sadat2307/MSciNLI huggingface dataset:
Domain: Software and its engineering
Sentence 1: To make the algorithm incremental, we design it in such a way that it does not execute one code fragment on all generated inputs; instead, it tries to execute all code fragment (Line 7) on one input .rst and partition them into smaller sets (also called code clusters).
Sentence 2: the whole set can be gradually partitioned into functionally equivalent clus­ters with more and more inputs (Line 6).
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Recall that an aasumption that is not invali- dated by any regular property or desired result in a superim- position (or in a roletype) is considered an implicit regular property of the same (if not declared as "basic").
Sentence 2: in row six of Table 3 (in contrast to the same row in Table 2) there is a contradiction between a result of B (--p) and an assumption of A (p) that is not invalidated by any result or property of A.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: p1(let z =(1, 2) in (1, 2)) Further, we must be able to instantiate under nested bindings be­tween the binding in question and its use.
Sentence 2: (inst-2) must allow additional bindings E2 and E2 ' between R and the let and 1 It is the conventional wisdom of distributed programming that in any cases of this sort early binding is extremely wicked, and every opportunity must be taken to allow for variability.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: As in SSBA, the essence of this impossibility lies in the requirement that if a Byzantine node changes its input value, the output value of the repetitive consensus does not change.
Sentence 2: in CC, even if all non-faulty nodes have all the input values of all nodes, they cannot di.erentiate between a non­faulty node that has changed its value, and a Byzantine node mimicking a new input value.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Consider every predicate expression as being mapped to a set of locations.
Sentence 2: assume a set of location sets, {L1 = {.11 ,.12 , ....1m1 }, L2 = {.21 ,.22 , ....2m2 }, ... Lk = {.k1 ,.k2 , ....1mk }}, where Li corresponds to locations associated with predicates that reach call-site i of procedure P .
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: For example, in continuos sensing it has been shown the relevance of modifying classi.cation parameters at runtime; (iii) classi.cation accuracy is inversely proportional to the number of treated classes [11] [5].
Sentence 2: modern architectures stemming from these requirements should exhibit a certain degree dynamism and .exibility and make applications able to autonomously WORKSHOP: MCW interoperate and recon.gure.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: 2.4 Impact Analysis Although test suite reduction has a number of advantages, it is not always appropriate (e.g., even though reduction approaches can maintain 100% requirement coverage, they may have di.erent fault detection behavior from the original test suite [23]).
Sentence 2: developers often prefer impact anal­ysis-based approaches [13, 17, 18, 20] that use static and dynamic analyses to determine which tests could possibly be a.ected by a source code change.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Parallelizing Eduction The semantics of NVIL is a good basis for executing NVIL pro­grams but does not take advantage of distribution in the case of par­allel architectures and does not memoize computed values to avoid recomputation.
Sentence 2: we have designed a parallel Eduction Virtual Machine (EVM) to execute intensional NVIL programs.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Since S only has arcs to nodes corresponding to Ts s instructions de.ning r, this is clearly a cut in Gf .
Sentence 2: by the construction of Gf , for a given cut C in Gf , the number of dynamic communications of r that will be executed corresponds to the cost of the arcs in C. the problem of .nding theminimum number of dynamic communications reduces to .nding a minimum cut in Gf .
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Figure 9 con­ tains an illustrative implementation of this simple abstract interpreter.
Sentence 2: our systematic pre-generation of op­timized derivatives needs to account for selective generation of reference count operation optimized derivatives, e.g., for binary operations the following four optimized derivatives are possible: both reference count operations can be removed,  the top-of-stack operand s reference count operations can be removed,  the reference count operations of the second element on the operand stack can be removed,  no reference count operations can be removed (this cor­responds to the standard implementation).
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: We note that the language of these properties are timed-pre.x-closed, timed-su.x-closed sets of interval-timed traces, and hence the properties are pas­sively testable.
Sentence 2: as described in Section 2, passive test­ing corresponds to checking of membership of the observed interval-timed traces of the HBM in the language of these properties.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Using Type a does notwork becauseit would notbe possibletode.neatypeequality mechanismoverit.Thedrawback ofthe use of Var isthatHaskelltypeinferencemechanismfails to unify Var withany type, likeit woulddowithanormalHaskell type variable.
Sentence 2: we cannot solely rely on the Haskell type­system and thus have to create our own uni.cation mechanism (Section5.4).
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: A statistical test was performed, Wilcoxon-Mann-Whitney rank sum [8], and we could reject the hypothesis that FRAN is not favorable to FRIAR in more than 50% of comparisons in the top-10 and top-15 cases (p-vals of 0.0034 and 0.00034 respectively), but not in the top-5 case (p-val of 0.83).
Sentence 2: statistically, FRAN more often than not does better than FRIAR.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: if ( join attribute value t.v is already inserted in   LHist(BTi)) then increment the frequency relative to t.v in LHist(BTi); .
Sentence 2: else add the couple (t.v, 1) to LHist(BTi); Endif }} the associated records of local histograms on all map­pers are sent to the same reducer.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: RELATED WORK AND DISCUSSION Previous work has studied transactional memory consistency by: investigating the semantics of different programming languages with atomic blocks and the feasibility of their ef.cient imple­mentation [1, 11, 19]; or  de.ning consistency conditions for TM [3,5,8,9,18] and proving  that particular TM implementations validate them [4, 9].
Sentence 2: previous work has tended to address the issue from the per­spective of either programming languages or TM implementations and has not tried to relate these two levels in a formal manner.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: For ex­ample, it is possible to express policies that disallow system calls for opening .les in the host computer, or to block ac­cess to network services after reading data, but it is hard to encode the dynamic behavior of a high-level policy, which takes an authorization decision based on the current condi­tions in its running environment.
Sentence 2: the model of the policy environment becomes a cru­cial element for enforcing dynamic policies.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: To make program behavior deterministic, we stipulate that these actions are executed in the order of their textual occurrence in the program.
Sentence 2: when Ambiguous Example 1 receives an A event, it executes first the action x=1 and then the action x=2, leaving x holding the value 2 when the action !>B(x); is executed.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Clearly, #l(z) _> t + 1, and f(y) = 0 for every y with #l(y) = #l(x) --1.
Sentence 2: since t = 1, #l(x) > 2, and it is possible to switch two of the rs in x to 0, getting two input vectors yl,y2 with #l(yz) = ~l(y2) = #l(x) -1, and hence with /(yz) =/(y2) = 0, and both yz and y2 differ in exactly one bit from x.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: are the "potential query terms" that can be used to retrieve additional requirements for the complete search.
Sentence 2: thcse terms comprise a conceptual space that can charectcrize requirements space R. It is a highly labor-intensive task for uscrs to gcncrato such a long list of elsboretive (similar/alternative) queries with an expectation of not missing any important requirements terms.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Overall, females had significantly more pauses than males, with a mean of 220 versus 190 occurrences (ANOVA, p<0.05, F[1,74]=4.22, R2=0.05).
Sentence 2: males did not take the time that might have been used to reflect upon the feedback from their actions as often as the females did.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Furthermore, most UIs have been developed only for a 2D environment in mind: their 3D integration is not seamless and not straightforward.
Sentence 2: there are many reasons to de-fine and test a method for systematically producing a 3D UI simi-larly to methods existing for 2D UIs, while taking into account specific characteristics of the 3D world and what is needed to en-sure a smooth transition between 2D and 3D.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Co-iteration consists of associating to each stream a transi­tion function from old state to a pair of a value and a new state, and an initial state.
Sentence 2: in Haskell we can model co-iterative streams as follows: d a t a S t r e a m a w h e r e S t r e a m : : ( s t a t e .
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Though the above mechanism may compromise the atomicity of a weak-lock protected code region, we always preserve the in­variant that only one thread holds a given weak-lock at any given time.
Sentence 2: recording and replaying the exact order of forced weak­lock release and reacquire operations with respect to instrumented weak-lock operations is suf.cient to guarantee deterministic replay.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: [7] explain the challenges of formalising such an ecosystem, players need to realise their role, and manufacturers need to face risks such as opening their product interfaces, knowledge bases and source code to other parties.
Sentence 2: the formalisation of business rules that enforce the required openness to support open innovation while preserving the intricate properties specific to ES, such as real-time constraints and safety, is required.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: 3.2 Application of the Model The interpretation and analysis of the amount of time for the communication tasks at arvato services healthcare based on the VSM leads to the following assessment of the IC structure: the site manager spent lots of time for daily visits at the warehouse or operational issues (System 3*) and meetings with staff (System 3).
Sentence 2: there was no time for System 4 and System 5 func­tions which nobody else carried out.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: For example, in their analysis of the Apache server OSS development community, Mockus and colleagues found that of 3,060 individuals who submitted a total of 3,975 CRs, a subset of 458 individuals submitted the 591 CRs that were addressed in subsequent code releases [15].
Sentence 2: increased noise is a downside of the openness of OSS development.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: If a method s hash is the same as before, then the method did not change between ver­sions, and for those methods VMV(N ) boils down to just check­ing that the extracted necessary conditions are also suf.cient (i.e., col.5).
Sentence 2: we focus on those methods whose semantic hash changed; these are the cases where the semantic assumptions car­ried over from previous versions should enable the proof of the modi.ed code.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: In terms of A-FSMs and state matrices, if an A-FSM is deterministic, it is possible to search for Adaptation Cycles and Adaptation Races by looking for paths of transitions among multiple states whose active rules contain predicates that are satis.able on the same bit string.
Sentence 2: in order to detect these faults, it is necessary to consider all proposi­tional context variables, not just the subset relevant to the active rules of a speci.c state.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: When using suspend/resume, on the other hand, we observe that the trend is for the wait times to not vary with the requested duration and for the slowdowns to exhibit a slight decreasing trend.
Sentence 2: all requests are treated more fairly, although the overall average does increase (the shorter requests, which make up the majority, have longer wait times because they no longer skip the queue, thanks to back.lling).
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: let rec run () = match try Some (Queue.take queue) with Queue.Empty -> None with None -> () | Some t -> Lwt.wakeup t (); run () Thefunction yield creates a suspended thread, adds the thread to the end of the queue and returns it.
Sentence 2: a thread waiting for an expression yield () to terminateisstopped untilresumedbythe scheduler.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: The constraints are extracted from (a) the system architecture and requirements (e.g, a cruising speed must be between 10 and 150 kmph); (b) user requirements for a particular scenario, and (c) soft constraints that represent testing knowledge, i.e., the veri.cation expertise which biases test generation towards interesting areas [7].
Sentence 2: a generation of a test can be seen as a solution of a series of CSPs [9].
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: In contrast, the categories with less studies are security, MLT, RSVM, and testing.
Sentence 2: it is argued that optimization, GC, and ES are evidence clusters (i.e., where there may be scope for more complete literature reviews to be undertaken), whereas security, MLT, RSVM, and testing can be regarded as gaps (i.e., where new or better primary studies are required).
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Then nc = rankc(j1) - rankc(i1 -1) represents the number of suf­.xes pre.xed by p and preceded by c whichisactuallythe number of su.xes pre.xed by cp.
Sentence 2: we deduce that j2 = i2 + nc - 1=(C[c]+ rankc(i1 - 1) + 1) + (rankc(j1) - rankc(i1 - 1)) - 1= rankc(j1)+ C[c].
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: The majority of the respon­dents(56%) originatedfrom twoIT companies and one com­pany in consumer electronics in the Netherlands the rest (44%) originatedfrom various companiesin theNetherlands and other countries.
Sentence 2: it is not surprising that 80% of the respondents originated from Holland, followed by the United States (5%), India (4%), and the United Kingdom (1%).
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: We have I(E3E2E3E1, 2) = {E2E3} because tc(E2E3) and tc(E3E2), respectively, generate instant test cases in form of [N] - [N] + [N] and [N] + [N] - [N], where right associativity only affects the calculation result of the former one.
Sentence 2: we have our .nest-grained faults: F(E3E2E3E1) = {E2E3}  4.3 Algorithm In this section, we present a detailed pseudo code for an au­tomatic fault localization.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: However, only a partial swap of COI processes is possible: MPSS uses buffers on the Xeon Phi to hold data that has been transferred from the host, and these buffers cannot be swapped as they are pinned.
Sentence 2: a COI process can run out of coprocessor memory and crash, which is especially an issue on coprocessors since their physical memory (8-16GB) is much lesser than the typical physical memory of host processors.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: INDICATOR considers a constraint candidate as real, if a) all the violating test cases fail and at least one of the satisfy­ing test cases passes; or b) all the test cases fail, and the error messages of the violating test cases look alike to the description of the constraint can­ didate.
Sentence 2: iNDICATOR first invalidates a candidate, if some of its violating test cases pass.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: and Cheek Raise are related to the risorius and the zygomaticus mainor-major respectively.
Sentence 2: we captured a subject in fa­cial expressions loosely based on Lip Corner Puller and Cheek Raise in Facial Action Coding System (FACS) using a high de.­nition Sony HDR-SR12 video camera with 29.97 fps.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Now, let v beavariablevertexin V whose outgoing arcs reach con­text vertices {c1 ··· cn}.
Sentence 2: obviously, v can be diagnosed through any of the context vertices, say ci,where 1 = i = n. in our mapping, we represent each context vertex c with a binary in­teger variable xc; i.e., the value of xc is 1 if and only if v can be diagnosed through c. Otherwise, xc is equal to 0.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: An increase of instruction-level parallelism results in an increase of register count as well as FU port count for concurrent access [9].
Sentence 2: according to this disadvantage of VLIW architectures, the Transport Triggered Architecture (TTA) [10] processors have been de­veloped to reduce the demand of general-purpose registers and to improve the utilization of FUs.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: The semantics of CoJava interprets a program as an optimal nondetermin­istic execution path, namely, a path that (1) satis.es the range conditions in the choice statements, (2) satis.es the assert-constraint statements, and (3) produces the optimal value in a designated program variable, among all execution paths that satisfy (1) and (2).
Sentence 2: to run a CoJava pro­gram amounts to .rst .nding an optimal execution path, and then procedurally executing it.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: 2.1 Layout policies We anticipated somewhat early in the development of Ganeti that the actual policies for the layout of virtual machines across (pairs of) physical machines might differ based on site policies and thus decided that the actual policy should be left to external scripts, while Ganeti itself should just implement the mechanism.
Sentence 2: we have a documented API (called the IAllocator API) for things like given cluster state X, on what pair of machines should new virtual machine with speci.cations Y be placed?.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: To make the comparison consistent, wegenerate the sub­mission schedule withasubmissionduration of554 seconds, record itintoa .leand useitthroughouttheexperiments.Thesizedistri­bution of eachGrepjobfor this experimentis showninTable5 andisbased onthe experimentsperformedbyZaharia et al.[24].
Sentence 2: our scheduleis representative ofa typical workload of apro­ductionMapReduce cluster with a mix of many smalljobs with a single map taskperjob, and afewlargejobs with morethan100 map tasksperjob.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: At this point, the reader might be wondering why the prob­lem could not have been solved as follows, using the original form of try: try case Expressions of Pattern 1 -> Body 1; ... Pattern n -> Body n end catch Exception 1 -> Handler 1; ...
Sentence 2: exception m -> Handler m end The di.erence is that in this case, all the success actions Body i, as well as the pattern matching, are now within the protected part of the code.the catch...end section will handle all exceptions that may occur not only those within Expressions.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Because no complete methodologies address the concern location and comprehension problem, more development time is spent read­ing, locating, and comprehending source code than actually writing code [25].
Sentence 2: a software development organization could Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for pro.t or commercial advantage and that copies bear this notice and the full citation on the .rst page.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Process Pmr is not one of Pmo,.--,Pmr-~, since it enters Filters[r], and therefore succeeds in Filters[Of .... , Filters[r -1].
Sentence 2: there are processes Pmo,---,pm._~,pm~ that enter and fail in Filters[Of,..., Filters[r -1], Filters[r], respectively.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: *) fun destroy gconsumer = fn xs => let fun next [] = NONE | next (x::xs) = SOME(x,xs) in gconsumer (next, xs) end Again,thekeyoptimisationisthat(ignoringeffects) List consumerList "' "' (destroy gconsumer) (unfoldr (next,s)) = gconsumer (next,s) . '
Sentence 2: "' " generator consumer generator wecanagaineliminatetheintermediatelistpassedfromunfoldr todestroy,andinsteadpassthe(next,s) generatordirectlytotheconsumer,whereitcanlikelythenbeinlinedintoaloop.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: For example, the hardware may implement rollback of memory state, but rely on the programmer or compiler to retry transactions that abort, sometimes using backoff protocols to ensure that a given transaction eventually commits.
Sentence 2: it is helpful to distinguish the memory model for TM, as the essential memory semantics that the hardware implements, from the pro­gram model, as the semantics that the programmer sees.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Broadly speaking, we have chosen to link all the mistakes (form or substance) of the learner to items of knowledge (basic), knowing that these links can be propagated (as in the exercises) bybottom transitivity to all nodes of the tree representing the ontology.
Sentence 2: at a given item may reflect several errors, each of which provides an indication of its non control by the learner.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Moreover, they do expose different optimization .ags, and they likely use different optimization passes in their internals.
Sentence 2: one of Pathscale or Intel compiler may very well work better than PGI with the technique described in the present pa­per, as well asin the possible future ones.Forexample they may exhibit quite different sets of con.icting .ags.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: The bene.ts of the SMDS concept still have to be val­idated in practice.
Sentence 2: alongside the development of the SMDS concept, we have been implementing a proto­type of such a self-con.guration and -management system, called COMPASS (Con.guration, Organization and Man­agement Prototype for Autonomous Systems of Systems).
Relationship: reasoning