sadat2307/MSciNLI huggingface dataset:
Domain: Software and its engineering
Sentence 1: The underlying idea is to exploit the advantages of MDE [27] to build tool support for the methodological proposal presented in [1] that provides formal definitions about the evolution of Web Services and the conditions for Service compatibility.
Sentence 2: this work has introduced the use of a bunch of DSLs and model transformations that allow: to inject WSDLs file into Abstract Service Descriptions (ASD); to check whether two different ASDs representing two versions of a given service are compatible; and to generate randomly different versions of a Service in order to check the functionality and performance of the compatibility checker.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Here x appears free in the argument to f, which appears in an antiquotation and is some metalanguage function that manipu­lates object language fragments.
Sentence 2: we would like the program­mer to be able to reason about this fragment without knowing the implementation details of f. the programmer should not have to know what object language context f might place its argument in in the process of building a new object lan­guage term even if that context might bind a variable named x.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: The two rules for well-formed methods enforce thatthetypeofthe methodbody s termisa subtypeofthe declared return type, that a method of a superclass is being overridden ap­propriately, and that no subsequent re.nement introducesa method with the same name.
Sentence 2: override considers methods that are overridden by the given method and introduce considers methods that are introduced later and establishes whether they replace the given method or not.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: One simple strategy is to fall back to a representation of argument lists as list of tagged unions at least internally.5 Danvy s approach is to make use of continuation-passing style in the implementation of the interface.
Sentence 2: type a va_sig is the type of continuations that expect a list of argu­ments (in NLFFI s internal representation) and map it to a result of type a.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: However, it requires that the nesC compiler replace all field accesses by offsets, replace uses ofoffsetof, and many other issues.
Sentence 2: c arrays behave differently from other C types, so all assignments, casts, pointers involving network types (note, e.g., the declaration of pCmdMsg 5 For completeness, we also provide little-endian versions of the base types, named nxle .... in the example above) require special handling.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: number of cores (default configurations) number of cores (default configurations) Figure 1: PDF vs. WS for parallel merge sort compared to WS.
Sentence 2: bandwidth-limited irregular programs and parallel divide-and-conquer programs present a relative speedup of 1.3 1.6X over WS, observing a 13 41% reduction in o.-chip tra.c.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: The GigE and 100Mb/s host clients need very different optimal local:remote ratio, which can be derived approximately at store time using our throughput model, or with a diagnostic test similar to these experiments when a workstation joins FreeLoader.
Sentence 2: in both cases the peak throughput with asymmetric striping is signi.cantly higher than the local I/O rate, motivating the use of FreeLoader even when users do have enough local disk space, for higher access rates.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: (ii) Replace tuples and tuple operations with maps and map operations.
Sentence 2: replace tuples of more than two components with tail nested tuples of two components, e.g., [XYZV ] becomes [X [Y [ZV ]]]; then, for each 2-tuple Z and map M,replace  while exists Z in M ... Z... with while exists X in dom(M) while exists Y in M{X}... [XY ]..., replace for-loops in a similar way, and replace M = {}with dom(M) {}; .nally, replace [XY ] notin M = with Y notin M{X}, and replace M with := [XY ] with M{X} with := Y .
Relationship: entailment
Domain: Software and its engineering
Sentence 1: For example const int bufsz = 256 * 4; int main() { int buffer[bufz]={0}; // bufsz is constant 1024 // ... } This de.nition of constant expression in C++ [2] is quite conven­tional.
Sentence 2: a call to a (user-de.ned) function with constant expression arguments is never considered a constant expression.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: In Figure 6 the process schema related to the ELDA-based methodology (see Figure 6) is shown.
Sentence 2: the process starts with two parallel activities: -Simulation Model Definition, which provides an ELDA­ based simulation model for the considered Agent-based High-level System Design produced by using specific phases of available agent-oriented design methodologies [2].
Relationship: entailment
Domain: Software and its engineering
Sentence 1: In fact, experience with a commercial Windows application of over 100,000 SLOC developed in this style shows that real software is not only feasible but also of notably higher quality than software built using traditional methods [4].
Sentence 2: this proposal for how to specify iterators is not based on an unrealistic closed-world assumption; it also is not based on business-as-usual in C++ or Java.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: TimeStream manages to combine the best of both MapReduce-style batch processing and streaming database systems in one carefully designed coherent frame­work, while at the same time it offers a powerful abstraction called resilient substitution that serves as a uniform founda­tion for handling failure recovery and dynamic recon.gura­tion correctly and ef.ciently.
Sentence 2: timeStream makes the following technical contributions.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: This program is secu­rity unsafe, since observing the communications on port p, even if the communicated data is hidden, reveals informa­tion about h. Our solution to implicit information .ows is standard except that we have to treat send actions as having the lowest security level.
Sentence 2: we ensure that the label of each instruction is at least as high as the label of the program counter when the control reaches the instruction.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: [1,|S|]is the smallest integer such that S[i+k]=S[i].
Sentence 2: a phase is a subsequence of S that starts with the speci.ed actor (S[i]) and ends before the next occurrence of the same actor (i.e., there are no intervening occurrences of S[i] in the phase).
Relationship: entailment
Domain: Software and its engineering
Sentence 1: easy to see that T 2 T 1||0 holds, since P 1 and P 2 r r the leftmost b bits in common.
Sentence 2: after the r-th swapping, · have = r it must be that P 2 C2 = C1||0 or C2 r r P 1 = +1||0 or P 2 = r P 1+1||1 holds.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: The general trend that can be observed in these plots is the reduction in block distances as we go from Default to GPART, and also from GPART to GPART+.
Sentence 2: in the case of Default, the fraction of block distances that fall in the [1-24] range (recall that the last level cache in Harpertown is 24-way set-associative) is 17%, whereas the corresponding numbers in the cases of GPART and GPART+ are 28.4% and 49.1% in that order.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Yet our design naturally generalises the basic intuition behind dynamic binding, beyond the ordinary case where the execution context is accessed as a stack or a tree: at any point during execution, the dynamic bindings in scope are those in the context, a pre.x of which can be delimited by a control delimiter such as reset, removed by a control operator such as shift, and reinstated by invoking a captured delimited continuation.
Sentence 2: we add dynamic binding to the language DC by manipu­lating the evaluation context, following the footsteps of Cartwright and Felleisen [9].
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Thebasicideaoftracing connected componentsofthesil­houettes is that silhouette pixels in the image are neighbors on a silhouette segment if theyhave similar depth.
Sentence 2: two neighboring silhouette pixels a and bare depth continuous if cont(a, b) := Idepth(a) - depth(b)I < .n.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Figure 8 shows the number of devices, identified by subdirectories, in which a process may block in each version of FreeBSD.
Sentence 2: it shows that in v2, of the 7 devices total, 3 of them sleep, and 2 of those 3 (shown in the list of subdirectofies) sleep without timeout; in v4, of the 69 devices total, 27 of them sleep, and 11 of those sleep without timeout.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: copy of the best individual in the next population at each generation) Pop Size: 500 individuals Initialization: ramped half and half with maximum depth equal to 6 Other Parameters: maximum depth for crossover 17, swap mutation probability 0.1, shrink mutation probability 0.1, sub-tree mutation probability 0.1 [14] Maximum 500 Number of generations:  3.2.2 LS2-GP The second version of GP that we present uses the same parameter setting as stdGP, but a different fitness function.
Sentence 2: the fitness of a GP individual k is obtained by executing two steps.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: As said before, our focus is on DFT sizes that cannot be computed using exclusively the Cooley-Tukey FFT (5), since for these sizes, close-to-optimal code is already available from vendor libraries, FFTW, or the orig­inal SPIRAL.
Sentence 2: we focus on DFT sizes that require at least one Rader step (7) that is not unrolled in the recursion.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: The initialization time validator, as with Eventrons and Exo­tasks, performs its checking for reference (or full) immutability in a data sensitive fashion.
Sentence 2: it maintains the set F of .eld sig­natures (static or instance) found to be referenced (for reading orwriting) in any method, and the set O of objects residing on theglobal heap but accessible to Flexotask code.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Gridkit is an experimental reflective middleware for grid computing, which supports adaptive grid and pervasive applications by dynamically combining middleware behaviour (composed as component frameworks) based on application requirements and changing environmental context.
Sentence 2: we illustrate how the Genie toolkit improves the development of the Gridkit middleware through the modelling and automated generation of middleware policies; that remove the complexity of handling large number of adaptive policies.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: An instance of the k-median clustering game with integral edge distances has a weak Nash equilibrium if and only if it has a weak Nash equilibrium con.guration in which centroids are placed in half integral locations on edges.
Sentence 2: in order to guarantee the existence of Nash equilibrium, we add a rule penalizing a node whose move to a cluster C changes the location of the centroid of C. the cost of a node u performing an improvement move will consist of two values: The distance from the updated centroid of the new cluster, d(u, c(C+u)).
Relationship: entailment
Domain: Software and its engineering
Sentence 1: take a measurement)  Configuration data enable to provide XML-based input to a component in Jazz  Events - allows components on the server to register to server based events  While RTC provides the necessary building blocks and plumbing to define and control its operational model, some extensions would be required to provide a full governance enactment solution.
Sentence 2: rTC doesn't support RACI roles and responsibilities and consequently can t enforce or track them in the team interaction.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: The proposed compiler-directed reliability approach super-poses on top of all optimization performed by naïve compiler and does not incur any performance penalty, since it only reallocates the VLIW slots (slips the scheduled instructions from one slot to another) within the same scheduling and order determined by the naïve compiler.
Sentence 2: this dynamic binary optimizer guarantees the iso-throughput execution of the healthy kernel.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: 2.1 Containment-Based Filtering The property of subscription containment (also called cov­ering) has long been used for content-based .ltering (e.g., [3, 4, 10, 11, 13, 19]).
Sentence 2: essentially, we say that a subscription s contains or covers another subscription s 0, denoted by s w s 0 , if any event that matches s 0 also matches s. s is 0 more general than s .
Relationship: entailment
Domain: Software and its engineering
Sentence 1: The statistical significance of 0.05 means that we accept 5% chance of rejecting the hypothesis about the equality of the fault-proneness of new and modified code when the hypothesis is actually correct.
Sentence 2: selecting 5% significance level means that we are at least 95% confident that the hypothesis regarding the equality of fault-proneness of new and modified code is false before we reject it.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: On a multicore chip with intricately shared hardware resources, however, chip­wide environmental factors also affect per-core power account­ing.
Sentence 2: the maintenance of shared multicore resources (including clocking circuitry, voltage regulators, and other uncore units [21]) consumes some active power as long as one core is run­ning, which does not change proportionally with core-level event rates.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Rather than perform substitutions to generate a new fragment consisting only of de.nitions (which would be closer to the semantics of the actual C preprocessor), our semantics constructs an accumulator A that contains both the core language de.nitions and other information needed to enforce CMOD s rules.
Sentence 2: the preprocessor is de.ned as a relation among states of the form (h;A;.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: HiLPR: Pretty Pictures for Pretty Complicated (Parallel) Patterns Donna Kaminskyj LongUniversity of Victoria dkj@cs.uvic.ca Nigel HorspoolUniversity of Victoria nigelh@cs.uvic.ca ABSTRACT Users of parallel patterns need to carefully consider many subtle aspects of software design.
Sentence 2: implicit re­lationships with hardware realities coupled with aggressive strategies for optimization are daunting in this domain.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Since wedo not use an instrument to mea­sure the absolutebattery consumption, we rely on the speci.cation givenin[16] and[10] toestimatethetotalpower consumed.
Sentence 2: theWiFiinterface consumes1120 mWin theCAM and72 mW in the PSM; the Bluetooth interface consumes 120 mW in the ac­tive mode, and 25 mW in the idle mode.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: RELATED WORKS Traditional tuple spaces The issue we faced while devising the presented model can .rst of all be framed as the problem of .nding the proper coordination model for enabling and ruling inter­actions in emerging pervasive computing scenarios, which are intrinsically distributed, mobile, dynamic, and call for self-organisation.
Sentence 2: our idea of mediating agent interactions by a shared space has been proposed by the pi­oneer work in the Linda [7] tuple space model, in which coordination is achieved by coordinated processes insert­ing tuples (records of primitive values) in the global shared space and retrieving (and removing) them based on tem­plates (records possibly including wildcards).
Relationship: entailment
Domain: Software and its engineering
Sentence 1: (2) The safety condition requires that the state trajectory of each coop­erative agent is contained in the interval formed by the initial states of cooperative agents and that the limit exists, despite the in.uence of the adversaries.
Sentence 2: if we de.ne the interval I0 =[minxi(0), max xj (0)], i.Vc j.Vc then the safety condition requires that given q = F adversaries, xj (t) .I0, .t .
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Unfortunately, a detailed cost-bene.t analysis of each dynamic predication case requires the collection of per-branch pro.ling data obtained by emulating the behavior of a DMP proces­sor.
Sentence 2: determining the probability of each misprediction case, the number of dynamically predicated iterations, and the num­ber of extra iterations in the late-exit case requires either pro.ling on a DMP processor (with specialized hardware support for pro.ling) or emulating a DMP processor s behavior in the pro.ler.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Although it is important to illustrate the potential bene.ts of the tool to the target users, the tool will typically have limitations, and these limitations must be clearly communicated to the target users and how the target users can deal with such lim­itations.
Sentence 2: the target users should be informed and trained on helping the tool to deal with those faced limitations in a cooperative way, as advocated in the cooperative testing method­ology [72].
Relationship: entailment
Domain: Software and its engineering
Sentence 1: It is embedded into the Scheme programming language, allowing arbitrary computations to be used in transforming in­put programs.
Sentence 2: program transformations are imple­mentedas Scheme programs,with subroutinesavailableto simplify the de.nition of equations over the program s control .ow graph; those equations are then solved by a .xpoint algorithm.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: The main idea of the McErlang tool is to replace the part of the ERTS runtime system that implements process concurrency with a new runtime system suitable for model checking.
Sentence 2: the model checker replaces basic Erlang operations such as process spawning, communication and process linking, and corresponding data structures for recording processes, with its own data structures for recording processes and its own code for interacting with pro­cesses.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: of Information &#38; Software Engineering George Mason University Fairfax, VA 22030 +1 703 9931640  dwijesek@gmu.edu Mark Hartong * Federal Railroad Administration 1120 Vermont Ave Washington, DC 20590 +1 202 4936000  mark.hartong@fra.dot.gov ABSTRACT Misuse cases are a way of modeling negative requirements, that is, behaviors that should not occur in a system.
Sentence 2: they can be used to model attacks on a system as well as the security mechanisms needed to avoid them.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Following the lines of [7, 26, 30], the graph presents the respective results grouped according to: 99-100%, 90-100%, 80­100%, 70-100%, 60-100%, 50-100%, 40-100%, 30-100%, 20­100%, 10-100%, 0-100%, score ranges.
Sentence 2: the y-axis of Figure 2 records the ratio of the faults that are effectively localized in the score ranges recorded by the x-axis.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: requires prior specific permission and/or a fee.
Sentence 2: pODC 2000 Portland Oregon Copyright ACM 2000 1-58113-183-6/00/07...$5.00 ters used by either long-lived adaptive renaming or collect must be a function of n. for any constant d there is a large enough nd such that every long-lived adap- tive read/write implementation of collect (and renaming) with nd processes must use at least d MWMR registers.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: 4.2 Design Tools As shown in Figure 5, we used the Eclipse Modeling Frame­ work (EMF) to support such a process and to create our tool suite design editors: (1) we create the model s Ecore .le (MM) and then (2) we use the code generation tech­niques of EMF as a transformation engine to build DSLs editors.
Sentence 2: we derived the EMF Generator Model (gen­model) .le based on the model s Ecore .le to make use of the code generation techniques of EMF.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: More speci.cally, a conditional assign­ment is created to determine whether a variable vi contributes to the unreachability and should have its behavior changed or not.
Sentence 2: when the select line Vi s is 0 (note that we use uppercase names for symbolic traces and lowercase for variables), the symbolic trace returned by symbolic simulation uses the original trace Vi, which means symbolic conditions will not be changed by vi.variable vi does not contribute to the unreachabil­ity and has its behavior unchanged.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: This is necessary because without some idea about how these ideas are embedded in the problems of sending bit messages it is difficult to understand whether or not the ideas are relevant to software engineering.
Sentence 2: we discuss in detail the notion of excess entropy since several software researchers have suggested that excess entropy can be measured on system designs and that designs with low excess entropy are to be preferred to those with higher excess entropy.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: In this work, we analyze theproblem of scheduling a work­load composed by hard, soft and non real-time tasks on a multiprocessor platform.
Sentence 2: we will improve and adapt to multiprocessor systems apreviouslyproposed tech­ * This work has been partially supported by the IRMOS (FP7/2008/ICT/214777) and ACTORS (FP7/2008/ICT/216586) projects.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Participants in all five application areas reported good levels of usability for all three tools, with the findings showing a mean usability score difference that lies predominantly in the difficulty of the VERITAS tools as defined by their use, content and complexity.
Sentence 2: t1 and T3 were reported to be quite easy to use across all five targeted domains, while T2 was rated as slightly more difficult.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: These check rules encapsulate all of the above concerns, and adhere to the following idiom: check: context -> (target, $[error message]) where assumption where require(constraint) The rule checks whether for the given context (the term under scrutiny) the constraint is satis.ed, given that the assumption holds.
Sentence 2: the require(s) operator is sugar de­.ned as follows: require(s) = not(s) the check rule succeeds (producing the speci.ed error message), if the assumption succeeds but the constraint fails.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Together, these de.ne a set of relations (one for each class) either as the solution of a set of (mutually recursive) equa­tions or, equivalently, as a proof system generated from the instance declarations.
Sentence 2: a key insight here is that this set of relations can be interpreted, viewed, and manipulated as a relational database.this means that we can leverage interesting results and tools from database theory (such as those in Appendix A) to help us specify and use multiple parameter type classes more effectively.
Relationship: entailment