sadat2307/MSciNLI huggingface dataset:
Domain: Software and its engineering
Sentence 1: could su.er a deadlock if scheduled by an adversary that is not in A, but we are only interested in schedules by the adversaries in A. as E for almost all processes.
Sentence 2: we then evaluate the relative probability of the two colour schedules M and N. Since we only .ip some registers from green to red in order to obtain N from M, colour schedule N is signi.cantly less likely than colour schedule M. we also have to take into account the number of distinct colour schedules MI that get mapped to the same N in order to avoid that process b .nds some other process in step s. 6.1 Preliminaries We start with some observations regarding the roll­forward rules.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: There has been research that supported modeling-level aspect-orientation based on a speci.c AOP language such as AspectJ: an aspect at the modeling-level is converted to an aspect in AspectJ[7].
Sentence 2: there are problems in these approaches: a PSM is limited to a speci.c AOP lan­guage; most of current AOP languages are based on a few .xed set of JPMs; and we cannot separate concerns that cannot be separated by current AOP languages.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: When they find the comments are constructive and valuable, they will revise their code sincerely and carefully.
Sentence 2: there are a few author students who might perform in the following two ways: (i) do not pay attention to their written manuscript code, neither compile nor test the code, or rush to send the email to the reviewer and wait for their comments; (ii) after receiving the comments form, the author will briefly look through it and make only casual revisions.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: It is an extract of an educational game which warns of domestic electrical accidents (DEA game) whose objective consists in causing an electric shock for the player [4].
Sentence 2: at first, the game designer (author) anticipates that the player, from an initial position, will go to the kitchen, where the IS controller will start the strategy of causing the electric shock for her/him, via appliances there such as a fridge, a microwave oven, an electric cooker, besides the possibility of going to the kitchen, the player may have other choices, for instance, staying at the initial position to work or going to the bathroom.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: As lock operations and application terms are annotated with their continuation e.ect, it is natural that e.ects .ow backwards through the type system: the input e.ect to an expression e repre­sents the events that follow in the future of e, that is, after e is eval­uated.
Sentence 2: the output e.ect represents the combined sequence of events caused by e and its future.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: Our proposed extensions were driven by the needs that arose during the development of our speci.c case-study; and hence it is possible that, through the development of additional behavioral projects, BP may need to be extended with additional idioms.
Sentence 2: due to the large variety of programming tasks entailed by the web-server project (e.g., handling timeouts, string manipulation, .le access, checksum calculations, etc), we believe that our proposed extensions are robust, and could prove suf.cient for a variety of programming tasks.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: Note that it may be possible to reduce the size of the partition identi­.ed by the algorithm by performing additional analysis (e.g., by distinguishing di.erent kinds of use relationships among classes).
Sentence 2: doing so would increase the cost of the partitioning and, as the studies in Section 3 show, our cur­rent approach is e.ective in practice.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: Many commodity operating systems also support an in­terposition mechanism for system calls intended for debug­ging purposes, such as ptrace in Unix-like systems, and it is also possible to interpose on OS library APIs [18].
Sentence 2: the complexity of the relevant interfaces makes these solu­tions demanding to use, and tightly couples the implementa­tion of an extension to a speci.c OS.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: In other words, we show how the bounds on the worst-case skews depend on all these parameters.
Sentence 2: another aspect of clock synchronization, which so far has not received much attention, is that a practical clock synchronization algorithm must ensure that the rates of progress of all logical clock values are always within spe­ci.c bounds, i.e., the clock values are not allowed to change substantially in a short time.3 bounding the clock rates inhibits the ability of an algorithm to react to clock skews, which have to be kept as small as possible.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: Semantic Web Data Visualization with Graph Style Sheets Emmanuel Pietriga* INRIA &#38; Laboratoire de Recherche en Informatique (LRI) Universit ´e Paris Sud, 91405 Orsay, France Abstract Visual paradigms such as node-link diagrams are well suited to the representation of Semantic Web data encoded with the Resource Description Framework (RDF), whose data model can be seen as a directed labeled graph.
Sentence 2: these representations are not fully satisfying: diagrams can quickly become big and over-cluttered, making them hard to understand.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: This empiricism allows us to conclude that on typical C programs, an optimized implementation of Andersen s analysis scales much bet­ter than its worst-case bound of O(n 3) in the size of the program (Section 5.4) and that a linked list append function that runs in lin­ear time in the length of the list is a performance bug in banshee s parser (Section 5.5), but the same idiom is not a bug in the context of elsa s data structures for resolving name lookup (Section 5.6).
Sentence 2: 6.1.2 When Workloads Oversimplify the user of trend-prof must choose work­loads carefully or risk generating results that do not generalize.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: 4.2 Model migrators As said in the previous section, BYADL provides software archi­tects with the means to create customized ADLs by extending ex­isting ones.
Sentence 2: in this scenario it is important that tools sup­porting original ADLs can still be used to manipulate and analyze models which have been created by means of the new composed ADLs.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: The memory overhead for the .ne-grain analysis is substantial (columns 3 and 4), since every .eld and array element requires a its own VarState object.
Sentence 2: fASTTRACK s memory requirements are substantially better than DJIT+ s because many 5 Some of the JavaGrande benchmark programs were run on smaller data sets than we used, which could also impact relative performance.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: Existing test-case generation approaches can be added to our testing framework for AutoResolver, e.g., plain random input generation, or evolutionary test case gener­ation [28], which targets large input domains and has been used successfully in industrial applications [7].
Sentence 2: as already explained, it is impossible for any such tools to di­rectly tackle the AutoResolver input space.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: Given MyMorph : Morph, this binding is then replicated for MyMorph s world and parent.world facets.
Sentence 2: this replication can be expressed as: B(p, A.e.G, A.f.G) = fb D(p, B.e, A.f) = fd B(p, B.e.G, B.f.G) = fb + fd where B represents binding relationships that are initially seeded by bindings encoded in the program: B(p = trait A ... f = g, A.f, A.g) = 0 B(p = trait A ... f = g, A.g, A.f) = 0 B relationships then generate D relationships that affect extension graph shortest path computations: B(p, e, f) = f D(p, e, f) = f binding edges are fundamentally weaker than typ­ical extension edges in one very important way: binding re­lationships cannot be derived across other binding relation­ships.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: http://www.someservice.com/< tenant> / easier to manage and evolve the schema itself, to use less computational resources, and to run analytics on the whole system data.
Sentence 2: its use requires initial changes to the original schema and indexes, it may happen that data from one Tenant leaks to another, and changes are required in the SQL statements used in the application.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: The OSEK/VDX sys­tem generator uses this knowledge to generate an OS variant that is speci.cally tuned for the given application.
Sentence 2: if the application violates the properties assured by the de.nitions in the system con.guration to the system generator, the runtime behavior is unde.ned according to the OSEK/VDX speci.cation [19].
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: To see this, consider the following simple example in which the invocation of m("def") in the main method of class B on an instance of a class A is meant to bind to A.m(String), but really binds to m(Object): class A { private void m(String s) { } void m(Object o) { m("abc"); } } public class B extends A { void m(String s) {  } public static void main(String args[]) { A a = new A(); a.m("def"); A b = new B(); b.m(true); } } To change binding, accessibility of A.m(String) must be increased [6, §6.6.2.1].
Sentence 2: this also changes the dynamic binding of the invocation of m("abc") on an instance of B in A.m(Object), which now binds to B.m(String) rather than A.m(String) as before.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: Simple locality-enhancing transformations Because the oct-tree in Barnes-Hut is a highly dynamic data structure, exploiting locality in the traversals is dif.cult.
Sentence 2: as 2 The full Barnes-Hut algorithm consists of several phases; we concentrate on the force computation phase, which is both the most time-consuming phase, and the phase with the computational structure we are interested in.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: An example program is given in Figure 2, where DEF and USE are as follows: DEFA = {x, z} USEA = Ø DEFB = Ø USEB = {x, y} DEFC = {x, z} USEC = {x, z} DEFD = Ø USED = {x} If we solve for INb and OUTb, we .nd that z is not live upon entry to D (that is, z ./IND).
Sentence 2: z is considered live on entry to C, even though it is never affects the output of the program.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: 3.3.1 Recruitment Pro.le-cast can be used to perform the dissemination, and a pro.le which includes the locations in the sensing area can be used as the target pro.le.
Sentence 2: unlike the origi­nal version of pro.le-cast, where the aim is to reach nodes matching a certain target pro.le, for recruitment it is nec­essary to also reach the nodes that match only a part of the target pro.le.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: The results on the PC are mixed, likely for factors other than the Table 3: Execution time (sec) on IBM Power 4 Benchmark Orig K=256 K=64 K=1% K=0.1% X-means Freq=50% Static Worst Swim 25.32 23.46 26.01 27.87 26.01 26.48 27.29 26.85 29.80 Tomcatv 21.74 20.70 20.70 20.70 20.70 20.60 23.74 20.90 23.80 MolDyn 52.22 52.22 52.22 52.22 52.22 52.25 52.22 52.22 52.79 Mesh 3.29 3.26 3.29 3.26 3.29 3.32 3.42 3.29 5.09 Cheetah 195.08 190.60 190.60 190.60 190.60 204.45 208.65 compiler analysis not applicable 218.76 Bisort 8.07 8.07 8.07 8.07 8.07 10.44 10.25 11.16 Perimeter 0.025 0.021 0.022 0.021 0.021 0.021 0.024 0.024 TreeAdd 0.230 0.226 0.226 0.226 0.226 0.226 0.226 0.258 TSP 41.69 40.34 40.34 40.47 40.37 41.15 40.34 41.73 Average Speedup 1.000 1.045 1.026 1.026 1.032 0.995 0.958 0.996 0.883 data layout.
Sentence 2: it still gives the worst slowdown of 8% on average.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: Self [26] with its Morphic [16] UI library gets around this limitation by supporting the direct manip­ulation [24] of object run-time structures, although such edits only persist and do not affect the object s code.
Sentence 2: our work is able to support liveness through a deep connection between code and program execution as well as direct manipulation whose effects are enshrined in code.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: One way to tackle the state explosion problem is to use mod­els and/or relax execution consistency.File system modelshave al­lowed, for instance, KLEE to test UNIX utilities without involving the real .lesystem.
Sentence 2: based on our own experience writ­ing models for KLEE, doing so is labor-intensive and error-prone.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: State-of-the-art approaches to binary obfuscation are based on the following three techniques: 1) inserting, after an un­conditional control transfer instruction, junk bytes, which are unreachable at runtime but make disassemblers confuse alignment of instructions, 2) replacing a control transfer in­struction with a signal instruction, which redirects a pro­gram s control .ow to the target of the original control trans­fer at runtime, but hides the actual control transfer from dis­assemblers, and 3) encrypting the body of an IF-statement, which is decrypted and executed only when IF-condition is satis.ed at runtime, but makes disassmblers interpret as data.
Sentence 2: those previous techniques have weaknesses in terms of coverage and stealth of obfuscation.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: A workaround for this permissive const semantics is for pro­grammers to use preprocessor macros, designed for token substitu­tions, rather than general and type safe language mechanisms.
Sentence 2: for example the function mileToKm may be replaced with the macro #define MILE_TO_KM(M) ((M) * 1.609344) preprocessor macros are brittle abstraction tools, fraught with type, namespace, and scope problems.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: Also, one can .nd in [3] a typeful program representation used in imple­menting an interpreter in Cayenne [2], a functional program­ming language based on Haskell that supports a dependent type system, where the type assigned to (the implementation of) the interpreter guarantees it preserves types.
Sentence 2: none of these techniques support, in a function programming language (not a theorem prover), typeful program repre­sentation for potentially open programs, that is, programs containing free variables.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: Forexample,people wantto sharefamilypictures with family members only, they want to share pictures from work with work colleagues, and they want to share their wedding videos with all the guests to their wedding.
Sentence 2: today s sharing systemsprovide access control mechanismsbased onidentities and groupsthatvaryfrom one content sharing serviceto another.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: The throughput of 2.3 phone calls/s for the BPEL based solution is not su.cient for building a larger scale phone or conferencing solution with hundreds or thousands of simul­taneous telephone calls, even taking into account a possible replication of services and more powerful servers.
Sentence 2: the performance achievable with the used tools may already be su.cient for other application scenarios with longer session durations, like a VoD solution for example.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: The stackis usually threadprivate and(due to thelimited number of registers on the x86) heavily accessed.
Sentence 2: assuming accesses to the stacktobethreadprivate meansthatthey canbeperformeddirectly in our applications.stack accesses need tobe adjusted to accountforthe save area we create on stack.Inthe examplethis can be observedininstruction5, wherethe offsetis adjusted upwardby 16bytes.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: For example, in Tracematches one can count matches of a pat­tern open close without a need to reset the monitor after each match as in MOP.
Sentence 2: total trace match­ing is more suitable for runtime veri.cation of formal prop­erties, because it is also the semantics adopted by conven­tional formal veri.cation techniques and tools.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: Model­driven techniques [16] and other approaches, such as the or­togonal variability model [12], suggest that traceability is a su.cient mechanism to .nd out the justi.cation of the varia­tions by tracing the elements from or to features.
Sentence 2: these approaches do not trace the intentions of the stake­holders, nor do they consider that assumptions made at dif­ferent stages of the product line may become deprecated or invalidated.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: CP-Mineroperatesbyanalyzingthetype 2clonesinasoftwaresystem,andreportingcodeclonewithincon­sistent identi.er re-naming as possiblebug.
Sentence 2: with CP-Miner, the ratio of false-positive in the re­ported bug candidate is large; consequently, for large-scale sys­tems, separating true bugs from false ones is a demanding task.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: Additionally, in applications that do not require real-time synchronization, several other techniques are proposed to estimate and re­move clock o.set and skew o.ine in captured data sets such as a packet delay trace [16, 27].
Sentence 2: in the Internet, each node is either a router or a host which is wired to a constant power source and has one or more stable and powerful CPU s. some other networks have only very limited resources such as scarce en­ergy, unstable processors, and unreliable and low communi­cation bandwidth, which we refer to as resource-constrained networks .
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: THE SSC -METRÔ RIO MODEL On the one hand, formal modeling requires the de.nition of a formal language, and this has been addressed by re­stricting the Simulink/State.ow language to a semantically unambiguous subset through modeling guidelines.
Sentence 2: when a large requirements set is involved in for­mal modeling, also the architecture of the model comes to be a fundamental issue.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: This is possible because the feature model identi.es the key concepts of the concern, and hence the domain-speci.c language!
Sentence 2: the speci.cation of a list of tags by itself does not yet suf.ciently de.ne a DSL, because the list only speci.es the con­crete syntax of the DSL, but not its semantics.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: MapRe­duce, the moving computation to data paradigm for many pleas­ingly parallel applications, assumes that data are resident on lo­cal disks and computation is scheduled where the data are located.
Sentence 2: on an HPC machine data must be staged from a broader .le system (such as Luster), to HDFS where it can be accessed; this staging can represent a substantial delay in processing.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: Since the predicate value is obtained during reverse execution, there is no time or memory overhead encountered during forward execution of F .
Sentence 2: in this method, if the value of any variable used in the predicate expression (the value of r4 in this case) has already been destroyed before reaching the reevaluation point, then that destroyed value must be recovered during reverse execution beforehand.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: Some of these concerns have been alleviated by the appear­ance of metamodeling languages [8] representing the ab­stracts syntax of DSML-s, and metaprogrammable tools [25] that can be adapted easily and inexpensively to di.erent do­mains.
Sentence 2: abstract syntax metamodeling -although an essential step -does not solve the problem caused by the lack of precise and explicit speci.cation of DSML seman­tics.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: The argument for the impossibility is that one of the participants must always go .rst .
Sentence 2: we believe that secret handshakes can be integrated into key exchange protocols to protect both the initiator and the responder against an active attacker, at least in system settings where it is practical to tolerate the following unfairness between a pair of legitimate users: Al­ice learns that Bob is legitimate without guaranteeing that Bob also learns Alice s legitimacy.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: In other words, TBLAS  1 2 4 8 16 32 64 128 256 5121024 Number of cores programs used 25% less compute cores than ScaLAPACK.
Sentence 2: for the per-core performance, we divide TBLAS s overall performance by 4 × NumberNodes, instead of 3 × NumberNodes.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: When the second node fails, the unresponsive nodes quickly cause more working threads to be blocked and lead to very low concurrency.
Sentence 2: (b) Scalability: Response Time (a) Scalability: Throughput both ED only and EP+ED maintains high concurrency through 0.5 100  event-driven request processing, and thus can achieve much better 0.4 80 throughput even when two nodes become unresponsive.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: Consideringadatastrutureindependentlyofitsunderly­ingsetisinterestingformanypurposes.Forinstane,thisis theesseneoftheapproahtakeninthetheoryofspeiesof strutures[3]forombinatorialenumeration.Theapproah isfuntorial,whihisalsotheasein[17],whereB.Jay developsaoneptofshapepolymorphism.Inhispointof view,adatastrutureisalsoapair(shape,setofdata).
Sentence 2: asabove,theshapedesribestheorganizationofthedata strutureandthesetofdatadesribestheontentofthe datastruture.hismainonernisthedevelop­mentofshape­polymorphifuntionsandtheirtyping.Ex­amplesofshapepolymorphifuntionsarethegeneralized maporthegeneralizedsan,thatanbeomputedwithout hangingthedatastrutureorganization.Moregenerally, theshapeoftheresultofashape­polymorphifuntionap­pliationdependsonlyontheshapeoftheargument,notof itsontent.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: Similar modi.cations are also possible in public clouds where the cloud provider itself offers a desktop cloud service to users.
Sentence 2: the desktop cloud service may also be imple­mented by a third-party that leases servers and storage from a pub­lic IAAS cloud provider (e.g., if Onlive s Desktop service were im­plemented on top of Amazon s EC2).
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: In a similar fashion, synchronization support in Cray T3E is provided with the help of atomic mem­ory operations (AMOs), viz., fetch &#38; inc, fetch &#38; add, compare &#38; swap and masked swap [46].
Sentence 2: the usage of these primitives does not guarantee a sequentially con­sistent execution.
Relationship: contrasting