sadat2307/MSciNLI huggingface dataset:
Domain: Software and its engineering
Sentence 1: Similarly, a MCW developer switched from team A to team C because he knew that according to the MCW software architecture, his team (A) depended on a component implemented by team B, and that B s component was dependent on a component implemented by team C. This developer followed the software architecture to find out to which team he should switch.
Sentence 2: software components with a higher degree of dependencies had to be handled more carefully because of their larger potential for impacting other components in the architecture.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: By forcing the underlying invocation graph to ignore the class constructor for sun.io.CharacterEncoding as well as all methods in classes Object, String, StringBuffer, and NullPointerException in package java.lang, and classes TimeZone and SimpleTimeZone in package java.util, we improved execution time significantly without affecting the resulting Permission sets identified.
Sentence 2: this optimization is a consequence of the fact that the analysis could be performed incrementally.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Pop, push, and copy methods are then defined, and placed in slots with corresponding selectors, with slot guards that indicate that they pertain to stackParent, which we say is in the role of rcvr, or along the dimension rcvr.
Sentence 2: messages sent with a context that includes the coordinate stackParent in the rcvr dimension, or any coordinate de­scended from stackParent, as well as an appropriate selector and argument list, will match these methods (regardless of any additional dimension-coordinate pairs in the context).
Relationship: entailment
Domain: Software and its engineering
Sentence 1: However, to us, the real problem was that this people, having an object-oriented solution as a target, could not envisage a design solution without objects flying all around the computer and following always the same patterns of behavior, even when the problem would require an alternative solution because of a different balance of quality attributes was needed.
Sentence 2: they were not able to apply abstract software architecture concepts, and preferred instead thinking following a specific technology.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: From the above analysis based on independent Bernoulli random variables, we see that PM PM t=1 t=1 VarG[F0(S)] pt(1 - pt) pt 1 = PM = PM = .
Sentence 2: e2 [F0(S)] ( pt)2 ( pt)2 EG[F0(S)] G t=1 t=1 the number of grounded-stream samples (and esti­mators) needed to guarantee small relative errors is inversely pro­portional to EG[F0(S)] (the quantity that we want to estimate).
Relationship: entailment
Domain: Software and its engineering
Sentence 1: This allows to generate a chain of specu­latively committed transactions that are serialized in an or­der compliant with the sequence of optimistic deliveries.
Sentence 2: during the time window that starts with the op­timistic delivery of a transaction T and ending with its .nal delivery, SCert strives to serialize any concurrently execut­ing T 1,...,T n according to their optimistic delivery order, achieving an overlap between communication and process­ing that is not possible with a conventional (non-speculative) certi.cation scheme.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Second, history can help us even when only one user initi­ated action is su.cient to trigger a bug.
Sentence 2: a user initiated action may actually result not only in one event (e.g., new sibling in FreeMind) but an event burst (e.g., new sibling quickly followed by a focus gained event for the edit .eld in the new sibling node).
Relationship: entailment
Domain: Software and its engineering
Sentence 1: (list a))) We must instead choose one of: (forall ( a) (list a)) ; polymorphic (?mutable?
Sentence 2: (list a)) ; monomorphic in this system, there is no principal type that we can infer for p. Given this, we must .x these maybe types to either mutable or immutable at a let-boundary.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: The results of such analysis are the UML diagrams describing enti­ties and relationship involved in the interaction, and the tempo­ral sequence of the interaction messages between the system and the involved users.
Sentence 2: the Class Diagram has been produced deriving classes and relationships from the logical data schema (Figure 5) and defining classes that represent the envi­ronment (e.g., network and devices).
Relationship: entailment
Domain: Software and its engineering
Sentence 1: We want to keep the sets small throughout the al­gorithm execution, certainly, but there is no harm in having a few non-minimal elements.
Sentence 2: we need to show how our algorithm can be implemented on sets of representative types, while giving the same answer (up to the operation of picking the minimal elements of a set), and without necessarily using minimal sets at each step.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: A constant-time function that partitions a set of objects with the same static type into equivalence classes based on the inheritance path of the static type within the dy­namic type.
Sentence 2: our technique for ef.cient type switching:  Is open by construction (§3.2), non-intrusive, and avoids the control inversion, as typical for visitors.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: $10.00 Employing a recently discovered simple technique for repre­senting multisets, predicates and projections using symbolic repre­sentations of collections, our implementation avoids the quadratic run-time penalty of multiplying out cross-products, which often makes using the otherwise attractive use of list comprehensions for SQL-like querying unviable.
Sentence 2: (equi)joins can be de­.ned na¨ively by composition of selection and cross-product, yet get executed by invoking an ef.cient join algorithm.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: While this inverse proportionality relationship holds for MarkSweep and SemiSpace, we .nd that, on average, GenMS runs in time inversely propor­tional to the square of the heap size.
Sentence 2: the function execution time factor = a/(b - heap size factor2)+c characterizes the trend for GenMS, where the execution time factor is perfor­mance dilation with respect to Lea, and heap size factor is the multiple of the minimum required heap size.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: In the current setting with both hidden information and hidden action, F P SS ' achieves a Nash equilibrium in the absence of per-hop monitoring, and a dominant strategy equilibrium in the presence of per-hop monitoring, consistent with the results in section 3 where there is hidden action only.
Sentence 2: with per-hop monitoring, B G the principal declares the payments si and si to each node upon failure or success of delivery to the next node.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: The di.er­ence between versions shows the developers modi.cation on the previous version, and thus we generated faults only in such di.erence so as to simulate most developers faults in software evolution.
Sentence 2: for each of the 11 func­tions of Apache 3.2, we applied MuClipse [62] to generate a number of mutants whose mutation operators10 occur only on the di.erent statements between Apache 2.2 and Apache 3.2.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: In general, there is a one-to-one mapping from classes to C API types but in some cases, such as image types, we choose to break this model and use inheritance.
Sentence 2: we felt that OpenCL C s choice to represent image and buffer objects as a single cl_mem type was a mistake and did not .t with our original goal of type­safety when possible.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: 3.8 WWW Link Graph The second semester of the course, especially the Java thread semantics and the foundations of concurrency (Section 2.5), contains much technical material and concepts that students are not familiar with.
Sentence 2: the fact that the sched­uler decides on the order of the execution of individual JVM instructions is in stark contrast with the deterministic execu­tion model taught in introductory courses.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: {cameron, candebat, david.gray}@computing.dcu.ie  ABSTRACT In this paper we describe an architecture that supports the secure operation of Location Based Services (LBSs) over the Internet.
Sentence 2: we describe a three-party protocol that is used to mutually identify and authenticate users, LBSs, and a trusted middleware infrastructure that is re­sponsible for managing the users identity and location in­formation.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: This paper proposes the use of a Vector Auto Regression (VAR) model, a generalization of univariate Auto Regres­ sion (AR) model, to capture the evolution and the interde­ pendencies between multiple time series.
Sentence 2: we use the bivariate Granger causality test [4] to identify if the changes of a software artifact are useful to forecasting the changes of another software artifact.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Cases in which a feature does not use a plau­sible capability are not necessarily errors, but indicate that a programmer may have found a different way to implement the system than envisioned in the requirements.
Sentence 2: a programmer might choose to virtualize the implementation (e.g., consuming a capability for the .le system but actually using an in-memory store instead of the persistent store).
Relationship: entailment
Domain: Software and its engineering
Sentence 1: This separation allowed us to implement sev­eral previously proposed approaches as policies that plug into the framework.
Sentence 2: we reimplemented the following strate­gies: (1) a randomized version of preemption bounding [19], (2) AtomFuzzer [22], (3) simple random sleeps, and (4) probabilistic concurrency testing (PCT) [5].
Relationship: entailment
Domain: Software and its engineering
Sentence 1: A plugin de.nes (a) base types and primitive operations, and (b) a change representation for each base type, and an incremental version for each primitive.
Sentence 2: the plugin speci.es the primitives and their respective derivatives, and ILC can glue together these simple derivatives in such a way that derivatives for arbitrary simply-typed .-calculus expressions using these primitives can be computed.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Since all parts of the system are modeled as separate pro­cesses running in parallel, they are activated in all macro steps, although some of them might not contribute to the overall result.
Sentence 2: if no arithmetic operation is executed, the ALU is nevertheless activated and some out­put is produced (depending on the implicitly speci.ed op­eration and arguments), and accesses to the register .le are made even if they are not needed for the instruction.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: The main drawback is that there is often a dis­connect between the desires of application users (low turn-around time, fairness) and the schedules computed by batch schedulers [42, 28].
Sentence 2: it is often dif.cult for a user to estimate when a job may complete, sometimes motivating creative strategies to mit­igate this uncertainty [35, 10].
Relationship: entailment
Domain: Software and its engineering
Sentence 1: In the open environment available information about a non-local software entity (and its owner) is often incomplete and inaccurate, which make it very difficult, if possible, to verify and validate the software component and system objectively and accurately in the same way as used before.
Sentence 2: the autonomy and cost-of-use of software entities in open environment makes white-box analysis and black-box testing on them generally infeasible.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Proof of Correctness for the Checker After building and testing the checker, we wanted to prove its correctness with respect to the sandbox policy.
Sentence 2: we wanted a proof that if the checker returns TRUE for a given input binary, and if that binary is loaded and executed in an appropriate environment (in particular, where the code and data segments are disjoint), then executing the binary would ensure that only the prescribed data segments are read and written, and control only transfers within the prescribed code segment.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: P Syntax and Semantics Figure 3 shows the syntax of the core of P. Some of the features presented in the examples of Section 2 can be compiled using a pre­processor into this core language.
Sentence 2: state descriptions in the core language are triples of the from (n, d, s1, s2), where n is a state name, d is a set of deferred events, s1 is an entry statement, and s2 is an exit statement.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Figure 4 shows the median total move­ment of all hosts along time.
Sentence 2: at any timepoint t > 0 we computed the total movement of a host i that us incurred during updating its coordinate for the latency 0.6 0.4 Vivaldi MP-Vivaldi, 0.2 W = 4, a = 0.5 (reaches 10504) 3 4 measurements lt j. i,j , i= Figure 4 is created after taking the 0 1 2 median total movement of the hosts at a speci.c timepoint 95-th Percentile relative error per host (b) CA-Vivaldi, .
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Conclusion In this paper, we revealed that the data prefetching prob­lem is closely mirrored in the business discipline of supply chain management (SCM).
Sentence 2: the inventory the­ory models can be used to draw insights into the prefetch­ing resource allocation problem when concurrent application request streams possess different accessing speeds, as well as the access pattern information propagation problem in multi-level prefetching.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: In our eval­uation, of the final constraints produced by INDICATOR, 86.5% were validated using criterion a, while 13.5% were validated us­ing criterion b.
Sentence 2: iNDICATOR determines whether the error messages and the candidate s description are alike, by computing the high­est similarity between each pair of the error message and the can­didate s description.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: The coordination between attackers is specified at action level trough precondition and concurrent conditions.
Sentence 2: a coordinated-attack plan P is a sequence of joint actions: p : (a0(s0),al(sl),,ak(sk))  where a joint action aj (s j), taken in state sj, is defined as the com- bination of all concurrent actions executed by each attacker in sj : aj(sj) : (alj(sj), a2y (sj), ..., ann(sj)) Every coordinated-attack plan starts in the current state so and finishes in some final state where the attackers's goal (or goals) is achieved, i.e., the system security is compromised.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Thus we de.ne our estimator F 2(S) = VarG[F1(S)] + dK 1d2 2.
Sentence 2: since VarG[F1(S)] = 0 provided all 0 = pi = 1, the sum of the .rst and third terms above is a non-negative quantity; hence, summing a (1 ± E) estimator for dK1d2 with exact values for VarG[F1(S)] yields an estimator for EG[F2(S)] that is within a (1 ± E) factor with probability at least 1 - d. our probabilistic AMS technique (pAMS) is a guaranteed (E, d) estima­tor for EG[F2(S)].
Relationship: entailment
Domain: Software and its engineering
Sentence 1: The problem in both cases is that if a data structure is extended (i.e., a singly-linked list becomes doubly-linked), then all operations should be updated to maintain the con­sistency of this extension, and not just some.
Sentence 2: if a singly-linked list has both insert and delete operations, when the structure becomes doubly-linked, both operations must be updated to work on doubly-linked lists.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: By getting such data from the relevant I/O devices, it is possible for the system to identify applications that are of immediate interest to the user, and prioritize them accordingly.
Sentence 2: this solves the problem shown in Figure 1; the results, in which Xine is automat­ically prioritized relative to the stressors and retains its full frame rate are shown in Figure 5.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: We model the I/O dy­namics of a large-scale SSD, and use the mean .eld theory to de­rive the asymptotic results in equilibrium.
Sentence 2: we classify the blocks of an SSD into different types according to the number of valid pages contained in each block, and our mean .eld results can provide effective approximation on the fraction of different types of blocks in the steady state even under the general workload.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: |capture(fi)|=|alloc(fi)|-|escape(fi)| |control(fi)|=|capture(fi)|- |capture(c)| c.children(fi) This computation of cardinality from the primitives alloc and escape is precise, even in the presence of set subtraction.
Sentence 2: we prove that we only lose the knowledge of what objects are in each set; we still know the exact size of the sets.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Therefore, a natural question is: is there anything in between the reproducing it after thousands of reruns reality and the reproducing it on the .rst replay goal that existing research ideas are shooting for?
Sentence 2: are there any methods that can reproduce bugs on multiprocessors with only a few (e.g., < 50) replay attempts while adding only small (e.g., < 50%) recording overhead during production run?
Relationship: entailment
Domain: Software and its engineering
Sentence 1: 4.1 Experimental Setup and Workload We implemented the recovery protocol as a pluggable mod­ule which integrates into any publish/subscribe application and protocol that provides a common publish/subscribe API.
Sentence 2: the publication record and other metadata re­quired by the recovery protocol is attached to messages as an array of bytes treated by brokers as application payload not subject to the matching process.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Theorem 8 implies that r must be O(n+ b)to achieve a small error probability.
Sentence 2: if d>max{j3 ,2m,8}and we pick r>1.5(n+1) +2b, then the error probability 3 (r-1.5(n+1)-2b) is bounded above by ( d 1 ) 2 .
Relationship: entailment
Domain: Software and its engineering
Sentence 1: For example, novices in OO-programming or programmers with a large experience on procedural languages (who naturally find it difficult to adopt the object oriented way of thinking [2]), tend to capture most of the domain and application semantics within a small subset of classes, occasionally within a single object [13].
Sentence 2: the outcome of the analysis is often one or more "God classes [20], which perform most of the work in the system.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: On-Demand remote invocation (target structure) Figure 1.
Sentence 2: class X .rst gets the in-VM reference of class N and then invokes the methods of N. Such a structure does not support of.oading any computation in class N because if N is of.oaded to a remote server, N s in-VM reference held by X becomes invalid, i.e., it cannot help the VM pass the method invocations to N, and X will fail to obtain the new in-VM reference of N. Figure 2 presents the typical code structure that enables class X to invoke the methods of a remote class N. X gets a remote reference to N from a remote commu­nication service, then uses the reference to interact with N remotely.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: 6.2 Open Issues 6.2.1 Generalization of the Method We are now aiming at generalizing this approach to other securitypropertiesthan sequencingproperties, and to other formalisms than regular expressions.
Sentence 2: we have mentioned in Section 3.3 the possi­bility to express the security properties as temporal logic formulas.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Contrarily to conditional directives, macros cannot be completed since each call to a macro would provide a different ending, in order to parse macros, we propose having the scanner work as a filtering process sothat the parser receives tokens corresponding to the C grammar.
Sentence 2: when the scanner finds a macro identifier, instead of sending the identifier to the parser it will send the replacement text.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: It is measured as follows:  X X P(t, c) IG(t)= P(t, c)· log (24) ¯ P(t)P(c) c.{ck ,c¯k }t.{ti,ti } From its de.nition, it is clear that the IG strategy is a su­pervised strategy.
Sentence 2: it uses the document labels in its choice of features to retain.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: 4.3 Impact on Execution Time From the results, our schemes have a significant improvement over a unified circular buffer and a generational buffer in terms of A common pitfall in cache performance evaluation is the miss reduction, which translates into considerable performance overemphasis on miss (rate) reduction while omitting the fact that speedup.
Sentence 2: the adaptive scheme does as well as the a significant miss reduction sometimes affects little in the overall fixed scheme in most cases, and in a few cases does substantially optimization objective.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Since attribute values often capture information that is speci.c to a given execution, but with little relevance when compared with other executions, such as the case of process identi.ers, LFA pre-processes attribute values to extract more general and reusable information than concrete at­tribute values.
Sentence 2: lFA eliminates attribute val­ues and modi.es event names to incorporate information about the regularity of the distribution of those values across events.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: It is a theoretical study that proposes a general formulation that in some sense en­compass the existing ones and outlines the fundamental lim­its of the method.
Sentence 2: it does not consider the problem of .nding pruning properties, but only the one of re.ecting them as precisely as possible, without the help of any complementary method (e.g., graph transformation).
Relationship: entailment
Domain: Software and its engineering
Sentence 1: In .gure 6 we show the graphical interface we use to load the XMI doc­uments of the analysed Software Artefact, which is drawn on the right, and the ODOL+OWL-S representation of the examined Pattern, reported on the left.
Sentence 2: here we show the UML class diagrams representing the Active Object implementation (right panel) and a graph represent­ing the original pattern (left panel), which portrays the in­stantiated class of the ODOL ontology (rectangles with a white background) and the corresponding individuals (rect­angles with a dark background).
Relationship: entailment