sadat2307/MSciNLI huggingface dataset:
Domain: Software and its engineering
Sentence 1: 3.1 Research Questions 1A framework for collection and analysis of software develop­ment process data https://code.google.com/p/hackystat The central question of this study is the following: What is the relationship between the conformance to TDD and its observed e.ects?
Sentence 2: we want to investigate the impact on external software quality, the developers productivity and the tests suite, in terms of number of tests that were produced, as well as their thoroughness.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: (ii) Rule (E4) of Figure 7 is substituted to Rule (E4) where =k is a new relation which identi.es mathematically equivalent abstract expressions.
Sentence 2: the relation =k is the quotient relation = / ~k where ~k is de.ned by:  I,k e ~k e I .. 'e,k = 'e.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Rcycle The rank function synthesis engine can prove this relation well­founded, and returns the following ranking relation computed dur­ing the proof which over-approximates .1: T15(s,t) t(x) <t(y) .
Sentence 2: t(x) = s(x)+1 we know that T15 is well-founded and that .1 .
Relationship: entailment
Domain: Software and its engineering
Sentence 1: We test different versions of GCC from 4.5.3 to 4.7.2 in order to evaluate the effect of NEON optimizations in our OpenCL and notice that there is a signi.cant improvement in the later version of GCC in terms of NEON code gener­ation, which results in comparable performance level as our OpenCL.
Sentence 2: the change in default vector size from 64 to 128 bit (in 4.7), the addition of support for wider in- AESEncr yptDecr ypt BitonicSor t  BlackScholes Bo xFilter (SA T)  CUTCP  HIST O SGEMM Bo xFilter (Separ ab le) 10.4 SPMV F astW alshT r ansf or m Flo ydW arshall Matr ixT r anspose STENCIL BT  EP FT  IS LU MG  Recursiv eGaussian Reduction 27.4 ScanLarge Arr a ys 64.7 SimpleCon v olution  SobelFilter URNG SP  1.412 Geomean  Geomean Bo xFilter(SA T) Recursiv eGaussian SimpleImage    BlackScholes Bo xFilter (SA T) ImageOv er lap Matr ixMulImage QuasiRandomSequence SimpleImage SobelFilter URNG Geomean OCL version ofSGEMMin Parboilbenchmarksbyhandand measure the performanceimprovementon Device A.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: 5.3 Solving Antipatterns Table 5 lists some of the solved antipatterns for the BRS software model.
Sentence 2: two columns are de.ned: the .rst one indicates the antipattern type according to the Smith and Williams classi.cation; the second one instanti­ates the solution by reasoning on the PCM model elements.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: We have collected datasets that con­tain the information on 120,550 torrents, 3,163,685 .les, and 14,822,261 users, which are comprehensively analyzed.
Sentence 2: we focus on: (1) how prevalent content bundling is, (2) how and what .les are bundled into torrents, (3) what motivates publishers to bundle .les, and (4) how users access the bundled .les.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: od retur n(vectorizable paths)  end In more detail the three steps of Algorithm 1 are: 1) is loop form vectorizable: In step 1, we determine whether the input loop is in a form suitable for vec­torization.
Sentence 2: we require that the loop must be regular (i.e., can be easily translated to a Fortran Do-style loop) and countable [16], where the number of iterations of the loop is known before entering the loop body, and all loop iterations can be counted using an integer index variable.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: To miti­gate this concern, this paper shows how to use automatically generated tree models [2] to discover the best con.guration of genetic algorithm-based approaches to reordering a test suite.
Sentence 2: we use the binary recursive partitioning algorithm [2, 5] to construct tree models that reveal how the explanatory variables (e.g., the selection operator) im­pact the CE value of the resulting prioritization.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Moreover, there are gateways that take charge of collecting data from the sensor network, and vehicles that move around the city and contact the gate­ways, searching for an available parking lot.
Sentence 2: we have de.ned that vehicle requests to #events % mobility % communication A 2.7 × 106 98.5 1.4 B 5.6 × 106 98.5 1.3 C 1.4 × 107 98.5 1.3 D 2.7 × 107 98.4 1.4 E 6.3 × 107 98.3 1.5 F 1.2 × 108 98.2 1.6 gateways are scheduled by an Homogeneous Poisson Process with interarrival time being an exponentially distributed random variable whose mean interarrival time is equal to 5 minutes.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Artificial classes contain only objects and they inherit all other class characteristics.
Sentence 2: an artificial class ac contains objects that qualify to be in Linsta~c~(c), where c is the corresponding class in the hierarchy, a objects from L~t ..... (c) migrate ir~to Linst ..... (ac), and hence are still considered in Wi,~,t ..... (c).
Relationship: entailment
Domain: Software and its engineering
Sentence 1: However, we consider that this approach is not satisfactory due to the fact that the diagrams transformations are rather complex but independent of the semantic transformations and, therefore, they can be reused from one model transformation to another.
Sentence 2: it is possible to de.ne rules to create and update diagrams such as UML class diagrams that are independent of the actual model transformations, such as the pull up and pull down method refactorings on UML class models.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Given a quorum system Q over U and an access strategy p, we can de.ne the load of an element u .U to be load(u) = .Q.Q:u.Q p(Q).
Sentence 2: (this is the probability that the element u is accessed when using the access strategy p.) Given a placement f : U .V , we can extend this notion of load to any node v by de.ning load f (v) = .u.U: f (u)=v load(u).
Relationship: entailment
Domain: Software and its engineering
Sentence 1: However, the steganographer is not free to choose which bit to .ip since it is determined by the wet paper and Hamming coding result.
Sentence 2: it is possible for Pt to be changed into any PM in the set Kt = {P||w(Pt) - w(P)| =1},where w(P) is the Hamming weight of P. Since the PM modi.cation is uncontrollable, the embed­ding impact of Pi should be measured by the maximum cost of replacing it with any PM in Ki.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: According to the Table, Microsoft Word and PowerPoint 2007 suf­fer from security vulnerabilities caused by third-party components, which lead to remote code execution attacks.
Sentence 2: load­ing the Google Desktop Office Addin and the HP printer driver fails to resolve particular DLLs when the programs open documents, and the current directory at that point is the same direc­tory as the opened documents.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: 6.1 The evaluator corresponding to the CAM The evaluation model embodied in the CAM is an interpreter threading a stack with its top element cached in a register, represent­ing environments as expressible values (namely nested pairs linked as lists), with a caller-save strategy (witness the duplication of the register on the stack in the meaning of applications below), and with a left-to-right evaluation of sub-terms.
Sentence 2: the meaning of a term is a partial endofunction over the register and the stack.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Linking a fragment of polymorphic bytecode B,equipped with polymorphic type constraints G,ina givenclass type environment ., amounts to .nding a suitable substitution s mapping the type variables into class names.
Sentence 2: the substi­tution s instantiates some polymorphic type constraints in G into monomorphic type constraints that hold in .,and in­stantiates variables in B correspondingly; these constraints can be eliminated, leaving only the constraints in G ' .when all constraints are eliminated, we obtain a fragment of standard bytecode (like the one produced by global compilation).
Relationship: entailment
Domain: Software and its engineering
Sentence 1: The Java source code of the CUT is analyzed and trans­formed by the Branch instrumentor module, which produces an instrumented version of the original class and determines information about method signatures, call and control de­pendences, used by other modules.
Sentence 2: the Chro­mosome former is able to generate chromosomes based on the method signatures, and implements the mutation oper­ators to transform them.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: To achieve high structural cover­age of the MUT (and the private methods calledbyit) needs various inputs.
Sentence 2: to cover the code under the true branchof dbConfig.getAllowCreate in the setupDatabase method and create a new database, the .eld allowCreate of the DatabaseConfig argument of the MUT should have the true value, which by default has the false value and can be mutated by invoking DatabaseConfig.setAllowCreate.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Moreover, it also disallows (Q,as0 ,Qd)a s0 when t is a variable a: variables with non trivial bounds must be treated abstractly and cannot be silently ex­panded.
Sentence 2: (Q)V(as0 ,ad s0 )a -adV(as0 ) a -a does not hold.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: This can be captured in terms of a type function Delta, such that Delta s a b is the type of one-hole contexts for sab.
Sentence 2: a value of type Delta s a b is equivalent to one of type sab that is missing one value of type b; so the type functor should be equipped with the corresponding operation to close a Delta s a b around the missing b to make an sab.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: If a hypothesis of a rule contains wildcards, we introduce an auxiliary relation to hold only the non-wildcard argu­ments of the hypothesis.
Sentence 2: for every hypothesis of a rule that contains wildcards, we (i) replace the hypothesis, say P (X1, ..., Xa), with a new hypothesis, Q(X1, ..., Xa/ ), where Q is a fresh relation, and Xk s are the non-wildcard arguments of P , and (ii) add a new rule P (X1, ..., Xa) .
Relationship: entailment
Domain: Software and its engineering
Sentence 1: For generality, we have studied type projections in the context of a canonical language de.ned around a value no­tation, a type language, and a relationship of typing be­tween the two.
Sentence 2: we have chosen a selection of structural types commonly found in existing procedural languages: built from a set of atomic types, they include in­clude record, collection,and untagged union types, possibly recursively de.ned.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: The advantage of this simplistic model is that it makes it easier to understand the significance of simulation results.
Sentence 2: we use a Bernoulli distribu-tion to model resource availability: for each binding request, a resource manager produces two outcomes, failure with probability p or success with probability 1-p. For this model, we assume that a component is served by a resource man-ager, the only owner of resources, and that the behaviors of all resource managers are independent of each other.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Among the different classes of mashup available on the Web, we focused on News Mashups [9] also known as Syndication Feed Mashups since they use syndication technologies like RSS and Atom to aggregate news related to various topics and create personalized feed views.
Sentence 2: we envisioned the opportunity to aggregate feeds about personal information originating from social networking sites in order to foster group awareness within distributed teams.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Given a body of papers, a network can be constructed where the vertices (nodes) are the authors, and the edges (undirected links), represent co­authorship relations between the authors at either end of the edge.
Sentence 2: if there exists at least one pa­per jointly written by two authors, there will be an edge in the network between the corresponding vertices repre­senting the authors.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: However, as we explored the range of ways in which people used the tool, and the set of extensions that they proposed, we found that it might provide value too as an analytic tool.
Sentence 2: as users asked for mechanisms that would help them explore the structure of the system with finer granularity, we noted that these structures might also provide the basis for an archeological exploration of a software repository.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Other parts of the superclass may rely on the abstract decla­ration in their implementation, which enables us to express a com­putation which cannot be performed before the missing de.nition has been provided just like the body of a lambda expression can­not be (fully) evaluated before the formal argument, a variable, has been replaced by the actual argument, a closed expression.
Sentence 2: virtual features of a class are in this sense arguments.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: ) .3= tg} (6) where A ' = Ai[xi/this] Ai = Invariant(.i .class) (7) i On the other hand, from (G1) and the de.nition of Ver(Prog), for each one of the Ai we have: SF(Ai ) (8) From (8), de.nitions of A ' and lemma 8 we have: i SF(A ' ) (9) i From (9) and property P8 we have: SF(*(A ' )) (10) i Furthermore, we know that: t0 = tg (11) Since tg is the ghost thread that does not take part in execution.
Sentence 2: we cannot have: ' H, ., (e0,tg,s0)(e ,tg ,s ' )|(en,tn ,sn), H ' , . '
Relationship: entailment
Domain: Software and its engineering
Sentence 1: For simplicity, we assume that neither H nor any preconditions of f in T ' (f) have existential quanti.cations.
Sentence 2: the abstract run of y:=f(e) searches for a collec­tion of specs of f stored in T ' (f) that can be used to transform the current symbolic heap H. for each spec {P }f(x){Q} in T ' (f), it tries to match the precondition P with the assertion H at the call site.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: A PROOF OF CONCEPT EXPERIMENT: ANALYSIS OF A COMMERCIAL UMTS CONNECTION In these experiments we show how it is possible to perform a simple analysis of a UMTS link using Plan­etLab nodes and the tools we developed.
Sentence 2: we equipped one of our PlanetLab nodes with a com­mercial UMTS connection provided by one of the major operator in Italy.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: From this table, for each scienti.c function, the number of 1-MRs is from 0 to 353, whereas the number of 2-MRs is from 0 to 401.
Sentence 2: our approach infers an unignorable number of 1-MRs and 2-MRs for scienti.c functions.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Cyberorgs may pre-pay to buy re­sources which will exist in the future.1 Cyberorg b may use the resources it owns only if the resources exist at a time when the cy­berorg is being hosted by a.
Sentence 2: after signing a contract, a cyberorg must migrate to the prospective host cyberorg in order to avail itself of newly acquired resources.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Assuming that trusted() returns false, Q has a transition sequence with labels t1:print site 1 , t1:(), t2:print sandboxed: , t2:(), t2:print site 33 , t2:() It is worth emphasising that without delayed instantiation, rebind­ing in these examples would not be possible.
Sentence 2: in both cases the construct-time (let) rule would substitute out here0 in t1 before sending the lambda-term, thus preventing a rebinding of here at the remote site.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: An important conclusion from these sensitivity experi­ments is that our approach performs better with larger num­ber of cores, larger number of memory controllers, increased row-bu.er sizes and reduced last level cache space per core (not the cumulative LLC size), all of which are current trends in computer architecture.
Sentence 2: we can expect our optimizations to continue to be e.ective in the long run.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Finally, we want to study the impact of a par­ticular kind of build system ownership on the kind of build system changes performed.
Sentence 2: we want to know for example if Corrective changes happen frequently in collec­tively owned systems (which might be risky since there is less quality control), or if they only enter into the version control system via a dedicated owner.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: In this context we can find a classic problem of information security related to the integrity of the communication channel, namely how to ensure that the Stego Video that was sent by the source user is really the same Stego Video received by the user destination?
Sentence 2: we intend to prove that the video/document was not changed during its transmission by the communication channel or in the server.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: In the multi-threading context, our shadow variables for local vari­ables and function parameters are still safe because they are local to each individual thread, while the soundness of shadow .elds de­pends on whether race condition vulnerability is present in orig­inal bytecode programs.
Sentence 2: if the accesses to static or instance .elds are properly guarded to avoid race condition in the original app, the corresponding operations on shadow .elds are also guarded because they are placed in the same code block.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Any model would produce a sound type system and allow us to 5By appropriately we mean that it must comply with the intuitive be­haviour that we had in mind when we introduced the extensional interpre­tation.
Sentence 2: it must be such that f v : t ..Hf v :¬ t. 6For instance, let us consider the recursive type t =(0 .
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Some important built-in axioms are given below, where denotes don t care : .e(A, B)= .e(evale(A, 0),B) evale(.e(A, ), 0) = evale(A, 0) evale(evale(A, B),C)= evale(A, evale(B, C)) passe(true)=0 passe(.e(true, )) = 0 passe(.e(false,A)) = passe(A)+1 One of the bene.ts of having a well-de.ned semantics for primi­tive PEG functions is that we can reason formally about these func­tions.
Sentence 2: using our semantics, we have proved all the axioms presented in this paper.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: The effect of this choice on the algorithm s results is that its abstract types always corre­spond to unions of whole value interaction sets, rather than parts of interaction sets.
Sentence 2: if a variable x had a value vx at # Global union-.nd structure for value interaction sets UnionFind value uf # Per-site union-.nd structure grouping value interaction set # leaders for sets of values whose unions form abstract types UnionFind type uf # Per-site array picking out a set in type uf corresponding to all the # previously-observed values of a variable Tag[] var tags  # Update the abstract types for this site, based on an execution when # the variables had values whose interaction sets are given by new tags method site.update types(Tag[] new tags): 1. for each variable v: 2.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: We have imple­mented and evaluated a simple strawman approach, which is to save all device state on failure using the existing support for putting the system in a sleep (S3) power state.
Sentence 2: we sim­ply use the system s ACPI suspend/resume functionality to save and restore system and device context to memory, while relying on the NVDIMM support to retain the in-memory saved state.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: SYSTEM MODEL Although we seek to develop a general framework for construct­ing a range of cooperative services, our approach is guided by a speci.c problem in a speci.c set of environments.
Sentence 2: we are building a cooperative backup system for three user communi­ties: 30 co-workers who cooperatively back up their personal home machines, 500 students in a dormitory who cooperatively back up their personal machines, and 50 nonpro.t organizations that receive free or low-cost refurbished PCs [32].
Relationship: entailment
Domain: Software and its engineering
Sentence 1: These modules (system wrapper and state-space ex­plorer) are unmodi.ed when plugged into DEMETER.
Sentence 2: dEMETER is able to leverage eMC s state-space explorer because it adds a partial-replay local system layer that gives the state-space explorer an illusion of a stand-alone complete system, similar to the original application.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Using FayLINQ, this query will also be executed in an ef.cient, optimized fashion.
Sentence 2: counts will be aggregated, per CPU, in each of the op­erating system kernels of the cluster; per-machine counts will then be aggregated locally, persisted to disk redundantly, to multiple machines for fault-tolerance and .nally aggregated in a tree-like fashion for a .nal query result.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: The structure of f *requires m to be a monad, and f to be a m functor.
Sentence 2: we use this fact so often that we will use the following convenient notation for the required type constraint synonym: type f f*= (Functor f ,Functor m,Monad m) m this constraint expresses that f*is a well-formed m free monad transformer.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: A variety of scheduling disciplines have been implemented, ranging from simple, traditional (e.g., .xed priority, EDF), to Time-Utility Function/Utility-Accrual (TUF/UA) poli­cies.
Sentence 2: we demonstrate a combined TUF/UA scheduling and thread integrity mechanism for providing bounded-time, end-to-end thread failure detection and re­covery.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: A careful inspection of these two CSRS s and of their in­teraction shows that the duplicating R-rule is not a problem any more regarding non-termination, because the .rst two occurrences of x in the rhs of the R1-rule become blocked after applying the rule.
Sentence 2: any further extrac­tion of subterms at these two positions, that is crucial for Toyama s counterexample to work, is prohibited by µ(f)= {3}.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: «interface» Client_management + Add_new_client(string, int, string, string, string) : string + Update_client(int, string, int, string, string, string) : void «WriteOp» «RW_Op» «interface» Financial_management «WriteOp» + Record_payment(int, date, date) : string «ReadOp» + Payments_due() : void + Record_payment(string, int, string, string, string, date, date) : string When modelling complex applications it may happen that some use cases represent several transactions.
Sentence 2: use cases represent functionality at a higher level than the one required for FPA counting.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: So, the capacity of the source is set to Cs = 3 and a client s capacity to Cc = 4.
Sentence 2: the 1http://www.omnetpp.org/ 2http://www.omnetpp.org/doc/INET/neddoc/index.html Figure 3: Resulting join rate in the simulation.
Relationship: entailment