sadat2307/MSciNLI huggingface dataset:
Domain: Software and its engineering
Sentence 1: Piernot and Yvon s AIDE system [7, Chapter 18] provides developersasystem substrate for creating application-independent PBD so that developers can add advanced macro capabili­ties to Smalltalk applications without re-implementing ev­erything from scratch.
Sentence 2: aIDE adopts a hier­archical representation of the application history and AIDE generalizes arguments in different events of the same class.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: The unusual-profile hypothesis provides guidance for these choices.
Sentence 2: it suggests that: (1) dissimilarity metrics should emphasize unusual aspects of profiles; (2) the number of clusters formed should be a non-negligible fraction of the population size, so that unusual executions will be separated from other executions; and (3) the sampling method should ensure that small clusters, which correspond to executions with unusual profiles, are sampled.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: A number of authors have recently observed [24, 20, 17] that these two approaches can play complementary roles in the veri.cation of general trace based program properties, expressed in temporal logics: type systems can be used to compute program abstractions, which can in turn be used as inputs to model checking [26].
Sentence 2: type analysis can serve as a technique for model extraction [16] in this setting.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Our experimental analysis shows that the proposed ap­proach is very successful in practice and reduces total disk energy on average by 18.17%, as compared to an execution without any power management, and by 11.55%, as com­pared to an execution that employs disk with low-power capabilities without our approach.
Sentence 2: pro­viding compiler support can bring additional savings over what could be achieved using hardware-based power man­agement alone.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: In their .rst article on delimited continuations [13], Danvy and Filinski brie.y described a variant of shift and reset, known as shift0 (S0) and reset0, where the operational semantics of the con­trol delimiter reset0 coincides with that of reset, but shift0, when capturing a continuation, instead of resetting it, replaces it with the inner-most delimited continuation pending on the metacontin­uation.
Sentence 2: in contrast to shift, shift0 removes the con­trol delimiter along with the captured continuation, which makes it possible to use shift0 to access continuations arbitrarily deep in the metacontinuation by repeatedly shifting continuations.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: The beanplot uses a Gaussian kernel density estimator to show the shape of the distribution for the CE values of test suites resulting from a speci.c prioritizer [10].
Sentence 2: the beanplot em­ploys the non-parametric kernel density estimator to create a smooth curve where a wide area indicates a concentration of values, such as a CE score, and narrow regions suggest the relative dearth of points.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: #include  #ifdef WORLD char * msg = "Hello Worldn"; #endif #ifdef BYE char * msg = "Bye bye!n"; #endif main() { printf(msg); } Figure 1: Example C program generating all variants.
Sentence 2: we want to check types before running the preprocessor with a speci.c feature combination but still guarantee that all variants compile after generation.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: This reference frame­work has been applied on the development of two open­source platforms, Hulotte and FraSCAti, to validate the acquaintance of the introduced concepts.
Sentence 2: we demonstrated that the adoption of this reference framework leverages on the integration of domain-speci.c requirements from the perspectives of the domain expert and the applica­tion developer.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Given the level l, l =1, 2, ···,L, and the chunk c, the corresponding chunk delay is   [() ] Sc Sc - 1 d(c, l)= + ceil + l - 1- (14) RSWR This delay will be periodic of period S, as a burst of S chunks will be received at the same time by nodes at same level.
Sentence 2: the most recent chunk of the burst will experience the lowest delay, the oldest chunk of the burst will experience the highest delay and the delay di.erence among two next chunks in the burst is T .
Relationship: entailment
Domain: Software and its engineering
Sentence 1: If 10% of a program s execution requires holding a speci.c lock, no amount of par­allelism can ever result in more than a ten-fold speedup [1].
Sentence 2: if a single lock protects multiple variables, the lock itself may cause a false con.ict: two tasks using di.er­ent variables may not execute concurrently as they require the same lock.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Under PAST, the current interval is predicted to be as busy as the immediately preceding in­terval, while under AVG, an exponential moving average with decay Nof the previous intervals is used.
Sentence 2: at each interval, we compute a weighted utilization at time t, Wt, as a function of the utilization of the previ­ous interval Ut-1and the previous weighted utilization NxW...tu... Wt-1.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: In addition to Nygaard and the authors, a large number of people have been involved in the development of BETA and the Mjølner BETA System including colleagues and students at Aarhus University, The Norwegian Computing Center, Oslo University, Aalborg University, and Mjølner Informatics A/S.
Sentence 2: the contributions of Dag Belsnes and Jørgen Lindskov Knudsen are acknowledged.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Optimally partitioning the work metrics between the two endpoints may be described by first visualizing two fictitious pointers that initially start at the left endpoints of the two segments and then trace the sub-parallelization graph as the pointers move towards the right endpoints of their segments.
Sentence 2: if the pointers are assumed to have coordinates (x1 ', y1 ') and (x2 ', y2 '), then the corresponding point in the sub-parallelization graph would have coordinates with a work metric of x1 '+x2 ' and an execution time of max(y1 ', y2 ').
Relationship: entailment
Domain: Software and its engineering
Sentence 1: In Idris, it is especially important to re­duce the size of the subterms being scrutinized when possible, be­cause the coverage checker can take signi.cant time when checking deeply nested patterns.
Sentence 2: the constructor for references to global names contains three subterms: whether the name is a function, constructor or type constructor;  the fully-quali.ed name; and  a full type annotation.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: The key is to specify when computations can proceed in parallel in a way that is (1) simple enough for programmers to reason about and rely on, and (2) .exible enough to accommodate im­plementation limitations.
Sentence 2: we are interested in starting with an implementation that was designed to support only sequential computation, and we would like to gradually improve its support for parallelism.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: By the induction hypothesis, there exist placements Ri for every subtree Li, as good or better than both Pi and Qi.
Sentence 2: each Ri is a correct placement for Li, therefore they enforce all dependences not carried by L and not lying in the body of L. We can extend the local placements Ri to a placement R for L by placing a barrier after each statement in the body of L (this is brute force, but enough for what we want to prove).
Relationship: entailment
Domain: Software and its engineering
Sentence 1: The essential property that makesit possible the safe introduction of a circularity is Law 3.3, which states that the computation of the second component of type z is independent of the particular algebra that is passed to g. This is a consequence of the polymorphic type of g. Therefore, we can replace inF by another algebra and we will continue producing the same value z.
Sentence 2: we can take k asthisother algebra,andinthatwaywe are introducing the circularity.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: One of the central properties of multistage configuration trees is that any connected path from the root node to a leaf node must be a monotonically decreasing (i.e., monotonically not increasing) sequence in the space of available feature choices.
Sentence 2: children must honor the feature decisions made by their ancestors and may optionally decide to make additional feature decisions that further constrain the space of available feature choices.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: 4.3 Semantics Jacques s semantics is like that of ClassicJava,with some modi.cations and additions; the changes are de.ned in .gure 11, with additional supplementary functions de­.ned in .gure 12.
Sentence 2: many of these rules per­form the additional run-time checks necessary to ensure that acquisition is well-de.ned.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: We have provided a generic notion of UI families, have presented tool support, and have evaluated our approach by application to a commercial real-world UI family.
Sentence 2: we have demonstrated the bene.ts for evolution of UI families: Modi.cations need to be performed just once on the abstract product family model and can be au­tomatically propagated to numerous individually customized products without loss of customizations.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: While JXTA aims at providing interoperability, plat­form independence and ubiquity for P2P wired networks (where con­nections are normally stable), Expeerience introduces management of intermittent connections and of multiple physical interfaces, increas­ing the potential of resource discovery, and providing a code mobility service, in order to give better support to wireless mobile ad hoc net­works.
Sentence 2: resource discovery is based on the mechanism of publishing/discovery of advertisements containing the information that each peer wants to share.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Statistical methods such as Analysis of Variance (ANOVA) [24] and Princi­pal Component Analysis (PCA) [25] can be used to analyze the data in this space and measure correlation among data samples.
Sentence 2: pCA can .nd a principal component (a vector in the d-dimensional space) that along this vector, data points are highly correlated.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: The intuition behind our approach is conceptually simple: if the ENV THREAD operation commutes with all of the MUT THREAD s operations, then we can shift the ENV THREAD s operation to not interleave with the MUT THREAD.
Sentence 2: we can always produce a linearization of the concurrent his­tory by simply moving all of ENV THREAD s operations be­fore or after the operations in MUT THREAD.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: The arrow is in call by value, by which we mean that in t u, the argument u is evaluated .rst, when it is not already a value: ) (te u+ || p> > p u+ µ x+ .
Sentence 2: (te || x+·p> if u+ is not a value ] (te V || p> >p (te || V ·p> contexts of the type A .
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Field access ownership violation.
Sentence 2: class D{} class C{ D f; C(D f){this.f=f;}} ... c1=new C(new D());c1.f becomes D d1=new D(),C c1=new C(d1);d1 the value new D() that was originally owned by c1, is now an independent value d1.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: In this paper we describe Poli-C, a language extension and runtime that exposes new OS resource management fea­tures to application programmers with the goal of allow­ing applications to tailor resource management to their own needs rather than relying on the one-size-.ts-all approach supplied by modern operating systems.
Sentence 2: we have added a powerful new statement to C that provides re­source guarantees and limits in such a way that programmers can set resource management policies for, and among, hier­archically parallel applications.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Between these two extremes, other for­mulations are possible; an excellent discussion of plausible de.nitions of determinism is given by Lu and Scott [27].
Sentence 2: the executions are SyncOrder deterministic if they, in addition to agreeing in the .nal result, contain the same synchronization operations, executed by the same threads in the same order.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: On the other hand, in August 2010, the Pex team added a new feature, Test Promotion, to allow developers to easily turn an auto­matically generated test into part of the traditional unit tests man­ually written by the developers.
Sentence 2: when the developers like a generated unit test, they can click on the Promote button to turn it into a manually written unit test .
Relationship: entailment
Domain: Software and its engineering
Sentence 1: FraSCAla therefore provides a versatile and homogeneous approach to design the structural model of an ADL before deriving the associated language.
Sentence 2: we illustrate in this paper how FraSCAla canbe usedtobuild ageneric com­ponent model that is then re.ned towards an ADL for the Service Component Architecture (SCA) industrial standard.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: As we will illustrate through examples, the consequences of this additional .exibility can be powerful and subtle, allowing the be­haviour oftheimplemented system todifferdramaticallyfrom that of the atomic system.
Sentence 2: the adversary can manipulate executions so that low-probability worst-case results in the atomic systembecome much moreprobablein theimplemented system.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Because b is well-aligning and v bx, there exists a j such that v ~xj and b xj .w = bx / xj <w for any w. In fact, that j must be i, by the same argument as in the proof of Lemma 19.
Sentence 2: fs = xi bx, a fact that we shall use below.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Notice the dif.culty of updating the global heap, especially the part modf * modf .
Sentence 2: using only the local speci.cation of find, one would not be able to prove that ¬y(f * )c. Indeed, the problem is updating the reachability of elements that are outside mod; in more complex situations, these elements may be far from the changed interval, and their number may be unbounded.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: We concede that our high-tech prototyping attempt might have been just as unsuccessful as low-tech prototyping if we had started the former on a blank slate , as opposed to showing participants how they could import characters from the SC libraries and drag these characters around on a themed background.
Sentence 2: it was likely that high­tech prototyping resulted in more creative designs because it was based on the laminated cut-out model [24], which was effective in stimulating children to generate ideas for low-tech prototypes.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Additionally, the library ex­pander produces straightforward code amenable to optimizations like copypropagation and procedure inlining.
Sentence 2: no run­time indirects are required to determine the values of either local or importedvariable bindings.To date, wehave tested the imple­mentation under Chez Scheme, Chicken Scheme, Gambit, Gauche, Ikarus, Larceny, and MzScheme.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Workflakes has adequately demonstrated the process- based software adaptation controller concept in the case studies covered here.
Sentence 2: while the instrumentation and measurement facilities by themselves may reduce a feedback loop that was previously entirely manual from days or weeks to hours, Workflakes has shown that an automated controller can fia'ther reduce the consequently determined software adaptations from hours to minutes and seconds.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: This ap- proach is based on three key elements: (i) formal program annotations concerning "mechanical" program properties, significantly extending ideas from [i0, 14, 13]; (2) maintain- able consistency between implementation and design intent via composable static program analyses, building on ideas from [22] and other sources; and (3) a step-by-step process for recording design intent and establishing assurance.
Sentence 2: increments of assurance are obtained from incre- ments of effort in declaring annotations and policy, and in carrying out the analyses that relate annotations and policy with source code.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: In the second part of the paper, we take a closer look at the com­position of two GLAV mappings.
Sentence 2: we break GLAV mappings into a small number of well-studied classes (including LAV and GAV), and complete the picture as to when the composi­tion of schema mappings from these various classes can be guaran­teed to be a GLAV mapping, and when they can be guaranteed to be conjunctive-query equivalent to a GLAV mapping.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: In order to solve some of the problems mentioned above, several researchers proposed methods to measure the functional size of UML models.
Sentence 2: some researchers (see for instance [7]) have addressed the application of IFPUG FPA directly to UML models, while others (see for instance [5] [6]) proposed UML measures that retain the principles of FPA, but do not strive to provide measures that are equal or comparable with IFPUG function points.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: The 32-bit x86 version of NaCl takes advantage of the segment registers to enforce most aspects of this policy.
Sentence 2: by setting the CS (code), DS (data), SS (stack), and GS (thread-local) segment registers appropriately, the machine itself will ensure that data reads and writes are contained in the data segments, and that jumps are contained within the code segment.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: This implication leads to a trivial check for con.icts: version v1 of item i is concur­rent with version v2 of item i if and only if v1[r1] >v2[r1] and v1[r2] <v2[r2] for some replicas r1 and r2.
Sentence 2: the version vector de.nes a partial order over the possible update his­tory of an item.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: An important common characteristic of all these approaches, including those focusing on sequencing (choreography) and semantics, is that they do not change the underlying WSDL service specification - they retain the core specification in its original form and add additional information on top of it.
Sentence 2: they utilize the same basic operation signatures as WSDL, but add additional specification mechanisms to support the description of choreography and semantics etc.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Of the 717 checks in which the model checking engine ran and completed with a de.nite result ( Pass or Error ), it iterated 5.63 times on average with a standard deviation of 11.21 iterations.
Sentence 2: on average, .ve false errors (in­feasible error path) were encountered and eliminated before the engine was able to complete a proof or .nd a feasible error path through the device driver.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: While such a solution is e.ective at querying policies, it does not provide support for change analysis.
Sentence 2: encoding policies as full-.edged logic programs can potentially make the change analysis prob­lem as hard as trying to di.erence general source programs written in richly expressive languages, a di.cult problem and one whose solutions would provide little insight to the policy developer.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: 5.4 Evaluation of the New Feedback Mechanism The performance improvements achieved by the LFS++ over the LFS solution [2], have been evaluated in isolation (dis­abling rate detection, to make the results more reliable) by using mplayer as a test application.
Sentence 2: we mea- Frame Number LFS LFS++  Figure 13.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Compiler Driven Data Layout Optimization for Regular/Irregular Array Access Patterns Doosan Cho Sudeep Pasricha Ilya Issenin School of EECS Department of Information and Department of Information and Seoul National University, Korea Computer Science Computer Science dscho@optimizer.snu.ac.kr University of California, Irvine University of California, Irvine sudeep@ics.uci.edu isse@ics.uci.edu Nikil Dutt Yunheung Paek SunJun Ko Department of Information and School of EECS Senior Engineer Computer Science Seoul National University, Korea Samsung Electro-Mechanics Co.,LTD University of California, Irvine ypaek@snu.ac.kr sunjun.ko@samsung.com dutt@ics.uci.edu Abstract Embedded multimedia applications consist of regular and irregu­lar memory access patterns.
Sentence 2: irregular pattern are not amenable to static analysis for extraction of access patterns, and thus prevent ef.cient use of a Scratch Pad Memory (SPM) hier­archy for performance and energy improvements.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: By designing some ex­periments on TCAS expressions and some randomly gener­ated expressions, experimental results suggest that di.erent fault prioritization strategies should be selected depending on the particular testing constraints.
Sentence 2: when test resource is limited and there is a risk that testing may be terminated exceptionally, the strategy that CCF and CDF have higher priority, should be adopted since it may yield a higher fault detection e.ciency.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Novel Language Syntax to Enhance Readability White Space, Parameter Sets, &#38; Control Structures Clifton Kussmaul Department of Mathematics &#38; Computer Science Muhlenberg College, Allentown, PA kussmaul@muhlenberg.edu Abstract This poster describes the preliminary status of a project to investigate novel syntax features to enhance programming language readability.
Sentence 2: we present sample syntax for the use of white space, multiple parameter sets, infix ob­ject specification, and programmer-defined control structures.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: That is, the entities and relationships within our model, and the rich textual description, should be intended as base guidelines to be considered while designing B3G-SOM architectures.
Sentence 2: the considerations within the textual descrip­tion allow for a better understanding of the speci.c domain we are addressing and of all the challenges that must faced during the design process.
Relationship: entailment