sadat2307/MSciNLI huggingface dataset:
Domain: Software and its engineering
Sentence 1: While this corresponds intuitively to the generativity of unpack in System F, it is undesirable in the context of dynamic, .rst-class modules.
Sentence 2: in order for an abstract type t de­.ned by some dynamic module M to have some permanent identity (so that it can be referenced by other dynamic modules), it is im­portant that each unpacking of M yields a handle to the same name for t. Moreover, as we show in the next section, our approach to de.ning wrapping is suf.cient to ensure abstraction safety.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: This fundamental difference between the heterogeneous system used in our work and previous work that uses DVFS, forces the operating system designer to consider factors be­yond caches and memory when assessing the relative perfor­mance of the cores.
Sentence 2: we will demonstrate that the metrics typically used in previous papers that model het­erogeneity using DVFS, namely last level cache misses, are insuf.cient to explain the performance differences between core types in heterogeneous systems.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: The Blue CHiP Research Project designed and devel­oped the Configurable, Highly Parallel (CHiP) computer [8], a MIMD parallel machine with programmable inter­connect like FPGAs of today.
Sentence 2: the processors are not permanently connected to each other in a fixed topol­ogy; the programmer specifies how the processors are to connect.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: In order to simplify our analysis, we make the following assumptions about the application code being analyzed: An application process uses send(p, m) to send message m to process p, and uses instruction receive(p, m) to receive message mfrom process p. For each send or receive instruction, the value p and the size of message, m, can be determined at compilation time.2  The message send/receive relationships can be statically cap­tured at compilation time.
Sentence 2: for each message send in­struction, the compiler can determine which receive instruction receives the messages sent by that send instruction; and for each receive instruction, the compiler can statically determine the send instruction that sends the corresponding messages.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: In this paper, we merge these two lines of research, by showing how recent the­oretical decidability results for veri.cation can be fruitfully transferred to a concrete UML-based modeling methodology.
Sentence 2: we identify additional steps in the methodol­ogy that, in signi.cant cases, guarantee the possibility of verifying the resulting models against rich .rst-order tem­poral properties.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Furtherdetails on the experimental procedure are provided in Section 2.3.
Sentence 2: the objects used in this study are screen mockups and UCs of twodi.erent software systems: EasyCoin andAMICO.EasyCoin isasystem forcatalogingcollectionsof coins, while AMICO is a system that helps Property Man­agers to manage a condominium (an activity very relevant in Italy) [5].
Relationship: entailment
Domain: Software and its engineering
Sentence 1: The GoldRush method is made possible by the FlexIO transport in the ADIOS I/O system [19][47] widely used on high end machines.
Sentence 2: with FlexIO and ADIOS, analytics pipelines can be configured to map to compute nodes only those portions of their computations that fit into available idle resources, with additional analytics mapped to dedicated resources and/or run as post-processing tasks after data has been moved to the machine s attached parallel file system.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Finally, we de.ne the notion of structural patterns­based trace similarity as the equality of the sets of structural patterns observed in traces.
Sentence 2: compatibility testing based on traces can be realized with a function that transforms a trace into a set of structural patterns as the tranformation function a and set equality as the test predicate ..  3.2 Temporal Patterns-based Similarity Structural patterns-based trace similarity will be ine.ec­tive in situations where traces are identical in terms of the structural patterns but di.er in the order of structural pat­terns.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Tostatemorepreciselythemainquestionaddressedinthispaper,assume that we have a translation s(·) that can be applied to (a)XML schemas, (b) XML documents, (c) XML schema mappings,and (d) XML queries.
Sentence 2: then the concept of correctness of such a translation is shown below: mapping M target T query QXML : source S M answer shred shred shred Relations : s(S) s(M) M s(T ) s(Q)M answer  suppose we start with an XML document S and an XML schema mapping M. In a native system, we would materialize some solution T over which we could answer queries Q.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Texas Instruments TMS320C6x family of VLIW dig­ital signal processors [10] is both commercially important and also the epitome of this architectural style, so we have targeted this family for our research prototype.
Sentence 2: we are targeting the C62x family, which are 32-bit .xed-point DSPs that are code­compatible with the more powerful C64x .xed-point family and the C67x .oating-point family.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: CONCLUSIONS AND FUTURE WORK Transparent shaping supports reuse of existing programs in new, dynamic environments even though the speci.c characteristics of such new environments were not necessarily anticipated during the original design of the programs.
Sentence 2: many existing pro­grams, not designed to be adaptable, are being ported to dynamic wireless environments, or hardened in other ways to support perva­sive and autonomic computing.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Despite ESC/Java s success at .nding real errors, feed­back from our users suggests that the tool has not reached the desired level of cost e.ectiveness.
Sentence 2: users complain about an annotation burden that is perceived to be heavy, and about excessive warnings about non-bugs, par­ticularly on unannotated or partially-annotated programs.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: 5.3 Refactoring Linux As a key step in applying the shared-most OS model, we refactor a recent Linux kernel 3.4 into both the main and shadow kernels of K2.
Sentence 2: in bringing up Linux on the Cortex-M3 of OMAP4, we adopt code from the linux­panda project [21].
Relationship: entailment
Domain: Software and its engineering
Sentence 1: ON DESIGN OF HYPERHEURISTICS The implementation of heuristics methods represents an interesting context in which software design topics can be studied.
Sentence 2: when performance is not as relevant as non-functional requirements that are related to the de­sign, we must obtain adequate results in reasonable execu­tion times, but the design of our solutions must consider modularity, reusability, and extensibility, for example.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: The main idea of our approach involved performing ethnography with its holistic and contextual vision, including some characteristics of action research, such as its collaborative and reflexive approach; used to recommend how to improve the studied practices to the company.
Sentence 2: we address: (a) the advantages and challenges associated with working in collaboration with, and having results to offer to, the participating company (b) the insider/outsider dynamic of participant observation; (c) the balance between participant listening and participant observation; (d) the researcher's relationship with the participants; and (e) the rigor in qualitative work that involves the dilemma of the contextualization to be sufficiently broad and detailed.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: For instance, the Themis structure tem­plate mechanism can provide multiple views of a struc­ture via its label and parameter mechanism.
Sentence 2: the user of a Themis structure may not care about the spe­ci.c layout of a particular structure; instead, it knows that this structure contains a From Address and it can ask the structure server to provide access to just that portion of the structure and nothing more.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Consequences of the embedded expander (which are analyzed in Sections 3 and 4) include: Fault tolerance: The expansion property is equiva­lent to the property that a deletion of k nodes may iso­late from the primary component at most O(k)nodes.
Sentence 2: even if a constant fraction of the nodes are deleted by an adversary, still a constant fraction of the nodes would remain connected in a single com­ponent.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: The hole (which we represent with )isa special internal data structure that acts like Arr or LoopD except that instead of holding the function f and state i, it keeps track of the modifying functions g and j.
Sentence 2: if the hole is an Arr form, then we know that we will eventually come to a scenario such as Arr f = Arr (gf ) Name GHC arrowp CCNF Stream Dynamic Counters 1.0 1.66 10.91 12.73 Chained Adder 1.0 1.91 4.06 4.29 Chained Integral 1.0 2.17 13.27 15.40 Figure 10.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: 3.5 Synthesis soundness and completeness An important property of Zephyrus is that all its parts have been formalized.
Sentence 2: the translation into constraints and the generation of the con.guration, two very complex and important pieces of Zephyrus, have been pre­cisely described and proven correct in [7], where the follow­ing results have been shown for Zephyrus: Theorem 1 (Soundness).
Relationship: entailment
Domain: Software and its engineering
Sentence 1: (q, o)][t ..] The corresponding reactive rule is simply de.ned as: (p,c, cTer(q)o) ...(.PU , cuTer(q)o , ) 4.5 Informing All the interaction patterns considered above mainly con­cern the agent receiving and processing knowledge queries.
Sentence 2: none of these interaction patterns has any ef­fect on the agent place, as emphasised by the fact that no place updates were speci.ed.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: The completeness theorem offers such an answer: ornament-induced promotion predicates are exactly those express­ible as relational folds (up to pointwise isomorphism).
Sentence 2: a predicate can be baked into a datatype by ornamentation if and only if it can be thought of as a nondeterministic classi.cation of the elements of the datatype with a relational fold.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: GF has two rows: all iterators appearing in the non-FVD are represented in the .rst row, and in the second row iterators appear­ing in the FVD with a coef.cient of 1 are represented.
Sentence 2: for the access function matrix F of dimension l×d+ n + 1, GF is constructed as follows.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Formally, the intended au­thentication goal holds at least until bob s agents collectively have su.cient information to infer that in one session, one of these agents received a replayed nonce for an expectedly fresh Ma.
Sentence 2: the corresponding attack launch detectability formula that holds on the IS model I is: A (auth@3({Ma, Mb}) WDbob ¬ auth@1(Ma)) (a) where Dbob is the distributed knowledge modality DG for the group G of agents representing bob and playing the B role in the second level, auth@3({Ma, Mb}) abbreviates the the set {auth@3(ag, {Ma, Mb}) | ag .
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Still, using dataflow it is possible to avoid this barrier Figure 6b.
Sentence 2: we partition each row to n partitions, where n is the number of worker threads, and build dependency graph so that each partition from the observation step t is processed by a dedicated task ComputeTask[t][j], where j corresponds to the position of the partition in the row.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: The hygiene algorithm in Scheme allows de.nitions and uses of macros to be freely mixed in a given lexical scope.
Sentence 2: a macro can be used in an internal de.nition before its de.nition: ( d e f i n e ( f o o ) ( d e f i n e y ( i d 1 0 0 ) ) ( d e f i n e -s y n t a x -r u l e ( i d x ) x ) ( + y y ) ) ; ; e x p a n d s t o : ; ; ( d e f i n e ( f o o ) ; ; ( d e f i n e y 1 0 0 ) ; ; ( + y y ) ) In order to support mixing use and de.nition, the Scheme expander must make multiple passes through a scope.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Multiple Concerns in Aspect-Oriented Language Design: A Language Engineering Approach to Balancing Bene.ts, with Examples Gary T. Leavens Curtis Clifton Department of Computer Science, Computer Science and Software Engineering, Iowa State University, Rose-Hulman Institute of Technology, 229 Atanasoff Hall, Ames, IA 50011 USA 5500 Wabash Ave, Terre Haute, IN 47803 USA leavens@cs.iastate.edu clifton@rose-hulman.edu Abstract Some in the aspect-oriented community view a programming lan­guage as aspect-oriented only if it allows programmers to perfectly eliminate scattering and tangling.
Sentence 2: languages that do not al­low programmers to have maximal quanti.cation and perfect obliv­iousness are not viewed as aspect-oriented.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Jamiie has to exploore the exampple ccode in more d etail to separatte relevant piecces of code fro m irrrelevant piecees.
Sentence 2: shhe has to identtify which funnc­tiions, variables, and imports oof JavaScript aand CSS files aare nnecessary to mmake her code wwork the samee way as the exx­aample.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: 4.4 Application to typical WSDL service de­scriptions The proposed conversational model could be applied to current Web Services with limited e.ort, if they already of­fer a WSDL service speci.cation.
Sentence 2: the service descriptions could be extended to specify the conversation .ow, at a limited level of detail, by adding the WSFL-like .ow speci.cation.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: For the Synergia2 project, we have adopted an operational interest in collectiveeffects.We are interestedin those collective ef­ 1WhileFortran 9X allows lower bounds in each array dimension to start atanyintegervalue,manyloopsinFortran applicationsare hard-codedto begin iterating at 1. fects that can be modeled by applying a momentum kick to the particles.
Sentence 2: synergia2 is concerned with the space-charge collective effect.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Given a database application and the schema de.ning its database back-end, our approach produces a parameterized mock database that complies with the schema and, at the same time, captures the behavior of the database back-end.
Sentence 2: such a mock database replicates the effect of operations over an actual database by performing the same operations on itself, so that the state of the  Figure 1: Architectural Overview of MODA actual database is faithfully mirrored and only feasible values are returned for database queries.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: In this context, standardization organisms, such as the In­ ternet Engineering Task Force (IETF) and IPSO Alliance, have been working on standard and interoperable commu­ nication mechanisms, in order to interconnect these devices.
Sentence 2: the Internet Protocol version 6 (IPv6) [7] has been identi.ed as the main candidate, and several working groups have been set in order to address the issues related to IoT devices communication.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: The solution to this problem we propose here is to offer the pro­grammer a restricted language, powerful enough to write complex iterators and simple enough to type them precisely.
Sentence 2: a lan­guage of non .rst-class operators which are not typed (or are just lightly typed) at their de.nition but, rather, are very precisely typed at the places of their application.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: We also observe however that, even with a 64KB data cache per pro­cessor, the average speedups with the nest based, global (.rst nest), global (ordered) and our approach are 4.41, 5.07, 5.44 and 6.29, respectively.
Sentence 2: our approach still generates the best results among all the versions tested.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Conventional macros use flat scoping all parameters are global they can be set and reset by all others Frames parameters, on the other hand, are local to the frame that first sets their values This means they can be set and reset only within the defining frame; descendent frames can only read them when a defining frame exist, all its parameters become undefined Conventional macros have a daisy-chaining parameter passing convention.
Sentence 2: if macro X invokes Y and Y invokes Z, parameters passed from X to Z, must either pass through Y or must be global forces macro Y to be more context sensitive... if frames X, Y and Z invoke each other as above, X parameterizes Z without involving frame Y macros find it hard to modify the bodies of other macros... frames can, if necessary, directly rework remove or replace any parts of a frame that don t fit the local context."
Relationship: entailment
Domain: Software and its engineering
Sentence 1: CONCLUSION &#38; FUTURE WORK In this paper, we have attempted to describe briefly early steps towards a PhD program of study aiming to revisit model-based UI engineering from a perspective which takes account of current and emerging trends in user interface software and technologies.
Sentence 2: our intention has been to raise the issue of managing creative UI designs and how they can be accommodated in the model-based tradition of UI engineering.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: The system rollout, theretbrc, was always this complex balancing act that included the maintenance of both these local university networks as well as wider relationships to the supplier and other adopting universities.
Sentence 2: it is not simply a matter of fit between the universi.ty and the system but also of how the university_ relates to others (i.e.. its fit within the sector_ or to the standard).
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Code to control the pump reacts to multiple user requests or failure conditions.
Sentence 2: 1) a patient can request a bolus during the ongoing infusion as re.ected by the E-RequestBolus event; 2) the caregiver can pause a current infusion by pressing a pause button that triggers event E-PauseInfusion; 3) an empty-reservoir condition (condition Cond-6-3 ) occurs if the remaining volume of the drug reservoir is less than a pre­speci.ed threshold; and 4) the condition Level-Two-Alarm should be processed if a hardware failure such as the drug reservoir door is open or an occlusion is detected.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: vis :: Noun vis = (hostisParadigm "vis") missing [ NounForm Singular c|c<-[Vocative, Genitive, Dative] ] An often occurring exception is additional variants, expressed with the function variants.
Sentence 2: that a word is in a particular paradigm, but have more than one variant in one or more forms.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: For any connected and non-bipartite social net­work, the probability that a length-w random walk starting from a uniformly random honest node will ever traverse any of the g attack edges is upper bounded by gw/n.
Sentence 2: when vv w = T(nlogn) and g = o(n/logn), this probability is o(1).
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Language implementors must also respect the fact that .­ nalizers naturallyconstitute a separate asynchronous thread of control.22 This applies to any.nalizers on heap objects, whenever these become inaccessible at a point that is not completelyapparent to the programmer.
Sentence 2: .­ nalizers should never be run implicitlyas part of a client thread which maybe holding other locks.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: C is constrained by at most two non-con.icting cardinality constraints in F, one lower bound (=) and one up­per bound (=).
Sentence 2: a dimension instance d =(D, m, <) satis.es the model D, written d |= D, i. it satis.es every constraint in F. d |= f for all f .
Relationship: entailment
Domain: Software and its engineering
Sentence 1: And while we aim to have operator membership in system be open to arbitrary operators world-wide, we must rely in part on a reputa­tion system to ensure that operators do not over-promise and under­deliver resources.
Sentence 2: the barriers to entry to the system (registration, due diligence, credit analysis) must be high enough to discourage small spurious providers, but low enough to ensure wide accessibility.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Two recent simulation-based studies have suggested an alter­native solution in which ISPs and P2P users cooperate to reduce cross-ISP traf.c.
Sentence 2: if a P2P client biases its connections to peers in the same ISP, the peer could receive near-optimal performance while signi.cantly reducing the number of times the same data item enters the ISP [3, 8].
Relationship: entailment
Domain: Software and its engineering
Sentence 1: In partic- ular, we distinguish the following three types of connections from clock to co-processor: 1. authentic and reliable connection (clocked co-processor) --clock pulses and only clock pulses are received by the co- processor; 2. reliable but not authentic connection --clock pulses are re- ceived, but some may be from the adversary; 3. no connection (stand-alone co-processor) --the adversary controls the clock signal for the co-processor.
Sentence 2: to formally capture the possibilities of these different models, we introduce a more general notion for proactive secure networks in terms of an allowed inaccuracy A E N. such a network only provides secure communication to every pair of non- corrupted servers during their local phase ~- if both servers are hon- est throughout their local phases IT--A, T+A].
Relationship: entailment
Domain: Software and its engineering
Sentence 1: The analysis of the product value requires a better under­standing of interdependencies among various artifacts of the software development lifecycle, particularly, requires to get a better understanding of how the value chain is preserved from problem space to the solution space.Thus, the spe­ci.c research question introduced in this position statement is about how to preserve the values from the prioritized re­quirements to the product architecture with the aim of sup­porting the analysis of the product value.
Sentence 2: we propose the use of traceability to preserve the value chain.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: 6.3 Trace-vs. Method-based Dynamically Typed Language JIT Compilers While PyPy is the best performing Python JIT compiler, there is no clear evidence to prove that trace-based compila­tion is more effective for dynamically typed languages than method-based compilation.
Sentence 2: in the domain of JavaScript, where the competition for performance is quite .erce, all of the major leading commercial JIT compilers are method-based.
Relationship: entailment