sadat2307/MSciNLI huggingface dataset:
Domain: Software and its engineering
Sentence 1: Let us consider a .nite Plus computation evaluation context C as follows, where m represents a computation and v represents a value: C::= |Bind C (v .m) |Bind m (v .C) |Plus C m |Plus m C In most of these contexts, the computation in the hole does not affect the choice of the .rst evaluation transition.
Sentence 2: for example, the context Plus C m is always evaluated using case 7 regardless of what is in the hole inside the context C. without loss of generality, we can let the evaluation proceed until the computation in the hole directly affects the choice of the evaluation transition.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: In fact, there is one more pitfall of allowing the map implementation to discard branches at unde.ned times: One cannotrelyonaniterator s hasNext() methodtogivetheright result, since all remaining key/value pairs could conceivably bedroppedbeforethecallto next() evenif hasNext() returned true.
Sentence 2: another contract modi.cation is necessary: we allow next () to return null if there is no further element to iterate.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Thus, for each element contained in the PLA for instance, software and hardware elements, and internal and external communication (i.e., interfaces) illustrated in Figure 7, an analysis is performed in order to identify which elements will vary for attending the di.erent PL members.
Sentence 2: pL requirements and other sources (such as variabil­ities in the PL members) could be also used together with such elements.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Over the past decade, the software and hardware of em­bedded systems have faced an increase in complexity due to the use of techniques such as multi-threading, power and memory optimization, and so on.
Sentence 2: the size of the execution traces of applications running on these sys­tems has also increased, and we can only expect an even bigger increase with the introduction of many-core proces­sors in embedded systems.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Dave Ungar s disser­tation research at Stanford was investigating how hard­ware could help overcome the inherent costs of support­ing objects[102].Oneof ourgoalswastoshowthatop­ erations similar to those found in a low-level language likeCcouldbeexecutedin Emerald with comparableef­.ciency.
Sentence 2: we wanted the cost of incrementing an integer variable to be no higher in Emerald than in C. Of course, the cost of invoking a remote object would be higher thanthe costofaCprocedure call.An important principle was that of no-use, no-cost: the additional cost of a given functionality, e.g., distribution, should be im­posed only on those parts of the program that used the additional functionality.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Before presenting the detailed re­cursive divide-and-conquer algorithm, we transform the equation 1.Assume (i, j) is the original coordinate in the original domain D = {(i, j)|0 = i = j < n}, where n = |D| is the original prob­lem size, (i' , j' ) is the new coordinate in the transformed domain ' ' D = {(i' , j' )|0 =i' = j' < n ' }, where n = n + 1 = |D ' |is the new problem size.
Sentence 2: the iteration domain transformation is de.ned as follows: (i ' , j ' ) = f (i, j) : i ' = i, j ' = j + 1 in the transformed domain formulation 1 is rewritten as the new formulation 2, where a(i) is the known initial value (the values on the new diagonal also can be any values).
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Django support involves 37 resources, of which 14 are speci.c to Django applications.
Sentence 2: engage allows the following (independent) con.guration choices for Django applications: OS: MacOSX (two versions) or Ubuntu Linux (two versions)  Web server: Gunicorn or Apache HTTP server  Database: SQLite or MySQL  Optional components: RabbitMQ/Celery (message queu­ing), Redis (key-value store), and memcached (caching)  Optional monitoring: Monit   we currently support 256 distinct deployment con.gurations on a single node.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: In fact, the need to link specific intentional elements types to specific elements of the ADD metamodel led to the exclusion of the enumerator type and the inclusion of metaclasses to represent the intentional elements.
Sentence 2: as can be seen in Figure 1 (see red elements) the intentional element types are represented by the Goal, Softgoal, Task and Resource metaclasses.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Although at some instant, the RI for each tree deviates from the ideal curve,  GrandChallenge Slashdot Rally SIGCOMM2002 SOSP2003 the resources each tree have remain close to perfect balanc­ing for the most of the duration.
Sentence 2: we conclude that our heuristics maintain trees in reasonable balance in resource­scarce environments.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: SYCMC is built on top of an extended version of NUSMV[14] that integrates the MathSAT[32] SMT solver and provides advanced algorithms for performing predicate abstraction by combining BDDs and SMT formulas [15], [16].
Sentence 2: the new ESST model-checking algorithmis implemented withinSYCMC.InSYCMCas well as in ESST each time we expand an ART (ARF) node we perform the check to verify whether the newly generated node iscoveredbyanotherART(ARF) node.itis fundamental to perform this check as ef.ciently as possible.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: When a concurrent workload runs on a VM, we observe that: (1) the number of spinlocks in a .xed time interval decreases along with the VCPU online rate; (2) the majority of spinlocks have waiting time less than 215 CPU cycles; (3) the percentage of waits taking more than 225 CPU cycles increases quickly as the VCPU online rate decreases; (4) the long waits usually occur in some neighboring spinlocks.
Sentence 2: virtualization has a severe performance impact on concurrent applications in the virtualized system.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: 4.2 Seamless Switching of Responsible Nodes for Subscription In the metho d where the global game state is maintained separately in sub spaces, each player cannot receive events  Figure 3: Sub Spaces and Player s View occurred in unsubscrib ed sub spaces.
Sentence 2: if each player subscrib es to a resp onsible node after a new sub space comes into his/her view, the player may miss receiving events which occurred in the new sub space just before the space comes into his/her view.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Algorithm: RSB(T) = {T}; for each optimization O applied to T for each source fragment S referenced in applying O to T RSB(T) = RSB(T) U {O}; end end For the translated code block T, if every element in RSB (T) is unchanged, reusing T would be 100% correct, even if there are changes in other parts of the source binaries in the same module.
Sentence 2: since RSB (T) is the minimum set of source binaries that determine the semantics of T, comparing any real subset of the Referred Source Binaries cannot ensure the 100% correctness of reusing T. for each translated code block, saving and comparing its RSB is the most efficient way to verify its reusability.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Here we list some of the .elds in which Ada is used to a signi.cant degree[4]: 1) Air Tra.c Management System 2) Commercial Aviation 3) Railway Transportation 4) Commercial Rockets 5) Commercial Imaging Space Vehicles 6) Communication and Navigational Satellites and Receivers 7) Scienti.c Space Vehicles 8) Banking and Financial Systems 9) Information Systems 10) Military Applications In all these .elds, the software systems are safety-critical and running online for long term, a tiny error may cause great losses.
Sentence 2: we need more ways to increase the reliability of these systems.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: It may be quite appropriate for a superclass to make a particular method re-implementable and overridable, and to allow one of its subclasses to over­ride it while another re-implements it.
Sentence 2: we see that for each method there are three indepen­dent access rights: o, r and c, and so there are potentially 23 = 8 di.erent sets of rights.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Several other research projects also explored the distributed object notion, notably Argus at MIT[71] and Clouds at GeorgiaTech[2].Argus, asa languagedesign,was essen­ tially complete before the Emerald project started.
Sentence 2: ar­gus was contemporary with Eden rather than with Emerald, and indeed shared with Eden the idea that there were two kinds of objects large objects that were remotely acces­sible (and, in the case of Argus, transactional), and small local objects (essentially, CLU objects).
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Filters must implement the interface RegionSummaryFilter, whose only method veri.es whether a region summary is accepted or rejected by the .lter.
Sentence 2: for example, a .lter that accepts only region summaries with non-zero message passing time can be encoded as follows: class MyFilter implements RegionSummaryFilter { public boolean accept(RegionSummary rs) { return rs.getCommunicationTime() != 0; } } in order to implement an iterator object that iterates over all region summaries with non-zero message passing time, we can use the following code: iterator = experiment.regionSummaryIterator(new MyFilter());  Figure 4.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Figure 4: Interposition of JDOSecure between an Application and a JDO Implementation As pictured in Figure 4, JDOSecure is intended to be in­terposed between an application and a JDO implementation.
Sentence 2: the architecture of the application domain could con­sist of user-interface, application, JDOSecure, JDO imple­mentation and a JDO resource to store the persistent objects of the application domain.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: t[p] = tm[p]+1 { t[p] := t[p] + 1; } l[py] := 42; l[px] := 24; var lx: lin in lx := l@{px}; var lxm:tot in lxm := map(lx); call incr(px,lxm,lx); l := lx@{px}; Figure 3.
Sentence 2: ghost variables the triple {px != py} C {l[py] = 42} can be easily veri.ed using the conventional frame rule.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: result Formula: (True U (~ PM / (False R ~ MU))) / (False R (~ PM / (True U MU))) Figure 3: Maude screen shot This formula characterises all the paths in which ¬ Mark­asUnread occurs at least once: this is guaranteed by the .rst part of the formula, in which it is required that Placedin-Mailboxes must be false at some point in the future, followed by globally ¬MarkasUnread.
Sentence 2: this formula rules out the possibility that MarkedasUnread is always true: indeed, in this case it would be impossible to .ip the value of the original formula because of MarkasUnread.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: ti.T Pi The memory space requirement makes the optimal speed assign­ment for all task instances impractical for the on-line usage.
Sentence 2: we propose to set the execution speed of the j-th task instance of task ti as the maximum execution speed among all of its task in­stances with the same value k = j (modNi)in a hyper-period (referred to as the (k +1)-th task frame Fi,k+1 of task ti).
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: However, after the .rst join, the intermediate join result of R S is pre-grouped on attribute a, b and c (e.g., the symbol a1 is not distinct on the attribute a in the join result).
Sentence 2: if this intermediate result further joins with the symbolic relation T on attribute a and e, then the distribution cannot be freely speci.ed by a user, because if the .rst tuple t11 of T joins with the .rst tuple t7 of the intermediate results, this implies that e1= a1 and thus t11 must join with t8 and t9 as well.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Neglecting the memory required to generate random numbers, .tness values of two sampled individuals, etc., the two largest memory require­ments for cGA are: (1) Probability vector: 4 *f bytes, and (2) sampling two individuals: 2 *f/8= f/4 bytes.
Sentence 2: the total memory required to store the probability vector and to sample two candidate solutions is given by 17 µcGA =4 *f + f/4= ·f.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: If the guard condition is satisfied, the test generator proceeds with the rest of the path, otherwise, it backtracks to a suitable node and explores another path for test generation.
Sentence 2: specification of guard conditions along state transitions is a powerful mechanism for the test generator to select test scenarios that are coherent and c) in the extended UML Statechart model, test statements may be specified along state transitions or state nodes.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: For shower simu­lations, the double source of randomness leads to the combi­nation of gaussian distributions due to internal randomisa­tion and non-necessarily gaussian distributions coming from the above-mentioned physical e.ects.
Sentence 2: taux d acceptation 0.6 0.4 0.2 the outlier detection test itself has to be designed from data mining of existing (and hopefully correct) shower results.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: The schema mapping M ' is a maximum recovery of M if (1) M ' is a recovery for M, and (2) for every recovery M '' of M, wehavethat M.M ' .M.M '' .
Sentence 2: a maximum recovery is a recovery that is optimal among all recoveries in the sense that the composition of M with M ' is the smallest among the compositions of M with every other recovery.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: The crucial point of the integration of graph transforma­tion techniques into MOFLON is, that MOF 2.0 acts as graph schema language rather than old versions of UML or proprietary approaches, which is a considerable novelty in the community of graph transformation tools.
Sentence 2: the promising features of MOF 2.0 like association subsetting and rede.nition can be applied in the context of graph trans­formations.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: At time t = 1 an event E1 occurs, which satis.es all the constraints to enter 4 Notice that an automaton in its initial state cannot be deleted, as transitions exiting the initial state do not include timing constraints.
Sentence 2: state E. Aut duplicates itself, creating Aut1, which uses event E1 to move to state E. We record this fact by labeling the .red transition with the triggering event E1 and the time of occurrence, i.e., E1@1.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Although it s quite simple, it does depend on nesting (an object literal in a method in an object literal), and that can be hard for novice students to understand at .rst.
Sentence 2: for instructors who want to delay a discussion of nesting, or who just prefer a more con­cise or more familiar syntax, the following class declaration accomplishes the same thing: class anAddressCard.for (nm) address (adr) { def name = nm def address = adr method email { EmailApp.openComposerWindowTo(name) } } a Grace class is really just a factory object.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: In MR-MPS, each expected result that implements a certain process culminates with the generation ofone or more work products, which can provide concrete evidence of the process satisfaction.
Sentence 2: in agilemethods, when the practices are implemented, it is possible to generate a work product as output.an important issue to consider is whether the work products arising from the use of the targetagile method correspond to the work products required by the MR-MPS processes.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: In Situation 3, in the worst case, we need to perform l reduced­order merge operations before erasing a log block, where l is the maximum associativity of a log block allowed in LMT.
Sentence 2: the worst-case system response time in Situation 3 is: l × {(Trd + Twr ) × Npage + Terase } + Terase .
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: (sk+1,tk+1) is permitted (in fact, checking that a word is accepted by a timed automaton is linear, see [3]).
Sentence 2: as mentioned above, the maximum diameter of a witness for a violation is equal to the number of states of an automaton, which is bounded by n. the veri.cation that (sk,tk) .
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Ad hoc tracing has several disadvan­tages: e.g., experts who have a strong mental model may not need to keep explicit traces; however, later in development the memory of traces may not be sufficient and much more costly and time­consuming to obtain.
Sentence 2: recent software engineering standards (like CMMI) demand basic systematic tracing between requirements and artifacts such as design, pieces of code, and system test cases.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: In a similar way, we can decompose the tile hor­izontally if we wanted to view it as a revision of the derived update /u* towardsupdate v. Figure 4.
Sentence 2: examples of 2-arrows Ifupdatesareunderstoodoperationallyaseditsequences, then u and v may be two different sequences with the same all components of the tile are essential and neither result.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: This would at least in most cases be too circumstantial and only feasible when all applications can cope with the resulting non-availability of the .lesys­tem for temporary data.
Sentence 2: we propose a more convenient approach relying on the tmpfs storage facility [9] (called simply tmpfs in the following), which is basically a dynamic RAM disk based on the virtual memory subsystem.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: To avoid repetitively and needlessly iterating over many dead robots in scan(), the programmer might maintain a cache a list of just the alive robots as follows: class Battle { private List robots; // master list of all robots private List aliveRobots; // cached list of alive robots ... public List getRobots() { return robots; } public List getAliveRobots() { return aliveRobots; }} Then, each robot can scan the list of alive robots, without needing to check whether each is alive or dead: class Robot { ... private void scan() { for(Robot r : battle.getAliveRobots()) { if(r!=null &#38;&#38; r!=this &#38;&#38; r.intersects(...)) { ... } }}}  Here, aliveRobots is a sub-collection of robots containing only those where !isDead() holds.
Sentence 2: the for-loop in scan() no longer needlessly iterates over dead robots.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Among others, the de.nition of user-centricity in TAS3 also addresses the user s ability : 1) to express privacy pref­erences, 2) to manage his own partial identities, 3) to con­.gure trust preferences and provide feedbacks.
Sentence 2: the user s ability to express trust preferences in TAS3 is accommodated by allowing the user to specify the trust rating or trust score that is required for entities in order for them to be involved in processing operations that for example can involve his/her personal data.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: In case N(J)=Span(J)=max(AIt)+l, the maximum iteration dif- ference between any two nodes in J is strictly less than the number of loop bodies.
Sentence 2: for each duplicate J~ of J, any two nodes that belong to different iterations of J will be located in different loop bodies in G =, thus not interfering.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Tracingtimeimprovesparticularlyonbenchmarkswhere cross­metadata references account for a large proportion of the total numberof referencestracedby COMP,e.g.avrora, fop,luindex, lusearch,sun.ow,tomcat andxalan.Forthesebenchmarkstracing timeisreducedby afactor of .veor more.
Sentence 2: thesmallestgainsare obtainedforh2(15% only).Itstotal numberofliveobjectsintheapplicationheap aremorethan65 times aslarge, andthe numberof references emanatingfromthe application heap are more than 50 times as large than from the permanentgeneration.h2isthe onlybenchmark to bene.t more from the elimination of compaction than the reduction in tracingtime.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: InFigure11,if the next eventbreaks out along/near the solid thickgrayline, whichperpendicularly bisectsthe soliddarklinebetweenanchorC and thecenterof gravity of node9 s area(thegray area), the wave would reach anchorC and thecenter ofgravity of node9 sareaat roughly thesametime, which would relatively equallydividenode9 s area.
Sentence 2: node9prefersto voteforthepositions around the thickgrayline.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: For example, a select operation on a collection represented by a comprehension of the form (1) is translated by conjoining the body of the select con­struct with the predicate p(x).A collect operation can be trans­lated by substituting E(x) by the body of the collect construct.
Sentence 2: every OCL type includes an unde.ned value.3 we add to every translation of an OCL expression e a formula de that evaluates to true iff the expression does not evaluate to the unde.ned value.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Additionally, RedHerring s decoy environments are con­structed to look identical to real distributed web servers from inside the container; for example, many real web servers use LXC containers that look like the decoy LXC containers.
Sentence 2: distinguishing decoys from real web servers on the basis of environmental details (e.g., through init process control groups) is di.cult for attackers.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Thiskeepstheinternal stateof theunitinternally consistent on all explored paths: for each explored path, there exists some con­crete execution of the system that would lead to exactly the same internalstateoftheunit alongthatpath exceptthe enginedoes not need to incur the cost of actually .nding that path.
Sentence 2: any sound analysis that takesinto account only theinternal state of the unit produces no false positives under the LC model.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Concretely, we must prove that: runAT aenv o(f #i ) .. orunAT aenv 0 o(f #i ) We observe that the problem of reasoning about aspect interference for an isolated function woven by aspects is directly analogous to the work of MRI in the model of mixins.
Sentence 2: we can bene.t from the established results of MRI in at least two ways: The type Open s represents an open component of type s. new is a .xpoint combinator that closes, or instantiates, an open com­ponent that is potentially extended.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: O(q).v < v}| automata, an upwards closed set is completely determined by a single natural number, which is the lower bound on the set.
Sentence 2: we introduce an integer variable k.nal and create a constraint that Our decision procedure will take four additional parameters as the value of the counter after reading t is greater than or equal to input Q, N , K , M .
Relationship: reasoning