sadat2307/MSciNLI huggingface dataset:
Domain: Software and its engineering
Sentence 1: To prove this result, it was necessary to revisit the def­initions of some basic concepts that were .rst given in [5, 4] (e.g., what constitutes a problem, what it means to solve a problem, what it means to implement a failure detector, and what it means to compose an algorithm that uses some failure detector D with an algorithm that implements D).
Sentence 2: we augment the model in [4] to allow external input and output actions.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: In this paper, we pro­pose an e.cient victim block selection (module) design to improve the performance of the existing garbage collection policies by minimizing the time on (1) selecting the victim blocks with maximal invalid pages, (2) identifying the status of each .ash page, and (3) copying live pages from the se­lected victim blocks.
Sentence 2: a victim block selection strategy is designed to recommend the best victim blocks (i.e., the blocks with the maximal number of invalid pages) and page status of the selected victim blocks for the existing garbage collection policies with limited accesses to the .ash memory, such that the victim block selection overheads and the live-page copying overheads could be minimized even when the storage capacity grows.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Given a reference p to a Person object, we ideally want p s account , i.e., a compound, or indirect reference to account via p, to be passed to SOP, rather than the account refer­ence itself.
Sentence 2: we want some kind of redirect semantics for references: the meaning of account should be Figure 2: Decorator design for output streams late bound within the current context of the object referred to by p, whenever p s account gets evaluated.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: The adoption of the Semantic Web standards for representing context data is fundamental to guarantee a common understanding among devices and services, enabling interoperability.
Sentence 2: we intend to use the Linked Data standard [5], which is based on the representation of data in the form of RDF triples, using standard vocabularies  such as DBPedia, FOAF, Geo, GeoNames, etc to represent context data types and instances.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: However, the information-hiding decision process does not account explicitly for the costs and benefits of modularization, so it does not help designers most effectively to design for value added.
Sentence 2: the current formulation does not address two key questions from a value-maximization perspective: (1) which of the available modularizations is best; (2) at what point should one be selected in the face of uncertainty about the first question?
Relationship: entailment
Domain: Software and its engineering
Sentence 1: 4.1 The concept of Participant If we closely analyse the ODOL ontology, we can easily .nd out a few minor incoherences in the de.nition of some of its concept.
Sentence 2: the ontology introduces the central concept of Participant, which is de.ned as the father OWL class for all of the pattern s elements templates, like ClassTemplate, MemberTemplate, RelationShipTemplate and so on.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: INTRODUCTION Term rewriting systems [4, 5, 10, 16] are versatile models of computation in their own right and underlie several mod­ern declarative programming languages, e.g., ASF+SDF [19], Elan [6] and Maude [8] to name a few.
Sentence 2: pro­grams in the functional logic programming languages Curry [12] and Toy [17] are generally regarded as TRSs and are executed by narrowing.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: They can, first, programmatically locate val­ues to change using XPath to probe the generated XTBL+, which is generated at the first step, and then Mulini can change all corresponding points within intermediate specifications, which are generated over the initial code generation process, using XML mapping technique.
Sentence 2: the target portions are linked between intermediate specifications during the initial processing by mapping XML elements of a specification to those of next specification.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: On the other hand, if the veri.er does not consume p but rather some other, adversarially chosen stream pA that does not contain p as a pre.x (e.g., because the server is behaving ma­liciously or incorrectly), then the only way the veri.er can accept an incorrect result is if the adversary has found a hash collision.
Sentence 2: the consumed stream pA contains an element s  that corre­sponds to an element s in p such that s but hash s = hash s = s .
Relationship: entailment
Domain: Software and its engineering
Sentence 1: On the other hand, to decide whether a given FSM has an adaptive distinguishing sequence can be achieved in O(pn log n) [3].
Sentence 2: deciding whether a checking sequence generation method can be used on a given FSM is at least PSPACE­complete when the method is based on preset distinguishing sequences, while it can take polynomial time1 when the same method is adapted to use adaptive distinguishing sequences (this does not speak about the complexity of the method itself).
Relationship: entailment
Domain: Software and its engineering
Sentence 1: We say that .1 is subsumed by .2 in G, written G |= .1 .2, if for all valuations V consistent with G, V(.1) V(.2).
Sentence 2: in all possible instantiations of the type variables in G, quali.er .1 being A implies that .2 is A. Kinding and variance.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: 1 pipeline{ 2 for(int i=0; i<100; ++i) { 3 int x = foo(); 4 if(i% 2!= 0){ 5 fifo_put(&#38;f,x); 6 fifo_get(&#38;f,&#38;x); 7 bar(x); 8 } 9 } 10 } The dependency analysis stage forms a large number of can­didate threads by computing a backward data and control slice [16] from each unprivatized operation ignoring data de­pendencies on channel operations but including all other op­erations in the slice.
Sentence 2: we repeatedly apply rules (1 3) to form candidate threads.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: In fact, epidemic routing is a reasonable approach where no information can be determined about the movement pat­terns of nodes in the system.
Sentence 2: where there is no basis on which to distinguish the movement pattern of any node from another, and the movement pattern of each node is individually random, the only choices about mes­sage placement are to place messages randomly or to place them everywhere, since there is no more intelligent basis for making a decision.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: We introduce the necessary notions below: Genetic fragment The genetic fragment (or just fragment) represents the concrete subtree that gets changed by a genetic operator in the course of producing the o.spring.
Sentence 2: the subtree that gets swapped from the non­root parent to the root parent by crossover, or the node or subtree that gets modi.ed by mutation.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: While independent list elements are generated simultaneously and all elements inherit the same attribute list from their parent (in other words, every list element is generated over the same attribute list and cannot affect each other), in dependent list generation, elements are generated one after the other and each one inherits the attributes from the previous one.
Sentence 2: the generated attributes .ow through the list and the currently generated elements can affect the following siblings.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Collaboration Patterns in the SOA Ecosystem Michael Poulin, Ph.D. Head of Business &#38; Technical Architecture, BuTechCon Ltd. 264 High St., Beckenham Kent, BR3 1DZ, UK +44(0) 797-076-2133 m_z_poulin@hotmail.com ABSTRACT In this paper, we argue that orchestration and choreography are not two independent patterns, but they go together addressing two parts of the same thing known as a service composition.
Sentence 2: when a service-conductor engages another service in the orchestration, actual interactions with this service may be scripted using choreography.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: fundsCybFacil and hostCybFacil are facilitator actors of Fund­sCyberOrg and hostCyberOrg respectively Most interestingly, if the resources available through the contract with the current host cyberorg are not suf.cient, a regional cy­berorg may negotiate a better contract with another cyberorg.
Sentence 2: although the cyberorgs for sub-regions are created by cyberorgs for larger regions, the sub-regional cyberorgs are free to migrate elsewhere in search of a better matching execution envi­ronment.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: An occurrence of the super option, for example, consists of two adjacent terms: the key­word #:super followed by an expression, e.g., (de.ne-struct point (xy) #:super geometry #:mutable) No single-term pattern describes the inspector option.
Sentence 2: the pattern (#:super sup:expr) does not, because #:super and its argument do not appear as a separate parenthesized term, such as (#:super geometry).
Relationship: entailment
Domain: Software and its engineering
Sentence 1: AVA: Automated Interpretation of Dynamically Detected Anomalies Anton Babenko Leonardo Mariani Fabrizio Pastore University of Milano Bicocca University of Milano Bicocca University of Milano Bicocca viale Sarca, 336 viale Sarca, 336 viale Sarca, 336 20126 -Milano, Italy 20126 -Milano, Italy 20126 -Milano, Italy a.babenko@campus.unimib.it mariani@disco.unimib.it pastore@disco.unimib.it ABSTRACT Dynamic analysis techniques have been extensively adopted to discover causes of observed failures.
Sentence 2: anom­aly detection techniques can infer behavioral models from observed legal executions and compare failing executions with the inferred models to automatically identify the likely anomalous events that caused observed failures.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: The designer (as a user of ArchE) provides: (i) the meaning of scenarios and responsibilities, (ii) the mapping of scenarios to responsibilities; and essentially, (iii) the design context.
Sentence 2: the designer can trust the quality-attribute reasoning followed by ArchE when proposing tactics, but she does not have to agree on applying the best tactics found for satisfying her scenarios.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: 5.3 Experiences It is natural to ask whether or not the observed signi.cant state­space reduction translates into any tangible bene.ts for improving system reliability.
Sentence 2: we look at two aspects: (i) DEME-TER s ability to explore completely a meaningful logically bounded state space of a system implementation for a higher degree of reli­ability assurance and (ii) how DEMETER improves our ability to .nd bugs.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Analysis for CRT Key Pre Distribution Key connectivity is a measure of the probability of key-sharing 0.73 0.72 between two or more nodes.
Sentence 2: it is a measure of the number Connectivity 0.71 0.7 0.69 0.68 0.67 0.66 0.65 of pairs of nodes that have at least one key common between them out of the total number of possible pairs of nodes.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: For a job of tittwith a deadline d, its deadline is virtu­ally transformed to d- min{Cti }.
Sentence 2: i,Ctt For a job of {tj | i<j<k} and tktwith a deadline d, its deadline is remained d. tittis deemed to have a relative deadline Ti - min{Cti }.Once a job of ttthas the earliest deadline i,Ctt i on Px, no other jobs have earlier deadlines until the job of tittcompletes, since the period (relative deadline) of tittis guaranteed to be the smallest in .x by the characteristic of the task assigning algorithm presented in the previous sec­tion.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: ESC4, the ESC component of the JML4 project, is able to verify many more kinds of methods in part because of its use of novel techniques which apply multiple theorem provers.
Sentence 2: we present Of.ine User-Assisted ESC (OUA-ESC), a new form of veri.cation that lies between ESC and Full Static Program Veri.cation (FSPV), that al­lows users to control the level of completeness of the tool.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: While we have described trace formulas for our simple pro­grams, a C program with .nite bit width data, e.g., 32-bit integers, can be converted into an equivalent Boolean program by separately tracking each bit of the state, and by interpreting .xed-width arith­metic and comparison operators as corresponding Boolean opera­tions on each individual bit.
Sentence 2: our implementation han­dles all features of ANSI-C, including function calls and pointers.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: select function{ main }.body.loop end apply insert after %{ ... }%; $body.insert before %{ ... }% end Furthermore, multiple pointcut expressions can be joined and associated with a single apply, allowing access to mul-tiple branches in the join point hierarchy at once, thus re-ducing the size of the aspect definition.
Sentence 2: lA-RA supports the (::) operator which, when used in an apply definition, joins the results of two pointcut expressions.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: This later code might be the implementation itself in an interpreter, or a code-generation routine in an IR-based or JIT­compiler emulator; we will refer to it as per-instruction code.By exploring the instruction decoder with symbolic execution, we can discover which byte sequences the emulator considers to be instruc­tions, and group byte sequences that are the same instruction in the sense that they have common per-instruction code in the emu­lator.
Sentence 2: we start symbolic execution at the entry point of the emulator s instruction parser, mark the bytes that are the input to this parser as symbolic, and explore execution paths up to the selection of the per-instruction code.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: We highlight that the assumption that the levels of importance related to the same category of DDRD information are different for different DDRD UC(s) is valid only if the above null hypothesis is rejected for one or more combinations of i and j.
Sentence 2: each specific combination of i and j in which the null hypothesis is rejected, identifies a specific pattern in the perceived importance level of a category of DDRD information.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: A concept in the context of our approachis apair(O,F), whereO is a set of classes, and F is a set of use-cases.
Sentence 2: given a speci.c behavior of the system that is de.ned by a set of use-cases F; a concept (O,F) identi.es the set of classes O that realizes the given set of use-cases F. a concept can be used to identify the set of classes that can realize a given behavior in the system.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Generalizing the generating functions.
Sentence 2: to accommodate the new generalized data structures, we have to slightly extend the interface of the transform method that emit the staged C-IR: case class F2() extends SPL { override def transform[AR[_],ER[_],T:NType] (in: Vector[AR,ER,T]) = { val out = in.create(2) out(0) = in(0) + in(1) out(1) = in(0) -in(1) out }} Calling this generalized F2 function with the input val in = new SplitComplexVector[Rep, Double](2) will be resolved as transform[Rep,Complex,Double](in: Vector[Rep,Complex,Double]) the internal storage type will be Rep[Array[Double]].
Relationship: entailment
Domain: Software and its engineering
Sentence 1: That is, rpowerB ( A) is the relative power that a peer A is cur­ rently able to deliver, as perceived by a peer B.
Sentence 2: it is estimated by peer B as the average execution time of the tasks B ran locally, divided by the average execution time of the tasks B ran on A. mean{exectime(t B)} rpowerB (A) = B , where mean{exectime(t A)} B {exectime(tB B)} denotes the execution time of the tasks that B ran on B (i.e.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: The key of our concept is the following rule: [Separate ] PointsTo(x, 1, v) *-* Perm(x, 1, v)*Hist(x, 1, {v}, E) The [Separate ] rule splits the PointsTo predicate in two separate parts: i) Perm(x, 1, v) predicate, which keeps the access permission for the location x and its current local value v and ii) Hist(x, 1, V, H ) predicate, which stores some global information about how the value of x has been chang­ing in the past.
Sentence 2: the parameter V is a set of possible values that x initially had and H is a history of changes of the value of x.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: A register dependence from Ts to Tt in­volving (virtual) register r must be communicated at safe points,where Ts has the latest value of r. This property is necessary for correctness because communicat­ing r at an unsafe point would, in some control paths, overwrite r in Tt with a stale value.
Sentence 2: a dependence from a de.­nition of r not in Ts to a use of r in Tt would not be respected, thuschanging the program s semantics.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Two pieces of advice are strongly independent when they do not interfere with each other regardless of the contents of the advice bodies or the contents of the programs they are applied to.
Sentence 2: strong independence is determined exclusively by analysis of the pointcut designators of the two pieces of advice and con­sequently it is orthogonal to our analysis which (mostly) ignores the pointcuts and examines the advice bodies instead.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Thus, we propose an improved approach, thatexploits the in­trinsic structure of SystemC.
Sentence 2: each SystemC thread is translated into a separate sequential program and explored with lazy abstraction, i.e.by constructing an abstract reachabil­itytreeasin[8],[12].Theoverallveri.cationis orchestratedby the direct execution of the SystemC scheduler, with techniques similar to explicit-state model checking.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Furthermore, in all the following cases we know that: t0 = tg (G6) since tg is the ghost thread that does not take part in exe­cution.
Sentence 2: we cannot have: H, ., (e0,tg,s0) r (e0' ,tg,s 0' ), H ' , . '
Relationship: entailment
Domain: Software and its engineering
Sentence 1: In addition, if the branch of the loop is not scheduled in the last stage, there may be potential exit points in the prologue, each requiring an epilogue to finish the iterations that have been initiated up to this point.
Sentence 2: sC -BS -1 epilogues are required for early prologue exits, where BS is the stage where the exit branch is scheduled.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: UsingTheorem3, we canhence compare Pl(RT0(P))with Pl(RT1(P))in a fairer way.
Sentence 2: we use for RT0 the limit L for eachtarget(so at most (n + m)L test cases in total), whereas for RT1 we use l = E[WRT0(P)].
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Clearly, the transformed code in Figure 1b is far from optimal, especially for a high spatial-locality reference such as v1[i] with i=0 N. For high-locality references, it is trivial to compute the number of useful data present in the current cache line.
Sentence 2: we can easily compute the number of loop iterations for which the current cache line can provide data for such references.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Reimagining Leaderboards: Towards Gamifying Competency Models through Social Game Mechanics Katie Seaborn Peter Pennefather Deborah I. Fels University of Toronto University of Toronto Ryerson University 5 King s College Road 144 College Street 350 Victoria Street Toronto, ON, M5S 3G8 Toronto, ON, M5S 3M2 Toronto, ON, M5B 2K3 kseaborn@mie.utoronto.ca p.pennefather@utoronto.ca dfels@ryerson.ca ABSTRACT Competency models have been widely employed within education, training and development contexts.
Sentence 2: medical education programs have become a platform of exploration around innovations in competency-based as­sessment.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: All the 89 false negativesinLimeSurvey areduetotheanalysisinaccuracy of the PHP string analyzer used in our implementation.
Sentence 2: in LimeSurvey,thereareconstantstringsthat arecompared with the default values of input tags in the generated web pages that are fetched by $POST[ name of the input tag ].
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Observing Refactorings Our study evaluated refactorings associated with clones among versions of the JBoss Application Server, an open source implementation of J2EE, and ArgoUML, an open source tool to develop UML diagrams, both of which are written in Java.
Sentence 2: the refactorings were identified by observing changes from each pair of consecutive releases between version 2.2.0 to 4.2.3 (44 versions) for JBoss, and nine versions from 0.10.1 to 0.26 for ArgoUML.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: The following parameter values were kept constant across all the runs.
Sentence 2: the size of a log entry is 50B, size of a checkpoint is 2000B, bandwidth of the wired network is 2Mbps, ratio of bandwidth of wireless to wired network (r) is 0.1, time required to apply a log entry (Telog) is 0.0001s.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: While for the details of the OWL syntax we refer interested readers to [7], by exploiting the example provided in Sec­tion 3.1 about the car domain, we show a mapping between the SHOIN(D) and OWL DL syntax.
Sentence 2: in such example we used the SHOIN(D) assertion Maker T to de­.ne the concept Maker.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Thus far, we have implemented a small number of base evolution action modules.
Sentence 2: available for reuse are a module that stores each version as an entire baseline, a module that stores a first version as a baseline and any subsequent version as a change (creating a branch when needed), and a module that simply maintains one baseline that is continually replaced when a new ver­sion is stored (as used for directories in the CVS policy, for instance).
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Although Mycroft s rule is known to render ML type inference undecidable [11], this is not so for our system, as it conservatively extends the ML type system.
Sentence 2: since only well-typed ML programs are typable in our sys­tem, we can use Milner s rule to construct an ML type derivation tree in a .rst pass, and subsequently use Mycroft s rule and the generalized types inferred in the .rst pass to instantiate dependent types at (polymorphic) recursive call sites.
Relationship: entailment