sadat2307/MSciNLI huggingface dataset:
Domain: Software and its engineering
Sentence 1: 4.2 Weak Semantics Weak MTS re.nement also de.ned by Larsen [24] allows comparing the observable behaviour of models while ignor­ing the possible di.erences that they may have in terms of internal computation.
Sentence 2: this notion of re.ne­ment considers t-labelled transitions di.erently from other transitions.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: We do not ask the reader to understand the algorithm in Figure 2; we merely want to point out the essence of what complicates modularization.
Sentence 2: note that the memory location current.children[current.idx] serves two roles: on the right-hand side of the .rst parallel assignment, the location stores an edge of the graph; on the left-hand side, it serves as storage for the backtracking structure.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: RACECAR does not solve the POP problem for individual work metrics, but instead creates the parallelization graph to inform parallelizing implementations of how to partition computation for any work metric.
Sentence 2: a parallelizing implementation may perform a lookup within the parallelization graph based on the invocation parameter s work metric to determine how to efficiently apportion the computation and resources between the implementation s recursive function calls.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Crucially, the set of level-1 data cache (L1D) indices associated with the base addresses of the blocks within such arrays is restricted to just 16 instead of the full complement of 128.
Sentence 2: given the way virtual addresses map to cache indices and because of the regular consecutive spacing of the blocks in the array, blocks of that particular size-class (128 bytes) can start on only 16 of the 128 possible indices.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: This concept has a semantics related to the size of a set, but it is not the general cardinality notion.
Sentence 2: given n variables X1,...,Xn with domains D1,...,Dn, a cardinality constraint for a do­main element d is a bound k on the number of Xi that can be simultaneously instantiated to d. It is therefore a con­straint associated to the availability of a .xed number k of resources of a certain kind d. 7.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: This can be translated into an assumption that monitorBegin and monitorEnd events are correctly nested within one control .ow.
Sentence 2: every monitorEnd joinpoint should .nd at the top of the stack a Resource object that has been put there by a correspond­ing monitorBegin joinpoint (i.e., one that has been de­.ned within the same sub-aspect of AbstractMonitor).
Relationship: entailment
Domain: Software and its engineering
Sentence 1: However, we .nd it convenient to virtually run EC and PO-algorithms A on multi­graphs F with the understanding that the output A(F, v) is interpreted as if we had run A on a simple lift of F and then mapped the solution back to F according to (2).
Sentence 2: to determine A(F, v) where F is a multigraph, do the following: 1.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Note, however, that this behavior is only achieved if the action of the transition to DoneA that writes B is performed before the trigger of the transition to DoneB reads B.
Sentence 2: there is a race condition on AB A  A, O1 B, A,B, B,O1 O2 O2 (b) Two possible execution traces, with true-valued inputs above the tick time line and (c) Normalized SCChart ABO-norm.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Core issues that limit the portability of TinyOS-2.x are identified, and suggestions made as to how these might be addressed.
Sentence 2: tinyOS s reliance on the GNU Compiler Collection being available for the wireless sensor network device, the use of connection-dependent abstractions and their impact on system-on-chip devices, and the reuse of components within chip families.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Addition­ally, using up and down knobs in the Probe API, applications can force on-demand fast re-aggregation of updates to avoid staleness in the face of recon.gurations.
Sentence 2: if an application de­tects or suspects an answer as stale, then it can re-issue the probe increasing the up and down parameters to force the refreshing of the cached data.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: We will demonstrate how JavaConnect implements language interoperability through such a tran­sitive combination of FFI s and how Smalltalk s dynamic and re.ective features permit a high-level integration of Java objects in the Smalltalk environment.
Sentence 2: we de­scribe and explore the concept of language shifting objects where Java objects migrate across the language barrier into Smalltalk such that a part or their entire set of methods of their class e.ectively executes in the Smalltalk environ­ment rather than in the Java environment.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: 4 Virtual User Interface Evaluation Since a XIML model of the virtual world is maintained internally to Envir3D at any time, this model can then be exploited for other activities that are traditional to model-based design, such as, model checking, consistency checking, automatic verification of properties of interest, both on the presentation and the dialog, automatic evaluation of the model quality.
Sentence 2: we are in­terested by testing as automatically as possible whether the cur­rent virtual world is compliant with usability guidelines that may be recommended [Smith &#38; Walker, 2003; Wood, 99].
Relationship: entailment
Domain: Software and its engineering
Sentence 1: In­deed, while plans were initially designed to re.ect components making up an application, we demonstrated in [12] that plans can also re.ect other kind of artifacts, such as Service-Oriented Ar­chitectures (SOA).
Sentence 2: we proposed a component-based architecture for discovering, negotiating, and planning application con.gurations supporting SOA.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: preserve the rela­tion state_mint (x.signed L rx Iy.unsign rk ry Id) (lines 7 8), for any association list d with no register in common with the code (lines 3 6), provided the initial conditions from line 9 hold.
Sentence 2: these initial conditions spec­ify that register rk contains the length L (line 10) and rule out potential over.ows (line 12).
Relationship: entailment
Domain: Software and its engineering
Sentence 1: We compare the performance of the partitioned cache structure against a number of typical LI cache configurations in modern em- bedded processors.
Sentence 2: our comparison configurations in- dude: 4K direct-mapped and 2-way set-associative LI cache with line size of 4 words, 8K direct-mapped and 2-way set-associative LI cache with line size of 8 words.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Equ Notation Description (1) Instructionb Number of instructions in BB b (1) Lengthb The length of BB b (1) FU Number of functional units (1) Reschedulabilityb Re-schedulability of BB b (2) Weightv The weight of variable v (2) F requencyv The execution frequency of v (2) Degreev Interference degree of variable v (3) PB The priority of basic block b (3) Weightb The weight of basic block b (4) Cost The required latency of OPs (5) Reg Number of remaining registers (5) PD The priority of destination d CF G Control Flow Graph ILP Instruction-Level Parallelism  4.2 Strategy for Local and Global Variable Allocation Since we consider the basic block based register allocation, the dif­ferences of local and global variables need to be taken into account due to their different effects on register resource and the allocation choice of other basic blocks.
Sentence 2: register assignment of a global variable would limit the allocation choice of variables in other basic blocks.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: and the related criticisms, and to formally de.ne a protocol that incorporates them and does not su.er from the previ­ously mentioned limitations.
Sentence 2: solutions to the problem of binding the static and dynamic parts of a mobile agent have already been sketched in [6] and proposed in [7], while, for what concerns resistance to truncations, this pa­per shows how animprovement canbe achievedby forcing the agent to securely store the addresses of the next hosts to be visited, as long as they are computed or become avail­able.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: In this context, our aim is to experiment with the integra­tionofprediction modelswithinaspeci.cautonomic frame­work in order to assess the feasibility of such integration in a setting where the characteristics of dynamicity, decentral­ization, and cooperation among nodes are important.
Sentence 2: we base our work on the SelfLets infrastructure that we have presented in [13, 6].
Relationship: entailment
Domain: Software and its engineering
Sentence 1: ELEMENTARY CONSTRUCTION In this section we survey the constructions and results fea­tured in the rest of the paper, using only elementary terms and techniques.
Sentence 2: we give an elementary state­ment and proof of a special case of our Schwartz-Zippel type lemma, used here to show that a speci.c instance of degree­lifted AG codes has good distance, and an elementary de­ () v m Tower of curves (hypothetical construction, see below) 1 - d - 1 q n any scription of our correcting methods and their relation to the local correction of RM codes.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: 2.2 Hardening Distributed Applications Refactoring an existing centralized program for distributed execu­tions should preserve its original execution behavior, so that a dis­tributed application would provide the same or equivalent func­tionality to the user as the original centralized version.
Sentence 2: distributing an application should not only improve its per­formance, availability, scalability, and ef.ciency, but also furnish the original functionality to the user.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: In an interactivegame, the players will get frustrated if theyhave to wait for several sec­onds each time a leader is lost.
Sentence 2: one may ask whether we can en­sure that leader loss does not cause the simulation to pause while anew leaderis elected.asthegamegrowsin popu­lation, the probability that a leader will be lost also increases.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Recall that the only reason why we want to accurately state what set-theoretic model of types is, is to precisely de.ne the sub­typing relation for syntactic types.
Sentence 2: we do not de.ne an interpretation of types in order to formally and mathematically state what the syntactic types mean but, more simply, we de.ne it in order to state how they are related.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: 2 Goals In listening to the radicals describe their vision for a new CS 1, I find myself wishing that my CS1 could satisfy some of those radical goals.
Sentence 2: i would prefer that the programs I ask my students to write: ) have a GUI front-end occasionally involve some concurrency use many objects and many classes  use "real" objects (not procedural substitutes)  be dynamic, not static  It can be useful to read the list above more as an indictment of the course you get when you directly translate a Pascal CS1 course into Java syntax.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Because the ~S-cons algorithm needs to cope with those mistakes, it has the following in- teresting features:  The ~S-cons algorithm preserves safety even if neither of strong completeness nor eventual weak accuracy is satisfied.
Sentence 2: even if crashed processes are never suspected and correct processes are permanently suspected by all, (a) no two processes ever disagree on a decision and (b) no process ever decides on a value that was not proposed by some process.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Both approaches free up virtual andphysical memory by transferringhighly stale objects to disk, and both preserve safety by returning accessed disk objects to memory.
Sentence 2: unlike Melt, LeakSur­vivor cannotguarantee space andtimeproportionaltoin-use memorybecause referencesfrom staletoin-use objects con­tinueto use space evenif thein-use objectsbecome stale.entriesinLeakSurvivor sSwap-Out Table (SOT) (similartoMelt s sciontable)cannotbe eliminatedifthetar­getobject moves todisk, sinceincomingpointersfromdisk are unknown.Incontrast,Meltusestwolevelsofindirection, stub-scionpairs,to eliminate scions referencingobjectslater moved tothe stale space(Section2.2).Forthethreeleaks evaluatedinLeakSurvivor,theSOTgrows only slightly,but it is unclear if they grow proportionally to the leak since the experiments are terminated after two hours, before the leaks would have .lled the disk.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: The most general approach for laying out the stacks is to allocate global GPU memory for each threads stack where items are arranged such that if two adjacent threads are at the same stack level their accesses are made to contiguous location in memory, providing the best oppor-6.1 Evaluation Methodology tunity for memory coalescing.
Sentence 2: the threads stacks are interleaved in memory, rather than having each thread s stack contiguous in memory.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: We check completeness using parallel composition of multiple .le system checkers.
Sentence 2: we run different im­plementationsof.lesystemcheckers(possiblyfordifferent .le systems) and comparetheir results when started withthe samesemanticstate(i.e.,alogical representationof the .le system state that abstracts away the differences in the data and metadataphysicallayout) and the samedata corruption.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: To give an example of basic ehandler functionality, the following code snippet presents a useful handler in the context of channel EEC1: void ehandler() boundto(EEC1()): withincode(public void F()){ ... } This advice handles exceptions flowing through explicit exception channel EEC1.
Sentence 2: the handler is activated when such exceptions are raised within method F().
Relationship: entailment
Domain: Software and its engineering
Sentence 1: 4.2 Specifying Alternate Outcomes Though existing techniques can parallelize the applica­tionsin Section4.1,manyarestillleft unparallelizedbythis framework.
Sentence 2: the dependences that prevent par­allelization or lead to excessive misspeculation are often a resultof arti.cial constraints imposedbythe sequentialpro­gramming model.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: The generated JAVA class for the class de.nition in XTR A ITJ can be used in any JAVA program and can be itself subclassed.
Sentence 2: one can override the original method m: public class CExt extends C {@Override public String m() {return super.m() + ", Redefined"; }} If we execute the following JAVA snippet System.out.println(new CExt().callM()); the string "a String, Modified, Redefined" will be printed on the screen.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: It aims at obtaining semantic interpretation of signals (messages) going to/from the VIEW2 SCADA system (http://www.view4.rs/) which is the Mihajlo Pupin Institute s proprietary system for supervision and data acquisition currently installed at the airport Nikola Tesla.
Sentence 2: it is used to identify to which device/system an incoming (outgoing) signal belongs, which geographical location the signal is coming from, what its characteristics are, relationships with other devices/signals, etc.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: At 20 ms, when ports read by both tasks t1 and t2 are updated, and ports written by both t1 and t2 are read, a time-safety violation occurs unless both tasks have completed.
Sentence 2: an execution of the program is time-safe if the scheduler ensures the following: (1) each invocation of task t1 at 20n ms, for n = 0, completes by 20n+ 20 ms; (2) each invocation of t2 at 20n ms completes by 20n + 10 ms; and (3) each invocation of t2 at 20n + 10 ms completes by 20n + 20 ms.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Though the context of business documents for standardized information exchange is not considered as a traditional domain within Software Engineering, we ar­gue that concepts from Software Con.guration Management (SCM) may be applied for dealing with business document model variants.
Sentence 2: one aspect of SCM [22] ad­dresses dealing with di.erent versions of software systems whereas versions are di.erentiated into revisions as well as variants.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: is an abstract op­erator, and g{i,j}(x) is a function denoting the impact from element i to element j.
Sentence 2: processor i pushes value g{i,j}(vi) (instead of vi) to processor j, and on pro­cessor j, these g{i,j}(vi) from any processor i and cj can be aggregated (by .
Relationship: entailment
Domain: Software and its engineering
Sentence 1: To support formal analysis, our specification patterns may be formalized in a first-order, real-time linear temporal logic [22] augmented with epistemic constructs for security-related predicates.
Sentence 2: the epistemic operator KnowsVag is defined on state variables as follows: KnowsVag (v) = .x: Knowsag (x = v) ( knows value ) Knowsag (P) = Beliefag (P) .
Relationship: entailment
Domain: Software and its engineering
Sentence 1: dim Name(long, short) in dim Rep(rel,adj) in let T=Name(Node,N) in type T = Int type Graph = [(T,Rep(T,[T])]) ... With the let binding we need only one choice and can reuse it many times.
Sentence 2: if we want to extend the choice of names, we can do this easily and safely at one place and have the effect systematically replicated through the variable reference.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: However, those results are for a GOLDILOCKS implementation written in compiled C code inside the Kaffe Virtual Machine, and target programs were in­terpreted by this modi.ed JVM.5 If GOLDILOCKS were imple­mented inside a JIT, then target programs would run signi.cantly faster, and so the GOLDILOCKS slowdown would appear larger but would be more directly comparable to ROADRUNNER tools (in which both the target program and checker are optimized by the JIT).
Sentence 2: to compensate for this effect, we estimated the corresponding GOLDILOCKS-JIT slowdown from the experimental results of [14] as: (Goldilocks-Time - Interpreted-Time)+ JIT-Time JIT-Time we compute the cost of the Goldilocks analysis based on the running times of the unmodi.ed Kaffe interpreter and the Goldilocks-aware Kaffe interpreter, and then estimate the slow­down that this overhead would have on the running time of the tar­get program in the Kaffe JIT.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: FsaveP wd) AESEncr: PEAESEncr = true PIAESEncr = Spectative RAESEncr = G(call encryptDES  .
Sentence 2: x((G ¬encryptedDES) .F(encryptedAES))) Req&#38;EncrPwd takes care of requesting a pass­word and calling the encryption algorithm and assumes the existence of DESSave, an aspect that guarantees that eventu­ally the encrypted password is saved.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: The results that we present in Section 5 show that a new, directed test-generation technique based on path-constraint similarity yields the smallest test suites with the same excellent fault-localization characteristics as test suites generated by other techniques.
Sentence 2: when compared to test generation based on the concolic execution algorithm of [4], which aims to maxi­mize code coverage, our directed technique reduces test-suite size by 86.1% and test-suite generation time by 88.6%.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: The extreme resource con­straints inherent to WSNs, the in situ deployment in harsh environments and the lack of run-time support tools make debuggingand maintainingWSN applications very challeng­ing.
Sentence 2: run-time debugging tools are required to detect and diagnose complex run-time faults such as race­conditions, which occur due to unexpected interaction with the real-world environment.The ability to repeatedly repro­duce the failure by replaying the execution from the trace of events that took place can play a crucial role in debugging such faults.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: One of the main orientations of our future work will be to carry out a number of user-centered evaluations to explore how collaboration occurs in the type of multi-user multi-device environment that we have described in the Design Considerations and Example Use Cases sections.
Sentence 2: we want to explore issues of which type of browser representation is best in which contexts to best improve the collaborative experience, and the degree to which collaborative web browsing of the type we propose improves the collaborative process when compared to collaborative browsing using more traditional means and methods such as the backseat driver or divide­and-conquer.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: A complex mapping is indicated by the im­plicit relationship between the semantic association among the la­bels VehicleSearch , Price: , and Make: on the form and the thick-lined connection among the concepts in the ontology.
Sentence 2: the Price: label together with VehicleSearch on the form correspond to the path in the ontology from the concept node gr:Offering to the concept gr:PriceSpeci.cation through --gr:hasPriceSpecification-->-, where we use the no­tation --r-->-to represent a many-to-one (functional) relation­ship r in an ontology, and --r--to represent a many-to-many relationship.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: We demonstrate that na¨ively-injected faults do not have a uniform consumer-perceived severity, and thus that standard fault seeding metrics are misleading for web application test suite evaluation.
Sentence 2: the assumption that all seeded faults have the same severity, and thus that a test suite that .nds more faults is necessarily better, is not always true when considering consumer-rated severity.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: This can be achieved by reducing the reuse distance between two iterations that are mapped to two different cores that share an on-chip cache.
Sentence 2: our goal is to come up with a schedule for each core such that, if two cores share a data block, they share it within a short period of time, thereby increasing chances of catching the reused data block in the shared cache.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: In addition to generic device-class interfaces, one must also specifygenericbusinterfaces(seeFigure3) for various types of I/Obuses as wellasgenericinterfacesto commonOS services such as timers, synchronisation, andDMAbuffer management.
Sentence 2: design of the DMA buffer management interface raises someinterestingissuesduetothedifferent waysin whichthe testbench and theOS manage devices access tophysical memory.
Relationship: entailment