sadat2307/MSciNLI huggingface dataset:
Domain: Software and its engineering
Sentence 1: In SRS, we take advantage of the self-cleansing property in server programs to iso­late the faulty user request from other succeeding benign user re­quests, without checkpointing or rollback.
Sentence 2: in SRS, when a crash occurs, we do not rollback state to a previously saved safe state; on the contrary, we suppress the crash and execute for­ward.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Furthermore, Wrangler introduces a notion of a con.dence measure with these predictions to overcome the modeling error problems; this con.dence measure is then exploited to achieve a re­liable task scheduling.
Sentence 2: by using these predic­tions to balance delay in task scheduling against the potential for idling of resources, Wrangler achieves a speed up in the overall job completion time.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Examples of behavioral situations are: Compared to home care systems, outdoor living assistance systems have to cope with the following additional problems: While the type of context information collected via sensors in the home area is well defined based on body vitality checks and behavioral information, this is not true for outdoor living assistance.
Sentence 2: outdoor living assistance systems may acquire context information that describes unforeseen situations (traffic jams, etc.).
Relationship: entailment
Domain: Software and its engineering
Sentence 1: The second phase reads in all of these (object) files, unifies nodes corresponding to the same symbol or function from different object files, and reapplies the propagation step to obtain global points-to information.
Sentence 2: the analysis algorithm is first applied to individual files and the internal state of the algorithm (which in this case is a points- to graph, and symbol information) is frozen and written to a file.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: If the complexity of today s computing infrastructure and of mod­ern software introduces new problems for software engineers, how­ever, it also provides new opportunities that may help in addressing these problems, if suitably leveraged.
Sentence 2: many of today s software systems are deployed in a large number of similar (when not identical) instances, used by a multitude of users, and executed on powerful computers that are mostly interconnected.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: In particular, when 7 threads are allowed, for vortex and perlbmk, the best speedup is achieved by only using around 4 cores on average.
Sentence 2: the main thread normally cannot .nd more than 4 versions with VCs above the threshold at runtime and hence saves the extra 3 cores without sacri.cing performance.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Rn is a new test or query document, then from (2) it follows that our binary classi.cation function is: T T f(q)= xopt Aq.
Sentence 2: (6) given a new document q that we wish to classify, if f(q) > 0 then q is classi.ed as belonging to the class in question, and not otherwise.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: We believe, however, that the dif.culty of the programmer s .nal task is best measured by the number of candidate locations they have to understand, and not simply the total number of source code lines.
Sentence 2: the number of source lines highly depends on the idioms the programmer uses rather than the fundamental nature of the candidate computations: a relatively simple sub-expression may span two or more lines of code or a complex computation may be expressed in a single compact statement.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: More speci.cally, my contribute will be the de.nition of a middle­ware characterised by mechanisms that enable an e.cient asynchronous delivery of messages also in presence of inter­mittently disconnected clouds of hosts in the systems, by evaluating the available context information and predicting the evolution of the mobile scenario.
Sentence 2: we agree with the current research trend which states that a cross-layering could be an e.ective way of designing more e.cient middleware for mobile computing [3].
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Veri.cation is then tackled for the input-bounded version of the linear-time logic considered in [113, 114], extended with the possibility of referring to the previous input.
Sentence 2: decid­ability of veri.cation for this logic over an input-bounded web ser­vice is decidable in EX P SPAC E (in fact, PSPAC E-complete when the arity of the service schema is bounded a-priori).
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Like many ingenious pro­gramming techniques, this one goes back to Burge s astonishing book Recursive Programming Techniques (Burge, 1975), but it was probably Wadler s paper How to replace failure by a list of suc­cesses (Wadler, 1985) that brought it wider attention, although he did not use the word combinator and described the work as folk­lore .
Sentence 2: a parser may be thought of as a function: type Parser = String -> [String] a Parser takes a string and attempts to parse it, returning zero or more depleted input strings, depending on how many ways the parse could succeed.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: We also noted that .xed-size chunking works very well for VM disk images, outperforming variable-sized chunking in some cases, thus con.rming earlier .ndings [19] stated.
Sentence 2: in small chunk stores such as those in the Ubuntu Server series experiment in Section 4.1, .xed-size chunking results in better deduplication than variable-size chunking This is good news for implementers of deduplica­tion systems, since .xed-size chunking is typically easier to implement, and performs considerably better.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: To address this, a wide range of techniques for sup­porting (semi-)automated synthesis of behavioural models have been investigated.
Sentence 2: synthesis from declar­ative requirements speci.cations (e.g., [11, 13, 21, 16, 8]) or from scenarios and use cases (e.g., [10, 20, 9, 3]), has been studied extensively.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Energy Equation E is used to capture the energy consumption of all processing elements with all tasks.
Sentence 2: .NP .NP,T .NT,L .IS(l) .NDisE = Dis,d×DRFp,t,is,d× p=1 t=1 l=1 is=1 d=1 EP (is, d) .NM EP (is, d)= m=1 Mm,is,d × AEm In De.nition 7, the equation shows the amount of energy con­sumption that is calculated by summing up the energy consumption due to data cluster accesses performed by all processing elements for an application.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: This work then lead to the development of characteristic formulae,whichcanbeviewedasan abstractlayerbuiltontopofa deep embedding: characteristic formulae hide the technical details associatedwiththeexplicit representationofsyntaxwhile retaining the high expressiveness of that approach.
Sentence 2: characteris­tic formulae avoid the explicit representation of syntax, which is associated with manytechnical dif.culties (including the represen­tation of binders).
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Inasmuch as the overall aspects of NiMo development, the paradigms fusion has meant a big challenge that required to .g­ure out many creative solutions to make both models compatible.
Sentence 2: dealing with multiple outputs and curried/uncurried compatibilityhasrequired anon-trivialgeneralization of theusual notions of polymorphic type inference to handle the process type.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: .must According to this de.nition, a store S' overapproximates an­other abstract store S if, when they are extended to the same do­main, any may constraint in Simplies the corresponding may con­straint in S ', and any must constraint in S is implied by the cor­responding must constraint in S '.
Sentence 2: the overapproxi­mation encoded in S ' through the may constraints is more permis­sive than S, and the underapproximation encoded by S ' through the must constraints is less permissive than S. In the .x rule, it is easy to see that a trivial invariant store S* always exists since the analysis creates a .nite number of abstract locations for any given program, and an abstract store Striv with constraint (true, false) mapping each possible abstract location to any other abstract location has the property .S.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: This .ltering approach .rst separates the signal eigenstates from those belonging to the noisy eigenstates and then use the signal eigenstates to con­struct an approximation of the original data by projecting the perturbed data on to the subspace spanned by the signal eigenvectors.
Sentence 2: u = UpAuAu T ,where Au is the matrix whose columns are the eigenvectors correspond­ing to the signal eigenvalues.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Again, the set of covered abstract states is not an invariant.
Sentence 2: there is a concrete state d ' such that a({d ' })=(D, t, f) from which in one step of the program it is possible to reach a con­crete state e ' such that a({e ' })=(E, t, f), an uncovered abstract state.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Given an executed instance of a BP s i, let I P D( si)m be the im­mediate dynamic post-dominator of s i, the region directed by s i, represented by R( si), is de.ned as: R( si) = (xj |s i < xj < I P D( s)m) s i is called the director of the region.
Sentence 2: r( si) is an ordered set that is comprised of the executed statement instances in between s i and the .rst instance of the immediate post-dominator of s that is executed since.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: By combining elasticity with virtu­alization, S2 E offers the illusion of symbolically executing a full software stack, while actually executing symbolically only select components.
Sentence 2: by concretely (i.e., non-symbolically) executinglibraries and the OS kernel,S2 E allows aprogram spaths to be explored ef.ciently without having to model its surrounding environment.We refer to this as selective symbolic execution.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: This concept, originally drawn from the related area of Software Process Modeling, essentially states that it would be impossible to completely evaluate all preconditions and postconditions of a workflow task, hence the workflow manager could allow the task to be executed provisionally.
Sentence 2: a task could be allowed to start before all its preconditions are satisfied, or allowed to terminate before all its postconditions are satisfied.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: It integrates the functionalities of MASM and of the conventional RTI so to expose to the overlying federate the Time Management interface proper of conser­vative synchronization, while actually supporting optimistic synchronization (hence interacting with the underlying con­ventional RTI through the interface for optimistic synchro­nization).
Sentence 2: it performs a conversion between the (conservative) synchronization mode seen by the overly­ing federate, and the real (optimistic) synchronization mode selected for the execution among the ones supported by the underlying RTI.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Every move of is matched by a move of .m.P+Y|X .
Sentence 2: if states sP|X and s P+Y|X are related P|X by BSR,then (a)everymoveoutof sis matched by a move out of s P+Y|X ,and (b) the destination states of the matching moves are also related by BSR.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: M such that u isa left and right unit for *.We can take advantageof staging andbuild better staged op­eratorsthat respectthe identitylawsofthebase operators.Thatis, the resulting staged operator can generate code that does not con­tain unnecessary operations, for all types that supportamonoidal structure.
Sentence 2: we can generically simplify x +0 and 1 * x to x in the monoids (B, +, 0) and (Q, *, 1), respectively.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: The attacker wants to know all of the following information in the reputation system, including info1 : speci.c algorithms and parameters (especially thresholds) used in the reputation system  info2 : the information in the object-user graph  info3 : feedback reputation of malicious users  info4 : feedback reputation of other users  First of all, we cannot assume that the algorithms used in the reputation systems are secrets.
Sentence 2: the security and robustness of the reputation system should not rely on the secrecy of the algorithms.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: We modi.ed SRDirector and implemented ContinuousDi­rector so that both now rigorously export the actor abstract semantics.
Sentence 2: when the .re method of either direc­tor is invoked, the director does not commit to any state changes, and it does not invoke post.re on any actors con­tained in its composite.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: More precisely, our aim is to address distribution and mobility in the context of the separation between computation and coordination that we already mentioned, and provide semantic principles that support the externalisation of the mechanisms that are responsible for managing the distribution topology of systems.
Sentence 2: we aim to provide the definition and semantics of a primitive distribution connector that can fulfill a role similar to the one played by coordination connectors in externalising interconnections between components.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Its proof, by equational reasoning, proceeds by invoking the ax­ioms Q5 and Q1: isEmpty (dequeue (enqueue x empty)) = { Q5 } isEmpty empty = { Q1 } True.
Sentence 2: we .rst apply axiom Q5 to have the subexpression dequeue (enqueue x empty) replaced by empty.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: In our experiments, we set m as 2 and lifetime as 100 time-ticks (time is virtual that ticks at each modification request).
Sentence 2: a file modified more than 2 times is clas­sified as hot, while a file in Q0 that has not been modified within the recent 100 modification requests is classified as cold.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: The implementation of the meta-level API presented herein also relies on transforming (template) ASTs, however, the built in AST transformations in Groovy are not .exible enough on their own to provide the level of customizability that we need in our frame­work.
Sentence 2: the different phases supported by our interception points would be very hard (if at all possible) to implement in that way.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: 19) : b (forall k : N (forall a: ([[ mesh]] ,bt1) (implies (<=:< 0 k (alen a)) (<=:< 0 (aget ak) (alen ([[ verts]] ,bt0) ))))).
Sentence 2: we have proved that every index in mesh contains a valid index within verts.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: We can see that it was rare for more than 2 3 defects per week to be found for a given property model team, while a conservative estimate for the defect rate for the TF team was 10 20 defects per week.
Sentence 2: the teams working in the property model architecture produced defects at less than twenty percent of the rate of that of the traditional framework team.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: As far as suggesting is concerned, according to the credibility reported in Table 7 and the results reported in [2], showing the similarity measure provided by the best NLP is expected to improve both speed and quality of humans classifications.
Sentence 2: it is supposed to decrease of 1.6 seconds the amount of time required to classify a given requirement pair and the correctness is supposed to increase 5%.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: JPL s experience with commercial .ash systems has not es­tablished con.dence that current commercial products pro­vide this level of reliability.
Sentence 2: unexpected be­havior of the .ash .le system left one of the Mars Explo­ration Rovers in an uncontrolled state facing a critical low power situation, and resulted in days of lost science activity [15].
Relationship: entailment
Domain: Software and its engineering
Sentence 1: We show that if two classical queries can recover xi with probability 1/2+ e,then xi can also be re­covered with probability 1/2+4e/7 using only one quantum query.
Sentence 2: 1 a (2,d,e)-locally decodable code is a (1,d, 4e/7)-locally quantum-decodable code.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: {e : t ' }(if e.e ) (19) tcase e: t1 of x: t2 then e2 else e3 .
Sentence 2: tcase e ' : t1 of x: t2 then e2 else e3 (if e.e ' )  Figure 5: .N Reduction we are able to .nd out dynamically whether ab­stract types are compatible, although we cannot look at their representation.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: To do this, we can invert GETBOUND() and provide the second useful prediction routine: prob = GETPROB(M, Q, N, W, bound) Although GETPROB() accurately predicts the probability that a job will start before bound, it cannot say exactly when in that time interval the job will execute.
Sentence 2: the job could start imme­diately or one second before the deadline.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Although Russo does not explicitly require forward declarations to be transparent, other restrictions of his system implicitly do.
Sentence 2: his typing rule for rec ( X : sig) mod demands that, if a type component t is forward-declared abstractly in sig,then mod must de.ne t to be equal to X.t (i.e., by writing type t =X.t).
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Thus, if the page size of flash memory is 2K bytes (we assume that a page has four sectors throughout the paper), four sectors can be read or written simultaneously.
Sentence 2: in the previous FTL algorithms for small block flash memory, if the consecutive read/write sequence is S0, S1, S2, and S3 where Sn represents the physical sector number n in flash memory, it requires four read/write operations.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Unfortu­nately, this cannot be exploited/accommodated in the ac­tual VLIW/EPIC code generation process, because predi­cate values are unknown at the time of instruction issue.
Sentence 2: two micro-instructions cannot be statically bound to the same functional unit at the same time step, even if their predicates are known to be mutually exclusive, since the actual predicate values become available only after the execute stage of the predicate de.ning instruction, and the result (i.e.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: The algorithm INTER+INTRA improved those pro­grams, as well as jess and db on both processors, and also improved RayTracer on the Pentium 4.
Sentence 2: iNTER+INTRA achieved an 18.9% speedup of db on the Pentium 4, and also achieved a 25.1% speedup on the Athlon MP, while INTER was ine.ective on both processors.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Task parallel programs generateadynamically unfolding sequence of interrelated tasks, often represented by a directed acyclic graph (DAG).Ataskexecuting on the same thread as its parent or sibling tasks may bene.t from temporal locality if theyoperate on the same data.
Sentence 2: such locality properties are a feature of divide­and-conquer algorithms.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Thus far, however, few inquiries have been made into the provisioning of cache servers [18].
Sentence 2: we lack effective procedures for navigating the trade-off between costs and performance of the caching tier, leaving operators grappling with questions such as: Given the budget and latency service-level-agreements (SLAs) for our website, how many cache servers will we need to operate?
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Ironically, there was an exploitable XSS vulnerability on this page that could be used to launch authentic phishing attacks against the com­pany.
Sentence 2: the phishing web page could be re.ected o. the company s own server, making it very di.cult for users or anti-phishing solutions to identify the page as being ma­licious.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: 4.3 Proof system Compared to the very simple proof system of section 3.4, the system for proving or refuting whether a given value satis.es a contract in Core Racket is more sophisticated, although the general principles remain the same.
Sentence 2: we rely on three different kinds of judg­ments that relate values and contracts: proves, refutes, and neither.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: In particu­lar: the tool draw astg, packaged with petrifyand in­terfaced to dot, allows the Petri net to be displayed; pet­rifyitself, when provided with a library of gates, attempts to generate the logic description of an asynchronous circuit that implements the speci.cation.
Sentence 2: di2pn can be used as a front-end to petrify.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: 9.2 C++ Array Libraries Due to its powerful type system and its wide-spread use in high­performance computing, C++ has a signi.cant number of array li­braries that are both fast and generic.
Sentence 2: blitz++ [23] and Boost.MultiArray [1] feature multidimensional arrays with a re­stricted form of shape polymorphism.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: 3.1.4 Java Web Services To support the ever-growing need for service-oriented appli­cations, frameworks have been introduced to facilitate the exposition of regular classes as services.
Sentence 2: the Java Web Services (JWS) framework [27] provides a set of annotations that can be added to Java classes, methods, and .elds, leaving it up to the underlying framework to provide the necessary plumbing to expose the annotated classes as 1 Metadata MyWebService  2 Class c in p 3 Where (public class *Impl) 4 c += @WebService 5 @WebService.name = (c.name =~ s/Impl$//) 6 Field f in c 7 Where (private * *) 8 f += @Autowired 9 Method m in c 10 Where (public * * ()) 11 m += @WebMethod 12 @WebMethod.name = m.name 13 14 MyWebService  Figure 6: PBSE metadata for Spring Web Service.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: This mechanism guarantees that the talkspurt play-out delay can be dynamically set from one talkspurt to the next, provided that intervening silence periods of sufficiently long duration are exploited for effecting the play-out delay adjustments.
Sentence 2: the computed variation of the play-out delay is accommodated at the receiver with the introduction of artificially elongated or reduced silence periods of the human conversation.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: If we look closer at the top 10 predicted se­quences and their predicted y-values (marked by blue triangles and purple circles in the .gure), these sequences are among the best se­quences in terms of their actual speedup.
Sentence 2: the best pre­dicted sequence from CFG model is the actual best sequence, which means we achieve a speedup of around 19×.
Relationship: entailment