sadat2307/MSciNLI huggingface dataset:
Domain: Software and its engineering
Sentence 1: INTRODUCTION One of the major current research trends in Software Engineer­ing is the focus on the development of new techniques to deal ef.­ciently with the design of systems that are able to evolve overtime and adapt to rapid changes of their requirements and of the execu­tion environment.
Sentence 2: the .eld of Autonomic Computing [8] has been created to study these types of systems with the ulti­mate aim to create systems that are able to self-adapt without any external intervention.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: fork (asteroidsTurn asteroids) r3 .
Sentence 2: fork (wormhole asteroids) render asteroids player join r1 join r2 join r3 checkWinner asteroids player we fork a revision for every concurrent opera­tion, and do the render task on the main revision (mainly be­cause UI operations are usually tied to the main OS thread).
Relationship: entailment
Domain: Software and its engineering
Sentence 1: The hybrid approach proposed here relies on such approximated tech­niques and adopts sampling as described in [5].
Sentence 2: given a CTMC / DTMC model of the system and a property to be veri.ed, a large number of simulation runs are executed and the corresponding results evaluated against the property to be veri.ed: the .nal result is provided as the average of all the obtained values.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: The best .t to all measurements is obtained by: Here, A ..i, j is the estimated phase offset calculated by the position estimate.
Sentence 2: equation 10 calculates the best position (.t) given the set of measurements and under­lying propagation and statistical models, rather than .rst tak­ing the minimum of a subset and substituting it in the total.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: With the help of the APL-Java interface, we can use this Settler API (and othea:s) to connect APL to a wide variety of HTTP serves.
Sentence 2: it makes it unnecessary to implement an HTTP setter in APL; and aU the benefits of a modern ~ server become available, including SSL (Secure Sockets) support (i.e.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Conservative Progressive 1000 2000 5000 10000 20000 1000 2000 5000 10000 20000 we argue that such design is not unique to the particular bots we studied, but commonly exists in MMORPG bots.
Sentence 2: the command timing scheme is generalizable as it is based on the fact that bots react to server packets with some form of regularity.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: In a form of partial eval­uation or staging, inspired by prior work on cpp symbolic execution [15,26,27], the partial preprocessor processes a pre-cpp C .le, evaluates all .le inclusion, and expands all macros, but keeps all variability.
Sentence 2: after partial prepro­cessing, only conditional-compilation directives (#if, #endif) remain in the C .le, while all #include, #de.ne, and #undef statements are resolved and all macros are expanded.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: For instance, a re­cent study of storage reliabilityin aproduction system[4] reports a surprisingly large prevalence of undetected disk errors(i.e.,instances when readingfrom thedisk returns a value that does not correspond to the latest value that was written).
Sentence 2: for some drive models, 4% of the drives exhibit this type of errors over the 17 months of this study.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: .2, then .2 is also a solution.
Sentence 2: for example, if p .q is a solution to ., then so is p. the set of all solutions to a positive query is a set of propositional formulas that is upward closed with respect to the implication ordering: if some propositional formula is a solution, so is every weaker formula.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: In a previous paper [20] we reported on our and our students' initial experiences as it impacted on the ease of use and usefulness of the Fuze Meeting webinar tool when it was employed for collaborative purposes.
Sentence 2: we investigated various themes around the student experience as it related to familiarity, technical/connection problems, scope/potential, collaborative value, presentation experience, as well as the facilitator s experiences in setting up and presenting the webinar.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: The controller set progress lemma states that if the con­troller program is realizable and has become fully invariant, then every time the controller processes a help molecule, the controller set becomes strictly smaller.
Sentence 2: every help molecule contains enough information (and the compiler is powerful enough to exploit it) for the E-CONTROLLER rule to generate useful new classi.er rules.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Though our focus has been on removing strong-atomicity bar­riers, the analysis information could also be used to remove STM operations within transactions.
Sentence 2: given weak atomicity, we could remove transactional open-for-read barriers [1] for the in transaction version if that points-to set contained no objects 5For the latter, the loads and storesare in transactions,but the context for the enclosing method is not in transaction.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Sev­eral critical issues had to be tackled in order to make this general idea a fully-.edged solution, including performance, compatibility, and so on.
Sentence 2: eGO compiler has been developed with the following features: (Laziness) De­scriptors are created only the .rst time they are required, preventing any interference with usual Java class loading dynamics, and avoiding the problem of in.nite polymorphic recursion [13]; (Completeness) The type-passing translation schema is applied not only to generic classes, but also generic methods, generic inner classes, interfaces, and arrays; (Ef­fectiveness) A number of bridging techniques are introduced to deal with e.ectiveness issues such as interoperability be­tween legacy and generic Java code and support to separate compilation; (E.ciency ) The need to obtain good perfor­mance results of the translated code pervasively a.ects all the aspects of the translation; and (Implementation modu­larity ) EGO compiler is implemented as a modular extension to the javac compiler of JDK5.0, namely, a further transla­tion step to the abstract syntax tree (AST) just before the type-erasure process.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: That is, an object type s is a subtype of an object type t iff (1) s has all the methods of t and (2) for each method m of t, the type of m in s is a subtype of the type of m in t. Method subtyping is de.ned as expected.
Sentence 2: for a -> b to be a subtype of c -> d, the type c must be a subtype of a and the type b must be a subtype of d. For non-object types, the subtype relation reduces to type identity.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Without loss of generality we consider distributed computation of the function N 11 G(x)= xi = 1T x .
Sentence 2: (8) NN i=1 this type of rule and its linearly weighted gen­eralizations can be used for computations that arise in a va­riety of problems involving signal estimation in noise, includ­ing problems of source detection classi.cation and tracking [13].
Relationship: entailment
Domain: Software and its engineering
Sentence 1: All these components are implemented by many processes running on a simulation platform which is distributed across multiple machines con- nected in a network specially built for testing purposes.
Sentence 2: the state space defined by this testing con- figuration is the "product" (i.e., the set of all possible con- current executions) of the two processes visible to VeriSoft 2, which interact with each other and with the system un-der test whose processes themselves are hidden to VeriSoft.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Our framework, Timna, automates the process of combin­ing mining analyses to .nd seeds in a program, with high precision.
Sentence 2: timna s unique contributions are: the ability to exploit the combination of mining results from multiple code analyses to make classi.cation de­cisions for seed identi.cation,  the application of machine learning to learn good AOP style from canonical examples,  the generation of human readable rules for classifying code as mining seeds, and  the discovery of several novel mining analyses during our initial use of Timna.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: The implementation of the software objects is maintained in the Logical layer of Level A in Fig.2; while its interface is maintained in the same layer for the (3) tuples, and in level C for the (2) tuples.
Sentence 2: fig.4 and Fig.6 show that the Device and DevicePhysicalInfo interfaces are characterized by getting and setting methods for accessing and/or manipulating respectively information regarding the (2) and (3) tuples, with reference to a given networked entity in the real physical world.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: The local minutiae structures de.ne a region around each minu­tia by considering, e.g., all minutiae closer than a given ra­dius (.xed-radius based techniques).
Sentence 2: minutiae Cylinder-Code (MCC) representation, recently proposed in [4], obtained remarkable performance with respect to state­of-the-art local minutiae descriptors [10, 6].
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Pattern Oscillate: Changing Strategies to Dig Deeper For the participants who followed the Oscillate pattern on Type 1-initial and 2-build goals, the story was similar to Repeat on Type 1-initial, except the oscillators tended to seek additional information from their search results.
Sentence 2: the oscillating participants would typically do a code search, explore the results a bit, decide they were on the wrong track, and return to searching.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Using an automatic strategy called Delta Debugging, we can systematically narrow these initial differences down to a small set of variables: The GCC failure occurs if and only if fld[0].rtx, the second child of the linknode, points to its parent a cycle in the abstract syntax tree.
Sentence 2: variable fld[0].rtxis a failure cause: if fld[0].rtx is altered such that it no longer induces a cycle, the failure no longer occurs.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Meanwhile, multimedia workloads with indirect I/O su.ers less degradation from CPU­hungry workloads than that with direct I/O, since their CPU re­quirement become lower by o.oading display operations to anIDD;VLC­HighRes withindirectI/O requires56%CPU, whereas that with direct I/O requires 62%.
Sentence 2: the VLC­HighRes with direct I/O su.ers from severe frame drops when competing with the down­loading workload.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: While ample prior work has investigated bandwidth and CPU allocation in shared settings, stor­age allocation has been studied less thoroughly.
Sentence 2: there is a delicate tradeoff between fairness and .exibility: the system shouldn t unnecessarily restrict the behavior of clients by imposing arbitrary and strict quotas, but it should also ensure that all clients have access to their fair share of service.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: However, a common problem when traceability is imple­mented in SPL projects is that it must be started from scratch from project to project, because most of the times there is no documentation and guidelines which explicitly formalizes the best practices and successful experience with traceability in the organization s projects.
Sentence 2: traceability knowledge is lost if the traceability practices are not actively captured, documented and applied.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Let VB.B VB * denote the .nd the squared-error minimizing translation, rotation, and eigen-decomposition of B.
Sentence 2: the closest rank-one approxima­ * scale of the points P into P. we seek a scale factor tion (in the Frobenius norm sense) to B is .nvnvn,where .n is the largest eigenvalue of B and vn is the associated eigenvector.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Each application server runs the following components: a Re­quest processor (RP), responsible for receiving the requests and starting the VSTM transactions; a VSTM executes the transactions by running a protocol described in the next paragraphs; a Cache manager (CM), responsible for main­taining a consistent cache of regularly used objects; a Per­sistent store (PS), responsible for persisting the updates on stable storage for later recovery; a Certi.cation manager (Cert), that certi.es the transactions ready to commit to see if there are con.icts; a Group communication service (GC), responsible for maintaining up-to-date information re­garding the membership of the group of application servers (including failure detection) and providing the required com­munication support for the coordination among the servers.
Sentence 2: the service provides both an Atomic broadcast service used by the VSTM to disseminate the write-sets of transactions that are ready to commit, and a non-ordered Reliable broadcast service used by an application server to notify the other application servers about commit/abort de­cisions of transactions.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: The evaluation of a program variable will be just a lookup in the environment, and the evaluation of a navigation expression is de.ned re­cursively.
Sentence 2: assignments to locals: Assigning an expression e to a local variable v is abstracted by the following rule: ¯ F(v := e, (Eu , Eo))= Eu ([v .eval(e, Eu)], Eo[v .eval(e, Eo)]) the lower and upper bounds of e become the lower and upper bounds of x.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: We adopt from Buschmann [3] the following de.nition: A pattern for software architecture describes a particular recurring design problem that arises in speci.c design contexts, and presents a well-proven generic scheme for its solution.
Sentence 2: pat­terns have been considered as a suited solution to enhance the construction of software with support of functional and non functional properties.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: The COCOMO model can be written as: Y Effort = a * Sizeb * Cost Driveri (1) i This model suggests a linear relationship between the loga­rithmic transform of Effort and the logarithmic transform of Size and the cost drivers.
Sentence 2: x ln(Effort) = ln(a)+ b * ln(Size) + ln(Cost Driveri).
Relationship: entailment
Domain: Software and its engineering
Sentence 1: In this paper we present a page replacement algorithm called TNRP (Time of Next Reference Predictor) that exploits this information to predict the time each page will be referenced again and selects the victim page by considering its predicted time of next reference.
Sentence 2: it is assumed that each page is accessed at a regular interval and that the time that a page will be re-referenced can be predicted by adding its interval to its time of last reference.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: For example, Table 2 shows the table generated from a uniform sampling of 0.01% over the entire iteration space of the matrix multiply loop nest of Figure 2 with N = 256.
Sentence 2: we generate the table by investigating 1678 ran-domly chosen iteration points from the total of 16,777,216 points in the iteration space.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: The degree to which Conver­gence Debugging .nds related failures in the vicinity of a given failure is used as a criterion for evaluating the e.ec­tiveness of this method in locating faults.
Sentence 2: the goal of the experimentation presented in this paper was to determine if there is a correlation between control dispersion and related failures in tight neighborhoods around failed test cases.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Consider for example tuple ids; we de­.ne the set of missing tuples and the set of extra tuples as follows (here - is the set-difference operator): missingTuples(Ig,Ie)= tids(Ie) - tids(Ig) extraTuples(Ig,Ie)= tids(Ig) - tids(Ie) Similarly for missing joins and extra joins: missingJoins(Ig,Ie)= jids(Ie) - jids(Ig) extraJoins(Ig,Ie)= jids(Ig) - jids(Ie) When reported to users, these sets represent a precious feedback, since they clearly point out what are the tuples and surrogates that cause mismatches between the expected solution and the one gen­erated by a system.
Sentence 2: our similarity measure provides two different comparison indicators: the .rst one is a number mea­suring the overall similarity of the two instances; the second one is a detailed list of edits (tuple additions, tuple deletions, surrogate replacements) that should be applied to the instances to make them equal.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Given the P2P nature of our system, as well as the fact that it is intended for large, networked, distributed compu­tational platforms, we are faced with a problem that often appears in such situations: That of the trustworthiness of the agents.
Sentence 2: as the origin and actual (as op­posed to advertised) behaviour of the agents is outside the control of the end user, it is not possible to guarantee that a defective or malicious agent will not be present in the pro­cess.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: In this paper, we propose a search-based approach to au­tomatic inference of polynomial MRs for a program under test.
Sentence 2: we use a set of parameters to represent a particular class of MRs, which we refer to as polynomial MRs, and turn the problem of inferring MRs into a problem of searching for suitable values of the parameters.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: We have implemented constant folding, global con­stant propagation, local value propagation, eta reduction, simple hoisting of arithmetic operations, simple contractions (e.g., inlining of called-once functions), useless variable elimination, dead code elimination, and trimming of memory reads.
Sentence 2: the combination of .attened records, dead code elimination, and useless variable elimination makes programming with records and tuples (especially pack and unpack) inexpensive.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: During the computation of a dynamic slice, the dyDG is traversed backwards to identify the statements that belong to the slice.
Sentence 2: the set of dependence edges Es going backwards from a statement s can be partitioned into subsets of edges Eus corre­sponding to each use us and subset of edges Ecs corresponding to SS all control ancestors of s. Es = Eus Ecs .
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Since the attacking packets may come from a large number of hosts (called Zombie hosts) and may traverse many different Internet paths, an individual ISP (Internet service provider) may not see a large num­ber of packets destined to any victim.
Sentence 2: such global icebergs (IP addresses that are targets of the DDoS attacks) may not emerge as local icebergs anywhere, and therefore may not be de­tectable without correlating data from multiple monitoring points.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: the normal application of network coordinate systems.
Sentence 2: in weighted networks, after using our algorithms to preprocess the network and create distance sketches we can compute the approximate distance between any two nodes in at most O(D) times the size of the sketch rounds (where D, the hop-diameter, is the maximum over all pairs of nodes of the minimum number of hops between the nodes) by simply exchanging the sketches of the two nodes.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Furthermore, we have identi.ed both desirable and undesirable behavior for dynamic weaving in the presence of class loaders and characterized it analogously to virtual method calls.The de­sired design has been characterized by two simple conditions based on the static and dynamic type of the callee at join points.
Sentence 2: these conditions abstract away from implementation issues like the distinction between call and execution join points, which would introduce fur­ther subtleties [5] to the already subtle matter of dynamic class loading.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: {1, 0.5}  No o.OM |OM |  2.2 Object-Points Analysis For our measurement and data analysis, the structural data gathered from the programs is processed using an Object-Points (OP) anal­ysis.
Sentence 2: we apply the OP analysis by Sneed [17], not be confused with object-oriented variants of Function Points (see e.g.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: 2.2 PriorWork Our approach to pro.ler development relies on MAJOR[21,22], an aspect weaverthat enhancesAspectJ with support for comprehensive weaving.
Sentence 2: mAJOR is able to weave aspects into all classes loaded in the JVM, including dynamically loaded or generated classes, as well as the standard Java class library.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: There is a relationship between observational equivalence of terms and the function Specs, because |= V1 Sat gives rise to a notion of observability from the speci.cation point of view.
Sentence 2: two terms t and t ' are observationally equivalent in this sense iff t ~ t ' ,where def t ~ t ' = Specs({t}) = Specs({t ' }) It is trivial to check that ~ is an equivalence relation.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: To keep our formalization of exotypes simple, we focus on the typechecking and evaluation of Terra code with exotype property queries.
Sentence 2: we omit the machinery for quotes, escapes, and specialization used to generate Terra code, which can be found in previous work [7], and assume that an environment P that holds a mapping between exotypes and their properties is already constructed.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: To document aliasing at the function level, the exit alias­ing on packet set conn and entry aliasing on packet send2 are added to these functions summaries.
Sentence 2: the points-to edge (out.last,out.first)with guard true is added to .out of packet set conn and to .in of packet send2.This aliasing must also be documented for the many other func­tions which directly or indirectly access out.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: 3.3 Mutation Operators To generate mutants of the subject programs, we used a mutant generation program first used by Andrews and Zhang [1] to generate mutants for code written in C. To generate mutants from a source file, each line of code was considered in sequence and each of four classes of "mutation operators" was applied (whenever possible).
Sentence 2: every valid application of a mutation operator to a line of code resulted in another mutant being generated.
Relationship: entailment