sadat2307/MSciNLI huggingface dataset:
Domain: Software and its engineering
Sentence 1: This paper discusses the design and implementation of Repo-Man, which is an implementation of the OMG CCM Repository Manager specification [6] tailored to enterprise DRE systems.
Sentence 2: repoMan optimizes its CPU and I/O usage to provide fast/predictable access to component data for enterprise DRE sys-tems with a range of QoS requirements.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: In this framework one can write the following de.nitions for the combinators Always and Eventually, and the formula to be monitored (M1): max Always(Term F)= F /.Always(F) min Eventually(Term F)= F V.Eventually(F) mon M1 = Always(x > 0 -Eventually(y > 0)) The Always operator is de.ned as having a maximal .x-point in­terpretation.
Sentence 2: if by the end of the trace the property was not yet violated it is assumed to be validated and will evaluate to true.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Statistical techniques use data collected during execution of failing and successful runs to rank statements in the order of their likelihood of being faulty.
Sentence 2: the Tarantula approach [9] uses a for­mula to rank program statements according to the intuition that the statements primarily executed by failing runs are more likely to be faulty than the statements primarily ex­ecuted by successful runs.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: CONCLUSIONS Within a modern OSS 2.0 project ecosystem our results are sub­stantially in contrast to earlier research conducted on individual projects when the state of Open Source software development had not yet evolved to its current state.
Sentence 2: this work is novel because to the best of the authors knowledge it is the first study to consider these contributions in the context of an ecosystem.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: In this paper, we outline the application domain, give a brief overview of the DSL that we developed, and provide concrete data to demonstrate its effectiveness.
Sentence 2: we show that the DSL has several signi.cant bene.ts over the orig­inal, XML-based approach including reduced code size, increased modularity and scalability, and detection and prevention of com­mon defects.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: The source code analysis step and the runtime log parsing step, output of the process is the complete message templates, as Figure 3 illustrates.
Sentence 2: we do not claim with a data structure containing each message s template to handle every situation correctly (despite extensive sup­(regular expression), position in the source code, and the port for language idioms), but we do show that some of the names and data types of all variables appearing in the mes­ important features used in our results cannot be extracted sage.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: The proposed WSB was compared to FTL, BL, NFTL and FAST management strategies.
Sentence 2: fTL and NFTL adopted a greedy policy for the garbage collection: blocks in the .ash memory are circularly scanned to .nd the victim block to reclaim, and a block is considered as a victim when the number of invalid pages is larger than the number of valid pages in the block.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: .t abt(t1) .t1,v1.DSTM.rs ' (t1,v1) = DSTM.rs(t1,v1) .¬.t abt(t1) .t1,v1.DSTM.os ' (t1,v1) = DSTM.os(t1,v1) .¬.t abt(t1) def where .t = t1 = t..v1.DSTM.rs(t, v1).DSTM.os(t1,v1).
Sentence 2: abt(t1) any thread t in the .nished state is allowed to validate its read set; in doing so, every owner of a location which t read becomes aborted.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Therefore, for each activity Ai .MT (BP ), a set of m service candi­dates SAi = {si1, ..., sim} are assumed to be discovered in the solution space (Figure 3).
Sentence 2: sAi includes binding links to di.erent services providing multiple imple­mentations for activity Ai with varying QoS properties.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Command mitigate (e,e) c executes the command c while ensuring that timing leakage is bounded.
Sentence 2: the expression e computes an initial prediction for the execution time of c. The label e bounds what information that can learned by ob­serving the timing leakage c. no information at level e' such that e' g e can be learned from c s execution time.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: This component performs stan­dard machine independent optimizations and identi.es portions of data .ow graphs suitable as speci.cations for codelets.
Sentence 2: loops (While or Until nodes) that are amenable to data parallel implementa­tion are identi.ed and converted to use equivalent code structures with either a ForAllConstruct node if the result is an array, or a ForAllReduce node if the loop computes the result of applying an associa­tive/commutative operator to the set of results of each loop cycle.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Unfortunately, despite introducing many important compo­nents, GHC RTS did not scale on multicores, leading to poor per­formance of many network applications that try to use lightweight Haskell threads.
Sentence 2: our experiments demonstrate that even embarrassingly concurrent network servers are typically un­able to make effective use of more than one or two cores using current GHC RTS.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Third, as the last major hurdle, to ef.ciently support high-level queries, a Fay tracing platform must correctly integrate with new or existing query languages and data-parallel execution frameworks.
Sentence 2: fay query-plan generation, optimizations, and task scheduling must correctly consider the difference between persis­tent, redundantly-stored trace event data and tracepoint-generated data which is available only at an online, ephemeral source, since a tracepoint s thread, process, or machine may halt at any time.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: XCert achieves a strong correctness guarantee by proving the correctness of the execution engine fully formally, but it also pro­vides excellent extensibility because new optimizations can be eas­ily expressed in the DSL and then checked for correctness fully automatically.
Sentence 2: while adding only a relatively small amount to CompCert s trusted computing base (TCB), our tech­nique provides the following bene.t: additional optimizations that are added using PEC do not require any new manual proof effort, and do not add anything to the TCB.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: MG, wemust havethat RJi = PIi .In the second case, assume that there is no assignment from the variables of sH to values in adom(Ii) so that the antecedent of sH becomes true.
Sentence 2: there is no homomorphism from E2 to the bi­nary relation EIi of Ii.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Di.erently from traditional software systems, where a com­bination of static and dynamic analysis can be used to detect design patterns [13], in the context of service oriented archi­tectures pattern detection can only rely on observing SOAP messages, while the source code is not available.
Sentence 2: in this context patterns are identi.ed by a sequence of service interactions, while the system structure is not vis­ible and, above all, dynamically changing.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Suppose a frame bound F,a stack bound S, and a heap bound M have been inferred for method M. If the initial con.guration C0 = ((p, F, 2) : .,., ret(E), s-F, h)satis.es the following conditions: (1) p F h =M (2) p F s =S, then the stack space s and the heap space h are adequate for the execution of the program.
Sentence 2: for any C = (.1,.1, E1, s1, h1)where C0 ,.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: 4.2.3 Bene.ts The application of the Dublo pattern is reasonable, if the following bene.ts provided by this pattern are of relevance: Smooth migration: incremental replacement of old business logic and client software by new middle-tier business logic.
Sentence 2: if the migration cannot be performed in a short time interval, this issue becomes essential.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Here we show that even with improvements to the justi.cation process to permit these opti­mizations, other very basic problems exist.
Sentence 2: the often­mentioned out-of-thin-air guarantee, as well as the necessity of preserving sequential consistency for race-free programs result in signi.cant constraints on optimization, limiting important existing techniques and imposing additional analysis costs.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: All of the execution states in one group are merged.
Sentence 2: for example, aas ({[{a},l],[{a},m],[{b},n],[{b},o],})= {[{a},l. m],[{b},n. o]}.aas is designed to maintain the correlation between a given property state and the execution states under which the property FSM is driven into that state at a given program point.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: (6), we .nd that the cost on a link up to time interval t equals the sum of the cost on that link up to time interval t - 1, and the additional cost incurred by the possible over.ow in the time interval t. This implies that, if the traf.c volume on a link during one time interval is less than the charging volume on that link up to the previous time interval, which is the maximum aggregate .ow rate on that link over t - 1 time intervals times the duration of one time interval, no additional costs will be incurred.
Sentence 2: the traf.c volume in interval t is carried on the link for free.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Figure 3a shows that with transient-core nodes instead of transient nodes, the overhead for disk-intensive jobs relative to the job execution on only core nodes is much smaller.
Sentence 2: sort shows a signi.cant improvement, decreasing the overhead from 40% with transient nodes to 23% with transient-core nodes, as do KMeans and ActiveHashes.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: The result of combining MBT and PBT is a new testing ap­proach in which testers get the bene.ts of using properties to generate test cases, and those of specifying the test re­quirements using a model of the SUT.
Sentence 2: we have used UML models complemented with OCL constraints as starting point, so that testers do not have to deal either with the implementation details of the SUT, nor the peculiarities of a new formalism to specify the tests.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: We can now state the conservativity theorem which says that if the stricti.cation of a lazy computation EL reduces (in a purged context) into a value V1, then the lazy computa­tion reduces (in the unpurged context) to a value V2, whose stricti.cation is equivalent to V1.
Sentence 2: evaluation and stricti.cation commute.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: In a dynamic scenario, the model can be extended by assuming (1) departure rates that depend on performance, (2) arrival rates a.ected by p, and (3) dynamics that a.ect the distri­bution by postulating type-dependent departures and  arrivals.
Sentence 2: one could imagine that p would a.ect the arrival rate in di.erent directions.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: An Intra-Task DVFS Technique based on Statistical Analysis of Hardware Events Hiroshi Sasaki, Yoshimichi Ikeda, Masaaki Kondo, and Hiroshi Nakamura Research Center for Advanced Science and Technology, The University of Tokyo {sasaki, ikeda, kondo, nakamura}@hal.rcast.u-tokyo.ac.jp ABSTRACT The importance and demand for various types of optimization tech­niques for program execution is growing rapidly.
Sentence 2: dy­namic optimization techniques are regarded as important.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: For example, the difference of two types contains all the values that are contained in the .rst type but not in the second, the union of two types is formed by all the values of each type, and the intersection of, say, an arrow and a record is equivalent to (in the sense that it has the same interpretation as) the empty type.
Sentence 2: subtyping is just set inclusion: a type is a subtype of another if the latter contains all the values that are in the former (for more details see [8]).
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Speci.cally, the set of tasks that run in each logical execution slot is cho­sen from the intersection of all resource speci.cations of the components and the platform constraints speci.cation (as described above).
Sentence 2: improving the speed of the machine allows better performance (because less constraints means more applicable schedules and possibly existence of a better one).
Relationship: entailment
Domain: Software and its engineering
Sentence 1: As for Lucene and Ant, we obtain their bugs and test suites from their bug tracking and version control systems fol­lowing the procedure described by Dallmeier and Zimmermann [8].
Sentence 2: we consider Lucene bugs that were reported for ver­sions 2.0 to 3.1, and Ant bugs that were reported for versions 1.5.1 to 1.9.2.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: newtype fm*a = FreeT {unFreeT :: m (Free f a (fm*a)) } data Free f a x = ReturnF a | OpF (f x) instance Functor f .
Sentence 2: functor (Free f a) where fmap (ReturnF a) = ReturnF a fmap f (OpF x) = OpF (fmap f x) When the monad is Id there is no additional structure so: f* a = f* Id a f* a is the .xpoint of Free f a.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: A value is a tree of the special form .k n. {||} , of­ ten written just k. For instance, the phone number .. .¯ pc; dotted arrows represent splitting or concatenating trees.
Sentence 2: the result of applying l1/ to c|pc (the tree formed by drop­ping the immediate children of c whose names are not in pc) must be a tree whose top-level labels are in the set pa; similarly, the result of applying l2 / to cpc must be in pa. the lenses l1 and l2 are allowed to change the sets of names in the trees they are given, but each must map from its own part of pc to its own part of pa. Conversely, in the putback direction, l1 must map from pa to pc and l2 from pa to pc.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: However, we believe that our approach breaks new ground by the integration of MAC into use case, class, and sequence diagrams, and by providing design-time.
Sentence 2: security assurance in this paper, we report on our research on the incorporation of MAC into UML use case, class, and sequence diagrams, for the definition of clearances and classifications for relevant UML elements, which augments our efforts on including role-based access control into UML [9].
Relationship: entailment
Domain: Software and its engineering
Sentence 1: FASTTRACK uses an adaptive representation for tracking the read history of each variable that is tuned to optimize the common case of totally-ordered reads, while still retaining the full precision of vector clocks when necessary.
Sentence 2: if the last read to a variable happens after all pre­ceding reads, then FASTTRACK records only the epoch of this last read, which is suf.cient to precisely detect whether a subsequent access to that variable con.icts with any preceding read in the entire program history.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: pathS no longer satis.able, then Achilles can drop path Ci from the current state, but also all path pred­icates path Cj such that di.erentFrom [j][i][a] = FALSE .
Sentence 2: if pathCi no longer holds, due to the addi­tional checks on .eld a, then all path predicates pathCj can be dropped, because they cannot have any additional values for .eld a.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Otherwise, we distinguish two cases : (a) IfS C is .nite, then for all constructors c in this set we consider the context Qc Q ' c = EX(c( ,..., ),ctx) Then, trap handlers (P1,e1); ...;(Pt,et) are scanned left-to-right, stopping at the smallest i, such that the intersection Q ' c nPi is not empty.
Sentence 2: we .nd the trap handler where to jump to when the head construc­tor of x1 is c, in order to extend the case list as follows : L= L case c: (exit ei) It is possible that ei does not exist (when Q ' c is empty).
Relationship: entailment
Domain: Software and its engineering
Sentence 1: We .nd that although the oblivious method allows base code design­ers to ignore aspect design, it leaves important abstractions implicit in program details and does not decouple design decisions in the other direction.
Sentence 2: the freedom afforded to base code designers comes at considerable cost to aspect designers, who are thwarted by a lack of constraints on the code they need to advise.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Here, li is the running time of phase i and A ij is the estimated run time of qj when it runs in the query mix of phase i.
Sentence 2: a ij is the estimated time for a query instance of type Qj to execute, from start to .nish, if it executessolelyinthismix .Sincephase i runs onlyfor time li, qj will complete only afraction li ofits workin thisphase.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: The next step after addressing these issues is design of methodology for improving TDD by leveraging traceability information.
Sentence 2: we need to study: -in-process guides that identify requirements remaining to be implemented, -in-process identification of inconsistencies between requirements and unit tests, -traceability-aided automated test generation, and -generation of change-impact information when refactoring (tools such as Chianti [17] might prove helpful here).
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Each EMi and SFi is converted from text (such as very high ) to a numerical value by looking up the cost driver elements of An and M in tables provided as part of the definition of COCOMO6.
Sentence 2: 5 seven possible ratings exist ( extra low, very low, low, nominal, high, very high, and extra high ); however, technically, extra low and extra high are excluded options for some attributes, meaning that an alternative such as very low or very high must be used instead.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: This score can be expressed as a fraction of the PDG: |N | S = 1 - |PDG| 7.4 Improved Strategies A cause transition at a blamed location b can impact the failure only in two ways: If the state at b is infected, it is caused by the defect.
Sentence 2: the defect d is in the backward slice of b or b .
Relationship: entailment
Domain: Software and its engineering
Sentence 1: In this paper, we make the following contributions:  We .rst propose to use Neville s algorithm [8] to predict the storage cache space required by competing applications such that everyapplication s SLO is satis.ed and the overall I/O latency is minimized.
Sentence 2: this .rst partitioning considers all the storage server caches as one big monolithic cache space and allocates it across applications.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: It can be seen that our approach cuts dy­namic instructionsand packing/unpacking operationsofSLPonav­erage by 14.5% and 43.5%, respectively.
Sentence 2: we observe that Global achieves signi.cant packing/unpacking instruction re­ductions for most benchmarks tested, which shows the advantage of our global strategy of extracting superword reuses.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: While sorting randomly ordered data is a well-studied problem which has produced a plethora of useful results over the last five decades such as Quicksort, Merge Sort, and Heap Sort (see [9] for a summary), the importance of sorting almost sorted data quickly has just emerged over the last decade.
Sentence 2: the vast quantities of almost sorted log-based data appearing in data centers has generated this interest.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Prashant R. Chandra Intel Corporation prashant.chandra@intel.com With the hardware support described above, every memory access instruction in IXP is non-blocking and is associated with an event signal.
Sentence 2: when a memory access instruction is issued, later instructions can continue to run while the memory access is in flight, until a wait instruction (for the associated signal) blocks the execution of the thread.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: d)ifitis both(d, d1,f,f1)-speculatively stabilizing and (d, d2,f, f2)-speculatively stabilizing.
Sentence 2: still for the sake of simplicity, we say in the following that a distributed protocol p is d-speculatively stabilizing for speci.cation spec if there exists a daemon d .ud such = that p is (ud,d,f, f )-speculatively stabilizing for speci.­cation spec.a d-speculatively stabilizing distributed protocol is self-stabilizing under the unfair dis­tributed daemon (and hence always guarantees convergence) but is optimized for a given subclass of executions described by d.  Examples.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: µ(an :&#38;: Sig) inlineAnnotated = [propAnn (.M trans inline)]Ø M We close this section with a small example that shows how to generically annotate a tree with unique labels so as to track changes made by subsequent transformations.
Sentence 2: we shall annotate each node with a list of type [Int ] that describes its access path, i.e.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Then, the job of the type system is to guarantee that our operational semantics respects our interpretation of types.
Sentence 2: for a function, we verify that, whenever the function body starts with a marked value inhabitingin the input type and performs operations as speci.ed by the body expression, it results in a marked value that conforms to the declared result type (if it terminates).
Relationship: entailment
Domain: Software and its engineering
Sentence 1: CHEAT CONTROLLED PROTOCOL 4.1 Time Cheating In the example in Figure 1, if P2 was a malicious player, he could intentionally alter the value of d1 21, of CM1 21, or tag CM1 21 referring to the previous update message such that CM1 21 would be delivered for processing before the command message CM1 11 from P1, from which he benefits unfair situation.
Sentence 2: through time cheating a player can obtain more time to react to a game world event than an honest player.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: In order to solve this interoperability problem, our pro­posal is to base the service de.nition in open standards.
Sentence 2: theOpenVirtualizationFormat(OVF)[17] isa standard recentlypublishedbythe DistributedManagement Task Force(DMTF)1 that describes a speci.cation on how to package and distribute software to be run in virtual ma­chines.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: 2006), where structural recursions such as folds and catamorphisms are used to structure programs and systematically manipulate programs.
Sentence 2: our approach is in.uenced by the many attempts at de.ning structural recursions for speci.c graphs, such as graphs represented by trees with spe­ci.c pointers (Hamana 2009; Dal Zilio et al.
Relationship: entailment