sadat2307/MSciNLI huggingface dataset:
Domain: Software and its engineering
Sentence 1: The Understand tool, like many fact extractors, is designed to work with complete versions of the system.
Sentence 2: since the .les in the sys­tem evolve individually, we created monthly and transaction snapshots of each .le and ran Understand on each of these snapshots as if it were a static release of the source code (see steps 1, 3, 6 in Figure 1).
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: There are many different parts in the entirety of the GHC pipeline, and some of the no.b programs have teased out otherwise undis­covered interactions between the pipeline and the changes neces­sary to enable the stack transform.
Sentence 2: for the vast majority of programs, it is possible to apply our stack passing transform to the entire program, and still run it with a modest, but perfectly ac­ceptable, performance hit.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: D passing through thebottlenecklinksbetween E and F, consumingtwicethe critical resource.
Sentence 2: consequently,themaximumachievable ratesofSimul­cast andMutualcast are all120kbps.Celerity explores all 2-hop delay-bounded trees, and upon convergence utilizes the treesthat only consumebottlenecklinkbandwidth once, achieving ratesthat are closetothe optimal of240kbps.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: Hence there is an advantage in that the lazy assertions presented here are limited to properties of algebraic data types that canbe checkedin linear time.Itisa limitation that sim­ple equality checks like for the Boolean tuple in the introduction cannot be expressed.
Sentence 2: such assertions can only be vio­lated when data structures are fully evaluated, which may happen less frequently in programs that work with manypartial data struc­tures (cf.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: However, the call-graph and control-.ow-graph representations do not adequately capture the multiple con­texts in which functions can be invoked, and force the con­texts to be the edges of the call-graph and control-.ow­graphs.
Sentence 2: our framework explicitly distinguishes function-call invocations based on their dynamic context of invocation (call-stacks), which can be much more varied.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: Coupling of a type with others can therefore be quantified as the number of imported types, for instance by the Coupling Between Objects (CBO) metric [2].
Sentence 2: in presence of subtyping different imported types ex­press different degrees of coupling: at one extreme, if an imported type is declared final, the coupling is maximal, since only in­stances of this type are allowed; at the other extreme, if the im­ported type is the root of the type hierarchy (e.g., Object), the coupling is minimal, because any instance is allowed.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: For example, if the self-adaptive application is not in the optimal con.guration for its current execution environ­ment, model analysis may produce an advice to change its con­.guration.
Sentence 2: if the environment conditions are close to a change and the current con.guration is the optimal for the future environment, the best behavior may be to resign itself to executing for a short period in the sub-optimal con.guration without requir­ing any adaptation, instead of performing two adaptations in a short time interval.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: Natural language (NL) speci.cations continue to be the most commonly used form (as opposed to formal models, based on a logical framework), accounting for up to 90% of all speci.cations [6].
Sentence 2: nL speci.cations are prone to a number of errors and .aws, in particular due to the ambiguity inherent in natural language [11].
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: These arguments will be evaluated using our plural semantics, which intuitively means that they will be treated like sets of elements of the corresponding type1 instead of single elements, while the others will be evaluated under the usual singular/call-time choice semantics traditionally adopted for FLP.
Sentence 2: we have precisely formalized the semantics of this new language through a novel vari­ant of CRWL called CRWLs p. the main goal of this paper is not formalizing this semantics but exploring its expressive ca­pabilities.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: Theo­rem 5 does not apply here, because of Assumption 5.
Sentence 2: by Lemma 2, yki/Yk =1/N .0 as N .8, and thus any limit point (p1, y) of the sequence (p N 1 , y N) satis.es the competitive equilibrium optimality conditions.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: Tools to recognize fault patterns are appealing because they are able to provide quick feedback about potential faults without requiring program execution.
Sentence 2: the e.ec- 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: contrasting
Domain: Software and its engineering
Sentence 1: It at­tempts to allocate exclusive access to a NUMA-node to each request.
Sentence 2: if the number of cores divided by the num­ber of concurrent requests is smaller than the number of cores in a NUMA-node, then each request will attempt to acquire exclusive access to that number of cores on the same NUMA node instead (with a minimum of one core).
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: The modular semantics obtained provides meanings for higher-order programs with constraints and, more generally, D­modules de.ned on a higher-order constraint domain D.  5.1 Compositional and Fully Abstract Semantics An important aspect to be considered when a declarative language is extended for modular programming is the sound integration of as done in [3].
Sentence 2: to obtain full abstraction with respect to the deletion operation, we have to consider pattern models of pro­grams obtained by deleting any signature included in the under­lying signature.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: 256MB 512MB 1GB 256MB 512MB 1GB 1 11 0.95 0.95  outperforms both the fair share and uncontrolled partition­ ing schemes under both the LRU and LRFU replacement schemes.
Sentence 2: the choice of a good replacement pol­ icy and exclusive caching is crucial to multi-level hierarchies as it is observed that fair share scheme with LRFU and Normalized I/O Latency 0.9 0.85 0.8 0.75 0.7 0.65 exclusive caching can outperform our MLMS scheme with 0.6 BTIO HPIO IOR MPI-TILE-IO LRU and inclusive caching, although it is not better than MLMS with the LRFU policy itself.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: TR ANSI T borrows from traditional software [18] and hardware [4] protocol description languages to specify the protocol skeleton (i.e., types and variable de.nitions) and transitions (using a guarded command language).
Sentence 2: tR ANSI T offers the additional ability to mix concrete and symbolic transitions as snippets, and to under-specify elements of transitions for the tool to infer.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: Although,itispossibletointegratethedisussedap­proahtonesteddataparallelismintonon­funtionallang­uages-aswedidforC[8]-itisrathertedious,asnon­trivial restritionsontheuseofrefereneshavetobeimposed withinparallelomputations.Moreover,theodegener­atedbythefatteningtransformationistoofnegrainedto bediretlyexeutedeÆientlyonmostarhitetures.This requiresaggressiveompileroptimisations,whiharesignif­iantlyeasiertoperforminapurelyfuntionallanguage,as theompileranexploititsdetailedknowledgeaboutdata dependenies.
Sentence 2: nepalallowsuser­defneddynamidatatypeswithinpar­allelarrays.Thisispossibleduetothedelarativewayin whihalgebraidatatypesarespeifedinfuntionallan­guages.TheompilerisabletoomputeaneÆientrep­resentationofthosestruturesbymappingthemontoiso­morphistruturesthatontainonlyparallelarraysofbasi type-whih,aswehaveargued-isimportantforparallel performane.Suhatransformationisonlypossiblewhen wehavesuÆientontroloverhowdatastruturesarea­essedandmanipulated.InV,thenestedparallelCdialet, werestritedtheuseofreferenesinaparallelontextto parameterpassingtogivetheompilermoresopeforop­timisations.Intheproessofhandlingtheremainingref­erenes,ourprototypeompilerforVtransformedarrays ofreferenesintoasinglereferenetoonearray.as[22]disusses,evenwiththisstrongrestrition,itispos­sibletowriteprogramswherethefattenedprogramdoes notauratelypreservethesemantisofthesoureprogram withoutimposingfurtherrestritions.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: With the recently added support of WebGL, web browsers natively support running 3D visualization applications [Marrin 2011].
Sentence 2: for the wealth of existing desktop software with graphic interaction, migration to the Web represents several major obsta­cles: (1) Redevelopment entails signi.cant mastering of languages and standards for web-related programming.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: The evaluation also included some new metrics proposed by Shen and Zhao, for example the Cross­cutting Degree of an Aspect caused by Pointcuts (CDP), Crosscutting Degree of an Aspect caused by Intertype­declarations (CDI), and Coupling on Advice Execution caused by Advices (CAA).
Sentence 2: di.erently from our study, they did not correlate the proposed metrics with fault­proneness of the modules, but with other attributes of the programs (such as LOCC -Lines of Class Code).
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: The altered FM is equivalent to the original one as it de.nes the same product space.
Sentence 2: constructing a sound stage model for this adapted FM is much simpler as now the selection of GeneralIndex directly in.uences the possi­ 2200 2000 1800 1600 1400 1200 1000 800 600 400 200 0 CTCR in % Figure 9: Experimental Results established by SCREAM #Inner Loops bilities for selecting or deselecting MetaDataIndex.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: This type promotion is formalized as a close operation by Igarashi, Viroli and Rimassa in [8], where the close operation is only applied to the result type of an op­eration, and in [15], where also the argument types are closed.
Sentence 2: in case of nested types, the promotion proposed by these authors may need to discard some type information in order to provide an expressible type [13, Sec.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: We use the set Ki = {ni1 ,ni2 ,ni3 ,···niKi }to denote the nodes that could be visited next, which is determined by the structure of the RG (based on the static constraints as explained ear­lier).
Sentence 2: taking into account the dynamic constraints, gives as a subset of Ki, denoted Li, which can be written, without loss of generality, as Li = {ni1 ,ni2 ,ni3 ,···niLi }, where Li = Ki.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: The context factors recorded in a case study are to some ex­tent a function of what is being studied.
Sentence 2: we believe there is a minimal set of essential, omnipresent metrics that must be recorded for each study of soft­ware engineering technology, whether it be of a soft­ware development methodology (such as XP) or of a specific practice (such as pair programming).
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: This translates into a disk subsystem with two 15K-rpm SCSI disks.
Sentence 2: the disk subsystem of a proxy server would need to pro­vide at least 31.2 MBytes/second, assuming 4340 requests/second and a 10% hit rate in the memory cache (which is an optimistic main memory hit rate assumption for proxies).
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: Figure 5(a) shows that vmrncESP is around ~wme as slow as vmmcOmg fbr 4 byte messages and 38 % slower for 4 Kbyte messages.
Sentence 2: vmracESP is only 35 % slower than vramcOrQNoFastPathsin the worst case (for 64 byte messages) but has comparable performance for 4 byte and 4 Kbyte messages.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: Statement 2 cannot give any guarantee that the results of a verification on a finite-state version SN may be extended to an unbounded S. For example, a deadlock in S may oc­cur only when a certain number k of instances of a model have been created: checking only SN with N<k cannot de­tect the deadlock.
Sentence 2: it is often the case that either a system does not work correctly for a small value of N or it works correctly for every N. Hence, even with small values of N we can increase the confidence in the correctness of the specification: the results of the verification obtained on the approximation give some useful and meaningful hints on the correctness of the original package, although they cannot be automatically generalized.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: If it is not equal to 0, the CSMA-CA al­gorithm shall return to perform the second CCA, as shown in step 3 of Figure 1.
Sentence 2: if it is equal to 0, the MAC sublayer assumes the channel access is a success and shall begin transmission of the frame on theboundary of the next backo.period.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: For example, it is reasonable to assume that including 10 lines from the minimal cause of the bug (an important subset of the counterexample trace [6, 28]) might also cause more bug reports to be addressed.
Sentence 2: the Normal bug reports in our experiment did include complete counterexample traces, which were on average only 6 events long (and at most 34 events long).
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: AGiottoannotationfallsinoneofthreepossibleategories: (l)aGiotto-Pannotation(platform)speifesnamesand uniqueIPaddressesforallhostsandnetworksaswellasa listofprioritiesforeahhostinthesystem;(2)aGiotto-S annotation(shedule)speifesforaGiottomodetheGiotto task-to-hostmappingsandtheprioritiesoftheGiottotasks; (3)aGiotto-Cannotation(ommuniation)speifesfora GiottomodetheGiottoport-to-networkmappingsandthe timeslotsoftheGiottoports.Theseannotationsaresuited forstatipriorityRTOShostsandTDMAnetworks;fortar­getingplatformswithdiferentshedulingprimitives,difer­entannotationsanbedeveloped.Forexample,forplat­formsonsistingofnon-preemptiveRTOShostsandCAN networks,Giotto-Cannotationswouldspeifytimeslotsfor tasksandprioritiesforommuniations.
Sentence 2: theGiottoprogramofFigure9ontainsexamplesofall threetypesofGiottoannotations.AGiotto-Pannotation atthetopoftheprogramprovidesdetailsonthetwo-robot platform.Therearetwohostsalledbot1andbot2,whih areonnetedbyanetworkallednet12.TheGiottoom­pilermayexploitthisinformationtoimproveodegener­ation.morespeifinformationisgivenbythe Giotto-SandGiotto-Cannotationsintheexample.Note thatforfexibilityweusesymbolinamesratherthannum­bersforGiottotaskprioritiesandGiottoporttimeslots.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: According to Arnold and Gosling [4], there are two main motivations for .nal: security and performance.
Sentence 2: declaring a method m in a class C as .nal can improve security because a programmer cannot declare a subclass that re-implements or overides m. Therefore, one can rely on its implementation wherever m is sent to an expression with static type C or a subtype of C. since Smalltalk is not statically typed, it o.ers no such type-based guarantees in the .rst place.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: This method is constructor-polymorphic (just as isEqualLists) to work for a reversible list or any sub­classes (whose de.nitions are not given here).
Sentence 2: the argument type has to be exact, since binary methods are in­ 6 Here, the meaning of binary methods is slightly expanded so that they now refer to methods taking another instantiation of This; so the argument type is not necessarily the same as the type of this.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: ViCo: An Adaptive Distributed Video Correlation System Xiaohui Gu, Zhen Wen, Ching-Yung Lin, Philip S. Yu IBM T. J. Watson Research Center Hawthorne, NY 10532 {xiaohui, zhenwen, chingyung, psyu}@us.ibm.com ABSTRACT Many emerging applications such as video sensor monitoring can bene.t from an on-line video correlation system, which can be used to discover linkages between di.erent video streams in realtime.
Sentence 2: on-line video correlations are often resource-intensive where a single host can be easily overloaded.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: It is corrupted , from the standpoint of the functional paradigm, by its use within each method definition of the default control mechanism referred to in structured program­ming terms as sequence , which requires a series of machine states and hence completely disqualifies Smalltalk as a functional language in the purest sense.
Sentence 2: one important element often seen in functional languages is also seen in Smalltalk, name­ly functions as first-class objects.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: For the set reduction rule, it is tempting to write simply: Mi .ß N .
Sentence 2: (M1,...,Mn)C .ß (M1,...,Mi-1,N,Mi+1,...,Mn)C this leads into problems: note that if [M1] · GC = [M2]· GC then [(M1,M2)C]=[(M1)C],but the above rule may let (M1,M2 )C and (M1)C reduce differently.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: Selecting a 1 to 1 mapping would imply that the number of threads in the block must be equal to the range of P a, which is the tile size used for the tiling process in the previous step (T A).
Sentence 2: it seems more convenient to decouple the size of the threadblock from the size of the tile, which has a direct relation with the amount of data processed by the thread­block.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: Acomprehensive survey of these analysis problems and their solutions can be found in Benavides et al.[6].
Sentence 2: sPLC 12, September 02 -07 2012, Salvador, Brazil since the core assets include reusable Copyright 2012 ACM 978-1-4503-1094-9/12/09&#38;#0133;$15.00.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: 4 Transient and Dart s checked mode The transient semantics for Reticulated is reminiscent of Dart s checked mode [12], in which values are checked against type annotations (which are otherwise ignored at runtime).
Sentence 2: dart s checks are performed under different circumstances than Reticulated s, and these choices cause Dart s type system to be unsound even when checked.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: In the program class D={int foo(){return 0;}} class C={int m(){return new D().bar();}} the class constant used as de.nition of C is ill-typed (there is no method bar in class D), hence the whole program is ill­typed.
Sentence 2: a similar program where the ill-typed class constant is only used as meta-expression, as the following: class D = {int foo(){return 0;}} class C = {class m(){return { int n(){return new D().bar();} } } } is considered well-typed, but not deeply well-typed.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: By providing the text of the requirements and a set of keywords, a user can iteratively arrive at a set of concern clusters, and get a clear view of potentially aspectual requirements.
Sentence 2: because of its pure lexical nature, Theme/Doc in­volves signi.cant user intervention to obtain a set of concern clus­ters, and to identify aspectual requirements.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: The original benchmarks in this study were written with medium-grained parallelism; a larger relative improvement can be expected for programs written with .ner-grained parallelism.
Sentence 2: even for the medium-grained parallel benchmarks studied in this paper, the signi.cant improve­ment obtained by the transformation framework underscores the importance of the compiler optimizations introduced in this paper.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: FCFS (.rst-come-.rst-served): If process pdoorway-precedes process q and the two processes request different sessions, then q does not enter the CS before p. Previous works [15, 16, 21] have designed algorithms satisfying P5.
Sentence 2: for the sake of enhancing concurrency, we will not try to satisfy P5.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: Then it is impossible to match the memory area of a communication tile before A2A with the memory area after A2A because we divide the input array into communication tiles along the z dimension.
Sentence 2: for a special input with Nx = Ny, we can have the same memory area for A2A source and destination data in each communication tile, by generating the y-z-x layout (as opposed to z-y-x)after A2A and Unpack.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: Note that ambiguity is inherently a structural problem depending on how a language is de.ned by a regular expression is de.ned, not on the language it de.nes.
Sentence 2: the above characterization permits a change of perspective in that it allows us to analyse ambiguity as a .nite number of linguistic equations (of non-empty intersections and overlaps of languages and epsilon-containment).
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: The data for the nearest neighbor method ( NN/Perm ) is taken from [12]; one can see that no test run has a score of 100%, meaning the defect is never pin­pointed.
Sentence 2: 16.51% of all test runs achieve a score of 90% or better, meaning that the programmer can stop her search at 10% of the code in 16.51% of all test runs.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: The merit of that work is mainly in the exploration of the nature of the relations that link FPA and COSMIC BFC.
Sentence 2: according to the reported results, the method is of little practical value: on the one hand, it is expensive, since you have to perform most of the FP measurement process (as you need to identify FTR); on the other hand, you only get a relative wide range of possible values for the size in CFP (on average, the estimate is in the ­29..+26% range).
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: An extra argument is reach(a,X) (1) (1) Normal Looping  Tabled Looping Subgoals Answers Alternatives reach(a, b) reach(a, X) (1) reach(a, c) reach(a, a) Figure 1: DRA Resolution for Example 1 added for the predicate reach/3 to record the found path.
Sentence 2: this extra argument results in the .xed point of the computation to be in.nite, since there are in.nite num­ber of paths from a to any node due to the cycle between a and b.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: Suffice to say that leaving y undefined complicates reasoning, although not nearly as much as allowing aliasing; and that leaving y with either an arbitrary or a distinguished value of its type is actually quite a reasonable thing to do.
Sentence 2: we have found that the last approach --swap-ping the values of x and y --is both efficient and safe with re- spect to modular reasoning, and it results in remarkably few changes to how most programmers write imperative code [3].
Relationship: contrasting