sadat2307/MSciNLI huggingface dataset:
Domain: Software and its engineering
Sentence 1: One way to do this is to compute the whole dynamic of S and to control it using the previous method, but this would leadto a state space explosion.Instead, we will use the contracts of the sub-components as an abstraction of them.Thus, we use an ab­stracted STS S , de.ned as the composition of S ' with the system part of the subcontracts, constrained with the properties enforced by Ki on each of the sub-components.
Sentence 2: we take the assume and enforced parts of the subcontracts as environment model of the abstracted system.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: l ' : thus data Alice endorses can .ow to the database, but not data Carl endorses.5 Our resource reclamation scheme is, in fact, an information .ow control scheme which enforces an integrity policy: principals corre­spond to resource containers, labels correspond to sets of reachable containers, and endorsement corresponds to a copy operation.
Sentence 2: the CM Monad is merely a type-specialized version of an existing, publicly-available information .ow control monad called LIO [23].
Relationship: entailment
Domain: Software and its engineering
Sentence 1: The root cause of the di.erence is the join point model: what DominoJ adopts is the point-in-time model while the one AspectJ adopts is the region-in-time model [15].
Sentence 2: in AspectJ the arrays of the three types of advices are separate, but in DominoJ there is only one array.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: t Figure 3: A-posteriori abstraction With this in mind we introduce another building block of our calculus: in order to allow it to express sealing di­rectly, we generalize coercion expressions to arbitrary types and make the transformation rules from .gure 3 built-in by turning them into reduction rules.
Sentence 2: coercions will have the actual form '± {e : t }.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: The other use of regions is to control the extent of array computations.
Sentence 2: for example, by prefixing the repeat­statement with [R] we specify that all array computations in the statement are to be performed on indices from R. the operations of the two assignment statements in the body of the repeat and the loop condition test, all of which involve expressions whose operands are arrays, will be performed on the n2 values whose indices are given in the region R. In this way programmers have global (de­clarative) control over which parts of arrays are operated upon.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Entropy and Software Systems: Towards an Information-Theoretic Foundation of Software Testing Linmin Yang, Zhe Dang, Thomas R. Fischer, Min Sik Kim and Li Tan School of Electrical Engineering and Computer Science Washington State University, Pullman, WA 99164, USA {lyang1, zdang, .scher, msk}@eecs.wsu.edu, litan@tricity.wsu.edu ABSTRACT We integrate information theory into software testing.
Sentence 2: we use entropy in information theory to mea­sure the amount of uncertainty in a software system before it is fully tested, and we show how the amount decreases when we test the system.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: To extend a pattern functor with a case for metavariables, it is, in essence, enough to introduce a sum to encode the choice between the extra metavariable case and a value from the original pattern functor: type Ext f = K MetaVar :+:f However, Ext extends a type with metavariables on the top-level only, whereas ee also have to allow metavariables to occur in subterms.
Sentence 2: the pattern functor has to be extended recursively.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Although Hoogendijk [19] coins the term parametric polytypism (for what we call parametric datatype­genericity ), and contrasts it with ad hoc polytypism , the only hont he considers is the generic ZIP described above.
Sentence 2: although Hoogendijk certainly makes use of FOLD, there is no evidence from his writing that he realised that it too was a hont.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: 5) MPI_WIN_IFENCE entails a barrier semantics wherever MPI_WIN_FENCE does, that is, whenever the fence call ends an epoch.
Sentence 2: if a call to MPI_WIN_IFENCE must close epoch Ek and open epoch Ek+1, the progress engine of each process must internally delay activating Ek+1 until it receives the Ek completion noti.cations from all the other peers encompassed by the RMA window.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: N and for all t = 0 mj Jmj ( j)t mj mj mj ||x¯(t) - e x¯(0)||2 = .j (t)||x¯(0) - x¯(0)||2.
Sentence 2: i 0 i 0 there exists a zero-input solution that satis.es the above inequality with initial values x¯m0,k j (0), for k = 1, 2, .
Relationship: entailment
Domain: Software and its engineering
Sentence 1: 6.1 Constraint Expressions and Lists Constraint lists are generalised in order to carry not only the con­straints given in the de.nition of a constrained type, but also the constraints arising from its application to other constrained types.
Sentence 2: constraint lists are also constructed from polytypic applications and they contain not only constraint expressions but also other constraint lists.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: In particular, we are interested in ADT de.nitions that depend more heavily on polymorphic re­cursion such as non-uniform ADTs, generalized and extended ab­stract data types (GADTs and EADTs).
Sentence 2: for dealing with non-uniform ADTs we would like to consider an execution strategy that does not apply the problematic rules exhaustively, but rather lazy or on demand.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Indeed, we formally de.ne privacy properties through observational equivalence, however, ProVerif adopts a stronger equiv­alence relation called di.-equivalence.
Sentence 2: di.­equivalence can distinguish between the execution of di.er­entbranches of a conditional statement evenin thefollowing case: if a = a then P else P /di.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Scenarios, depicted using variants of sequence diagrams, are a pop­ular means to specify the inter-object behavior of systems (see, e.g., [5]), are included in the UML standard, and are supported by many modeling tools.
Sentence 2: we are in­terested in modal scenarios presented using a UML2 com­pliant variant of Damm and Harel s Live Sequence Charts (LSC) [3, 7], which extends the partial order semantics of sequence diagrams with universal and existential modalities and allows symbolic class level lifelines, resulting in com­pact andexpressive speci.cations.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: While these projects necessarily include some analysis of the programs, they are not designed for use as an analysis writing platform.
Sentence 2: finally, RIL s design was in.uenced by the C Intermediate language [12], a project with similar goals for C. the authors prior experience using CIL s visitor class, and CIL s clean separation of side-effect expressions from statements, lead to a similar design in RIL.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Not every object al­location site creates a single run-time ob ject.
Sentence 2: if an allocation site is inside a method that could be exe­cuted multiple times (i.e., a method that is reachable along multiple executions paths from the start method), it poten­tially creates multiple objects and cannot be considered as the source of receiver objects for singleton call sites.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: In particular, we showed that a signi.cant number of paths to Ono-recommended peers crosses one or more ASes, but the average number of AS hops for these paths is nevertheless much lower than the corresponding number for paths from unbiased BitTorrent.
Sentence 2: a pure AS-based approach cannot achieve the reduction in cross-ISP traf.c that Ono provides in the area between the curves where x>0 in Fig.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: The get function is blocking when there are not enough elements in the buffer and the put function is blocking when trying to add more items than there is space in the buffer.
Sentence 2: get does not return until the requested number of data items are available in the buffer, Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for pro.t or commercial advantage and that copies bear this notice and the full citation on the .rst page.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: This further implies that, if the data from these two regions were mapped to di.erent cache banks, remote accesses would be introduced.
Sentence 2: |ih(ia -iaj )| re.ects the number of remote accesses that could be intro­duced by this partitioning (under the hyperplane h) when considering the reference pair ia and iaj , while Cost(ih) pre­dicts the total communication brought by this partitioning when considering all the reference pairs in the loop nest.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Modeling CORRELATION IDENTIFIERS solely in the compo­nents &#38; connectors view of the PROCESS-BASED INTEGRATION ARCHITECTURE creates one more inconsistency with the Process Flow view.
Sentence 2: the macro.ow and micro.ow models should pass a valid CORRELATION IDENTIFIER type to all asyn­chronous invocations.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: ß. a2N12..Nk2 2 = ··· =G(am)N1 m..Nkm m .
Sentence 2: ß. aM1..Mn the derivation is started with S-id and followed by alternative applications of S-G and SA-ß.. Then, we show that there should be at least one ai in this sequence such that ai occurs before a in the context G. Finally, by induction on the position of a in the context G, it is proved that such a sequence can never be constructed.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: (t,t,...,t); 1 2 K task instance to utilize the energy saving in the dormant mode.
Sentence 2: if the worst-case execution time of the task is w<p, we would let the processor stay in the dormant mode until the current task instance has been released for p -w time units so that the energy consumption in the p -w time units for procrastination is 0.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: At the beginning of each test, the SLICE algorithm uses the con.icting information in the con.ict database and the collected slices to devise an execution order with the goal of minimizing database resets.
Sentence 2: if the con.ict database contains a con.ict information of (S).Ti (where S is a slice of test traces), and there are no known con.icts between Ti and any of the test traces in S, SLICE should arrange Ti to be exe­cuted before S. At the same time, SLICE does not change the order in which the test traces in S are executed because these test traces can be executed in that order without requiring a database reset.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Students have indicated that seeing the links being set correctly (or incorrectly) as they step through their code is extremely helpful with respect to their understanding of exactly how the implementation relates to the abstraction of the data structure itself.
Sentence 2: seeing a node added on the blackboard as links are redirected is easy, but when it comes to understanding how this happen in the actual code, it is suddenly not so easy.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: In this paper, we propose an architectural optimization of MB-A with the objective to achieve green-ness in the architecture by re­ducing its total computational cost.
Sentence 2: we use ensemble-based architectural design in which, on the lines of Weighted Majority [10], we train an ensemble of prediction models for each server, and periodically learn and update the meta-attribute of each prediction model.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: The concept of satis.ability plays an important role in the fol­lowing sections.
Sentence 2: we say that a set of predicates P is satis.able if Ø..SP for some substitution S. Equivalently, we say that P is satis.able if LPj= Ø,where LPj= {SP |Ø.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: The widespread adoption of multi-core processors signi.cantly exacer­bates these problems, both by increasing the degree of thread inter­leaving and by making memory model and cache coherence issues much more prevalent.
Sentence 2: relaxed memory models cause programs with intentional race conditions to behave in ways that even experienced programmers .nd subtle, complex, and counter­intuitive.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Because the basic design has to accommodate universi.ty structures and processes across many countries, much of the functionali.ty can be configured in more than one way and the overall functionality is likely to be much wider than that required for any one count .ry.
Sentence 2: because the system was in~nded for general release to a global market its design had taken on something of a 'baroque' character, encompassing the processes.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: With a suf.ciently aggressive optimizer, one might hope to elimi­nate the pre-normalization requirement and still get ef.cient code when the actually argument has been normalized.
Sentence 2: the compiler should perform the following optimization (interprocedu­rally).9 normalize (normalize v)= normalize v Rather than wire this domain-speci.c optimization into an other­wise domain-independent compiler, Vertigo performs simpler and more general rewrites.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: This paper posits that mobile devices are not just infotainment platforms, but are also powerful distributed sensing devices.
Sentence 2: continuous sensing and processing of a variety of device­embedded sensor streams (such as accelerometers, gyros &#38; micro­phones) represents a distinct application class, that provides invalu­able real-time context for a variety of consumer and enterprise ap­plications.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: The Intel IXA NPU family of network processors (IXP) is such an example [2] Effective compilation of sequential packet processing programs for execution on the Intel IXP requires that the compiler perform an array of program transformations for the effective utilization of the various forms of concurrency available on the machine.
Sentence 2: multi-threading is required in order to mask the relatively long latency of accesses to off-chip RAM [1][7].
Relationship: entailment
Domain: Software and its engineering
Sentence 1: The average energy savings in this case are 18.3%, 9.7%, and 25.8% for the CPU-only, link-only, and CPU+Link schemes, respectively.
Sentence 2: even when all the overheads incurred by our approach are included, combined scaling of both CPU and commu­nication links leads to signi.cant savings.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: For any timed automaton A of De.nition 2.3, we can obtain a corresponding timed au­tomaton without acceptance invariants AT by adding a new location that is the single accepting location and adding transitions from all accepting locations l of A on the spe­ v cial symbol that are required to meet the clock invariant o .F (l).
Sentence 2: for A= (L,L,S,X,.,E,LF ,.F ), we de.ne the timed automaton (without acceptance invariants) AT as o (L.{f},L,ST ,X,.,E1 ,{f})where f is a location not in L, v and E1 = E .
Relationship: entailment
Domain: Software and its engineering
Sentence 1: The important experiences of Peer-to-Peer (P2P) computing- based software systems, which have come to maturity with systems like Napster [6], Cmutella [7] and Freenet [8], have inspired our work, but our system is essentially new, in the sense that it allows a reliable and distributed song sharing service over mobile UMTS devices.
Sentence 2: in order to ensure both the availability and the responsiveness of our music-on-demand service, we have structured our system according to the special technology of the "replicated Web servers" [9, 10].
Relationship: entailment
Domain: Software and its engineering
Sentence 1: The proof is similar to (Case 2b).
Sentence 2: it follows that the instance message m1 must be greater than the leader message m of v2, which in turn means that p2 cannot have pass Line 16 in round r2 by re­ceiving m. (Case 3 ) p1 used Line 21 and p2 used Line 44: This implies that p1 received a leader message mv from node v1.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: 3.1 Expressiveness of Generic Ownership Comparing Figure 5 with Figures 1 4 shows that it is slightly more complex than the individual type genericity or ownership examples, but rather simpler than the straightforward combination in Figure 4.
Sentence 2: figure 5 s declaration of the Map class has only three parameters (the same as in Figures 2 and 3).
Relationship: entailment
Domain: Software and its engineering
Sentence 1: The .nite variability restricts [24] that within any bounded interval a discrete-valued state can change only .nitely many times.
Sentence 2: we assume that for a discrete timed trace, an interval is classi.ed into two groups: (1) the discrete timed trace is constant over the whole interval; or (2) the interval can be decomposed into a sequence of sub-intervals, and the dis­crete timed trace has different values in any adjacent sub-intervals.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: This yieldsqualityproblemswithrespect to thedevelopedlan­guages;atrendthatalsohits uncontrolledsoftwaredevelop­ment.Existingstudiesindicatethatabout 30%ofdeveloped DSLs aretoo narrowortoo broadtobeuseful, orthat about 40%ofalldevelopedlanguagesdo not re.ecttheprocesses thattheywillbeappliedin(cf.
Sentence 2: [8]) We therefore developed a DSL development approach that transfers well-proven concepts of software engineering tolanguagedevelopment.weusetheconcept of design patterns and traceability to improve language de­velopment.Design patterns capturelanguage development bestpracticesbyconservingprovensolutionsand document­ing theirproperapplication.Traceability ensuresthatdeci­sions are documentedandlinks partsofthelanguagetothe requirementsthatthey originate from.Bothdonotonlyin­creaselanguage quality,but also enable developers to bet­ter understand DSLmetamodels,which both enables quality controlactivitiesandmaintenanceactivities.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: In our investigation, we use 1S to compare the amount of infor­mation transferred by two mappings from the same source schema.
Sentence 2: if M1 1S M2 and M2 1S M1, we say that M1 and M2 transfer the same amount of source information, which is denoted by M1 =S M2.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: For c = k or c = k+1,there is a run of A such that c is the .rst clean round and some process decides in round c+2 or later.
Sentence 2: 5.3 Extended results For loquacious consensus algorithms, we have shown lower bounds in terms of c, and there are existing early-stopping lower bounds in terms of t and f. let n = 3 and t<n-1, and let Abe a loquacious algorithm for (n,t)­consensus.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: <rdf:RDF xml:lang="en" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:rdfs="http://www.w3.org/2000/01/rdf-schema#" xmlns:serv="http://localhost/RDF/servizio.rdfs#">  <serv:ServiceProvider rdf:about="provider ...">   IDFP1SOM   TRANSPORT     Check_Hotel_Availability   SM01   Service providing a check for hotel availability     arrival    IN  STRING      departure   IN  STRING      category   IN  STRING   <serv:Parameter rdf:about="result parameter">   Ris   OUTPUT  STRING     Figure 5: SDL specification for the check_hotel_availability service Our future research will be focused on the implementation of all the components of the framework.
Sentence 2: we plan, first of all, the development of the Process and Services Integration Manager, to provide an effective means for integrating the framework proposed with a workflow management system developed in our research group [2].
Relationship: entailment
Domain: Software and its engineering
Sentence 1: 5.4 Solicitation Pattern 5.4.1 Context Some essential information is needed by a party to make a decision that will affect the flow of some interac ction that is yet to start.
Sentence 2: information about the chara acteristics of other participants service offerings is critical to makin ng a decision as to which participant is to be selected for the interaction.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: By analyzing the source code implementing the sin function, this machine-learning based approach may predict that this function has an MR whose input change and out­put change are both additive3 .
Sentence 2: for the sin function, this machine-learning based approach may infer metamor­phic relations like sin(x) + c1sin(x + c2) = 0, where c1 and c2 are constants and x is the input parameter of the function sin.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: As it is shown in Figure 1, the metrics considered in the measurement framework can be brought to the essential aspects involved in a process model.
Sentence 2: the evaluation of the metrics involves: - Activity: referring the lowest level of details of the performed human tasks with reference to the business process - Resource: regarding all the resources involved in the activity execution, including both human resources (Actors), and inputs/outputs data required to perform the activity (Artefacts).
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Instead, we will want to obtain inductive-recursive de.nitions by appropriately instantiating a single, generic theory of induction-recursion.
Sentence 2: we will want to instantiate a uniform, axiomatic approach to induction­recursion that is widely applicable, and that abstracts over the speci.c choices of index and the codomain of the decoding function.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: In this paper, we consider the memoization problem for a higher-order concurrent language in which threads communicate through synchronous message-passing primitives (e.g.
Sentence 2: concurrent ML (Reppy1999)).Asynchronizationevent acknowledges theex­istenceofanexternal action performedby another thread willingto sendorreceivedata.Ifsuchevents occur withinafunction f whose applications are memoized, thenavoiding re-executionatacall-site c is only possible if these actions are guaranteed to succeed at c. using memo information requires discovery of inter­leavings that satisfy the communication constraints imposed by a previous call.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: 2.3 Peer-to-peer In the peer-to-peer architecture (P2P), each peer has an SLT (Surrogate Location Table) which contains the location information of all the peers and their respective contents.
Sentence 2: for each peer surrogate an SLT has an entry formalized by the pair , where CZ (Content Zone) is the space of the identifiers of the contents potentially stored in the peer identified by SId.
Relationship: entailment