sadat2307/MSciNLI huggingface dataset:
Domain: Software and its engineering
Sentence 1: Considering that both the ATM and the Card Protocol are deterministic it is easy to see that the composite PLTS can never exhibit the trace  If we compute the composite model and minimise with respect to the strong semantic equivalence (defined in the previous section), the resulting PLTS will no longer have the following pairs of undefined behaviour (compare with Table 2): {(insertCard, 2), (insertCard, 9), (insertCard, 10), (ejectCard, 3), (ejectCard, 4), (ejectCard, 5), (ejectCard, 6), (ejectCard, 7), (requestTakeCard, 10), (takeCard, 9)}.
Sentence 2: we now have a composite behaviour model that has fewer gaps requiring stakeholder intervention.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: 5 shows an example of a client that uses a Counter object c. During the initialisation phase of the object c the PointsTo(c.data, 1, 0) predicate is obtained from which the permission part, Perm(c.data, 1, 0), is transferred into the lock.
Sentence 2: the client obtains the Hist predicate for data (line 4).
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: The reduction in the number of .ows per peer results in an increase in the per-.ow download rate of 41.5%.
Sentence 2: while the total number of .ows in the system has shrunk by 20.7%, the BitTorrent traf.c has had a net increase of 12.1% between 2009 and 2010.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: However, OCEAN restricts the Finite Number of Parameters Infinite Parameters Space C1 Arbitrary Performance Prediction Model Undecidable Problem C2 Arbitrary Polynomial Performance Prediction Model Undecidable Problem C3 Fixed Polynomial Performance Model Finite Parameters Space Decidable Problem Ex: ATLAS [19] C4 Finite Parameters Space Decidable Problem Ex : OCEAN project [2] Figure 2: Classes of Best-Parameters Problems exploration to .nite set of parameter intervals.
Sentence 2: the number of parameter combinations becomes .nite, allowing a triv­ial exhaustive search of the best parameter values: each optimized program resulting from a particular value of the optimization pa­rameters is generated and evaluated.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: The checker had an enormous number of false positives, most due to a single limitation of our analysis: a small number of functions only freed one argument based on the value of another argument, but our analysis decided that these functions always freed their ar­gument.
Sentence 2: rather than having an error rate of one error per few hundred callsites, these functions had rates closer to .fty errors per hundred callsites.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: From (6.1) none of the processes in Gi(D)= Gi(E) -{a} is in cov(a, EII).
Sentence 2: from part (a) of the induction hypothesis all of the processes in Gi(D)= Gi(E) -{a} are in the same state at the end of EII as at the end of DII, so if a process other than a is poised to access r at the end of EII it is also poised to access r at the end of DII .
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Our notion of respon­siveness is weaker than synchronous languages like Esterel [4] (which require input events to be handled synchronously during every clock tick, and are hence too strong to be implemented in asynchronous software), but stronger than purely asynchronous languages like Rhapsody [12] (where asynchronous events can be queued arbitrarily long before being handled).
Sentence 2: our notion of responsiveness lies in an interesting design point between syn­chrony and asynchrony.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: However, for computing the relevant slice for this input, the predicate at line 5 will be identi.ed as a potential dependence since if it had evaluated to false outcome, the value of variable a output at line 14 could be affected.
Sentence 2: the relevant slice will contain the statements at lines 5, 3 and 1 in addition to the statement at line 4 that is in the full dynamic slice.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Thus, I(i ' ,j) was already captured at Tj ' , and we get that fCi ' ,j (P,S) = 0.
Sentence 2: si.i ' ,j will increase fC (P,S), since fC (P,Si.i ' ,j )=fC i,j (P,S)+ fC = (P,S) - fCi ' ,j (P,S) fC (P,S)+1 If the .rst case does not apply, fCi ' ,j (P,S) = 1 and Si.i ' ,j will preserve fC (P,S), since fC (P,Si.i ' ,j )= fC (P,S)+ fC fC fC i,j (P,S) - fCi ' ,j (P,S)= (P,S)+1 - 1= (P,S).
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: While this option needs to be available for faculty, we quickly found out that it is unrealistic to expect students who are in the process of learning about data structures to be able to modify a separate viewer class in order to see an instance of their own data structure.
Sentence 2: we turned our attention to building a mechanism that could determine if an instance was a linked list or binary tree based on a set of heuristics, and then automatically generate an appropriate view.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Moreover, the paper establishes that t< n/2and z = k are two tight bounds of the k-set agree­ment problem, when considering the (Oz)1=z=n family of failure detectors in an asynchronous message-passing system (Theorem 1).
Sentence 2: among all the classes described in Figure 1, Ok is the weakest class for solving asynchronous k-set agreement (hence, the algorithm is optimal in that re­spect).
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: 2.2 Dynamic Repartitioning The repartitioning strategy described in Section 1, whereby dur­ing a quiet time servers are taken of.ine to be moved into new clusters, has several problems.
Sentence 2: first, reducing electricity use requires running fewer servers at relatively high utilization levels rather than more servers at lower utilization.1 reducing the capacity of the network to repar­tition is dif.cult while sustaining the required query throughput.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Thus, the apache package should only be installed on a system that does not also have the apache-modules package, any instance of the jserv package with version less then 1.1.3 and so on.
Sentence 2: to install apache, the package manager must .nd out which other packages must be installed such that ulti­mately the system contains a set of packages that meet all the requirements speci.ed in the distribution metadata .le.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Second, leaks have the potential to impact not only the application that leaks memory, but also every other application run­ning on the same system; because the overall amount of memory is limited, as the memory usage of a leaking program increases, less memory is available to other running applications.
Sentence 2: the performance and correctness of every running application can be impacted by a program that leaks memory.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: The original cumulative constraint provided by MiniZinc [15] could not be used because it was not able to handle the two different task types present in MapReduce jobs: map tasks and reduce tasks.
Sentence 2: a modified cumulative constraint, called mycumulative, is developed that ensures that map tasks and reduce tasks are only scheduled on the map slots and reduce slots of the resources, respectively, and also the capacities of the resources are not violated.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Also, at any point in the interleaving, if the last step of S(i) that has been performed up to that point is sk, then we de.ne the cache state at that point to be Ck.
Sentence 2: the cache state only depends on which steps of S(i) have been performed, not on how S(i) and T ( j) are interleaved.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Therefore, given that the magnitude of RRmn(t) is r at time t, the probability that node n is located within zone 1...i after t seconds is given by 11 r = Ri - d0 P {d(t)= Ri|Rmn(t)= r} = 2 22 1 -1 d0+Ri -r cos r>Ri - d0 p 2d0Ri (10) From Equation 9, the probability density of r is given by 2 r f (r, t)= 2r e - am+an .
Sentence 2: am+an JRi+d0 P {d(t) = Ri} = P {d(t) = Ri|Rmn(t)= r}f (r, t)dr r=0 (11) According to [18], the node distribution is similar whether the link has to be continuously available or not.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: The loss of output-data leads to wasted user time allocation, which is very precious and obtained through rigorous peer-review.
Sentence 2: a timely o.oad can help optimize both center as well as user resources The need for timely data o.oading is also fueled by the, often, distributed nature of computing services and users job work.ow, which implies that data needs to be shipped to where it is needed.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: If visitor #3 goes back and visitor #2 becomes reachable again, a new instance of the video service has to be deployed on visitor #2 s host.
Sentence 2: if visitor #3 is near from video server and if it has enough energy, it is not necessary to use the visitor #2 as a relay and the platform can directly deploy the assembly and send a black &#38; white video.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: As Table 1 shows, this is indeed the case even in our MI hierarchies.
Sentence 2: a type eis allocated with an array rof size l e,v e,llb(eau taan c,e,sft oar stb(eau,t (in SI, l e,vee,llb(eau)==tatn c e,sft otr s/b(eau,t), with entries for each bbc aan c,e sft otr s/b(eaucb Speci.cally, bbsoeis stored in location l e,vee,llb(b{uin array r. checking whetherbas+ecan be carried out by checking whether b indeed occurs in location l e,vee,llb(b,uof array r. The encoding is optimized by not storing bitself in this location, but rather an id, which is unique among all types in its level.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: 6http://www.eclipse.org/mylyn/, veri.ed 15/06/11 7http://www.eclipse.org/, veri.ed 15/06/11 3.2 Parsing Social NewsWeb Sites The intention of the second component is to characterize recent posts on social news web sites, such as digg, reddit and mashable.
Sentence 2: for new article links8 posted on any of a user-de.ned set of social news web sites, our ap­proach follows the link to the referenced article and charac­terizes the article using a simple heuristic that abstracts an article to the technical terms that occur the most frequent in each article.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: This mapping is not exact, however, because neither the language nor TM system restrict exactly what memory can be passed into a method of an open atomic class, and the TM system performs a vanilla open­nested commit for a nested transaction, not a safe-nested commit.
Sentence 2: it is unclear what exact guarantees are provided with respect to serializability and/or deadlock freedom.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: After Q Until P, which is concerned with the event sequence after an occurrence of the starting delimiter, Q, and before an occurrence of the ending delimiter, P. P is not required to occur for this scope to exist This scope may occur repeatedly over the course of the system execution.
Sentence 2: with the restrictions noted above, there is limited interaction between the intent and the scope these restrictions allow us 17 to propose a rather straightforward way to apply scopes to property pattern templates.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: The length of the preamble should be long enough for synchro­nization between the AP and all UWB devices in the net­work, i.e., the preamble time Ta of i-th device is determined by di.
Sentence 2: tf rame and TAC K are obtained as Tf rame = Ta +(pl +RUIh)/Ri +(PHYh +MACh +HCS +FCS)/R0 and TAC K =Ta +(PHYh +MACh +HCS)/R0.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: I, do if A is an atom of a tabled predicate with mode last I0 + (I0 U {A}) - {A1 = I : K(A1 ) = K(A)} (*) else I0 + I0 U {A}; 3. return I0.
Sentence 2: the .xed point semantics of P can be described as TP .
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: The data .ow analysis frame­work[24] of aiT hasbeeninstantiatedtoperform .xedpoint iteration on the symbolic representation.
Sentence 2: the integra­ (.T.b, .b Algorithm 3: DoBlock+A.b ,b) the blocks correspond to the enumeration of the relevant instructions at b3 and b5 respectively.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: It is now possible that both T3 and T4 read the old values of Y and X respectively (from their caches), violating sequential consistency.
Sentence 2: while previously the read-others -write-early restriction appeared to have (acceptable) implications only for the main mem­ory system and the cache coherence protocol, new SMT and multi­core architectures move this restriction all the way to the .rst level cache and even within the processor core (if there are shared store queues).
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: The impact of position inaccuracy y is more severe in High Concurrency Protocols with Slow wdown (HCPS) of STIP protocols, since this group of f intersection protocols explicitly utilizes information rrelating to a vehicle's progression inside the intersection area.
Sentence 2: a failure in locating a vehicle's current ce ell information correctly may lead to vehicle collisions insiide the intersection grid.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: [42], we model loss using a two-state Gilbert model [17], setting loss rate to 1% and mean loss burst time to 100 ms. 7.1.3 Performance metric As discussed in §2.1, lag is the most important network factor that a.ects player enjoyment and performance.
Sentence 2: the primary performance metric we measure is percentage of required updates that are received on time.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: They typ­ically use the EIP register to indicate where in the applica­tion should the kernel return control to.
Sentence 2: when BIRD intercepts the return instruction of an exception han­dler, it uses the EIP register rather than the return address as the target of the return instruction and invoke the dynamic disassembler if the target happens to fall in an UA.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: It is '' '' possible to apply Avoine's scheme for UD(pcom,X ,Y '' ,f ) (which we call Avoine's dynamic scheme), but it cannot uti­lize the older result of pcom, and needs a heavy calculation as evaluated in Section 5.
Sentence 2: to design a secure iden­tifcation scheme with efcient update is a crucial challenge in large­scale RFID systems.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Trapezoids are executed in the form of thread blocks whose execution do not interfere with each other except for device memory accesses; when multi­ple memory requests are issued in bulks by multiple thread blocks, the requests are queued in the device memory and a thread block may have to wait for requests from other thread blocks to complete before it continues.
Sentence 2: the latency in the device memory accesses (MemAcc) needs to consider the joint e.ect of memory requests from all thread blocks, rather than be regarded as part of the parallel exe­cution.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: On the other hand, there are still only .nitely many choices for a node n, namely the number of members in the class of n, that is, |classn|.
Sentence 2: to produce a new criterion for trivial col­orability, we must .nd a measure of the constraints imposed on n by n s neighbors, and this measure must be comparable with the number of choices |classn|.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: This could allow the move­ment of one or both of the accesses mentioned in Section 3.1.1, into an overlapping region of execution.
Sentence 2: the fewer the interesting synchronizations among Usync, the more the unaffected statements in user code, and so the less the chance of two procedures immedi­ately interfering as a result of a data-.ow transformation.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Giventhe destructive potentialofbuggy.lesystems,itiscritical thaterrorpropagationpatternsbe carefullyvetted.However,failures in the physical layer, while inevitable, are rare enough in daily use that traditional testing is unlikely to bear fruit.
Sentence 2: we propose a static analysis to identify certain common classes of error mismanagement.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: We added support in the front-end for generating call statements with non-contiguous actual arguments, sinceordinarilyonlyabaseaddressisused.Inthesecondcase,the front-endwillordinarilyrepresentallassumedshapearraysasdope vectors.
Sentence 2: it will create a dope vector in the calling func­tion, initialize it to point to the section of data that is being passed, and replace the actual argument in the call statement with it.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Every path in G{ corresponds to a path in the burdened dag Gb, except that G{ omits overheads for continuations that are not stolen.
Sentence 2: we have T8{= Tb8.Since we only have a migration overhead when a continuation is stolen, thetotal amount of overhead in G{ is at most dPT8{+ O(Plog(1/e)),from which it follows that T1{= T1 + dPT8{+ O(Plog(1/e)) = T1 + dPTb8 + O(Plog(1/e)).
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Finally, since AOSE methodologies often have to deal with many di.erent kinds of WorkProduct and relations among WorkProducts and ac­tors, one further addition to SPEM could be a mechanism for the management of the representation complexity similar to the SODA layering principle.
Sentence 2: in the future we also plan to test SPEM in other contexts, like for instance Aspect-Oriented Software Development [10], with the purpose of devising a possible SPEM extension that makes it general enough to potentially model any kind of process, independently of the computa­tional paradigm adopted.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Let y .P be the head of the semi-strong path q.
Sentence 2: we know that there exists a semi-strong path q from A to B such that the strong path from y to A (as well as the strong path from y to B)is honest if (any sub­set of ) the second set in Ais corrupt and is fail-stop corrupted if (any subset of ) the .rst set in Ais cor­ 4The exact probability analysis is easy and very similar to the one done for the Information-Checking Protocol of [11].
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Viewing the operating system as an immutable object is clearly at odds with the bulk of operating systems research, which seeks to develop and integrate new ideas into operat- ing systems themselves.
Sentence 2: to reduce the efforts required to change the OS, a large body of research has investigated how the operating system should be restructured so that it is eztensible [8, 13, 15, 35].
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: This behavior is explainedbythefact thatF-AODVminimizes the number of nodesthatparticipatein communications usedby F-AODV which in turn causes a low probability of contention.
Sentence 2: f-AODVcanaccommodate morepacketdeliveryinthiscase by reducing the number of collisions using a low number of FNs.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: How­ever, for many e-commerce applications, content is created dynami­cally based on the current state of a business, such as product prices and inventory, rather than static information.
Sentence 2: content delivery by most CDNs is limited to handling static portions of the pages and media objects, rather than the full spectrum of dynamic content that constitutes the bulk of the e-commerce Web sites.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: µF negNorm = [trans]D Q0  2.5 In.nite State Space The Haskell representation of DTTs generalises the de.nition of DTTs as it does not put any restriction on the state space: the state space q in the type TransD fq g does not have to be .nite.
Sentence 2: we can express transformations that go beyond DTTs in the traditional sense, e.g.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: 3 cannot change the nondeterministic behavior of the original pro­gram.
Sentence 2: it does not include an abstract cost to mea­sure the amount of nondeterminism.4 Due to this fact, the current RLNT calculus enjoys the following property: for each residual rule r, the associated costs in the original and residual programs, (k, k ' ), have exactly the same structure (i.e., the same number of alt constructs and in the same position).
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Then, the (.eld) referencing level from Oi to Oj is n, the number of .eld references needed to reach Oj from Oi, i.e.
Sentence 2: oj is reachable from Oi at (.eld) referencing level n. in Figure 1(b), the referencing level from A to E is 2.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: For example, in Figure 9(b), variable u and w have two different val­ues in subspaces 1 and 2 respectively while v is only updated in subspace 1.
Sentence 2: subspace 1 is the one that contains all the three variables, subspace 2 only contains u and w. Since the values of variables a and b are not affected by speculative values, these vari­ables do not exist in any subspace.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Because reachable memory usu­ally grows more slowly than the allocation rate, allocations trigger more and more collections as memory .lls the heap.
Sentence 2: we support two options: (1) moving to PRUNE when the heap is still 100% full after a collection and the VM is about to throw an out-of-memory error or (2) moving to the PRUNE state after .nishing a collection in the SELECT state.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: One approach to improve the detection of redundant in­formation for non-WinZip encodings is to reduce the aver­age chunk size, but even using CDC with an average chunk size of 2 KByte, we have only been able to detect 51.3% of redundant information.
Sentence 2: we have created an application-speci.c chunking method for zip-.les.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Firm mutation is de.ned by Woodward and Halewood [24] as the situation where a simple error is introduced into a program and which persists for one or more executions, but not for the entire program execution .
Sentence 2: similarly to the AjMutator tool [10], the evaluation of mutants based on partial program executions implemented in JUnit tests characterises .rm mutation in Proteum/AJ .
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Note that, before the context transition, GPSNavi is still active and RFNavi is not active yet.
Sentence 2: the execution of powerOffDevices() results in the execution where the device controller turns the GPS receiver o.. By EventCJ, we can declaratively specify which context is activated by which event, and this activation is preserved until the next event that deactivate the context is .red.
Relationship: reasoning