sadat2307/MSciNLI huggingface dataset:
Domain: Software and its engineering
Sentence 1: One simple instance of evolution occurred in the fourth version, when the return value from a query message added .elds describing the number of rows returned and the name of the table from which they were extracted.
Sentence 2: the query handler s type evolved roughly from the .rst to the second of the following (for clarity, we elide most of the handler pattern): handler ..., #queryCmd[String], ... returns #results(*#row[*column[]]) { ... } handler ..., #queryCmd[String], ... returns #results(*#row[*column[]], #rowcount[Integer], #tablename[String]) { ... } The new return type is a subtype of the old one.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: AIC consists of the following stereotypes for capturing control .ow dependencies and con.icts: match-jp de.nes the relationship between a (core or as­pect) scenario and a joinpoint where the scenario is the originator of and matches the joinpoint.
Sentence 2: a match-jp relationship is established between a joinpoint and a (aspect or core) scenario if the join­point is within a subset of the scenario s execution traces.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: At this point in the semester, we shifted the focus away from the theoretical aspects of systems design, and spent two weeks investigating speci.c examples of real distributed systems.
Sentence 2: we studied several Google services that have resulted in research papers, including the Chubby Lock Ser­vice [5], MapReduce framework [9], and BigTable database system [6], in addition to di.erent distributed .le and storage system implementations.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: One commonly used method for reducing the overhead of GC is to reduce the fre­quency of collections by increasing the allocation area (aka nurs­ery) used by the program.
Sentence 2: in our experience, provid­ing a large allocation area (for example, 32MB) improves multicore performance, con.rming the observations of other researchers [24].
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Additionally, we .nd that views from Android phones last longer than the views from  3.2 Video Viewing Time Viewing time is another indicator of workload, which can be also used for cache policy design.
Sentence 2: if most of the views last only a few minutes, it would be e.cient to cache the .rst chunks of videos in content delivery net­works (CDNs) so as to maximize the e.ectiveness of system storage.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Applying this to the example of yk the countdown problem, the e.ect is to set e = i=1 vi, and the ball for each site allows each site to receive up to (t/k-e) new updates before triggering another communica­tion.
Sentence 2: this scheme is equivalent to the basic scheme in Section 2.1: each site is given a uniform fraction of the current slack , and a global communication is forced whenever any site uses up its slack.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Originally developed as a generic extension to the Embedded C [12] vari­ant of ANSI C, address spaces have recently gained popularity in programming languages for General Purpose Graphics Processing Units (GPGPU).
Sentence 2: nvidia s Cuda [21] has support for disjoint address spaces as a type modi.er, while Khronos Open Compute Language (OpenCL) [22] formalizes them as type quali­.ers as a variant of Embedded C, shown diagrammatically in Fig­ure 1.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: While our method comes with a mathematical, if asymp­totic, guarantee and provides strong evidence of correctness, we stress that this is not the same level of assurance that formal veri.­cation provides.
Sentence 2: the sig(·)term in Equation 13 has the potential to introduce discontinuities that may be very dif.cult to discover.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: A detailed consideration of the particular nearest-neighbor stencil of the problem (i.e., the operator Dw) shows that the smallest overhead and highest e.ciency are obtained when for a given site all components of, e.g., a spinor with its 24 real degrees of freedom, are stored in 24 separate registers and cache-lines (known as structure­of-array (SOA) format).
Sentence 2: gather and scatter instructions are avoided and there is a 1:1 correspondence between data in memory (cache-lines) and registers.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: 1 Introduction Research in academia [8][15][20] has demonstrated the attractiveness of visual languages based on formal models of com- putation for specifying modern embedded DSP and communica- tion systems.
Sentence 2: various flavors of dataflow have been shown to be good matches for signal processing because of the nat- ural correspondence between discrete-time signals used in DSP and the infinite streams of tokens that characterize the data in data- flow netwod<s.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: S(v) = a freeBlock(L, a) = L' - .
Sentence 2: (S, H, L i ' (free(v), S, H, L, Q), Q) we never recycle holes inside H. Finally, function inBlock(L, a) returns true if address a is within a block tracked by L. By de.nition, inBlock(L, .)
Relationship: entailment
Domain: Software and its engineering
Sentence 1: A semantic bug in print tokens2 v7 Program CCI-Prev CCI-Havoc Our investigation shows that most test inputs that take the outer-if Apache1 0.4% 0.5% Apache2 0.0% 0.0% branch end up also taking the inner-if branch.
Sentence 2: once Cherokee 0.0% 0.0% the BT predicate is observed at the inner-if site, it is mostly evaluated FFT 96% 102% to be true.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: On other examples (such as the examples from Figures 3 and 8 below), where Slam succeeds quickly in .nding a proof, Synergy does so as well, by performing a Slam-like overapproximate analysis.
Sentence 2: dart works well for deterministic loops (since there is only one path, which a test can cover easily, but a large number of abstract states along the path, which may take many iterations for iterative re.nement to generate); and Slam works well for sequences of branches (such as Figure 8, since there are a small number of abstract states for Slam to generate, but a large number of paths for Dart to enumerate).
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Though it shares some characteristics with both the Iterated Prisoner's Dilemma and the Alternating Prisoner's Dilemma, all three models are distinct, and model different sets of real-world situations.
Sentence 2: the Turn-Taking Dilemma is a better model of "compromise" situations, in which one must take short-term losses to achieve a high average payoff in the long run.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: By execut­ing startTimer(T, offset) in round r, a node pi can set its timer T to expire in offset rounds.
Sentence 2: the predicate expired(T ) will be true in round r + offset at pi and any following round until some other timer has been started.2 Also, from the call of startTimer(T, offset) on until round r + offset - 1, the predicate running(T ) will hold at pi.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Second, we show how two classic race detectors (based on happens-before and lockset) can be reimplemented in this architecture.
Sentence 2: we show how to partition the work of those race detectors effectively into phases, reduce the amount of deferred work through transitive reduction, and reduce the amount of work needed to deal with unknown initial states through lock­set factorization.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: In order to face this issues, current research [2, 14] has increased the interest in the use of semantic descrip­tion of information through an ontology language where an ontology is a formal representation of a set of concepts within a domain and the relationships between those concepts and the use of logical reasoning over such descriptions to support information matching.
Sentence 2: by introducing in TuC-SoN tuple centres an ontology language to specify a taxo­nomical knowledge coupled with a logic reasoning over such knowledge would allow to face: (i) openness problems con­cerning heterogeneous coordinables that refer to information that is semantically equivalent but has a di.erent syntactic representation, and (ii) dynamism problems concerning the inability of coordinables to have a prior knowledge about all possible information stored in a tuple centre.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: When the IRTree is built, the last step, the back-end, entails scan­ning the IRTree and generating the native code; this process is per­formed by three components of the JVM: the parser, the resource manager and the code emitter.
Sentence 2: the parser is a key component that analyzes the tree by searching for pre-de.ned pat­terns (i.e.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: The HPP is applied to the PG described in Section III-B, with a different de.nition of valid path.
Sentence 2: a path Pp = {Entry, BBi,BBi+1,... ,BBj ,Exit} is valid if it starts from Entry and ends in Exit, like in EPP [4], BBi and BBj are connected by a back-edge (i.e., eji .
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Many heuristics have been proposed for hot spot detection and all of them share a common wisdom, which can be stated informally as follows: a long-running method is likely to be a hot spot.
Sentence 2: a method that has been running long so far is likely to be running long in the future, so its compilation is likely to lead to a performance benefit that can offset its compilation overhead.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: In this paper we propose an EUDWeb approach and tool for the speci.cation and the generation of Webapps embedding access control mechanisms.
Sentence 2: we have added access policy speci.cation mechanisms in a previous mockup-based EUDWeb tool [8], in order to support the speci.cation and implementation of Role­based Access Control (RBAC) policies [10] within the Webapp logic.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: This allows applica­tions to be rapidly prototyped in Smalltalk and performance­critical parts to later be rewritten in C if they are determined to be too slow.
Sentence 2: it is possible using LanguageKit for code to begin life as interpreted or JIT-compiled scripting code inside an application, but then be statically compiled and shipped with a future version.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Corollary 4.5 For any G,d,p, there exists a constant E> 0 such that any E-error algorithm for spanning connected G subgraph veri.cation problem requires O(min(dp , dpB )) time on some T(Gdp)-vertex graph of diameter 2p +2.
Sentence 2: if we consider G=dp+1pB then O(min(dp , G/(dpB))) = O(dp) .
Relationship: entailment
Domain: Software and its engineering
Sentence 1: (sub) G1, x : t, G2@R x x x (s (s) ' (s = s ) G1, x : t, G2@R x Figure 4: The general coeffect calculus Flat coeffect shape is de.ned as ({*}, star, <, *, *) where star(G) = * and * < * = * where * = {Ø}.
Sentence 2: there is a single shape * with a single position and all free-variable The operators x and x combine shaped coeffects associated contexts have the same shape.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: 5.2 Realization strategy for performance vari­ability and its motivation The case study identi.ed the software and hardware vari­ability strategies for realizing performance variability.
Sentence 2: the results highlighted the importance of the hardware: several factors seemed to favour the hardware strategy, the software strategy was kept simple by down­grading performance, and even the software strategy was dependent on hardware.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: The technique is to prune all of the unnecessary nodes between multiple neighbor nodes connected with a given node by Theorem 1.
Sentence 2: to find the shortest path passing an optimal adjacent node, this technique can select the node having minimum cost of distNE(u, wi, v) out of the adjacent nodes w1,w2, ,wi, ,wk emanating from u (i,e., dist(u, w1), dist(u, w2), , dist(u, wi), , dist(u, wk) in the road network.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: These four questions align with the traditional life cycle consid­erations of requirements, user interface, high-level design, and low-level design, but cast as design, we now know that there are some similarities to be expected in how they are explored, some unique aspects and challenges, but most of all a very strong rela­tionship.
Sentence 2: in light of the in-depth explorations that are frequently necessary, it means that designers will need to address the questions in parallel, for example already creating some of the architecture and implementation while still in the process of de­veloping the requirements or interaction mechanisms.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Furthermore, there are programming styles that can cause a given analysis technique to fail.
Sentence 2: for example, while it is easy to recognize a two-dimensional array created in a single operation: double[] [] a = new double[m] [n] ; it may be more difficult to detect one whose creation is spread over many steps: double[][] a = new double[m][]; for (int i=O; i<m; i++) a[i] = new double[n]; the simple runtime analysis with the dense flag, described in Section 3.1, would fail on the latter code (i.e., it would indicate a nondense array).
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Safety Quality Attribute Scenario Source: A request by the Ambulance Dispatch System Stimulus: A request for a spatial mapping for a dispatched ambula nce Artefact: Ambulance Dispatch System Services Environment: Runtime Response: Directions and routing information is provided Response Probability of a dangerou s failure is less than Measure: 10-4/hour  5.2 Replay and Adaptation When the recorded architectural process is replayed in the design of the new architecture, design mismatches occur at the second decomposition level when the safety aspects of the Ambulance Dispatch System are considered.
Sentence 2: adaptation is required to deal with mismatches in the GIS service subsystem.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Thus, given that the tar­get data generated by a mapping can be used as the source data in other mappings, it is natural to ask whether the same result holds when naive instances are considered as source instances.
Sentence 2: it is natural to ask whether for every mapping M speci.ed by a set of st-tgds and for every source naive instance I1, there exists a target naive instance I2 such that rep(I2)= SOLM(rep(I1)).
Relationship: entailment
Domain: Software and its engineering
Sentence 1: For a variety of reasons, these data centers are typically located in dif­ferent geographical sites, and connected to one or multiple ISPs at the nearby major Internet interconnection regions or Points-of-Presence(PoPs)1 .
Sentence 2: the content servicedby alargecontentprovidertypically .owsfromone of its data centers through one of these PoPs to enter these ISPs, and is then carried to eventually reach various users.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: We can then model the Macro-Micro.ow Re.nement primitive by constraining the stereotypes.
Sentence 2: if the refinedNodes tag value of a Microflow is not empty, the Microflow is a re.ne­ment of another Microflow or a Macroflow.If refinedNodes of a Macroflow is not empty, it must be re.ned by another Macroflow.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: A software factory is then defined as an SF schema populated with the necessary software development assets.
Sentence 2: to build a software factory, software factory developers need to define an appropriate SF schema, and populate each of its viewpoints with software development assets such as DSL (to allow models of that viewpoint to be constructed), transformation engines (to allow models of that viewpoint to be transformed to models or codes of adjacent viewpoints), etc.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: We abstract a web applica­tion P :S * ,...,S * .S * as a mapping from user inputs (over an alphabet S) to query strings (over S).
Sentence 2: p is given by {f1,...,fn,s1,...,sm}where fi :S * .S * is an input .lter;  si :S * is a constant string.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: On the other hand, for ParaMEDIC, there is practically no di.erence in the I/O time with increasing query sizes.
Sentence 2: paraMEDIC is only minimally impacted by the limited I/O of the subsystem and it e.ciently distributes its com­putational resources across the system to achieve high per­formance.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: It is calculated as the product of number of unique faults found during an inspection (Dr) and the average cost to detect a fault in testing (ct).
Sentence 2: .Ct = Dr * ct Finally, Cvt - Virtual testing cost, (i.e., testing cost expended if no inspections are performed) is the sum of the testing cost required to detect the faults remaining post-inspection (Ct) and the testing cost saved by inspection (.Ct) .
Relationship: entailment
Domain: Software and its engineering
Sentence 1: + = 1 pl pi l=1 We know that el /pl =ul and WCRT WCRT .i= pimin1=k=n (pk) and so a system of tasks Ti in our system is schedulable if n WCRT .
Sentence 2: ul + = 1 l=1 min1=k=n (pk) a task set that would be feasible under preemptive EDF (i.e.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Based on the rules in De.nition 2, we can enrich a safety con­straint with extra coordination messages and coordinators to make the decomposed sub-constraints consistent with the safety constraints.
Sentence 2: rule 1 addresses the out-of-order messages by adding a synchronization message between two consecutive global tasks, (i.e., interactions) where the receiver in the .rst one is different from the sender in the second one.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: To this end, it is possible to exploit the reasoner service provided by any Description Logic-based system that allows to query the ABox through a TBox-based description and obtain the set of individuals that satisfy such a query.
Sentence 2: in Section 4.2 we show how it is possible to exploit an OWL-DL reasoner in order to extend the tuple matching mechanism of TuCSoN tuple centres.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Let Bd = {b .Bd : Fb = F} be the set of boxes F in the class that store exactly F. These sets partition Bd into sub-classes, each comprising boxes that store identical contents.
Sentence 2: let the number of boxes B = |B| go to in.nity, while scalingboth the request arrival rates rc ·d andthe size of the subclasses BF d = |Bd to B. F|proportionally the quantitiesrc.d F/Bare constants thatdo notdepend on /B, Bd B as the latter increases.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: The additional complexity over the similar rules of sections 2 and 3 handles the addition of .at contracts con­ taining recursive contracts, disjunctive and conjunctive con­tracts, and pair contracts.
Sentence 2: to check disjunctive contracts, we must test if the left disjunct passes the contract, and branch on the result, whereas our earlier reduction rules for .at contracts simply fail for contracts that don t pass.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: WS Binder: a Framework to enable Dynamic Binding of Composite Web Services Massimiliano Di Penta1 , Raffaele Esposito1 , Maria Luisa Villani1 Roberto Codato2 , Massimiliano Colombo2 and Elisabetta Di Nitto2 dipenta@unisannio.it, r.esposito@unisannio.it, villani@unisannio.it roberto.codato@cefriel.it, mcolombo@cefriel.it, dinitto@elet.polimi.it 1 2 RCOST University of Sannio CEFRIEL Politecnico di Milano Via Traiano, 82100 Benevento, Italy Via Fucini 2, 20133 Milano, Italy ABSTRACT The rapid di.usion of service oriented systems is becom­ing a reality in today s software engineering.
Sentence 2: an aspect that is gathering the interest of researchers and practitioners is the possibility to create compositions of dy­namically bound services.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: For example, TCP NewReno uses a heuristic interpretation of duplicate acknowledg­ments to avoid timeouts, but it is widely accepted that TCP SACK (in Category 1) provides better recovery from losses [18].
Sentence 2: we argue these extensions are impacted to some extent by the pres­sure of backwards-compatibility.1 Finally, the remaining six extensions in Category 3 inherently re­quire changes to only one endpoint.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: There are two types of analysis tools: static analysis tools that collect information about a program by studying its binary but without executing it (e.g., disassemblers and decompilers), and dynamic analysis tools that collect information from program runs (e.g., debuggers, simula­tors, dynamic analysis frameworks, and emulators [18, 34, 55]).
Sentence 2: the development and availability of dynamic tools has strengthened the attacker s capabilities because many static protec­  Term Notation De.nition Guest Application P The software application Protective PVM V A process-level virtual machine that has been con.gured to apply various protection techniques at run time.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Thus, there is no cycle in G. Note that our termination algorithm discovers all the termination situations detected by the previous algorithms [3, 5, 8, 9, 10, 11, 12, 131.
Sentence 2: the termination situations discovered by the Path Removing Technique [lo] and the Cycle Unrolling [ 1 l] are discovered by our algorithm.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Let us now consider a cumulative weight that contains weights associated with the subdomains belonging to an equivalence class IND(k)(e.g., k = 3 in our example, i.e., IND(3) = {f,g,h}), but not IND(k + 1), IND(k + 2), etc.
Sentence 2: take any total order(e.g., total order  for Figure 1) and consider the cu­mulative weights for a given sequence of subdomains in the total order that reaches level k (e.g.,<b,a,d,c,e,f,h > for level k = 3) but go no further.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: For consensus, a signi.cant e.ciency improvement has been established when considering the ef­fective number of failures [5, 10, 15].
Sentence 2: it was shown that for any integer f = t, any consensus algorithm has a run with at most f failures in which some processor decides not earlier than in round min(f+2,t+1), and there is an algorithm where all correct processors decide by round min(f +2,t+ 1) for all f [5, 15].
Relationship: entailment
Domain: Software and its engineering
Sentence 1: The objective of this case study is to answer the two following research questions: [RQ1] Is F capable of leading to a ful.llment of the three objectives?
Sentence 2: does the minimiza­tion of F results in a maximization of F1 (or a minin­imization of (-F1)), a minimization of F2 and a min­imization of F3?
Relationship: entailment