sadat2307/MSciNLI huggingface dataset:
Domain: Software and its engineering
Sentence 1: For example, the Age newtype de.nition generates the axiom (where mkAge is a coercion constant c): mkAge : Age ~ Int/T Note that ECOERCE requires s1 and s2 to be equal when considered in role T, which is consistent with the idea that type equality determines when it is safe to coerce.
Sentence 2: on the other hand, source programs can also introduce code equalities.Forexample the type function F (Section 2.2) generates the two axioms: axF1 : F Int ~ Bool/C axF2 : F Age ~ Char/C all code axioms can be used to prove type equalities, as code equality is a re.nement of type equality.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: The remapping step runs in parallel with a preceding independent GPU kernel and takes more than 10 times of the kernel execution time.
Sentence 2: with the e.­ciency control, the remapping is shut down automatically; the execution time of the kernel shows no noticeable changes compared to that of the original as shown in Figure 6, indi­cating the e.ectiveness of the scheme in preserving the basic e.ciency of a program.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: Now,letusexaminetheperformance.Whatperformance isexpectedforagoodGCalgorithm'Toanswerthisques­tion,Ifrsttakeremarksfrom[14]:Theoverallexecution timeforgarbagecollectiontypicallyrangesbetweenafew percenttoaround20percent....Ifaball-parkfgurehadto bechosen,10percentwouldnotbeunreasonableforawell­implementedsystem.
Sentence 2: "thisanswerseemsalittle confusing,becausetheframeofreference,i.e.,theprogram executiontime,isnotclearlydefned.Here,Iintroducea morefeasibleperformancemeasurement.LetT(P)bethe executiontimeofaprogramPonamachinewithinfnite virtualmemory,T(GC)bethetimespendongarbagecol­lection,and(P)betheexecutiontimeofPincorporated T0 withgarbagecollection.Thus,takingthe10percentball­parkfgureintoaccount,thefollowingformula: (1:1XT(P))(T0(P)+T(GC)) couldbeusedasanexpectationforawell-implemented garbagecollectionalgorithm.Fromthisconsideration,I testedsomebenchmarksunderLVMwithCGCdisabled.To beabletorunthesebenchmarks,Ihavechosensomeproper inputssothattheirmemoryrequirementsftthecapacityof thevirtualmemoryonthetestingplatform.Table4gives theexecutiontimesinCGC-enabled(E)andCGC-disabled (D)tests.AlltimesaregatheredbytheUnixtimingfacility whichreturnsusr/syselapsedtime.Byaddingtheusr-time andsys-timetogether,thethirdrowgivestheratioofE/D.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: Motivation: Reduce Software Development Costs The detection and correction of design defects early in the process substantially reduce the cost of subsequent steps in the development and support phases [7]: Designs free of de­sign defects are easier to implement, change, and maintain.
Sentence 2: their detection and correction in large designs are highly time-and resource-consuming and error-prone activ­ities [10] because design defects crosscut classes and meth­ods and their descriptions are subject to misinterpretation.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: So, effec­tively the Create locution is being used here for proposing commit­ments, not for their creation, because the framework has no locution for proposing a commitment.7 That this is possible in the .sh-market domain is because the rules of the auction institution are suf.ciently constraining, and be­cause the commitments concerned can be expressed as conditional commitments, each to be undertaken upon achievement of some de­.ned world state.
Sentence 2: if the commitments were to involve si­multaneous achievement of different world states, or simultaneous execution of actions, by different parties, then they could not be ex­pressed as conditional commitments.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: In the .gure we can seen that the node SortAlgorithm.init has the same root trace in both call graphs.
Sentence 2: the nodes SortAlgo­rithm.setParent, BidirectionalBubbleSortAlgorithm.sort, Sor­tAlgorithm.pause and SortItem.pause have di.erent root traces in the call graphs.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: A KlarDeutsch program translated to English could look as follows: pumpOff: pump=off if heatingValve > 0,4 and faultPump = on then goto pumpOn if currentDay > 6 then goto block pumpOn: pump=on if heatingValve < 0,2 or faultPump = off then goto pumpOff block: pump=off if currentSecond > 10 or faultPump = off then goto pumpOff KlarDeutsch is extremely simple and somehow old fashioned still using goto-statements.
Sentence 2: it shows that there seems to be a need especially in engineering to use natural language supple­mented programming languages in the native languages of the engineers.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: In CPRS(D)-programming we are going to follow an approach close to that developed in [2, 3] for logic pro­gramming and .rst-order functional logic programming [31, 32].
Sentence 2: in the new higher-order setting with constraints we must consider modules as open programs in the sense that function de.­nitions in a de.ned module can be completed with de.nitions for the same functions in other modules or in the higher-order cons­traint domain D, interpreted as a prede.ned module.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: This includes such standards as: Frames should have a NOFRAMES section;  all elements should be operable without a mouse;  grouped links should have a link at the start, allowing the user to bypass the group; and  alternative text should be provided for all image map hot-spots.
Sentence 2: these checkers do not check for site-speci.c stan­dards such as breadcrumbs must come before an H1 tag , which are the focus of this paper.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: For example, loading only required functionality on a mobile de­vice from a network according to the underlying hardware or user preferences can reduce network load and avoids the necessity to provide any variant of a program.
Sentence 2: unfortunately, dynamic compo­sitionhas typicallyanegativeeffectonperformance becauseitin­troducesanoverhead.static compositionavoidssuchan overhead needed to support dynamic composition and enables opti­mizations on the source code level (e.g., function inlining) [21, 12].
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: 2.1 Relational Composition Simple structural relations such as Rhd have .xed cardinality , i.e., they have a .xed number of tuples regardless of the concrete size of the data structure on which they are de.ned.
Sentence 2: practical veri.cation problems require relations over algebraic datatypes to have cardinality comparable to the size of the data structure, which may be recursive.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: In fact, Longrun in­curs a 2.31% slowdown and consumes an extra 69.27 Joules when compared to FULL (the increase in energy consumption is due to the longer completion time for the build job).
Sentence 2: tS-DVFS is able to extract 38.62% energy savings at the expense of 4.03% longer execution time when compared to LongRun.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: A major shift in adapting prototyping techniques to the current mobile paradigm has already started, for instance as a result of the availability of prototyping tools for mobile apps (e.g., Antetype1 , Axure2, Fluid UI3, POP4, and iMocBuilder [2]), and was also demonstrated by the work presented at the first edition of this workshop [4] held at the MobileHCI 2013 conference.
Sentence 2: work still needs to be done in many different directions such as how to build and utilize prototypes; novel approaches and techniques to support the interaction design process of mobile application development properly.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: In this case, by apply­ing Lemma 4.3 to the set J = {i, j, k}, we get a = ./3.
Sentence 2: we have ac+1 ac = max ak · kj k.P k.Pj.P = max ak · 1 (Using property (3) of the family) k.P .c1 = (By de.nition of P ).
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: We also knew that the .le-based lookup solution could handle the batches with 30 million transactions and 50 million distinct entities required at the time.
Sentence 2: as the number of entities has been increasing beyond the expected range in the past years, the disk design has now reached its limits in terms of scalability and is being currently re-implemented with the support of our scalability framework.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: In our reengineering process, we made the database classes into component classes, and initially left the user interface classes as they were, adding ports for communication channels that led to the database.
Sentence 2: the thorniest architectural problems in Aphyds were in the user interface interactions, and since we didn't make the user interface classes into components, our architecture didn't help with these problems at all.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: Ontologies for the Internet of Things * Sara Hachem, Thiago Teixeira, and Valérie Issarny INRIA Paris-Rocquencourt .rstname.lastname@inria.fr ABSTRACT Challenges the Internet of Things (IoT) is facing are directly inherited from today s Internet.
Sentence 2: they are ampli­.ed by the anticipated large scale deployments of devices and services, information .ow and direct user involvment in the IoT.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: For example, consider some of the configuration parameters required in the C++ version of Prism-MW: size of event queue; number of pre-allocated system resources (sema­phore, mutex, file, DLL); number of pre-allocated archi­tectural constructs (Component, Connector, Port); size of memory buffer used by the network sockets; and size of pre-allocated memory pool used by application-level vari­ables.
Sentence 2: the Java version of Prism-MW has only two configuration knobs : sizes of event queue and thread pool.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: This could be attributed to the work of brilliant motivated program­mers who aren t however e.ciently managed to pay atten­tion to the details of style.
Sentence 2: the high marks of wrk in code style and low marks in code structure could be attributed to the opposite e.ect: programmers who are e.­ciently micro-managed to care about the details of style, but are not given su.cient creative freedom to structure their code in an appropriate manner.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: The pointer to B is overwritten with a pointer to a third object, C.If A is now evicted, B may stay on the stack, since there is no longer a pointer from A to B that would violate the Baker constraint.
Sentence 2: if we had been clever and immediately heap allocated A, knowing that it was likely to be evicted later then B would have been evicted when the pointer to it was written into A.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: Compisthecompilationtime,Sizethesizeofthebinaryfle.
Sentence 2: inordertopresenttheimpactofprofledcompilationonthe executablesize,wehavedecidednottostrip(thatisnotto removethesymbolstable)thebinaryflesinoptimization mode.oneshouldbeawarethatonourworking architecturestrippinganexecutableshrinksitbyabouta  Queens Eval Bootstrap Comp.modes Comp.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: For instance, as far as [COMPOSE] law is concerned, semantic-matcher takes the two service descriptions as in­put parameters, returning a couple of matching open ports, if any, and a vagueness value 0 means that the two services cannot be composed.
Sentence 2: semantic-matcher is also adopted when [MATCH] is executed: in this case, it takes a service tuple and the service description within a req tuple, returning just a vagueness value, which speci.es whether the request can be processed or not.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: The above problem is solved by Triage using its software architecture and amortizing the transition cost of a long interval of time.
Sentence 2: we .nd that the USB-transfer cost is a potential bottleneck for both the Triage and WoW* systems and the performance of Triage could be improved if the bottleneck is eliminated using low power DMA (direct memory access) between the Mote and the Stargate.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: than Root Set, and in fact Random with f =1 is as good as Root 34 Set with f = .
Sentence 2: this difference diminishes as f is de­   4.4 DHT replica placement In this section we compare two common strategies, Root Set and Several limitations of the traces likely underestimate the long-Random, for managing .le replicas in distributed hash table-based term bene.t of Random over Root Set.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: OWL-S provide means to semantically describe WS using three elements, and that is, service profile: describes what the service does, process model: describes how the service operates, and service grounding: provides details on how to automatically access the service.
Sentence 2: wSMO semantically describes WS using four elements [4]: (1) Ontologies: provide domain knowledge that can be used by other WSMO elements, (2) Web services: describe functional and behavioural aspect of services enabling machine-interpretability, (3) Goals: represent the request(s) that the service consumer might need the service to fulfil, and (4) Mediators: deal with heterogeneity challenges between conflicting semantic concepts.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: Forexample, studiesshowthatuser-providedjob run-time estimates used for back.ll algorithms are inherently in­accurate[22].1 Using ourde.nitionof uncertaintyfromSection 1All of our presented simulations assume perfect run-time esti­mates.
Sentence 2: repeating all of the experiments using the actual run-time estimatesfrom usersdoes not signi.cantly change the re­sults; we omit thesegraphsfor space considerations.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: The .ring duration of the AEC actor is de.ned in [17] as 9.091ms which means that its maximum transfer rate is 80 > 8.
Sentence 2: the AEC task contains a 48 taps .lter 9.091 which causes the .rst 48 samples to be used only for .lling the taps.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: For example, the functionality of sensor nodes may need to be changed based on newly sensed events and the constraints imposed by limited memory space will necessitate remotely reprogramming the device as opposed to storing all envisioned codes locally.
Sentence 2: the flexibility of field upgrades provided by such remote reprogramming also makes the code vulnerable to eavesdropping and execution in an unauthorized device.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: Our current implementation does not implement the recovery scheme described in Section 4, so we do not have accurate mea­surements for the amount of duplicate evaluation detected and re­covered from.
Sentence 2: we have reason to believe that the .gure will be small in the case of GHC: we measured the number of times a GREYHOLE thunk was entered, in a version of ghc-smp compiled with grey-holing support.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: We focus on the representation of a single page of code, though current trends in the visualization of code focus on the management and representation of large-scale programs  and despite the fact that we appreciate that interaction with 2.3 Differences between textual and visual languages code is important [5, 7].
Sentence 2: we think that represen­ tation at the level of the page is overlooked: understanding a single page of code is still required since the very act of programming (i.e., editing code) is often done at this level.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: The reason for this heuristic is that while the cost of mispredicting a short-hammock 3When there is a chain of CFM points, the probability of merging at X in Alg-freq has to be modi.ed to compute the probability of both paths of the diverge branch actually merging at X for the .rst time, instead of just reaching X.
Sentence 2: for the diverge branch candidate A in Figure 4, probability of merging at C = pT (C) * pNT (C) = 1 * P (BC) = P (BC), where P(BC) is the edge probability from B to C. probability of merging at D = pT (D) * pNT (D) = P (CD) * P (BE) because if the not-taken path of the branch at A takes BC, the actual merging point would be C instead of D. T F  Figure 4.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: Both parties, Alice and Bob, could simply encrypt and sign their RSSI measurements, and a third party, Victor could com­pare the RSSI trace results, measure the correlation coe.­cient (much as we have done), and if he calculates a value r > 0.9, he can be certain that the .ngerprint is valid.
Sentence 2: there are issues with using raw RSSI values as link .ngerprints: for one, both parties will have to store ev­ery RSSI value for every transaction in memory which may not be feasible for memory-constrained sensor devices.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: Both CnC and Hi-PaL, share the goal of helping the end-users develop parallel applications at a high-level of abstraction, have long-term goals of supporting multiple architectures, and intend to provide separation of serial and parallel concerns.
Sentence 2: as previously mentioned, there are a lot of differences related to the approach to parallelization from the implementation perspective and usage perspective.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: A reasonably high predictive accuracy of IFN models is important if we intend to use them as automated oracles in regression testing, but expecting them to become perfect predictors of all outputs in complex software systems is certainly unrealistic.
Sentence 2: as shown in [21], the inherent compactness of these models can help us to recover the most dominant requirements from execution data and, consequently, to build a compact set of test cases.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: Therefore, there exists an integer-valued function g; fsuch that g(x) <g(y)and gis certainly called when f (x· a)and f (y· a)are evaluated.
Sentence 2: since state(x)=state(y)holds, g(x)<g(y)implies g (x)= g(y)= 8.Now let ube the boundary used in f ; then, g (x)=8 implies ++ g(x)>u, because f ; eimplies g; efor any expression e. g(x) = f(x· a)holds from construction of f,which implies u<f(x· a).
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: A  1The goal is that applications conforming to each compli­ance level should be capable of being certi.ed to the highest level of integrity.
Sentence 2: it is accepted that the e.ort re­quired to certify at compliance Level 2 may be signi.cantly greater than at Levels 0 and 1. notable restriction of the Level 1 programming model is that use of Object.wait() and Object.notify() is prohibited.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: The second run of the algorithm will (very likely) invali­date this spurious equivalence since the probability that b mod q1 = b mod q2 for randomly chosen large enough q1 and q2 is very small.
Sentence 2: note that this technique does not discover the equivalence y = bx; in general it does not discover equivalences that involve constants that are larger than the randomly chosen prime numbers.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: Bytakingadvantageofbitwidthinformationduringarchi­tecturalsynthesis,wereducesiliconrealestateby15{86%, improveclockspeedby3{249%,andreducepowerby 46{73%.Thenexteraofgeneralpurposeandreconfg­urablearchitecturesshouldstrivetocaptureaportionof thesegains.
Sentence 2: 1Introduction Thepioneersofthecomputingrevolutiondescribedin StevenLevy'sbookHackerscompetedtomakethebestuse ofeverypreciousarchitecturalresource.Theyhand-tuned eachprogramstatementandoperand.Incontrast,today's programmerspaylittleattentiontosmalldetailssuchas thebitwidth(e.g.,8,16,32)ofdata-typesusedintheirpro­grams.Forinstance,intheCprogramminglanguage,itis commontousea32-bitintegerdata-typetorepresentasin­gleBooleanvariable.Wecoulddismissthisshiftinempha­sisasaconsequenceofabundantcomputingresourcesand expensiveprogrammertime.thereisanotherhis- Permissiontomakedigitalorhardcopiesofallorpartofthisworkfor personalorclassroomuseisgrantedwithoutfeeprovidedthatcopies arenotmadeordistributedforproftorcommercialadvantageand thatcopiesbearthisnoticeandthefullcitationofthefrstpage.To copyotherwise,orrepublish,topostonserversortoredistributeto lists,requirespriorspecifcpermissionand/orafee.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: The discussion in this paper makes a few simplifying assump­tions for clarity: one, it assumes that developers push to and pull from only the master repository; two, it assumes that developers only make a commit when all their tests pass.
Sentence 2: our ap­proach in general, and the Crystal tool, in particular, handle arbi­trary pushes, pulls, and commits.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: This level of precision ensures that injec­tion points are unique on each tested execution path, and all possible library-level faults can be explored.
Sentence 2: this produces a large fault space, and introduces the possibility of test redundancy (we will show how AFEX explores this space ef.ciently in §7.1 and mitigates redundancy in §7.4).
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: The correct implementation of the function search should .nd the largest, max, and the second largest, second, keys in an array L of n keys by sequentially scanning the array and keeping track of the two largest keys seen so far1 .
Sentence 2: the implementation of the search function given in Figure 1 contains a seeded fault at line 10, where instead of assigning L[i] to second, L[i] is incorrectly assigned to max.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: The di.erences (D1) and (D2) still hold between [35] and our approach since the applicability of transformation rules has to be restricted by NACs, and all kinds of model modi.cations and not only well-de.ned delta operations can be modeled.
Sentence 2: the di.erence (D3) does not hold as the transformation rules in [35] also reuse the concrete syntax of the corresponding modeling language.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: The worker basically executes statementbefore ( set a piece in Figure9 as do ), statementbody , and statementafter ( remove the piece inFigure9 as undo )inthisorder.
Sentence 2: duringthe execution of statementbody , statementafter is also executed as an undo clause before an attempt to invoke an older task request handler.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: Pickle Veri.cation We argue that the design we have presented so far ensures type safety for pickles in the sense that there is no way to corrupt the runtime system from within the language: for any pickle written by the system, unpickling is always safe, regardless of type mis­matches.
Sentence 2: there remains the obvious possibility that pick­les are forged outside the control of the system (this may include the use of the library s low-level I/O subsystem).
Relationship: contrasting