sadat2307/MSciNLI huggingface dataset:
Domain: Software and its engineering
Sentence 1: We illustrate these techniques by showing how to embed Cryptol (Galois, Inc. 2002), a high-level speci.cation language for low-level cryptographic algorithms, in a dependently typed language (Section 2).
Sentence 2: we will write a domain-speci.c library for Cryptol s most charac­teristic feature: bitvectors of a .xed length equipped with a spe­cial pattern matching principle.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: To see why the solution is a valid feasibility bound, let us assume that the tasks are assigned to a particular processor and the resulting processor utilization is Ui.If UiiF, at least one of the constraints in (3) B must be violated.
Sentence 2: the .rst request of Tias well as higher priority tasks can be completed before either one of the pT's or k , which is equivalent to the system being feasible [13].
Relationship: entailment
Domain: Software and its engineering
Sentence 1: 5.3 Peak Power and Cooling-Awareness Next, we consider what happens if the dynamic cost-aware poli­cies do not account for the cost of cooling and/or peak power de­mand.
Sentence 2: we consider versions of the CA and CAM policies that use Equations 1 and 9 without the CostPd component and/or Equation 3 without the P C d,t component.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: For the coming sections we will simply assume that cast is available, and that every type is an instance of Typeable.
Sentence 2: given cast, we can write mkT, which we met in Section 3: mkT :: (Typeable a, Typeable b) => (b ->b) -> a -> a mkT f = case cast f of Justg ->g Nothing -> id mkT f x applies f to x if x s type is the same as f s argu­ment type, and otherwise applies the identity function to x.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: In Figure 6, for instance, exercising XQ(UserAddress, //city/) once may not execute the definition for the variable w at R6 because, when V at R5 is empty, R6 will not be evaluated.
Sentence 2: a test set that satisfies the all-queries criterion may not cover all the def-use associations of variables in X-WSBPEL.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: In such a scenario, the polyhedral framework would ei­ther apply the loop shifting transformation to remove the backward dependence or issue a cut between statements to satisfy the dependence.
Sentence 2: if the pre-fusion schedule satis.es the precedence constraint, then the poly­hedral framework guarantees legal fusion partitioning that satis.es the fusion-preventing constraint.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: D The above theorem shows that in order to ensure that the execution of a program e corresponds to an E-differentially private random­ized function from values in s to values in t, it is suf.cient to check that the program e has a type of this form: f e : !Es -Ot  5.4 Primitive Operations for Privacy As outlined in Section 3, one important property of DFuzz is that it can be extended by means of primitive operations.
Sentence 2: we are interested in adding two basic building blocks, allowing us to build more involved differentially private examples.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Although this is easy to au­tomate using a traditional parser, our goals are larger.
Sentence 2: we wish to establish a common framework for statecharts seman­tics which can support reasoning about the semantics, reasoning about statecharts using theorem provers, and model checking stat­echarts, with all of these goals supporting multiple semantic varia­tions.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: 2.3 Untrusted code execution Purity gives us a way to execute untrusted code safely: we .rst verify that the untrusted code is pure, and then many useful privacy and security properties will follow.
Sentence 2: the lack of side effects means that the pure, untrusted computation cannot violate the integrity of the rest of the program it interacts with2, so pure code inherently executes in a sandbox.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: We use the Pin [15] dynamic instrumentation framework to implement the tool.
Sentence 2: we make the following contributions: We develop a tool, called the Performance Opportu­nity Finder (POF), that identi.es potentially redun­dant computations matching three patterns: redun­dant sign/zero extension, redundant constant spill, and missing copy/constant propagation.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: ...Sim ) 2. the subgraph induced by M in CGis connected, where CG is the communication graph of the sensor network.
Sentence 2: any sensor Iij in the connected sensor cover can communicate with any other sensor Iik in the cover, possibly through other sensors in the selected set  M. A set of sensors that satis.es only the .rst condition is called a sensor cover for Q in the network.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: If e is an expres ion denoting the sequence (e0,e1,.......,en), the expres ion pre(e) denotesthe sequence (nil,e0,.......,en ) where nil is an undefined value.
Sentence 2: pre(e) returns, at a moment t , the value ofthe expres ion e at the moment (t -1) .
Relationship: entailment
Domain: Software and its engineering
Sentence 1: In order to overcome the limitations of certifying compil­ers, earlier work [6, 5, 7, 18] has considered expressive veri.­cation methods for executable code and established their adequacy with respect to veri.cation methods for source programs.
Sentence 2: burdy and Pavlova [7] have de­veloped a proof compiler for Java, that enables certi.cates of Java bytecode programs to be constructed from source code veri.cation with JML-based tools such as ESC/Java and Jack.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: In the beginning, the product line engineer creates a Stage-Model for the product line (Figure 5, step 1).
Sentence 2: the StageModel 1pure::variants feature models, domain-speci.c models based on Ecore, domain-speci.c textual languages based on Xtext, XMLSchema XML, Java property .les, Kcon­.g .les, and C header .les with #de.nes (cf.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Since stage of a is the same as or before stage of b, any new stage inserted before stage of a is also before stage of b.
Sentence 2: newStagesBef ore(stage(a)) = newStagesBef ore(stage(b)) Hence after the insertion, the new dependence distance d+ newStagesBef ore(b)-newS tagesBef ore(a) = d = 0.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: string)) (define load-interactive-checked (apply-contract load-interactive-contract load-interactive))  Contracts more clearly express the intended checks, and the compiler ensures that the intended checks are actually ap­plied (in an e.cient way, and with clear error messages).
Sentence 2: after declaring contracts, the programmer can think of the function arguments as having the declared types, although the type requirements are enforced dy­namically.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: The combination mechanism we propose, based on an unfold­ing/folding technique combined with partial reduction operators, could be applied for other abstract domains than those consid­ered in this paper.
Sentence 2: other abstract domains based on .rst-order formulas, e.g., the one de.ned in [13], can be used to strengthen the analysis in our domain of universal formulas.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: We have compared several variants of a self-adaptive IRK solver, which exploits thetime-stepping nature ofthesolutionprocedureto select the best implementation variant from a candidate pool at runtime.
Sentence 2: we have investigated the empirical selection of tile sizes for loop tiling from a set of tile size samples, where the set of tile size samples is determined by a model-based approach.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Most of these are generalisations of the type equalities of [5], but will not be identities in our model.
Sentence 2: for all the type isomorphisms listed, the term from left to right can be de.ned canonically in our calculus, but we add the term going the other way, plus two equalities of terms, stating that the added term is an inverse to the existing one.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: APT::Solver::name "aspcud-paranoid-1.3"; APT::Solver::criteria "-removed,-changed"; Since MPM aims to replace only the dependency solver part of apt, everything else will still be handled by the un­derlying library.
Sentence 2: once a solution is found by the dependency solver, apt will be in charge of .nding a in­stallation plan for the proposed solution.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Furthermore, the semantics also ensures that meth­ods canbeinvoked onlyifboththe caller and method arein the same component.
Sentence 2: this prevents a mixin from invoking a method without protection, preventing the faulty invoca­tion from the search-mixin examplein section2.3.all method invocation must either be dispatched lo­cally or through a contract monitor.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: When S1 holds, we can prove that out-or-order processing of transforms does not cause problems.
Sentence 2: we can show that: applications do not interfere with transform functions, transform functions of unrelated objects do not interfere with each other, and transform functions of related objects run in a pre-determined order (namely an object is transformed before its owned subobjects).
Relationship: entailment
Domain: Software and its engineering
Sentence 1: This does not complicate the ap­plication of mixins because,inpractice, type application of rows canbeinferred[35].In contrast, our type system does allow width subtyping on the types of objects, since objects inRacket cannotbe extended after creation.
Sentence 2: our approachispay-as-you-go.Program­mers needtobe awareofrowpolymorphismonlywhendeal­ing with abstractions that are not provided in most typed object-orientedlanguages, such as mixins.Meanwhile,pro­grammers neednot consider rowpolymorphism whendeal­ingwithobjects,andcaninsteadreasonabouttheirprograms usingfamiliar subtyping rules.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: A mobile user with the master mDev will consider a mobile service with mClouds useful if there is surplus in utility after paying the slaves: u - w * t - m * s - q> 0 (2) And mClouds provides real cost savings (compared to equa­tion 1) only if: w * T + p>w * t + m * s + q (3) That is, the added payment to the slaves should be lower than the savings achieved through reduced waiting time and reduced payment to the wireless carrier by using mClouds.
Sentence 2: note that if the carrier is willing to cover the cost to sig­ni.cantly reduce the network congestion, then the slave pay­ment cost (q) from the master is reduced to 0 and mClouds is bene.cial to the master as long as: w * T + p>w * t + q (4) incentives provided by carriers intended to reduce congestion in their networks may signi.cantly boost the adoption of mClouds.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Since edges are established with probability padd = 1 - exp(-2J ß) if and only if the involved spins both are aligned (2 cases out of 4), the expected number of elements to be transferred is 0.29 N¯in two ¯ dimensions and 0.18 N¯in three dimensions, where N is the number of border sites in this step.
Sentence 2: the expected amount of data to be send is 8×0.29N¯bytes, and 8×0.18N¯bytes, respectively.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Web Services, the second layer, are the integration point and provide access to a wide range of resources in a third layer, including compute and file resources, databases and Grids.
Sentence 2: resources available to our experiment belong to the Italian Grid Infrastructure (IGI) [3], which is based on gLite, and to our local cluster, which is based on LSF [4].
Relationship: entailment
Domain: Software and its engineering
Sentence 1: We use obfuscation transformations applied to known malware to obtain a large number of new test programs that are semantically equivalent to the original malware thus, the new test samples are just as malicious as the original malware and should be .agged by the detec­tor.
Sentence 2: our test set PT is created by applying semantics-preserving obfuscation transformations to a set of known malware.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: As an example, let us consider a constraint requiring that every association has at least two ends: context Association inv: memberEnd->size() > 1 (4) Without considering its presence conditions, the model in Fig­ure 1(b) satis.es this constraint since every association in that model has at least two ends.
Sentence 2: evaluating memberEnd ->size() > 1 on a1 in Figure 6 using the standard OCL inter­pretation clearly yields true since a1 is associated with two ends, namely e1 and e2.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Although all the existing features of the AORA tool were preserved, it has suffered some modifications to be able to assess the ComBO rules and approach.
Sentence 2: it was necessary to develop: (i) HTML report conversion, (ii) basic and automatic graphical generation of the composed rules, (iii) logging support, for the history functionality, (iv) Composition Rule persistent storage in the eXist repository, such as reading and writing, (v) concern creation and update and major refinements in the Composition Rule Editor (CRE).
Relationship: entailment
Domain: Software and its engineering
Sentence 1: 4 Experiments 4.1 Microbenchmarks The objective of our microbenchmarking experiments is to evaluate the performance of the building blocks of AVEK-SHA.
Sentence 2: we evaluate (a) how many clock cycles it takes for AVEKSHA to perform event monitoring for each of the three modes breakpoint, watchpoint, and PC polling, (b) the accuracy of the energy monitoring by comparing it with measurements obtained using a Fluke multimeter and a dedicated power monitor from Monsoon Inc., and (c) the energy consumption of the TDB itself.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Our experimental results indicate that Green can signi.cantly improve performance and reduce energy consumption of several applications with only a small degradation in QoS.
Sentence 2: we improved the performance and reduced the energy consump­tion of Bing Search,aback-end implementationofacommercial, in-production web-search engineby 21.0% and 14.0% respectively with 0.27%ofQoSdegradation (three queries outofa thousand re­turned a search result that included at least one different document orthe same documentsinadifferent rank order).We also empiri­cally demonstratethatGreencan generatearobustQoSmodelwith a relatively small training data-set and that runtime re-calibration can enable applications to meet their QoS targets even if they use imperfectQoS models.TheQoS models producedbyGreen during the calibration phase have also proved useful in providing develop­ers with a better understanding of their application.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: We denote action assign/(j) < loadi(j)  use/(j) as a use action on shared variable vj by Thi; simi- assigni(j) < storei(j) < writei(j) < readi(j) < loadi(j) larly for assign, load, store, read, and write.
Sentence 2: the action lock/denotes locking of all shared variables by Thi; similarly we infer that an assigni(j) cannot take for unlocki.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: The method incorporates a heuristic Dependence_constant for every combination of parameters, that adjusts for the gain for that combination.
Sentence 2: the objective function in formula 2, computing predicted overall normalized runtime, could be adjusted as follows: Pred..Runtime_function = ]-I~=lRuntime_function(pi) (3) Dependence_constant(p1,... Pn) The Dependence_constant is a value that adjusts the gain to take into account dependences between parameter values.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: 4.2 Load Balancing The parallel file system at the ALCF is optimized for high­performance local access, typically massively parallel local access; this follows directly from the architecture of most modern supercomputers.
Sentence 2: while GPFS can be optimized for single-node I/O of up to 2 GB/s, the GPFS servers at the ALCF are limited to 500 600 MB/s each.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Based on a variety of traces from the SPECcpu2000 benchmark suite, we have shown the generated code to be faster and to com­press better on average than BZIP2, MACHE, PDATS II, SBC, SEQUITUR, and VPC3.
Sentence 2: the auto­matically generated code typically outperforms hand­crafted and optimized code.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: The goal of supporting multimodal, multi-device access to multilingual content imposed certain requirements from the application logic and the backend infrastructure.
Sentence 2: the information access and retrieval system had to support: Information transformation and presentation to various formats corresponding to the different modalities Adaptation of retrieved information to various terminal types and models  Information personalization based on user preferences Different database systems and schemas corresponding to diverse demonstrators (i.e.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Such a speci­.cation is relatively straightforward to write in higher-order program logics, even if it is out of scope in the more com­mon .rst-order Hoare logics.
Sentence 2: consider a func­tion compile from source-language commands s to target­language commands t. To do compositional veri.cation of such a compiler, we informally prove the following proof rule for any s. compilepsq t tsafe to run su t tstate could result from running su Using the separation-logic [25] interpretation of Hoare triples (where the precondition must imply that the program is crash-free), this rule means that (1) t is safe to run when­ever s is safe to run; (2) if t terminates, the .nal state is one that could have resulted from running s. We say that s and t are in a backwards preservation relation.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: 4.2 Correctness In the short version of our paper, we provide only the highlights of the proof that the given implementation of the concurrent queue is correct and wait-free, deferring the further details to the longer version.
Sentence 2: we review the computation model, de.ne linearization points for queue operations, and explain why our algorithm guarantees wait-freedom.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: This paper shows part of a development methodology that we are elaborating for the construction of information systems based on Grid Computing highly dependent on mobile devices where security plays a very important role.
Sentence 2: in this paper, we will present the analysis phase, managed by reusable use cases through which we can define the requirements and needs of these systems obtaining an analysis model that can be used as input to the following phase of the methodology, the design phase of mobile Grid systems.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Section 3 describes our types as modules strategy and shows how PADS/ML-generated modules together with functional O CAML code can concisely ex­press common data-processing tasks such as .ltering errors and for­mat transformation.
Sentence 2: a key bene.t of our approach is the high return-on-investment that analysts can derive from describing their data in PADS/ML.PADS/ML makes it possible to produce automatically a collection of data analysis and processing tools from each descrip­tion.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: This is an approach similar to the one proposed in [17], where a theoretical pre­sentation of algorithms to implement a Distributed Shared Memory mechanism is provided in terms of protocols to keep replicated instances of a variable coherent.
Sentence 2: one of the provided algorithms proposes to implement vari­ables as multi-version lists where write operations install new version nodes and read operations .nd the most suit­able version.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: As an application of the higher-order naturality of UNFOLD, consider Pascal s Triangle: 1 11 121 13 3 1 14 6 41 1 5 10 10 5 1 ...
Sentence 2: the triangular shape can expressed as the .nal coalgebra of the bifunctor U de.ned by Ua = Int × IStream × IStream × a, which gives a vertex of type Int, two in.nite edges of type IStream Int, and an inner structure of type a. Pascal s Triangle itself is UNFOLDU step (repeat 1), where step (SCons x (SCons y xs)) = let zs = SCons (2 × y)(zipAdd (xs,zs)) in (x,SCons y xs,SCons y xs,zs) (the seed of the unfold is one of the in.nite edges.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: 4.2 Online Reserved Instance Con.guration While o.ine optimization is shown to be expensive at least in the above discussion, real SEC managers have to per­form online instance provisioning without seeing a full job history.
Sentence 2: reserved instances are relatively long­term commitments (1 year and 3 years in EC2 s case) and cannot be returned , demanding a load prediction mecha­nism that sees rather far into the future.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Most of these ranking are based on test results (for example, those potent test cases will be ranked high), coverage (certain coverage criteria may be ranked high for certain testing applications), or component tested (for example, the test cases that execute a modified section will have a high priority during regression testing).
Sentence 2: these are often based on physical items such as the test cases, test results, or software components.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Our metric for trace simplicity (and interleaving granu­larity) is the number of context switches in a trace: a trace with fewer context switches is simpler than a trace with more context switches.
Sentence 2: given a buggy trace t , we would like to generate the simplest variant-trace of t. we would like to generate the variant-trace with the minimal number of context switches of all variant-traces.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Several studies also highlighted that the techniques are good to find requirements that are either unknown or overlooked but not necessarily innovative [S5, S26, S36, S38, S42, S43].
Sentence 2: l. Mich and D. Berry [S5] proposed the EPMcreate technique, which proved to be very effective for finding requirements, especially those not previously known to the project managers.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: For the remainder of the paper we assume that interaction com­position (#) binds stronger than dot-composition (·).
Sentence 2: these opera­tions are related by a distributivity law [26]: Distributivity I : R#(S · T)=(R#S) · (R#T) (8) the interaction of R with S · T is the dot-composition of interactions R#S and R#T.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: (1)  |= (1 - )n, 5 d · min(., d) lg n lglg n · n · 2.1600 09/10 |U|= m 5 .
Sentence 2: we will prove this by contradiction so we will assume that |U0|= k if n is su.ciently large.
Relationship: entailment