sadat2307/MSciNLI huggingface dataset:
Domain: Software and its engineering
Sentence 1: The second idea exploited by [DPC+09] is that, if the con­text is .nite (i.e., there is non in.nite loop in the context), then the two following veri.cation processes are equivalent: (a) compose the context and the system, and then verify the resulting global system; (b) unroll the context into N scenarios (i.e., a sequence of events), and successively com­pose each scenario with the system and verify the resulting composition.
Sentence 2: the authors transform the ini­tial global veri.cation problem into N smaller veri.cation subproblems.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Then the procedure de­scribed above, when applied to C2 with a d-fraction of errors ( ) succeeds with probability at least 1 - 2 d + E. d 1-a So the closer a code s automorphism group is to being two transitive, the better it s degree lifted version does as an LDC.
Sentence 2: when an AG code has a 2 transitive automorphism group (as RS codes do) then the simple pro­cedure of passing a random curve through the point of cor­rection works well as a local corrector for any m.For some AG codes, the Hermitian codes among them, we can add some redundancy to the code and get one that is doubly transitive.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: While all our tested bugs can be successfully reproduced by PRES in our experiments and also theoretically it is feasible for PRES to exhaustively search the unrecorded non-determinism space to .nd a bug-producing combination, it is conceivable that in some cases it might be dif.cult for PRES to reproduce an oc­curred bug within an acceptable time limit.
Sentence 2: it might take a long time for PRES to produce a bug (1) that has a long error-propagation time before leading to a detectable failure, or (2) that requires multiple rare interleavings (i.e.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Our goal in conducting these experiments is to state the correlation while we envision greater benefit in using such a metric in the context of a placement tool generating solutions that optimized for this metric along with wirelength, instead of purely optimizing for the latter.
Sentence 2: the solutions presented in Table II would be part of the solution space searched by a placement tool that attempts to arrive at a good solution with respect to the proposed measure.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Fi­nally, as speci.ed by the metadata, the JDO enhancer adds persistence-speci.c methods and .elds to each persistent class, enabling its instances to interact with the JDO run­time.
Sentence 2: the enhancer changes a persistent class to implement interface PersistenceCapable and wraps all read and write accesses to a persistent .eld with special methods that interact with the JDO runtime.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: s u p p o r t e d B y A c t i v i t y c h a n g i n g {18 l a b e l s u p p o r t e d B y A c t i v i t y 19 }20 } Listing 4: Gromp script for the new language them more powerful.
Sentence 2: we are researching means to write Gromp scripts in a simpler way, possibly with the help of assistance.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: A propagation solver solv(F,D)for a set ofpropagators F and adomain D .ndsthegreatest mutual.xpoint of all thepropagators f .
Sentence 2: f.solv(F,D)returns a newdomainde.nedby solv(F,D) = gfp(.d.iter(F,d))(D) iter(F,D)= .f.F f(D) where gfpdenotesthegreatest .xpoint w.r.t.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: 1 class Point { 2 int x, y; 3 int s; 4 5 public Point(int xi, int yi) 6 { x=xi; y=yi; s=1; } 7 public int getX() { return (x*s); } 8 public int getY() { return (y*s); } 9  10 public void move(int nx, int ny) 11 { x=nx; y=ny; } 12 } 13 14 aspect adjustScale { 15 pointcut m(Point p): 16 execution(void Point.move(int,int)) 17 &#38;&#38; target( p ); 18 19 after(Point p) : m(p) { 20 if ((p.x < 5) &#38;&#38; (p.y < 5)) { p.s=10; } 21 } 22 } Figure 1.
Sentence 2: point Class and Aspect indeed, precisely what the adjustScale aspect does.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: The technical difficulties are mainly due to the different memory layouts, code relocation, and power management scheme of the target hardware.
Sentence 2: the memory layout and relocation mechanism provided by microcontrollers are widely different, hence we have designed an architecture-independent executable file format for the RETOS application, with which the actual code/data relocation is conducted in binary load stage.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: F , ** ** sg(A )st = Mssg(A )st = Msrg(A )rt = (M · g(A ))st r.F = (h(A * ) · M)st = h(A * )srMrt r.F = h(A * )stMtt = h(A * )stt.
Sentence 2: setting s = 1 and summing over t .
Relationship: entailment
Domain: Software and its engineering
Sentence 1: In our framework we use the standard user-based collaborative filtering approach, based on the k-nearest-neighbor algorithm, to predict the level of interest that a user might have in a forum for which the stakeholder has registered no prior interest, given a set of ratings (ranged over .., with .. denoting an average rating).
Sentence 2: the predicted interest of a user u on a forum f is computed as where n .
Relationship: entailment
Domain: Software and its engineering
Sentence 1: The most reasonable justification is that, in a mature context, humans tend to adopt the same terms when they express the same technical concept; therefore, techniques that are able to detect similarity even when the terms are not identical results in worst performances by providing more noise rather than positive contribution.
Sentence 2: results suggest that in case the terms are different, it is better to judge their semantic as different rather than observing any possible semantic similarity.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: {x} [PURE REL] x.Xx .L .,X fp release(x) : L.L{x} [PURE IF CAS] .,X fp ei : L.L .,X fp if CAS(e1,e2,e3) break e4 : L .L The top-level judgment .
Sentence 2: fp P states that the annotation pure eis valid if .,UnstableVar fp e: Ø.Ø a pure block may not change any stable variables or termi­nate with a different set of locks held than when evaluation started: see [PURE PROG].
Relationship: entailment
Domain: Software and its engineering
Sentence 1: The result type is polymorphic and can be instantiated to the one we may have had in mind: (.
Sentence 2: as < Con of a, Lam of ([int], (E as )), Var of int>) although any occurrence of Lam in the output will in fact have been applied to a value constructed with App, one can send this output into a context that is prepared to also handle other cases for Lam.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Conclusions: The major reason for this unex­pected resultisthehighly biased sample ofpassing andfail­ing tests provided with the programs under analysis.
Sentence 2: the ratiobetweenpassing andfailing runs,which has a major impact on the probability computations, does not correspondto thefalse negative(failure) rates associated with the actually injected faults.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Thus, we can remember the difference value and avoid labeling the edge with a timestamp pair each time the dependence is exercised.
Sentence 2: for a dynamic control dependence edge cd(tc,td) which satis.es the above conditions, tc + d = td because timestamp is incremented by d whenever after the execution of the predicate when control transfers to the depen­dent basic block.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Note that R may appear also in BoolExp and thus this depicts a recursive de.nition of R. By Tarski s .xed-point theorem, it follows that any positive equation system (set of equations) has a unique least .xed-point (and unique greatest .xed-point).
Sentence 2: there is a unique least interpretation for the relation that satisfy the equations.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Even though the performance results seem to be scattered over larger ranges, we notice that the re­sult trends in Figure 4(c) are similar to the ones obtained in the case of uniform binding.
Sentence 2: software un­certain parameters have little impact on the performance results since they lead the RT(updateVitalParameters) to vary between 2.89 and 3.71 seconds, whereas hardware un­certain parameters lead the RT(updateVitalParameters) to vary between 2.39 and 4.04 seconds.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: 7http://conference.apnic.net/ data/assets/pdf .le/0020/ 50771/osr apnic34 1346132140.pdf 8http://www.sitepoint.com/8-simple-steps-for­contributing-to-open-source/  3.2 Folder Use and Number of Forks We .t regression models to investigate the relationship between the number of forks and the use of standard fold­ers.
Sentence 2: we use testing, document and example to present a basic structure for .le organization.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: In this way, the LUNES user does not need to deal with low-level simulation details and can transparently take advantage of all the features o.ered by GAIA/ART `IS.
Sentence 2: to allow the simulation of large models, a parallel and distri­bution simulation approach can be followed and some ad­vanced featuressuch asthedynamicmodelpartitioning and load-balancing features are implemented transparently.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Parametric­ity [18] asserts that the function can only drop or reorganize its input list elements, without inspecting them or construct­ing new ones.
Sentence 2: an element in a view must come directly from an element in the source, and this corre­spondence enables an update to a view element to be trans­lated into an update to its origin in the source, which forms the basis of a backward transformation.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: The visible determinacy of the open program P ensures that the set of feasible paths cor­responding to any call sequence either always end in P.E,if this call sequence is not permitted, or always end in ¬P.E,if this call sequence is permitted.
Sentence 2: if d = dag..s, then the feasible paths corresponding to d either always end in P.E or always end in ¬P.E.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: The resulting environment must be well-formed; the de.nition of well-formed type environments (typing rules for the judgment f G0 are given in Figure 4) relies on that for well-formed standard type environments (that is, those which only contain standard type as­sumptions, ranged over by Gs).
Sentence 2: g is well-formed iff there exists a well-formed standard type environment Gs which entails G. A standard type environment is well-formed if the inheritance re­lation is acyclic, for each class all its ancestor classes are available and the Java rules on overriding are respected (that is, a class can­not declare a method with the same name and parameter types of an inherited method and different return type).This is modeled by means of a judgment Gs f c:MSS0 which holds if we can calculate in Gs the set of all method signatures of class c (empty for Object).
Relationship: entailment
Domain: Software and its engineering
Sentence 1: As an example, in Listing 4 the .rst statement sets the localized value of point to a new value, so the localized execution of this second statement will use this new value of point in combination with the original values of its neigh­boring points.
Sentence 2: even though each thread is updating an Array Element value in the .rst statement, in the second statement all threads consistently read their neighboring point values as they were prior to the foreach block, and only the particular update to a particular Array Element reads the new value of point when it is used in the second statement.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: One could imagine an extension of interval consistency requiring that all relevant credentials remain valid from the time that they are received until the end of the interaction between the two parties participating in the authorization protocol.
Sentence 2: if Bob negotiates with GeoTech to gain access to their database (as in Example 1), GeoTech might want to guarantee that it could detect if any of Bob s creden­tials were revoked after the end of the authorization protocol and consequently prevent Bob from further accessing their database.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: For each one of the hash table operations, we will now show that one can pick a linearization point within its execution interval, so that at this point it has modified the abstract state, that is, the set H, according to the specified operation's semantics.
Sentence 2: we will choose the following linearization points: the insert operation is linearized in line I5, at the list_insert operation,  the search operation is linearized in line $4, at the list_find operation, and  the delete operation is linearized in line D4, at the list_delete operation.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: 6.3 SDN Controllers A major recent development in computer networking is the notion of a Software-De.ned Network (SDN), in which network behav­ior is programmed through centralized policies at a conceptually centralized network controller.
Sentence 2: the Open.ow proto­col [13] has established (1) .ow tables as a standard abstraction for network switches, (2) a protocol for the centralized controller to in­stall .ow rules and query states at switches, and (3) a protocol for a switch to forward to the controller packets not matching any rules in its switch-local .ow table.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: PRIME therefore analyzes the down­loaded code snippets using interprocedural static analysis with points-to and aliasing information, and tracks the se­quences of API method invocations observed in them for each API object, in order to derive the PTSs.
Sentence 2: pRIME has a special treatment for unknown types and meth­ods to allow us to work around them and extract the know­able information, while clearly marking the unknowns.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: The particular method used in this research [2] is to integrate colored Petri nets (CPNs) [3] with object-oriented architecture designs captured in terms of UML communication diagrams.
Sentence 2: this paper will present a method to systematically translate a UML software architecture design into an underlying CPN model using a set of pre-defined CPN templates based on a set of object behavioral roles.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Because we aim to be applicable to general binaries, our proto­type implementation handles nearly all of the 300+ opcodes ofthe x86 architecture; previous efforts have focused on a much smaller set of register-to-register operations.
Sentence 2: wepresent the .rst techniques for correctly inferring superopti­mizations involving memory accesses and branches, as well asthe .rst approach that takes the context (e.g., the set of live vari­ables) of an instruction sequence into account.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: In fact, we not only see the importance of parallelism (how often both threads are executing), but also the importance of lack of parallelism (how often the support thread is running alone which im­plies the main thread is stalled, waiting for the support thread completion).
Sentence 2: for crafty and parser, where we still suffer slowdown in the fast spawn scheme, we .nd that these benchmarks spend a signi.cant portion of time where only the support thread function is running.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Introduction Design patterns were first introduced by Christopher Alexander who proposed a collection of patterns for urban design and defined the concept as follows: Each pattern describes a problem which occurs over and over again in our environment, and then describes the core of the solution to that problem, in such a way that you can use this solution a million times over, without ever doing it the same way twice [1].
Sentence 2: a pattern is a way to document recurring design problems, associating them with a name, a set of forces which influence them, a proven solution, examples of the solution s application, and any other information relevant to problems documented.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: In our opinion, the result of not teaching functional programming to students in natural sciences inhibits them from using computers for manipulating mathe­matical structures directly.
Sentence 2: quantum-mechanical entities that are considered too abstract for computer programs in standard programming languages are only treated as alge­braic formulae: they are processed with computer-algebra sys­tems instead of computed with language processors.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Actually, it has a solid background, category theory.
Sentence 2: with respect to the categorical manifesto of Goguen [8], our spec­ i.cations conforms to the .rst dogma (category for inter­preting a programming language), the second one (functor for the constructions associated to a data binding) and the third one (natural transformation associated to the preced­ing constructions).
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Note that this reasoning about the measurement plan does not occur only during the creation of the GQM plans, but also during the execution of the measurement (e.g., to understand what metrics to collect, and how to collect them), during the interpretation phase, and even afterwards, when reuse of measurement data and plans are evaluated.
Sentence 2: the possibility of reusing existing metrics can be assessed by comparing the current process model with the model corresponding to the existing metrics.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Our main contributions are the techniques used within our compiler for CAO which automatically convert AES into an executable target program that is close to the ef.ciency of a manually constructed, low-level alternative.
Sentence 2: we present a novel form of Inter­mediate Representation (IR) to support matrix and vector container types, a novel de.nition of memoisation for imperative programs and its associated transformation, and a transformation to perform vectorisation on the code.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Intuitively, the desired correctness condition is that whatever information the attacker could observe in the right-hand side of an evaluation rule could have been observed in the left-hand side, i.e., no rule can ever provide an attacker with additional in­formation.
Sentence 2: starting from a program with an empty memory, i.e., with the attacker not knowing anything, then if the program terminates the attacker is guaranteed not to have learned anything.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: The Bloom .lter keys are generated deterministically by the client using a cryptographic hash, so that the client can e.ciently keep track of them with only logarithmic storage.
Sentence 2: a bit set to 1 at position pos in the Bloom .lter is represented by Tpos =Hash(sk | pos | level | gen | 1), and a bit set to 0 by Fpos =Hash(sk | pos | level | gen | 0).
Relationship: entailment
Domain: Software and its engineering
Sentence 1: The fragment depicts a hierarchical component for intelligent ve­hicle navigation and the components in its environment that it communicates with.
Sentence 2: the navigation com­ponent relies on its local subcomponent ParkingManager, which via its required interfaces communicates with a park­ing lot to manage reservations (using the ParkingReserva­tion interface), and a garage door/bar to enter (using the GateOpener interface).
Relationship: entailment
Domain: Software and its engineering
Sentence 1: This function node has a set of implementations {fr,i}np , and in our Stage 2, we have actually shown that each i=1 fr,i, being a point on the (E ' ,T ' ) curve, is achievable by some explicit randomized program Pi.
Sentence 2: this new function node fr is a real function node: every approximate implementation fr,i has a corresponding randomized program Pi that can be constructed by our algorithm.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: In order to provide an incentive, a user may o.oad tasks to other containers so long as she reciprocates accordingly.
Sentence 2: more precisely, Task­lets of a user u are only allowed to be executed at a remote Tasklet container if the ratio between the Tasklets that u s container has executed on behalf of other users, o, and the Tasklets that u has remotely executed, r, is greater than a threshold, t. if o/r > t holds the user may execute Tasklets with other users containers.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: By focusing on expressing what computation is to be done rather than how to do it, DSL compilers can often apply optimizations speci.c to both the computation and the target hardware whose ap­plicability would be dif.cult to infer from imperative code express­ing lower-level operations.
Sentence 2: embedded DSLs (DSELs) have the additional advantage [7] that programs can take advan­tage of most or all features of the embedding language, and that complete programs in the embedding language can include sub­programs in multiple distinct embedded languages.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Since OSGi does not impose any restrictions on services and in fact accepts potentially every Java object to become a service, R-OSGi has to deal with the same miscellaneous­ness that is expressible in Java.
Sentence 2: the service interfaces of remote services can have (tightly coupled) de­pendencies to either classes from inside the original module or other modules.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Thus the key challenge is to track which durable write requests, i.e., those that need to be persisted to the secondary site, are causally related (dependent) on which externally-visible network packets.
Sentence 2: pipelined Synchrony replication must guarantee a causal ordering between externally-visible and durable events as de.ned by Lamport s happened-before .
Relationship: entailment
Domain: Software and its engineering
Sentence 1: In this work, we build upon and extend this prior work to improve MRE-OS-hardware interaction in a way that fa­cilitates GC avoidance.
Sentence 2: we design and imple­ment a simple prediction scheme that identi.es, with very low overhead, the amount of free space a particular GC in­vocation is likely to yield from dead objects.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: We have also addressed the concep­tual consolidation problem.
Sentence 2: we have carefully stud­ied the characteristics of GPUkernels that can and cannot bene.t from consolidation,andbasedonthis,havedevelopedamethodfor computing the af.nity score betweentwoor morekernels.Wehave also introduced two new molding techniques, and have developed anoverall algorithmfor mappingasetofgivenkernelstoapairof GPUs.
Relationship: entailment