sadat2307/MSciNLI huggingface dataset:
Domain: Software and its engineering
Sentence 1: FIF program is written using the new library, with no mention of the primitives unit, bind, recv, nor send, and further­more, if the program has a type according to the new rule Te-PROG, then the program either converges to a program result or diverges.
Sentence 2: well-typed programs written with the library do not have communication faults.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: We sincerely thank all of them.
Sentence 2: we would like to ac­knowledge Geoff Lowney, Moshe Bach, Robert Cohn, Brad Calder, Satish Narayanasamy, Chitra Natarajan, Mike Green.eld, Aamer Jaleel, Sam Strom, and Alex Skaletsky.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: RELATED WORK While there has been previous work in recovering ob ject­oriented models [1,8] and other kinds of type abstractions [4, 2,5,3] from weakly-typed programs,these approaches,ex­cept that of Komondoor et al [3],are not path sensitive.
Sentence 2: our approach distinguishes program states satis­fying di.erent predicates at the same program point,and uses this mechanism both for more accurate analysis (less pollution),and for inferring subtyping in a general manner (previous approaches for inferring OO models [1,8] are .ow­and path-insensitive,and infer subtyping either heuristically or in limited situations).
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Debugging these instances with the proposed ap­proach leads to a number of contradiction candidates as shown in Table II (distinguished between the minimal, maximal, and average number).
Sentence 2: the numbers of classes and models to be inspected can be reduced from some hundreds (thousands) to no more than 1-2 dozens in just a few seconds (in around half an hour).
Relationship: entailment
Domain: Software and its engineering
Sentence 1: The Titanium backend has been ported to several platforms, including SMP's running Solaris or Posix threads, Solaris and Linux uniprocessors, Cray T3E, IBM SP2, Tera MTA and the Berkeley NOW (a cluster of Ultra- SPARC's [5], I17]).
Sentence 2: the only major Java feature which is not currently supported by Titanium is arbitrary multi-threading, the user cannot create arbitrary asynchronous threads of control within a process.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: T (Lx ))) where newtype T a=T {unT :: F a(T a)} That rule s unconditional total correctness can be established in the same manner as demonstrated for the destroy/build-rule in this pa­per.
Sentence 2: figure 8 in Appendix A shows that free theorems can also be automatically generated for functions involving user­de.ned data types, such as for cons :: .
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Mathematically, d de.nes an ultrametric space on the set of nodes.
Sentence 2: d is non-negative, symmetric, 0 on the di­agonal, and satis.es the strong triangle inequality: d(p1,p3) =max{d(p1,p2),d(p2,p3)}for all nodes p1, p2, p3.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: In combination with the contribution presented in this paper, SOAP services will provide a .exible and transparent reference mechanism for large binary data.
Sentence 2: we realize the advantages o.ered by REST­ful services for SOAP web services by means of using refer­ences, but also maintain the advantages of SOAP-based web services such as standardized interfaces, industrial-strength tools, and the wide support by both research and industrial communities.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Since the stack distance is only accurate at the granularity of page group, HitCtrs only needstorecord thenumbersofhitsfor memory sizes that are integral multiples of GrpSize.
Sentence 2: counter j (1 = j = NumGroups) in HitCtrs records the number of accesses that would result in a hit with a mem­ory of size j * GrpSize pages, but a miss for any smaller memory size.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: When designers want a set of features, they really want the ×-product of these features, which includes the dot-product of these features and their interactions.
Sentence 2: the ×-product of features f and g is: f × g =(f#g) · f · g (1) where # distributes over dot and # takes precedence over dot: f#(g · h)=(f#g) · (f#h) (2) the interaction of a feature with a dot-product is the dot-product of their interactions.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: D. Correctness, Generality And Effectiveness Our current specialization of compiler optimizations in­cludes two key strategies: (1) a customized ordering of the optimizations and (2) a specialized con.guration for each optimization, to collectively maximize their effectiveness while minimizing interferences.
Sentence 2: the following decisions are made to customize a set of general-purpose compiler optimizations for dense matrix computations.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: The intuitive meaning of the .rst lemma is the following: if e is not a receive event, all the causal paths arriving at e have pred(e) as next-to-last event (see CP1).
Sentence 2: so, if pred(e) is a relevant event, all the relevant events belonging to its relevant causal past are separated from e by pred(e), and pred(e) becomes the only immediate predecessor of e.the event pred(e) constitutes a reset w.r.t.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: r applies at the root of t ' (i.e., t ' = s(f (l1,...,lk)) for some substitution s); and 3. there is a minimal nonterminating term u = g(s1,...,sm) at some position p of s(r) satisfying that p .PosF (r), i.e., p is a nonvariable position of r.  This means that considering the occurrences of de.ned symbols in the right-hand sides of the rewrite rules suf.ces to catch every possible in.nite rewrite sequence starting from s(r).
Sentence 2: no in.nite sequence can be issued below the variables of r (more precisely: all bindings s(x) are terminating terms).
Relationship: entailment
Domain: Software and its engineering
Sentence 1: As discussed in the introduction, we regard the graphs in .T FG as an extended tree data structure, i.e., as in.nite trees, so we shall use bisimilarity semantics rather than equality or isomorphism semantics.
Sentence 2: 2 this is not a set but a proper class, but this matter is resolved in usual way in coalgebra theory, if T is ranked.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Our ap­proach is presented in the context of both variability and architec­tural decision making processes at product line and product level for designing reference architectures and product architectures re­spectively.
Sentence 2: we present the steps of variability man­agement and architectural decision making and their relationships along with our solutions for eliciting the interdependencies among the two kinds of decisions.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: We .rst de.ne a re.ne­ment relation between cover sets which describes a partial order of cover sets based how re.ned the application of the abstraction operation using each cover set is.
Sentence 2: a cover set is more re.ned than another if the abstraction operation using the former yields a more re.ned model than applying the abstraction operation on the latter.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: To our knowledge, no one has since built a heterogenous object systemallowing not only objectsbutalsoexecuting threads to move between architectures at almost any point in the program with no decrease in performance after arrival on the new architecture.
Sentence 2: an Emerald process that moves, e.g., from a VAX to a SUN 4 SPARC and back will, when running on the SPARC, execute at the same speed as if it had originated there, and it will also execute at the originalVAX speed after returning toaVAX.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: We hy­pothesize that if the target application exposes a username (or any­thing that is a variant of it), two different usernames should map to two different byte sequences in the messages transmitted to remote servers.
Sentence 2: two different outputs generated from two different test inputs (with everything else being equal) suggests that the dif­fering segments in the output may correspond to the application test parameter.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: In a hierarchy whose complexity is I, CTdperforms dispatching in ddereferencing op­d erations, and reaches a compression factor of at least dllo-al d (when using a slice size ofl).
Sentence 2: in a hierarchy whose complexity is I, the space requirements of CTdin the multiple-inheritance setting is worse than the single-inheritance setting by a factor of at most 2Ilo-ald .
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Hence, these buffers are not overflown so often, data is reused more and stall time is reduced.
Sentence 2: the local hit ratio of this loop increases from 65% with MDC to 97% with DDGT (the local hit ratio with MDC and no Attraction Buffers is 33%) and stall time is reduced from 805K cycles with MDC to 110K cycles with DDGT.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Bias scheduling can be implemented on top of most ex­isting schedulers since its impact is limited to changes in the load balancing code.
Sentence 2: we implemented it over the Linux scheduler on a real system that models microar­chitectural differences accurately and found that it can im­prove system performance signi.cantly, and in proportion to the application bias diversity present in the workload.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: 3.4 Checking code names DOCREF extracts EAPI from API references, which de.ne API el­ements of an API library in a semi-structured form.
Sentence 2: dOCREF extracts four types of API elements, such as types (class­es, enums, interfaces, and exceptions), variables (parameters and .elds), packages, and methods (constructors and methods).
Relationship: entailment
Domain: Software and its engineering
Sentence 1: 3.1 Server Side Integration WHIP bundles are made available through the myExper­iment Web site via a simple hyperlink, which triggers some very simple Ruby code.
Sentence 2: the Ruby code looks 1http://rubyonrails.org/ for an existing WHIP bundle on the myExperiment host ma­chine associated with the particular work.ow being down­loaded.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: For example, for a de.nition like x = 2.0 or for use as an array index like A(x), it is safe to assume that if x was declared to be an integer, this de.nition or use will not affect the result of the program.
Sentence 2: for this de.nition or use of x, x is IntegerOkay.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: It turns out that the converse also holds.
Sentence 2: given a trace graph, if there is a .ow assignment such that each read(r)node and write(r)node gets a positive .ow and each A : write(r)such that there exists B : read(r)with AB gets a .ow equal to 1, then there is a read-write pipeline with bottlenecks for the region r. By Theorem 5, this implies that there exists such a .ow assignment for every region r if and only if the trace graph is witness race free.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: are de.ned as in Section 5 for F. The name clash between constants should not lead to confusion and will always be resolved by context.
Sentence 2: the are two constructs set(X): Fa and set(X): Fna, where in the latter case X ranges over .nitary and not .nite sets of terms (we explain below how to regard the set of all terms as a nominal set).
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Eliminating false positives at class level w/thresholds Yet, this effect has advantages because many more false positives are eliminated than false negatives are added (with small filters).
Sentence 2: the weakest 10% of the trace links contained only 1% of the true traces (i.e., observe that 26% false positives may be re­duced to 14% false positives by only adding 1% of false nega­tives).
Relationship: entailment
Domain: Software and its engineering
Sentence 1: The representations of a language are computed by com­posing tuples element-wise.
Sentence 2: the tuple for language FJ = Cast · cFJ is: FJ = Cast · cFJ =[LsC, LoC, LtC, LpC] · [sFJ, oFJ, tFJ, pFJ] =[LsC · sFJ, LoC · oFJ, LtC · tFJ , LpC · pFJ] the syntax of FJ is the syntax of the base sFJ com­posed with extension LsC, the semantics of FJ are the base semantics oFJ composed with extension LoC, and so on.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: For commitment of operations (corresponding to R3), the crux of the argument is that even though commitment takes several rounds of messages, all composite operations sub­mitted in this duration can be thought of as being submitted ei­ther before or after the entire commitment operation completes.
Sentence 2: all composite operations issued at machine mi be­fore tBeginUpdate(i) can be thought of as issued before the atomic commit, and all composite operations issued at machine mi af­ter tEndUpdate(i) can be thought of as issued after the atomic commit.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: For all k, p, q, and r, Left-Zero: (stop >>= k) = stop Stop-Identity: p  stop = p Par-Commutativity: pq =q p Par-Associativity: p(q r)=(pq)r Par-Bind: ((pq) >>= k) = ((p>>=k)  (q>>=k)) Note that these are not the same as the laws typically suggested for the MonadPlus class.
Sentence 2: orc calls for the parallel com­binator to be commutative, a property violated in many instances of the MonadPlus class, including the classic instance, List, in which  is ++ (list append).
Relationship: entailment
Domain: Software and its engineering
Sentence 1: As a consequence, we compute Aij as the weighted sum of met­rics that measure how close i and j are in space and time.
Sentence 2: p3(k) (1) (2) (3) Aij = wkI,where I,I,Iare k=1 ij ijijij (k) our three metrics, and wk is the weight for metric I.The ij three metrics we use are: Proximity.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: LanguageMemoryModels.Severallanguage speci.cations, such asAda83[34] and the newC[26] andC++[25] speci.cations, do not guarantee any semantics for programs that contain data races at the source level, essentially considering all such races to be harmful.
Sentence 2: the corresponding compilers are al­lowed to perform optimizations that break racy programs in arbi­trary ways [4].
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Orca was de- signed specifically to allow object replication.
Sentence 2: its object model is very simple: it supports only methods on single ob- ASP i i i i naive ' ...........................i ..................... ~ .... 60 manually optimized ......... i i ..r:: ;'~ replicated ---.e---:~ } ...:;,"i 50 3o ..................... i ..................... i......................
Relationship: entailment
Domain: Software and its engineering
Sentence 1: For instance, for T2 it shows as requirements the .eld i (declared in the used trait T4) and the method m (declared in the used trait T3).
Sentence 2: the latter actually refers to the renamed method mm, and clicking on the node for m will actually bring the programmer to the de.nition of the original method mm in T3 (which is in a different .le).
Relationship: entailment
Domain: Software and its engineering
Sentence 1: This permits the use of func­tions in the metalanguage (Haskell) to represent functions in the object language (Barracuda), allowing reuse of the metalanguage s name binding mechanism.
Sentence 2: in Barracuda, the con­structors representing let-expressions, reduction, and mapping use Haskell functions in their representation.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: For input port pand output port p 1 of an actor a, da(p,p 1)= d is interpreted to mean that given n tokens at port p, there will be d(n) tokens at port p 1 .
Sentence 2: given an input stream of length n, the out­put stream has length (da(p,p 1))(n).
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Moreover, if f : U .leaves(TG) is a placement with congestion * at most a×cong TG over the edges of TG, then f has congestion of * * at most (a×ß) ×cong =(a×ß) ×cong G over the edges of G. TG This implies the following result: Theorem 5.2 Any placement f : U .
Sentence 2: leaves(TG) with edge con­ * gestion a×cong TG over the edges of TG has a congestion of aß × * cong G over the edges of G. a placement on the leaves of TG that is an a-approximation for congestion on TG is an aß-approximation for congestion on G. Note that the above theorem only works for placements that map elements to the leaves of TG, and as such cannot be used directly with the results of the next section.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: While hash tables provide constant time lookup operation, there is a non-negligible performance over­head due to added lock contention, extra computation re­quired to do the lookup, and some resulting cache pollution.
Sentence 2: figure 1: Anatomy of virtualization wrapper the system-wide hash table is used for each resource access to determine the pod associated with the running process.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: *(r1 .... .rn)] M8,a is .nite for each valuation a.
Sentence 2: as long as the set of elements below each element of M8 is .nite, we can use bounded quanti.cation to reduce the truth value of EBU sentences in M8 to the satis.ability in .nite substructures closed under the below relation.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: De.nition 1 (Object Containment) We write P,Sfobj 1 :obj 2 to indicate that obj 1 contains obj 2 in store Sand program P. Formally: P,Sfobj 1 :obj 2 <I S( obj 1)=< c,ctnr,F) and F( fd)= obj 2 for some fd such that < c ' ,fd,contained) .P c. De.nition 2 (Object Containment Graph) For a given store S, we construct a directed graph GS , called the object containment graph, as follows: GS =( V,E) where 2 V = rng( S) and E ={< x,y)E V I ctnr( x)= y.
Sentence 2: there is a node in GS for each object in S, andan edgefromeachnodetoits container.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: A number of alternate metrics have been proposed [6, 9], notably the elapsed time until the .rst hoard miss, but we have shown in earlier work that these measures also have drawbacks that make them inappropriate for characteriz­ing hoarding systems.
Sentence 2: the time until the .rst hoardmississensitive to minorvariationsinuserbehavior patterns, and does not properly recognize the fact that some hoard misses are only a nuisance, while others are catas­trophic.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: We envision that the elderly users of Figure 1: Left: the .rst-generation of smart walker, middle-top: front wheel mounted with multi-rotation sensor, middle-bottom: RFID reader and tag, right-top: Phidget interface kit, right­bottom: slidometer walkers could also bene.t from the .exibility a.orded by these environments.
Sentence 2: such smart spaces may engender new applications for the walker, including its use as a personal computing platform that can utilize the local­ization information sensed from the environment to augment its apparent intelligence and operations.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Algorithm ApplyScript is also deterministic: given the same S0 and D3, calling ApplyScript(D3,S0) will yield the same .nal state S3 at di.erent sites.
Sentence 2: based on these algorithms, all repli­cas of the shared data model (and thus the editor contents) at all sites will be identical after sync.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: To formalize this condition, we borrowed the term simultaneous agreement from contract law.
Sentence 2: stated as a condition on two separate variables, a leader and a follower, we define it as the interval satisfying this conjunction: t0 , ti , tj : ( ti tj ) (ti t0 + d) : v : ti v tj : Pleader(v) = Pfollower(v) u : t0 u tj : Pleader(u) = Pleader(t0) the follower s value must become equal to the leader s before it changes.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: When a subscriber receives a message mk that carries a publication record (B1,...BR) the subscriber checks whether it has received messages mk-1,...,mk-R from the same publisher.
Sentence 2: then, for each message mi that was not received, the subscriber checks whether the Bi entry in the publica­tion record matches any of its subscriptions S. the subscriber checks whether there is one of its subscriptions S such that Bi .
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Represented as a Directed Acyclic Graph in Fig- ure 1, it is easily seen that MOEA tasks show more prece-dence relationships than asynchrony.
Sentence 2: a pMOEA has a large grain size with algorithmic decompos- ability rapidly reaching a limit (i.e., there is only t,so much" that can be parallelized).
Relationship: entailment
Domain: Software and its engineering
Sentence 1: However, efficient design and operation of CVS systems is not possible using the developed models, and a description framework or model that is closer to physical realities is still required.
Sentence 2: the exact behavior of the vehicular ad­hoc network (VANET) used in CVS, the effect of network performance on tracking process, and the effect of physical vehicle dynamics and the estimation process on the performance of the network are not captured by the existing models.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Ir,B,0 = Ir+1,B,f ' r+1 Our goal is to simulate one round of algorithm A per iteration.
Sentence 2: after iteration Ir,B,i .nishes, we will .nish r.l.l.j fj+ i)th the ( r ' =r+1 r ' round of algorithm A. Speci.cally, =4 and thus there are 4 nodes in each subpath Pi 10, we let r.l.l.j j tr = fr ' ' r =r+1 and our goal is to construct a protocol with properties as in the following lemma.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: INTRODUCTION An increasingly important requirement for software-inten­sive systems is the ability to self-manage by adapting their structure and behavior at run-time in an autonomous way as a response to a variety of changes that may occur to the sys­tem, its environment, or its goals [6, 9].
Sentence 2: self­adaptive (or autonomic) systems incorporate complex soft­ware components that act as controllers of a target system by executing actions through e.ectors, based on informa­tion monitored by probes.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: SST ) TrC .. # BPT # BPT BPT is the set of the transitions that models the control flow among the Business Process Activities and BPTS, the subset of transition that are automatically controlled by the software system.
Sentence 2: the transitions controlled by the software system are identified through the intersection of the sets of transition implemented by the software system, SST, and BPT.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Such predictable answers for the hard sequence do not trivialize the problem: the data structure has no guarantee about the sequence of operations, and the information it gathers during a query (by probing certain cells) must provide a certi.cate that the predicted answer is correct.
Sentence 2: the probed cells must uniquely identify the answer to the query, and thus must encode su.cient information to do so.
Relationship: entailment