sadat2307/MSciNLI huggingface dataset:
Domain: Software and its engineering
Sentence 1: Prioritizing executions with fewerpreemptions was veryeffectiveforfull-coverage searches us-ingDPOR.As the number ofpreemptionsgrows, theDPOR algo­rithmbecomesincreasinglylikely to swap con.icting accesses and return to an already visited state.Sleep setshelp combat thisprob­lem, but we cannot prune a portion of the state-space due to sleep sets withoutperforming atleast one redundant execution.Prioritiz­ingbypreemption counthelpsdeferthese redundant executions.In addition, testers .nd preemption points useful for identifying the root cause of abug.Traces that containfewerpreemptions are thus preferable, as theymakeit easier toidentify the root cause.
Sentence 2: the modi.edDPORpriority function alsoimproved the speed with which theDPOR search .ndsbugs.wecombined these heuristicsto .ndbugsevenfaster.TheBF(mdpor,pb)priorityfunc­tion .rst prioritizes by the modi.ed DPOR priority function, and among executions with equivalent priority it chooses executions that contain fewer preemptions.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: The threshold voltage (Vth) of the PMOS transistors increases as more traps form, reducing the drive current, which in turn slows down the rising propagation delay of logic gates over time.
Sentence 2: the NBTI-induced performance degradation strongly depends on the amount of time during which a PMOS transistor is stressed, that is, when a logic 0 is applied to the gate.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: incomplete requirements with a strong causal relation to 4 vari­ables in RE, but also to 8 variables in the project di­mension and even one in the overall company dimen­sion), or, .nally, they 4. have no direct relation to RE (except over transitive and, thus, not empirically resilient relationships).
Sentence 2: while we see good chances to use a substan­tial amount of variables for measurements in RE, we still have a large extent of variables that imply the need of fur­ther investigation on (1) means for accurate measurements and (2) extension of the variables themselves.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: For the sake of contradic­tion, assume that the barrier placement for a dependence subgraph of length l is not optimal but the .nal barrier placement for the dependence graph of length L is optimal, 1 = l < L. Let the num­ber of barriers at length l be bl.
Sentence 2: there exists another barrier placement for length l of size bfl such that bfl < bl.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: In A3, unlike the event or­der E1 depicted in Figure 3, we have possibly unbounded number of Check(false) events before Request, and these Check(false) events are ignored.
Sentence 2: the bounds corresponding to (., [0, 1]), (., [1, 2]), (., [1, 3]), (d, [0, 1]), and (d, [1, 3]) in Figure 3 are removed from the set of enumerated bounds for deriving a con­straint for A3, and therefore we cannot derive the same constraint as in Example 5.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Translating Curry into JavaScript An advantage of our design discussed in the previous section is the fact that it is not necessary to translate any Curry program into JavaScript.
Sentence 2: this is also not reasonable since the advanced features of a declarative multi-paradigm language like Curry (e.g., higher-order functions, laziness, logic variables, constraint solving, concurrency) requires a complex run-time system that must be transmitted to the client with the HTML form.4 we de.ne a class of Curry programs that are easy to trans­late into JavaScript by omitting the more complex features of Curry.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: An ideal idletime scheduler utilizes available capacities for background work (espe­cially at low foreground intensities), but begins to starve back­ground work as foreground intensities rise.
Sentence 2: back­ground performance decreases with increasing foreground inten­sity and preemption interval lengths, as illustrated by the gradient in the larger area in the right-hand graph.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: The LLM Approach The Long Lasting Memories (LLM) consortium is a European effort comprised of twelve partners from six different countries aiming to support elderly people and their families towards independent living and active ageing.
Sentence 2: a multidisciplinary team from various technological and service fields as well as with public authorities has been employed in order to provide an integrated and user-centric platform which may enable this population category to live in an autonomous way and to work or to interact with the society despite facing age­related impairments.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: PROOF.Assumethatwehavemusedbloks.Tokeepan evendistributionofbloksfrom1tondisks,m/iblokshave tobemovedfromi-1toidisksforeveryi?2.Hene, n thetotalnumberofreplaementsisatleasti'2m/i?
Sentence 2: m(lnn-1).theaverage(andthereforealsotheworst ase)numberoftimesablokisreplaedisatleastlnn-1, provingthetheorem.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: 3.1 Variability in ACCs Following the derivation by restriction mechanism either no ABIE is derived based on the ACC or an arbitrary num­ber of ABIEs are derived from the underlying ACC, as illus­trated in Figure 3.
Sentence 2: every ACC of a Core Compo­nent model has an implicit cardinality of .
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: However, weakening might allow us to type .x:t.e with a different portion of S than S0.
Sentence 2: we know that any superset of S0 has bound no less than .0, and while a non-superset of S0 may have a smaller bound, we chose S0 so that only S0 and its supersets are suitable to type the term and then weaken to S. for a function in any given context, there is a least usage quali.er, and our implementation can .nd the least quali.er by considering only the portion of S that pertains to the free identi.ers of the .
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: VeriCon models the semantics of both controller events, such as the receipt of a packet from a switch at the controller, and switch events, such as executing a rule entry in a switch s .ow table and forwarding an incoming packet to a certain port (or dropping it).
Sentence 2: sequences of events in VeriCon capture both controller-to-switch interaction and switch-to-switch interaction, making it possible to reason about SDN programs behavior for arbitrary sequences of network events (at both the controller and the switches).
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: The evaluation of the input size and the optimal num­ber of nodes is important to understand how to con.gure resource allocation through speci.c MapReduce schedulers, such as Capacity Scheduler and Fair Scheduler [21], to avoid resource wasting with allocation of nodes that will not pro­duce signi.cant gains [17].
Sentence 2: the variation of processing capacity showed in our experiments highlights the impor­tance of evaluation of the input size, block size, and cluster size adopted to obtain e.ciency in resource allocation [21].
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Adding those requirements to the standard may either (1) offer only a limited return on the non­trivial investment of effort required to de.ne a detailed and consis­tent speci.cation of those requirements (due to the small number of use cases impacted); or (2) even prove counter-productive overall (due to the potential of those requirements to preclude otherwise desirable solutions for the majority of use cases that do not have those requirements).
Sentence 2: approaches are needed that can cover those require­ments without entangling them directly with the core of the stan­dard itself.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: [6] provide a constraint satisfaction problem interpretation of the feature model con­.guration, in which the relations between one or more at­tributes of a feature are considered, in addition to the model integrity constraints.
Sentence 2: based on such an inter­pretation, their proposed method not only is able to check whether a given feature model con.guration is correct, but also to recommend the best product according to a criterion.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: When it is found that no solution can exist based on the current partial instantiation, it backtracks to the previous variable instantiated, and re-instantiates it with a different value from its domain.
Sentence 2: a backtracking algorithm has both forward (where we select the next variable and instantiate it with a value) and backward phases (where we return to the previously instantiated variable and assign a new value to it).
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Such a data sharing pattern can be expected from this stencil, since in this stencil, both the neighbors of a seed element are in the same row and there is no data sharing between two neighboring processors if they access different rows of the array.
Sentence 2: for two neighboring processors Pf1 and Pf2 to share data, the direction from Pf1 to Pf2, captured by Pf2 -Pf1, needs to be compatible with some direction vector in the stencil di­rection matrix D. In mathematical terms, such a compatibility can be formulated as follows: (Pf2 -Pf1)T D = f0.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: In the simple periodic-collection applications we measure, these thresholds are the same for all nodes; per-node thresholds allow Sympathy to monitor other appli­cations, regardless of differential transmission rates or in-network aggregation, as long as the sink knows the quantity and/or quality of data it should expect.
Sentence 2: the sink has received suf.cient packets from a node com­ponent if its S I N K PAC K E T S R E C E I V E D counter at least equals the corresponding threshold.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: In contrast, a standard SLR is driven by very speci.c, pre­cise research questions that can be answered by empirical research, e.g., best practices with respect to speci.c proce­dures, technologies, methods or tools [4].
Sentence 2: a SM could be conducted .rst aiming at providing an overview of the investigated topic and identifying whether there are subtopics with su.cient primary studies to conduct a SLR.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Due to monetary constraints as well as space and power limita­tions, the replication of each node and link is not an option in most embedded systems.
Sentence 2: we will present a hardware/software partitioning algorithm for recon.gurable networks that optimizes the task binding onto resources at runtime such that node/link defects can be handled and data tra.c on links between computational nodes will be minimized.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Indeed, DCPU producesinoutput onlypartial information about theformat of theinstruction(i.e.,thelength, the opcode, and theformat of non-implicit operands) while D1, ..., D4 output an assembly representation oftheinstruction.
Sentence 2: we can only check if the format inferred by DCPU is compatible with theformat reportedby D1, ..., D4.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: The Third Frontier Network within Ohio (more recently named OSCnet) has connected 68 of the 88 Ohio counties with OC12 links, which o.er 622 Mbps.
Sentence 2: an important questions we are also examining is How does the overhead of processing data from remote sites, i.e., the slowdown compared to applications that pro­cess data from within the same cluster, vary with the avail­able WAN bandwidths ?
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: For example, the usage interface of the design model of a concern is typically comprised of all public classes and methods made available by the concern.
Sentence 2: to reuse a concern, a software engineer must 1) se­lect the feature(s) with the best impact on relevant non-functional properties from the variation interface based on provided impact analysis, then 2) adapt the generated detailed models to the ap­plication context by mapping customization interface elements to application-speci.c model elements, to .nally 3) use the behaviour provided by the selected concern features through the usage inter­face.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: To add a third monad m, we change the type to Plus t (Plus s (Plus m Id)), and write inr (inr (inl e)) etc.
Sentence 2: the monad Id serves as a placeholder for future extensions and these extensions do not alter the currently existing code.4 As a brief example, assume that above we would have started with a recursive version of the count function.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Since it is likely that multiple ICLs will need the same parameters, we share this information in a common repository.
Sentence 2: all of our mi-crobenchmarks report performance numbers (e.g., expected disk seek time, expected disk bandwidth, time for the OS to allocate and zero a page, time to access a page in memory, time to access a page on disk) in a common format kept in persistent storage; each microbenchmark then only needs to be run once, or when the performance is suspected to have changed.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: For example, the contents of two memory buffers A and B could be multiplied and stored in a buffer C by calling the gemm() function which, given the .oating point arguments a and ß, performs the following operation: C .
Sentence 2: aAB + ßC by passing a =1.0 and ß =0.0, we obtain C .
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Unfortu­nately, it only works for packets generated by dom0 it­self; traf.c from guest VMs is routed or bridged directly, without segmentation, before reaching the NICs.
Sentence 2: a straightforward solution is simply to disallow guest VMs to send large packets and force them to segment in soft­ware before packets are copied to backend.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: records the type of each running session k. We assume that we can write G, a : G only if a does not occur in G; the same holds for .
Sentence 2: wrt sessions k. Further­more, we can write T, t : k[p] only if t is not associated to any other role in the same session k in T. a thread can participate in multiple sessions playing different roles, but it cannot participate in the same session with more than one role.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: With .at-nesting, I s reads and writes are added directly to the readset and writeset of A.
Sentence 2: in Figure 1, if a concurrent transaction Btries to modify variable i while Iis running, but before Ihas committed, then if Iaborts, it also causes Ato abort (since ibelongs to the readset of Aas well).
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: These instructions are inserted into the application at ap­propriate locations.
Sentence 2: the PVM is con.gured to handle these instructions uniquely as follows: At run time, when the protective PVM encounters any of these select in­structions, it interprets them in a custom manner, di.erent from the semantics speci.ed by the platform documentation, i.e., the protective PVM instance will interpret these instruc­tions using customized semantics, whereas other interpreter instances will interpret it in the conventional manner (e.g., according to the platform documentation).
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Finally, m0 is the memory location whose address is stored in bx.Also, Sign(Post(p)) = (R#,M #) where: R# R# (r0)=(+, +) (r1)=(+, 0) M# (m0) = ((+, 0), (+, +)) Recall that S[7]l= S[8] = (+, +).
Sentence 2: (+, 0) and lCount(Sign(Post(p))) = lx ly lz,where: lx[7] = lx[8] = ly[7] = lz[8]=1 , and all other elements of lx, ly,and lz are zero.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Figure 2: Thread scalability on Xeon Phi  3.3.2 Utilization A host process only periodically offloads work to the coprocessor, and each offload does not typically use all the 240 hardware threads of the Xeon Phi.
Sentence 2: in a single host process situation, the coprocessor not only idles most of the time, but even during offloads, it is seldom that all of its cores are used.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: In a direct-mapped cache, datafrom eachmemorylocationhas only onelocationinthe cache (cache line)where it can be stored.
Sentence 2: a cache con­.ict and thenacachemiss may occurevenif thecacheisnot full.Thesemissesareknownascon.ict misses.Ina set-associative cache,datafrom each memorylocationhas a set of several cache linesinthecache whereitcanbestored.Thesetsofcachelinesare disjoint.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Transforming the constraint speci.­cations (which are transformation rules using a special syntax that transform objects of the source metamodel to objects of the target metamodel) into a metamodel that is used by the transformation tool to encode transformation rules is a form of a HOT.
Sentence 2: in MTS we de.ne a HOT to transform the constraint speci.cations into what we call a Variability Meta Model (VMM).
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Otherwise, if a process sets M = {m ' ,m}in round r,it sets v at lines 28 or 42, or crashes; according to the algorithm, since p delivered m ' at lines 23 or 37, any process that sets v, at lines 28 and 42, respectively, sets v = m ' .
Sentence 2: any process that sets v in round r sets v = m ' .
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: For example, we should stop the monitor for x in Figure 5(a) at the end of the IFR for the second access to x, not the .rst.
Sentence 2: at release calls, we insert stop monitor calls only for variables in A[p] - RW[p] (i.e., variables for which this program point does not fall in an IFR).
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: ,.. ,, , oi,toi to= x(1,( ()+ 1 i (25) () Matdo)) ii From expression (20), any instructionoi.O must start executing no later than (l+ 1 doi).
Sentence 2: () equation (25) transforms to: Min l 1 ()),t ((+ do) i .
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Control mecha­nisms should respect and retain this loose coupling at the business level, and consequently, should be non-intrusive to the core business logic of an application.
Sentence 2: the control mechanisms and core business logic should also be loosely coupled, to allow changes to the service/component structure at both management and business levels with min­imal e.ects on each other.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: For example, the Linux kernel is executed in ring 1 instead of ring 0 of the IA-32 (user-level processes execute in ring 3 as in standard Linux and run unmodi.ed Linux binaries).
Sentence 2: operations which require the privileges of ring 0, e.g., page table updates, are provided through a different interface rather than virtualised one.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: A Synchronous Embedding of Antescofo, a Domain-Speci.c Language for Interactive Mixed Music * Guillaume Baudart  Louis Mandel ABSTRACT Antescofo is recently developed software for musical score following and mixed music: it automatically, and in real­time, synchronizes electronic instruments with a musician playing on a classical instrument.
Sentence 2: it faces some of the same major challenges as embedded systems.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: When a process pi completes WriteInView in line 62 of Tra­verse, the latest state of the register has been transfered to desired-View, and thus it is no longer necessary for other processes to start traversals from earlier views.
Sentence 2: after Traverse completes re­turning desiredView, pi invokes NotifyQ with this view as its pa­rameter (lines 15, 20 and 25), to let other processes know about the new view.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: For example, different content can be made available to developers, administrators, and solutions consultants or even third parties for industry or customer specific solutions as well as to managers, team leads, and various other administrators, analysts, and other users of a solution.
Sentence 2: [8, 9, 11, 20] a key aspect to all design is in determining and defining what interfaces are to be visible and what is to remain transparent in a system of systems and services.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Notethatsinethereareafnitenumberofparameters introduedbySan,thesimple­onstraintproedureisguar­anteedtobeexeutedonlyafnitenumberoftimes.Thus toensureterminationitissuÆienttoarrangethesimplif­ationproedurestoalwaysterminate.
Sentence 2: itisinstrutivetoonsiderinwhatsituationsthesolver fails.Ithappensifthesimpliferproeduresarenotaspow­erfulastheompilerinreasoningaboutexpressionequiv­alene,aswouldbetheasewiththeabovesimpliferfor memorystatesintheaseofaompilerthatperformsag­gressivealiasinganalysis.mostoftheefortinmain­tainingatranslationvalidatorisspentinthesimplifers.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: If we expect the system to have an upper-bound around 3000 tests, we might be satis.ed with a margin of 100, or 10 around the actual failing case.
Sentence 2: if a test fails for UB and succeeds for LB with the difference between these two less than a given margin, then no tests need to be tried within that margin.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: L(Tn2 ) that contributes to strings in the pre-T2 lan­guage, that same substring will be included in L(Tn1/n2 in the post-T2 .ow graph.
Sentence 2: property (1) holds.8 Property (2) also remains vaild throughout the construction because the T1 and T1 transformations do not a.ect the total num­ber of leaves in the forest of annotations.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: According to Lemma A.1, no suc­cessful SC(svar) can happen inside S. Consider an execu­tion of a LL-SC block on svar.
Sentence 2: there are two cases: case 1: the successful SC happens before S. the whole LL-SC block happens before S. Obviously, the theo­rem holds in this case.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: For example, consider the counterexample in which both arguments of the outermost Add constructor contain values causing the failure: Add (Div (C 1) (Add (C (-2)) (C 2))) (Div (C 0) (Add (C (-1)) (C 1))) Since no matter what random value the .rst .eld of the outermost Add constructor is replaced with, the property fails by Add s second .eld, and vice versa for replacing the second .eld.
Sentence 2: the universal generalization algorithm might return the formula forall values x0 x1 .
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Moreover, the algorithm used to select a particular job at a particular time from amongst the various queues is not typically published and can potentially change under administrator control.
Sentence 2: while the implementation of multiple policies for a given machine through multiple queues can provide a high-level, qualitative expectation of how a speci.c job will be treated, it substantially complicates the problem of making a quantitative prediction for that job s wait time.
Relationship: reasoning