Replication Factor: The replication factor is the number of working sets that a certain element belongs to.

it tells how many copies of an element are made and distributed.


That input value could either be equal to : or not, except for input[n] which we assumed to be zero.

for the whole program P composed of the two functions top and locate,there are 3n-1 possible execution paths: n executions terminate after the then branch of line 14, n executions terminate after the then branch of line 15, and n -1 executions terminate in line 16.


This results in a complex design, which is hard to implement and maintain.

in this paper we propose a custom UML profile referred to as the c-FSP-UML profile to decouple the crosscutting context-dependent behavior of a service from the core service logic at service interface level.


Some con.gurability was achieved using external parameters and runtime checks.

feature code was scattered all over the application.


Recent studies [3, 20, 30, 35], however, show that the above assumptions do not hold in real-world social networks.

the effectiveness of these schemes are left as an open question.


The main goal is that the complexity of dealing with different software stacks is made hidden by the framework.

software developers will be able to focus on the problem of creating mobile applications with a reduced time-to-market rather than waste their time on the porting of a software solution to several platforms.


In this case, LRead always returns a value read from BANK[i].

it suf- fices to show that any value that is in BANK[i] at some point within the execution of LLL, or is written to BANK[i] after that point is the current value of word i.


While ODK Sensors was influenced by these projects, it focuses on creating user-level drivers for locked consumer devices running Android.

unlike these projects we do not alter the kernel to provide the communication link between the OS and the user-level driver.


This assignment, however, can happen only if there is not already an edge.

we add a NAC which prevents the application of the rule in cases where the edge between the R and the U node already exists.


The problem is that messages should not be decrypted by an EPE bound to processes that are no longer running.

an EPE and AAP should both go down at the same time sharing the same fate.


All variables in an SCC of G have the same storage size.

the root of each tree returned by Decompose-colorclass corresponds to an SCC in G whose variables have a maximal storage size under :.


To reduce this overhead even further, we take advantage of the fact that when a .xed-size block has been fully allocated, the coalesce tag contains norealinformation and canbeeasily recreated(since nofree regions existin theblock, allbitsin the coalesce tag are set to zero).

the .nal region to be allocated within a .xedsized block can overwrite the coalesce block, recovering the space usedby the coalesce tag.When a regionisfreedfrom apreviously fully allocated .xed-size block, the coalesce tag can be recreated and stored in the newly freed region.


As more and more Web services are composed using BPEL, ensuring correctness of BPEL implementations becomes increasingly important.

the behaviour of a Web service composition should be tested exhaustively before it is used.


Both Metronomeand Metronome-TS are implementedintheexact same base JVM, and share much of the common GC code and data structures.

comparisons between the two algorithms are made on a level playing .eld with the only differences in the systems being the GC algorithms themselves.


This is due to the fact that word count is more I/O-heavy, compared with the other applications.

each node has more I/O requests to issue to dom0.


We omit the case where t is the application of a type constructor T , because it is subsumed by the last case, where t is a universal type.


3.5 Determine the Computations to be Of.oaded As shown in [27], a class that has more bytecode instructions is usually the one that costs more computing resources to run, e.g., CPU and memory.

dPartner calculates the instruction numbers of each movable app class to .nd the top n (e.g., n=3) computation intensive classes.


Thesede.ciencies are correctedinCS-MNSandour analysis does not suggest any upward limit on network size.

since CS-MNSshares a compatiblebeaconformat withTSF, the whatever the true network topology, for analysis the topology canbeconsidered tohavea single reference node that cantransmitto many nodesbut cannot receive.


Be-cause p found that X --p held at line 3, X is not written by any process between p's execution of line 0 and p's exe- cution of line 3.

q executed line 3 before p executed line 0.


Therefore, the relevant slice will contain the statements at lines 5, 3 and 1 in addition to the statement at line 4 that is in the full dynamic slice.

the relevant slice of variable a at line 14 for this input will contain only one faulty statement i.e., the statement at line 3.


since a ' Sizea (ma)=Sizea (m )+Sizet (t), we have the needed SizeS (S)= a Sizes (ma).


In the so-called RBAC mode, the permission management of Principals is separated from the permission management of CodeSource objects.

the RBAC mode has the advantage of an easier handling, but on the other hand, it is e.g.


Since NP = coNP is an important and long outstanding open problem, it is unlikely that a SAT solver, an e.cient solving technique for NP-complete problems, can be used as the main part of the solution for the problem of .nding prime implicants of a DNF formula, or equivalently computing prime implicates of a CNF.

we will seek other techniques for .nding or-groups in a CNF formula.


The Storage process models both types of storages, one to get a piece of iron and one to store the manufactured good.

a Storage can receive a load and a store signal.


This framework is essential for building other secure-deletion capabilities that rely on tainting or encryption-based key deletion.

our contributions are the following: (1) a per-file securedeletion framework that works with the legacy storage data path, which (2) addresses the challenges raised throughout the data path into a single work and (3) has been systematically verified.


Realization The By-Example Operation Recorder presented in the previous section is realized based on the Eclipse Modeling Framework3 (EMF) and EMF Compare4.

in the Origin area as well as in the Working area of the GUI any EMF-based editor might be applied for the creation of the example and for the description of the refactoring operation.


The resulting systems can perform quite general tasks at scale, but o.er a low-level programming interface: even common operations such as database Join require a sophisticated understanding of manual optimizations on the part of the programmer.

layers such as Pig Latin [20] and HIVE [1] have been developed on top of Hadoop, o.ering a SQL-like programming interface that simpli.es common data-processing tasks.


The microkernel term describes a form of operating system design in which the amount of code that must be executed in privileged mode is maintained to an absolute minimum [4].

the rest of services are built as independent modules that are plugged and executed by the kernel.


That is, building reputation within the community is a key motivator for contributing to Stack Over.ow, and contributors reputations are quanti.ed by scores based on their answers to questions posted on Stack Over.ow.

the reliability of the question/answer could be directly associated to the user who have created it.


While considerable effort is spent trying to eliminate such problems before deployment or at run-time [9, 14, 38, 48], the size and complexity of modern systems combined with real time and budgetary constraints on developers have made it increasingly dif.cult to deliver bullet-proof software to end-users.

many software failures still occur in .elded systems providing production services.


delay-sensitive media streaming applications, the typical streaming bit rates in modern streaming codecs must be accommodated for all the peers in a streaming session, in order to ensure their uninterrupted streaming playback.

it is typical for a peer node to parallelly download from multiple upstream peers, in order to improve the overall bandwidth availability.


For example, given the query all x : JavaMember | x defines foo AND x assigns bar , the system would generate a query summary of { foo(assigned),bar(assigned) } .

for each query we get a set of query summaries, one for each conjunctive clause in the DNF.


Since this is a non-zero constant, dividing the suspiciousness assigned to each statement by it results in no change to the relative order of the statements, i.e., the ranking.

equation (17) can be equivalently written as: susp s + () () =failedCovered s () passedNotCovered s (18) Since in the context of fault localization, Rogers and Tanimoto has been shown equivalent to Simple-Matching, and since Simple-Matching can be equivalently represented by Equation (18), it follows that Rogers and Tanimoto can also be represented by Equation (18).


Our refactoring framework starts by finding upfront the list of best refactoring solutions that represents a good trade-off between improving software quality which corresponds to minimizing the number of code-smells and improving QMOOD (Quality Model for Object-Oriented Design) quality metrics [10]; minimizing the size of the refactoring solutions (number of refactorings) and maximizing/preserving the semantic coherence of the design.

we use a multi-objective optimization algorithm, NSGA-II, to compute this optimal sequence of refactorings based on our previous work [4].


Therefore, multiple weaving at different locations is not appropriate.

we provide a workaround in that these variabilities are initialized before the execution of affected base use cases.


The temporal relations of the workflow model are omitted in this presentation.

the model can be displayed in an even more compact form.


If we have some level of node redundancy, a small number of node failures may not a.ect the system application at all.

in general, health monitoring techniques are not su.cient to provide con.dence in application-level requirements for WSNs at run time.


At all levels in the MRNet tree, we use a common representation for the stack traces that have been collected and aggregated.

all bit vectors used to indicate task sets (e.g., for for the call graph pre.x tree edge labels) are sized to .t all tasks of the entire application, even though only a subset of the bits are relevant for a given daemon or MRNet communication process.


However, programming with event-driven state machines in C su.ers from a number of problems [17].

while the device .rmware can deliver good performance, it is often di.cult to write and debug.


However, we cannot know the sizes of the individual objects.

we determine the upper bound of the amount of free area consumed during a single GC cycle, and conservatively reserve a contiguous free area larger than the upper bound.


The transportation processes that send messages from a sender to a queue and from a queue to a receiver are transaction-based.

during the transportation, if an error happens, the transportation processes would be rolled back.


While object behavior is specified by methods, the state of an object is represented by the object's current attribute values.

a persistent storage service deals with storing attribute values persistently, with the aim of en- hancing fault-tolerance.


In our study, e.ort estimation accuracies are average values from 10-fold cross validation.

the estimation accuracies of LS with and without outlier elimination are not signi.cantly di.erent.


(Ifit were,Rule(c) would make CPequal toHB.


We would like to avoid solving such hard problems.

we use a simpli.ed partial order de.ned as follows.


The most widespread format by far is motion compensated compressed video, specifically MPEG-2.

it is very difficult to find video that is uncompressed or even in DV format.


Web services are used by (remotely) invoking service operations.

there is no need to integrate the service with the application under development.


However, when post-copy is used, the destination node has more up-to-date copy of the virtual machine and the copy at the source happens to be stale, except for pages not yet modi.ed at the destination.

failure of the destination node during post-copy migration constitutes a critical failure of the VM.


While this limits the number of states (and symbols) to 216 =65, 536 in our IBCM implementation, it is not limited in the formal IBCM computational model.

one can encode any amount of states, symbols, and transition functions into IBCM s memory.


(2) Ti for producer ti and consumer tc If cache narrowings take place at the end of a task s period, the lifetime of objects is not extended arti.cially beyond a period.

the assumptions of the equations above are ful.lled and these formulas can be applied to the proposed GC algorithm.


For the sake of explanation, let us assume that each memory bank can store up to 500 array elements.

array A can be stored in two banks Bi and Bi+1 (see Figure 7(b)).


they would require the  same set of Permissions.


First, we note that the class of a DADT object is not a subclass of the current representation because, strictly speaking, it is not inheriting behaviour but rather observing the original object.

the interface operations must also be wrapped (but not necessarily re-implemented).


If a thread is switched out during the execution of code fragment (from moment A to moment B) that being measured, the measured execution time will be obvious enlarged.

the existence of hypervisor level scheduling would increase the probability of such risks.


This also includes ways to define subtypes and relationships between objects.

we can say that the core patterns that may help to describe the AOM architectural style are: .


Since region-based compilation is performed only at high optimization levels of the compiler, the method in which a region exit occurs is known to be performance-critical.

it is recompiled instead of being continued in the interpreter.


Increments the epoch number of class C. This is a .xed-width integer, with the same bit-width in the class as in the object headers.

the increment operation may cause wrapping, but as we will argue below, this does not compromise correctness.


Since Java programs heavily use libraries that contain many unused methods, we have augmented our analysis to keep track of reachable methods, in order to avoid analyzing dead code.

we take into account the e.ects of statements in a method body only if the method has been shown to be reachable from one of the entry methods of the program.


The runtime checks guarantee that even if a read-only reference .ows into a mutable reference, it is impossible for modi.cations to occur through the mutable reference.

javari soundly maintains its guarantee that a read-only reference cannot be used, directly or indirectly, to modify its referent.


By making sensor network interaction look and feel like web programming, we open doors to new sensor network application developers.

our approach builds a software architecture that enables sensor data dissemination based on web programming principles.


Each micro-engine in the IXP series processor has a local data store which has a very low access latency.

a thread does not need to context switch while accessing this memory.


Since C2 and C3 differ from C1 in having the composite objectives, MQ was removed from C2 and EVM was removed from C3 before PFC2 and PFC3 were joined to PFC1.

the best front for an instance was always described by four objectives: cohesion, coupling, difference, and number of clusters.


4.2 Protocol As intimated in the introduction to this section, our pro- tocol takes advantage of the fact that an application running on a reference host specifies the context over which it would like to operate, but the application does not need to know the identities of the other hosts in this context.

the context computation can operate in a purely distributed fashion, where responses to data queries are simply sent back along the path from whence they came.


The implemented strategy that is based on device types (DTStrategy) assigns weights wDT according to the type of the device.

we de.ned the device types infrastructure for devices like desktop PCs, notebooks, or servers (wDT =1.0), mobile for smart phones and PDAs (wDT =0.5), and cellular for simple cellular phones (wDT =0.0).


a task should not end at a node that is a source of a backward edge if that node is also the source of an indirect edge.


If the system is even able to autonomously re-deploy software components affected by a hardware crash failure, it can ensure that despite transient hardware faults the availability of the system does not decay step by step.

such systems can be classi.ed as self-healing (cf.


Hypothesis 2 is derived from the observation that the existence of unrelated traces may negate the e.ect of learning via generalization; ie., they can lead to over-generalization.

by clustering related traces and performing learning on each cluster, the e.ect of inaccuracies in learning can be localized to within a cluster.


Instead of providing an IOR for remote ob jects Java RMI serialises a stub using native Java serialisation and deserialises it again at receiver-side.

providing a user-speci.c, initial stub for the system is enough to obtain user-speci.c behaviour for all stubs, as they are all copies of the .rst one.


This however would be revealed by the replies of the rest of the neighbors, for both peers.

to mutually boost each other s reputation, all neighbors of each peer would have to cooperate and consequently all of their neighbors, until the whole network was part of the collusion.


We call the left end point of a line segment a turning point.

sN (·)can be represented by 2M numbers because each turning point can be represented by its two coordinates.


Furthermore, when the head or body is manipulated and the arms are left unconstrained, the arms rotate in a natural way to follow the body movement.

features are preservedatawiderangeof scales.Inthisexample,afullbodyposeis sculptedusingagraphof226 nodes.Thetailis lifted, arms crossed, left leg moved forward, and head rotated to look backward.


Sparsity:the large majority of a VM image may never be accessed in a complete execution cycle (see Table 2).

randomly downloaded pieces will likely never be of use, the bandwidth used to obtain them being entirely wasted.


We use a graphical notation (as illustrated in Figure 1a) to present the front-end to the pattern user.

specifying the front-end involves two files: (1) specifying the graphical elements that are or can be used by the pattern and (2) defining the generic behavior pattern by means of those graphical elements.


Due to exponential warm-up growth, most nodes in the system joined recently (although they believe they are older).

high bandwidth nodes must still reach their degree when the simulation starts, so topology tra.c in Figure 10(c) is high.


In a GPME, modeling commands are independent to a certain methodology, for they have to be applicable to the generality of methodologies.

every suitable metaclass of the GPML according to the current selection is offered for creation ensuring at least specification compliance.


However, many instances of a C++ class may exist.

the ThisPtr allows for operations on the data members within a particular object instance.


Taking only the mean into consideration will ignore the fact the actual resource utilized can be signi.cantly higher.

we also needs to deal with variability of resource usage with time.


Composition is de.ned by the UML2 infrastructure speci.cation [17] as A form of aggregation which requires that a part instance be included in at most one composite at a time, and that the composite object is responsible for the creation and destruction of the parts.

when a model element is changed, all model elements that are connected as parts of a composition relationship are considered impacted.


: Constraints * Xtend 2 and Java require just-in-time compilation for initial execution.

the first execution of constraints has been measured separately.


It is not uncommon for programmers to be surrounded by multiple displays showing various aspects of the development process such as the debugging and program state.

the space used to show conflict-specific information during the software development process is an important aspect of the evaluation.


The antennas were mounted on the flat part of the vehicle roofs at the same height on each vehicle.

the horizontal plane transmission power is of primary interest.


The receiver of this call, this.f, is unclassi.ed because this is not committed.

the call type checks only if setF s receiver is declared unclassi.ed.


These function symbols represent numbers of class instances in the pre-state.

these values are .xed, and an optimal instantiation of the concerned quanti.ers is performed during the translation in this case.


Table 1: Control Parameters for Sensitivity Experiment Input parameter Range Step Initial Novice Workforce Initial Experienced Workforce Scheduled Completion Time [0-10] [2-10] [45-80] 1 1 5  Under the System Dynamics simulation approach, all systems, no matter how complex, consist of networks of feedback loops, and all dynamics arise from the interaction of these loops with one another.

much of the work when building a System Dynamics model is discovering and representing the feedback loops, which along with stock and .ow structures, time delays, and nonlinearities, determine the dynamics of a system.


Additionally, the last step of Stage 3 represents today s approach.

the marginal cost brought about by the method is the Stage 2 inspections (several of which are or could be carried out by the configurator) and, in Stage 3, the examination of the actuation report (a step of almost zero cost).


Further, it is similar in Information Systems to the design science research methodology that is technologyoriented and attempts to create things that serve human purposes [22, p. 253].

design science consists of two basis activities: building an artifact and evaluating it [22, p. 254].


Thus, it makes sense to report even common exceptions, such as NullPointerException, if these occur within the valid precondition space.

the CnC runtime needs to know whether a method was annotated with a Daikon-inferred precondition.


With more bits being stored in a .ash cell and smaller feature size of .ash cells, the maximum number of erasures tolerable by each block further decreases, for example, to several thousands or even several hundreds for the latest 3-bits MLC SSDs [23].

to maintain high durability, another design requirement of SSDs is to maximize wear-leveling in GC, such that all blocks should have similar numbers of erasures over time so as to avoid any hot blocks being worn out soon.


In[20], wegiveaconstructivesuf.cient condition ensuring that the controller computed for H is indeed a quantized controller for H. 2.4.1 Symbolic Controller Synthesis Control abstractions for bounded DTLHSs are .niteLTSs.For example, a typical quantization is the uniform quantization which consists in dividing the domain of each state variable x into 2bx equal intervals, where bx is the number of bits used by AD conversion.

the abstraction of a DTLHS induced by a uniform quantization has 2B states, where B = .


SARC, meanwhile, happens to detect the sequentiality of accesses with a default threshold of 4 contiguous blocks.

any application request, sequential or random alike, after passing through L1 will be perceived as sequential by L2 and encourage unnecessary prefetching.


Modi.ed Condition/Decision Coverage (MC/DC): requires to show that each condition can independently a.ect the outcome of the decision [12].

having n conditions in a decision, n + 1 test cases are required to achieve MC/DC.


However, the available techniques to describe the software architecture of such systems do not support to make the control loops explicit.

architecting self-adaptive systems and their self-adaptation logic is today not well supported.


For instance, every 10ÆC-15ÆC rise in temperature can reduce the mean time between failures by half [38].

a higher heat dissipation requires active cooling mechanisms such as fan mounted on heat sink, heat pipes, and liquid cooling.


Our background subtraction approach is based on building a model of the colors seen in the neighborhood around each pixel and then computing the difference between each new pixel value and the historical model for that pixel s neighborhood.

the algorithm must maintain state for each pixelin the image (its model) and traverse each input image, comparing each new pixel against the model, and updating the model based on the values of surrounding pixels.


If any one of these conditions is not satis.ed, the edge cannot be coalesced.

an attempt is made to incorporate it into the partial cover by checking the same conditions that were formulated by Liao et al., i.e.


Storyboards were developed by UI Designers using Microsoft PowerPoint and illustrated a sequential set of UI screens for a specific workflow with the ability to add annotations to each screen.

storyboards were able to express UI design and depict workflows in a way that could be understood by all stakeholders [4].


iterator().next().getFact(), illustrated in the .gure by the shaded portion of predicate 12.12 We mark off the recursive parts of the access path and propagate only the folded structure.

the recursive sub-sequence is folded to generate predicate (src.getAttributes().iterator().next().


To be e.cient, it performs many sound but incomplete abstractions.

it always .nds all run-time errors but may report spurious alarms.


Finally, the PCE of Buffer aspect failed to capture stream operation of the new components: MusicPlayer and VideoPlayer.

the reason for the occurrence of the pointcut fragility problem for the MobilePhoto developed without the CM in Sc2 was the same as that of the Sc1, the string patterns used to describe the join points in the defined PCEs were not prepared to handle the new components.


Although in the analysis presented in [22] there were two independent variables: kind of diagram (class/nonstereotyped collaboration/stereotyped collaboration) and reading technique (CBR/PBR/Ad-hoc) the number of data points did not allow to use appropriate statistical methods (one-way ANOVA) for analysis.

in this paper, we do not regard different reading techniques as an independent variable.


Based on the virtual browser, web application developers can deal with multiple devices in a single virtual web page, rather than in multiple separated web pages.

the content on multiple devices can be logically linked into a single virtual page environment.


In the first scenario (see Figure 1a), the managed service is provided with both Event Captor(s) and a local Monitor and has, therefore, both event reporting and SLA checking capabilities.

when it receives an SLA, SLAM4M checks if each guarantee term in it can be monitored locally, according to the capabilities exposed by the Event Captor and the Monitor.


Consider the new operator l1(append, [], [ -2 s1 .. -1 s2 [ )(if !f then [Ref] else []) 1in Example 5.

since abs instant(1 , s2, 4) = 3, the interval partition is {[0,0]; [1,1]; [2,2]; [3,3] }at instant 4.z is 4, l is 3 and r is 1.


Besides, because fairness and performance are both attractive to users, we do not want to sacrifice performance in exchange for strict fairness.

our first motivation of designing a new scheduler can be specified as follows: Objective 1: Our scheduler should guarantee strict fairness to the jobs with attractive performance.


That implies that we need to completely decouple aspect code from component code.

the second issue arising can be regarded as a consequence of the solution to the first issue.


At this point, the assignment-based scheme faces a problem, because it can neither instrument D or C. Vertex D is shared in both paths and any instrumentation of D in the future will overwrite the value of m1.

it will decrease the sampling period again to .t =3 as the current paths p1 and p2 will become indistinguishable again.


In our setting each tuple has its own identi.er, which is represented in the VALUE predicate.

even if repeated tuples exist, each tuple will still have its unique identi.er and, therefore, exactly the same rules can be used to map relational data under bag semantics.


For the following round the extended speci.cation is used.

the Xie and Notkin approach is also a DSD hybrid, but Jtest s static analysis is rather limited (and certainly provided as a black box, allowing no meaningful interaction with the rest of the tool).


technology, such as TCP/IP, Bluetooth, USB, etc.

there in the Connected Health vision, patients are the are some formal requirements on transport layer for IEEE ones that take control of their health and wellness by be11073, such as IEEE 11073 relies on connection oriented ing responsible for monitoring themselves using connected channels.


This results in the memory placement of Figure 1(b).

our contribution to the cache-placement phase is to make it sensitive to code size expansion.


To simplify, we choose the block size as an integer power of two times the L1 cache line length.

the decompressed blocks cannot be loaded into the cache straightaway.


Many details concerning user interaction are available early in a software development process.

we capture and specify them at the very beginning of a proposed design process.


Similarly, indexed monads can be implemented in any higher-order language having some notion of parameterized type, again such as SML or Java.

type classes and functional dependencies are convenient but not necessary for an implementation of session types.


INTRODUCTION Parallel computers are becoming important in a variety of scienti.c and engineering .elds.

parallel processing is considered as an important part of Computer Science and Computer Science Education.


And the probability for R1(i, j) = 1 and R2(i, j) = 1 is (1 - u v ).

we have P rob(R1f2(i, j) = 0) = u v +1- u v = 1.


The thread-escape problem is usually de.ned as follows: This reentrant lock acquisition cannot cause a deadlock.

fora tuple(t)to be a deadlock our b a 1 , l1, lhaccessible from more than one thread?


As a result, GenArch+ tends to better support participants in the task of localizing and correctly answering questions about con.guration knowledge.

based on current results, we can conclude that the correct understanding of the con.guration knowledge is considerable dependent on the di.erent speci.cation techniques.


However, g is guaranteed that v is on the channel.

if g consumes values from c , it can witness v and, similarly, if it places values on the channel, it is guaranteed that v will be consumed prior to the values it produces.


The evaluation of depth level in which the expected results of the processes of the MR-MPS are satisfied by the agile methods is subjective.

the satisfaction rating to the expected results of the processes also depends on the evaluator vision.


We note that in practice a Turbine application may post multiple system tasks through ADLB in addition to the user tasks required for the user application.

the available extra processing on the ADLB server is appropriate.


We find that combining integer loads (Figure 3(a)) for instance variables is quite effective for compress and jack, and that combining floating-point loads (Figure 3(b)) for array accesses whose indices are constant is similarly effective for mpegaudio.

our approach is effective even for those instructions that are not related to any loop induction variable.


Similarly to operating systems sandboxes, Chromium uses sandboxes to isolate the rendering engine from the browser kernel.

most of the attacks will a.ect only the rendering engine and not the system kernel.


Moreover, once an optimization is found, it is saved in anindexed optimization database so that the expensive work done tocompute the optimizations need never be repeated again.

thedatabase represents all the optimizations acquired by running thesuperoptimizer.


4.4 Update Intensity CFDC tries to reduce IO cost by clustering updated pages.

it is very interesting to know how it performs under workloads with high update intensity (percentage of update transactions in the workload).


However, k=1 request service times are not known apriori and are partially nondeterministic: they can only be known after the request has completed.

mi, j can only be determined at run-time, after the utilization guarantee has been met, by counting the number of requests required to achieve the reserved utilization.


An equivalent effect can be achieved by changing the iterator c to have type sclient and thus keep it secret while revealing the comparison result, Figure 4(C).

the invocation c.tell(...) is now implemented by sending to all clients the same message that can only be understood by the intended recipient (function invocations with illegible arguments are ignored by the clients).


Now, we have to define how each process will react on these signals.

for each process class, one has to provide a statechart modeling the general process behavior.


If the condition contains any block event,periodicpolling is usedfor checking thread states.

iMUnitpausesthreads only if their eventsare getting out of order for the schedule.


2.1 Service based interaction When a service request occurs, the service provider must be found.

the request of the save service by a component X triggers a search in the hierarchy for a component K that implements the save service.


In the time it takes for a NOX program to generate and install a rule to suppress packets 2, 3, 4 with the same source MAC, those packets might already have arrived at the switch, be en route to the controller and be about to be processed by the handler.

the NOX programmer will have to remember to implement complex, error-prone bookkeeping if she wants to get it right.


We have analyzed over ten thousand applications downloaded from online software stores, and failed to .nd any application that contains SMC.

we believe that the well-citedproblemsforSBTdonot reallya.ect itsusability to binary migration in embedded systems.


all emails sent to a particular addressor mailing list.

for many open-sourceprojects itispossibleto obtain aMBOX .le containing thecomplete mailing list archive.


Now, the focus is on the organizational side of 490 interoperability; however there is one more concern: the capability to effectively communicate information implies the capability to integrate semantic heterogeneous data, raising issues of integrating semantically equivalent concepts (different models use different terms to refer to the same concept), distinguishing semantically unrelated concepts (the same term may be used to denote completely different concepts), etc.

interoperability encompasses three different aspects: o Technical concerning issues like linking computer systems, defining open interfaces, data formats and protocols; o Semantic -ensuring that the precise meaning of exchanged information is understandable by any application involved;  o Organizational -dealing with modeling institutional processes, aligning information architectures with organizational goals, and helping processes to co-operate.


Map operators are de.ned to apply element-wise to all vectors regardless of shape.

on grouped vectors, map operators apply to each element of each group, not to the groups themselves.


Compared to Java, these language extensions are relatively small and do not cross-cut Java programs too much.

we also wanted to gain experience with incrementally growing a language from scratch by composing multiple sublanguages and their editor services into one uni.ed language.


However, they do need places to cache some data since packet processing exhibits the spatial locality of packet data accesses and temporal locality of application data accesses [24].

software cache is used instead of hardware cache to solve this problem.


Software Managed Multicore (SMM) architecture is a truly distributed memory architecture on-a-chip.

applications on it require programmers to write several interacting tasks.


0.64 0.24 0.09 0.03 0.61 0.22 0.08 0.03  links from that message or its descendants that are treated as tryboth.

k must be limited to bound the running time of linking.


In most AO languages, aspects are means to modularize a set of correlated pointcuts and advice, as well as local variables and methods.

one may consider modularizing a behavioral pattern as an aspect.


Instead this metric focuses on security that is provided based on the protocol.

it gives high scores to architectures which have less components which are able to circumvent authenticity of the user.


An optimal solution to this problem is when we allocate the most frequently executed LOAD FAST instructions to the n available additional local caching variables.

we want to estimate which LOAD FAST and STORE FAST instructions will be executed most often.


Privacy, integrity, accountability, and integrity are major topics that are raised when companies start considering the cloud as an alternative to having their IT internally managed.

it is important to have a broad view of the different security problems present in the cloud and the different solutions that researchers are working on.


At the time an operand is woken up, the bypass bit is set in parallel with the setting of the conventional operand-ready bit.

there is no extra delay associated with setting of the bypass bit, as indicated by bypass hint being in parallel with issue in Figure l(b).


Unfortunately,introducing such a large number of symbolic values results in a large number ofpaths andalarge set of symbolic constraints that stresses the capacity of the underlying constraint solver.

this bug is di.cult to .nd for directed testing tools using a fully symbolic representation.


A k-regular random graph and a k-Araneola graph are almost always k connected [10, 8].

such graphs achieve high dependability even with high failure-rates, (includes node and link failures).


The e.ect of changing the domain of a variable can be simulated by introducing new variables and creating dependencies between the new variables and the existing ones.

formally, adding this feature to AspectLTL does not increase the language s expressive power.


The imbalance ratio, using the above method, is 6771 which de.nitely does not represent the true picture because the distribution of instances of other classes is relatively uniform.

we use following de.nition of imbalance ratio Ir to cater for proportion of all class distributions: Nc Nc - 1 IiIr = (1) Nc In - Ii i=1 where Ir is in the range (1 = Ir < 8) and Ir = 1 is a completely balanced dataset having equal instances of all classes.


Starting from the initial state s0, the transitions t1 of thread u and t3 of thread v are independent as they access different memory locations.

executing the transitions in either order reaches the same state.


It can assist us to reduce the efforts of performing reworks in software development projects.

it will also help in the reduction of redundant quality assurance activities and the cost of producing high quality software.


Rather than replicate existing resources, we integrated and added to them.

in addition to linking to a personal web site, a link to a linkedIn account can be provided in the people database.


The garbage collector in the KaffeOS is non-generational and conservative.

there is no provision to handle correctness and ef.ciency on a perprocess basis in the presence of modern GC techniques, such as pre-tenuring, or thread-local allocation areas.


We also know that there exists a strong path p from A to B in Ni-1 such that p does not contain nodes from (B1 {A, B}) and furthermore every occurrence of a node from (F1 {A, B})in p is after the last occurrence of a node from (B2 {A, B}).

we know that there exists a semi-strong path q from A to B such that the strong path from V to A is honest if the .rst set in Ais corrupt and is failstop corrupted if the second set in A is corrupt.


With the EEG we could confirm this statement, since we could show that multimodal feedback is resulting in a higher amplitude for the P300 than other types of feedback.

the brain seems to allocate more attention towards multi-modal compared to unimodal input.


Similarly, the validation of the models used in the WIS development is possible thanks to the instantaneous executability of Maude speci.cations, which can be used as functional prototypes of the WIS that is being built.

the tool can help modellers to build a WIS that contains (fmod NAVIGATIONNODE is sort NavigationNode .


The developer has remained our focus in the design and implementation of our platform.

we have implemented ParaDrop to include a fully featured API for development, with a focus on a centrally managed framework.


In addition, HiDP allows an optional suf.x function call to be made at the end of the map block.

a map block can be of the following formats (following EBNF notation): map block: map block |map block suf.x block: {statements } suf.x: function call Map blocks can be hierarchical.


The value of the PC, placed into %07 is visible to the DSI, even though the control transfer is delayed.

when eliminating a call for the purpose of partial inlining, Strata must emit instructions to load a PC value into %07 and to perform the effects of the DSI.


The oracle is represented as a set of synchronization processes equipped with a failure detector: each synchronization process can query its failure detector module to get hints about the failures of other synchronization processes.

our system only considers failures of synchronization processes.


When doctors require patient s information, their client application DoctorApp sends a request to the Dispatcher that manages the communication towards the database.

patient s medical history and disease data are retrieved by the DB-data storage resource, and if the battery of the doctor s PDA has a high charge level (regulated by a probability set to 0.75 in our case study) then the client application is noti.ed by additionally sending x-rays and disease images retrieved by the DB-images storage resource.


Although using C--as an intermediate language is technically a very promising approach, it comes with a huge practical problem: it is only worthwhile to develop a portable compiler backend if it is used by many compilers, but compiler writers do not want to commit to a backend technology unless they know it is widely used and supported.

a variant of C--is currently used as a low-level intermediate language in GHC, but there is no useful general-purpose backend based on C--that GHC could target.


Benchmarks that adapt well are those that contain much initialization or other code that adds to the total cache usage but is not performance-critical.

maximum unbounded cache usage is not a good metric to use for sizing the cache.


between applications on di.erent processors happens only when more than one device driver try to access the shared bus.

mutual exclusion is handled by the bus driver.


However, as a consequence, the representation of variables also has to be delegated to the meta-language.

we likewise usehigher-order abstract syntax(HOAS).


Using the interpolant method, we show that for infeasible traces of length n, the formula SP>((SP>trueop1))opn is unsatis.able (see Theo .... rem 1 for a precise statement of this).

at each point i in the trace, we need only to track the predicates in .


The main issues are the .exible association between delta modules and features (provided by the when clauses) and the class/method/.eld removal operations that are not supported in FOP.

we develop a compositional type system for delta-oriented product lines that satis.es the design requirements illustrated above and relies on an abstract interpretation of product generation.


For very high parallelism degrees all cores are nearly always utilized which implies the same or similar energy consumption.

low parallelism degrees are most interesting for evaluating the di.erences between the governors from an energy as well as from a performance perspective.


To circumvent this problem,we enforce monomorphic recursion for functions without type annotations in Chameleon.

this allows us to replace the user constraints involved in cycles with monomorphic types.


(e .# "layerY") world = ( (jsValToInt x, jsValToInt y ) , world) onMouseDown :: PaintEventHnd onMouseDown e state world # (coordinates, world) = getCoordinates e world = ({state & currentOrigin = Just coordinates}, NoEdit, world) The actual drawing happens when the mouse is moved while the mouse button is pressed.

in the onMouseMove event handler function, .rst the presence of the currentOrigin coordinates must be checked: onMouseMove :: PaintEventHnd onMouseMove e state world = case state.currentOrigin of Just coordinates = onDrawing coordinates e state world Nothing = (state, NoEdit, world) If they are set, then using these coordinates and the current coordinates of the mouse, along with the current color and tool, we can create a shape to draw it to the temporary canvas (which is cleared before that).


As the replication framework does not depend on the middleware, any middleware data that passes the framework does so in an opaque way.

the way language independency is realised in the replication framework does not have to be the same one as in the middleware.


It turns out that there are no differences between them.

we have shown that our approach is suf.cient to generate a family of real-world customized UIs based on a single abstract product family model.


Standardizing software vulnerability language provides a means to develop government and industry software contracts [31, 32].

including standardization benchmarks presents a means to enhance the language with explicit examples to compare and evaluate competitive software.


Instead, LDP stores instructions to reverse its states delta and attach the instructions to Kiasan s backtracking data structure.

lDP s constraints management is synchronized with Kiasan SymExe DFS algorithm.


The initial architectural and technological concepts for implementing non-repudiation for Voice-over-IP (VoIP) conversations have already been introduced in [5].

this paper will outline these concepts just brie.y and will focus on the concepts application and implementation on mobile devices.


However, users are un aware of this, because the infrastructure is a transparent middleware.


REACT simply forwards information from either sensor as soonasitis received,and schedulesthe remainingactorsona datadependent basis.

our basic observation is that, in the absence of model-based reasoning as in the PTIDES model, the scheduler has no good basis for deciding when to do the actuation, other than as soonas possible (asinREACT)orata.xedtime(asinTT).the two alternatives more or less bracket the possibilities.


Since the receiving nodes wait on data for immediate use, the model corresponds to the case of data being consumed before it is produced (Figure 2).

the resulting time available for overlap is zero while the pipeline is being .lled.


The central dilemma of the component developer is that during component speci.cation it is unknown how the component will be used by third parties.

in case of varying resource demands or branch probabilities depending on user inputs, the component developer cannot specify .xed values.


In fact, the GPU driver always uses DMA (Direct Memory Access) from its internal pinned memory buffer when copying data from the host memory to the GPU global memory.

if the application allocates the input data in pinned memory from the beginning, it saves the driver from performing the extra copy to its internal buffer.


Even a greedy assignment (.lling up one processor at a time) guarantees that no processor exceeds the lower-bound work balance of s/N by more than µ, the heaviest stateful .lter.

the stateful work can always complete in s/N + µ time.


An analogous analysis can be performed for the counterclockwise direction, i.e., considering values of the form C(i + 1, i), corresponding to traversal of the arc from vi+1 to vi.

denoting Ccc = min0=i=k C(i + 1, i), we have for any i:  C(i + 1, i) = Ccc + 2k2 .


We believe that Embodied Allegories may serve as this framing context.

some embodied schema mappings that may be triggered during the interaction with a generic version of an embodied system no longer seem relevant when an Embodied Allegory is introduced.


Hence, unlike in a choreography, the interactions in an orchestration focus on a single provider.

these interactions can be directly executed by that provider.


lookup GgTx taking the free monad of ExprD by Var G, we obtain the language of open terms in a context G: openTm G .


The value range of each variable represents the possible markings of the predicate in the PrT net.

the number of possible values of a variable is the number of possible markings of the corresponding place.


to a rule predicate ., which, in turn, essentially involves converting a code access path pcode to a metamodel access path pmodel .

the core of the rulegenerator component is the access-path translation step.


In this work we focus on replica placement to maximize application availability.

techniques like the above are complementary to ours and can be integrated in our system.


In short, given s, produce a kind of template t = [0 .. n ] of the same length, together with an association g between integer values in that template and the corresponding values in s. Then apply get to t and produce a further association h by matching this template view versus the updated proper value view v '.

combine the two associations into a single one h ', giving precedence to h whenever an integer template index is found in both h and g. it is guaranteed that we will only resort to values from the original source s when the corresponding position did not make it into the view, and thus there is no way it could have been affected by the update.


JavAdaptor works at a low level, requiring a compiled version of the class to update as an input and a connection to the Java virtual machine in which the program is executing.

changes to the Java source code drive the application update.


5.3.2 MPlayer Setup Enjoyment of multimedia playback relies on good interrupt service latency and low jitter.

we chose a video playback benchmark as another stress test of working set restore; any slowdown during  250000 250000 200000 200000 150000 Guest Physical Page Number Guest Physical Page Number 150000 On-demand Prefetch 100000 50000 On-demand 100000 50000 0 0 0 50 100 150 0 50 100 150 Elapsed Time (seconds) Elapsed Time (seconds) Figure 3.


In order to provide a MOps kernel, i.e., a minimal set of required MOps to overcome structural heterogeneities in-the-small, we systematically combined the core concepts of semantic data models, being (i) classes, (ii) attributes, and (iii) references with di.erent mapping cardinalities, thereby complementing the work of Legler and Naumann [13] focusing on attributes only.

mOps are provided for the basic tasks of a model transformation, being (i) copying, (ii) merging and (iii) generating2 .


Sampling the modified requirements artifact creation process shows that each complex search requires an average of 5 minutes, attributed to search formulation and modification, and human cognition of the final computed results.

for each new story the average complex search time is 3x5=15 minutes.


When data is received, the sensor time-stamps the datawiththe currentrealtime,then releasestheeventtothe system.

at a sensor, real time and model time are bounded by the relationship t>t.


Further information such as policies may also be exchanged as other requirements for TN.

tN can be described as: a selected set of information including credentials (or even a partial attributes within credentials), declarations, policies or other needed information exchanged between entities to establish a trust relationship in a bilateral, iterative and cumulative process [24, 25, 28].


CTL is the subset of CTL* obtained by requiring that each temporal operator is immediately preceded by a path quanti.er.

the syntax of CTL can be de.ned as follows: Definition 3 (CTL Syntax).


Such properties are expressed as predicates of execution paths by means of a Path Description Language (PDL).

the combination of symbolic execution and safety property assessment can effectively increase the confidence in the behavior of safety critical applications.


Also, data in the GPU global memory are persistent across kernel calls.

not all these data transfers are needed.


Models and MDE techniques (especially metamodeling and model transformations) can play a fundamental role for fully accomplishing these tasks.

models can become cornerstone elements for enabling and achieving interoperability between all kinds of systems and artifacts, including data sets (under the presence of different data schemata, and possibly at different levels of abstraction), services (despite their differences in data representation, access protocols and underlying technological platforms), event systems (with different complex types and origins), languages (that use different notations and may have different semantics), tools (with different data formats and semantic representations), technological platforms (with different notations, tools and semantics), etc.


Recall that the program is restricted in allocating at most M words at any time.

the larger the de-allocated space, the larger the space that can be allocated in the next step, and the larger the heap that the allocator must use.


Consequently, we need a more expressive negative scenario notation that allows one to express message interactions that should not occur within a context or scope.

we define negative scenarios as having three sections called After, Not and Until.


Although alias information can be computed by performing matrix multiplication over suitable representations of pointsto and pointed-by information, the computation is typically both time-and memory-consuming [48].

it is desirable to have an e.cient alias analysis that directly computes alias information.


Reader reads again and obtains a new value if it acknowledges that writing occurs while reading.

the read action of the pattern extraction thread does not burden the writing action to the ring buffer if a sequential lock is used for exclusive access control between application correlation reordering.


Our instrumentation introduces a small constant blowup in the control-.ow graph of the concurrent program and adds a small constant number of global variables.

the complexity of using KISS on a concurrent program of a certain size is about the same as using a standard interprocedural data.ow analysis or model checking on a sequential program of the same size.


As shown in Table 5 (column static join-points), the overhead of the kernel_stack aspect is signi.cantly lower in this case, with cost factors between 1.05 and 1.09 (average 1.07).

most of the overhead of the .rst kernel_stack implementation was ac tually caused by the fact that advice had to be given for dynamic join-points.


That is, the processor is either in status Idle or Load.

our approach distinguishes four di.erent states created by combining a frequency status with a load status: Low and Idle.


Not all of these frameworks use both XML and annotations as their metadata formats.

in the following we compare our PBSE speci.cations to whichever metadata format is used by a given example framework.


In addition, during a mouse interrupt, the XEN-VMM gets a noti.cation of an I/O request and a VM Exit occurs.

the thread that controls the Guest OS is suspended (assuming a uni-processor architecture) until 6Dong et al.


We expect that the effect of any change in the number of sender peers (due to departing of an existing sender peer or availability of a new sender peer) would be similar to a sudden decrease or increase in throughput.

the QA mechanism reacts to both events the same way.


The test server uses a simple socket connection to receive data.

it is due to the midlet to start and to control the connection.


3.1 Random k-Linear Interpretations One way to characterize the failure of the soundness property when using linear interpretations for binary functions is that we are restricted to only three random coef.cients, which are too few to encode a large number of leaves.

it is possible for two distinct trees to have identical interpretations.


For the OneOrTwo variation point in Figure 3.2 an explicit bound of [1, 2] is de.ned.

two factors would be used to model the possibility that two out of the three variants could be selected.


Maybe (g (Cxthf a)) project (Term t)= proj t project (Hole )= Nothing Therelationbetweentermsand contextscan alsobeillustrated algebraically:Ifweignorefora momentthe abilitytode.nein.nite terms due to Haskell s non-strict semantics, the type Term F represents the initial F-algebra which has the carrier T (F), the terms over signature F.The type ofcontexts Context F X on the otherhandrepresentsthefree F-algebrageneratedbyX whichhas the carrier T (F, X ), the terms over signature F and variables X .

for recursion schemes, we can move naturallyfrom catamorphisms,i.e.initialalgebra semantics,tofree algebra semantics: free :: Functor f .


State 5 is a .nal state of the loan approver peer.

when the state is 5, the loop is terminated.


The DaCapo suite is geared towards JVM and hardware designers.

it is important to reevaluate the benchmarks so as to 2 We commented out the toString methods of Block, FlowGraph, RegisterAllocator, Liveness, Node, Tree, Label, MemberRef, Instruction, NameAndType, LocalVariable, Field,and Constant.


In such an environment, it is straightforward to implement a perfect failure detector pf d, such that, pf d(Pi) = correct i. Pi is not crashed, =Pi.

texecmax exists and can be calculated by combining the bounds on local processing and network delivery delays.


However, capturing adaptivity implies modeling the user and the context of interaction.

during data design, the user and context requirements can be translated into three di.erent subschemas complementing the application data: The user sub-schema, which clusters data about users and their access rights to application data.


The actual progress and status of the task remains unknown until accurately reported or verified [13].

reporting is largely a manual process and prone to errors due to differences in perception and understanding.


If a contains v.p, where p is a possibly empty list of .elds, then we know that v cannot be null.

a condition is of the form v = null or v= null can be decided exactly.


A location can be entered more than once within the same status [1].

the con.guration has to be described by a multiset of locations.


In contrast, the number of branch traces increases at most by a factor of 2 or even decreases.

the ratio of average branches per trunk traces (the last two columns of Figure 12) also decreases.


Because core developers have already made many code changes, they should be familiar with the project requirements, design, and coding guidelines.

they should be able to write code that can be merged in fewer tries (i.e.


Line 2 is only executed only if both predicates dest != this and dest != other are evaluated to true.

if line 2 is executed, the predicates at lines 3 and 7 are also true.


This visual information allows the user to quickly locate an artifact of interest, and once the user clicks on an artifact, the artifact is displayed in its native editor.

at both the system-level view and the component-level view, users can identify at a glance both the trace and topic information and navigate to desired artifacts.


We note that the NFS layer at the client does detect the corruption, since the kernel log shows nfs_statfs: statfs error = 5 .

this is a case when NFS does not propagate the error to the application on the client but failssilently.


The MIDAS versions are those before and after restructurings to improve the system's modularity and adaptability [19].

the anti-degradation rules of the target projects had suffered modifications over their evolutions.


In particular, the open-closed principle [7] guided the design of the API.

without changing the overall pipeline architecture, whole parts of the detection process can be replaced and extended.


Similarly, if the target of the instruction block can be calculated statically, Clairvoyant can also implement the slide optimization.

in the best case, a continue command and the reinstatement of the original breakpoint can be executed with three writes to program memory and one context switch, as depicted in Figure 9 (d).


A right mover is an action that commutes to the right of every action by another thread; a left mover is an action that commutes to the left of every action by another thread.

to detect transactions we need to detect right and left movers.


#Congestion Detections/minute Under Traffic Conditions Epoch (secs) jected failure can cause other real network problems that Sympathy will currently report.

we evaluate failure detection accuracy by testing how few primary failure noti.cations are produced.


In fact, we can express every instance of list homomorphisms by map with reduce.

([f, 8]) = reduce (8) .map f list homomorphisms can be ef.ciently implemented by map and reduce.


(We refrained from doing so in this paper to keep the presentation simple.)

suitable extensions of FQL can express essentially all elementary coverage criteria.


We focused on the new component textArea developed for Ginipad version 2.0.3, and we identi.ed 14 additional components syntactically compatible with textArea.

we considered a total of 15 2The original suite covers 42.50% of the statements.


When the provisioned resources are only used for on-demand users much of the resources are inevitably wasted.

they [6] proposed to create back.ll VMs on unused nodes to run HTC jobs.


Since we use the behaviour-aware parent selection algorithm, the selected parent is the one who can serve the client more than any other candidates.

if the parent node is not able to serve the client any more, there is a high probability that the other previous candidates are not able to do so, either.


Indeed, if we took a local interval-based condition similar to the one used for .eld separation for instance, if we required the whole non-virtual zones (not only the data) of non-virtual bases to be disjoint , then we would lose tail padding optimization, and fall back to a naive implementation similar to that of section 2.2.

we have to compute, for any class C, the set ebo.sC of empty base offsets, i.e.


(Note that in any structure produced by elaborating a datatype declaration under this interpretation, the ti s will be abstract types.)

for example, if m = n then the datatype declaration datatype t1 = s1 and ... and tm = sm matches the above speci.cation if and only if si = ti for 1 = i = n, since this is necessary and suf.cient for the types of the in and out functions to match for the types mentioned in the speci.cation.


Instead we may have: let t = term R_trs_algebra "inter(arca(banker),barca(banker))"; normalize R_trs t; ... -: R_trs_signature term = cons(consult-loanList,nil) Here we can see that the banker category has a con.icting permission concerning the action of consulting the loan list.

the output of the analysis tool is rich enough to provide useful diagnostic information to a policy writer or system engineer.


There are not model elements recognized in the tracing semantics for the design phase.

all of them must be created as new instances in the TraceElement and TracingLink classes (see Tables 6 and 7).


FixCache considers .les in the cache to be defective and those not in the cache to be non-defective.

the cache contains both true positives (TP), .les that actually contain defects, and false positives (FP).


While lowering the barrier to entry, this unstructured web application development does not scale well for larger applications.

a number of architectural patterns have been developed for user facing applications.


The reconfigure operation provides the coarse-grained reconfiguration of aspects (add, remove and replace) at a join point and the reorder operation provides fine-grained reconfiguration, that is allowing aspects to be reordered at a join point.

aO-OpenCom provides granularity scope of reconfigurability requirements.


The scope of binding is orthogonal to the other two dimensions.

only the combinations of elasticity and cardinality are listed (parameterized with the scope s, i.e.


The DaCapo benchmarks are more complex than the SPECjvm98 benchmarks regarding code complexity, class structures, and class hierarchies.

the speedups are lower compared to SPECjvm98.


It is given by G* = ei,k,e£,j ,j.Ni .i,k,£,j where i, j, k and f are distinct.

by setting yi,k.j = 1 - xi,k.j and y£,j.i = 1 - x£,j.i, we can transform the minimization problem in 4 to the non-linear integer maximization problem, referred to as NLIP1, as follows.


We then perform an off-line analysis of the trace log by matching the trace log against a test property speci.ed as a linear temporal logic (LTL) formula [5].

we verify the essential building blocks, i.e.


In fact, these questions were indirectly answered in our .eld study (see Section 3).

as a step zero, we mapped the identi.ed stakeholders, their top-level goals and the dependencies to early requirement models, speci.cally to the actor diagrams.


Specifically, the crossover point is at t = 12 hours for A = 10%, t = 18 hours for A = 30%, t = 26 hours for A = 50%, and t = 32 hours for A = 70%.

in a dynamic IoT environment in which the hostility (in terms of the percentage of malicious nodes) changes over time, dynamic trust management is achieved by choosing the best design parameter settings (a, {) to maximize the service composition application performance.


The TBB framework provides make_edge template function for this purpose.

both the nodes and the edges must be defined explicitly.


We do so because social scientists engage with many documents in their daily work from research reports to email from colleagues to facilitate different types of collaboration with different participants, at distinct times and places, and around different kinds of content.

the practices of distributed and virtual interaction among social scientists are deeply enmeshed in their digital documentation/documenting practices.


Similarly, U is a binomial with probability p,so U =T(pL) with high probability (still in pL).


As Pj is honest (i.e., Adi jk=di jk), based on Equation (3) & (4) the difference between AATi jk and PATi jk equals the difference between ARTTj and (ERTTj+RTTTj).

in the figure PATi jk is represented by (ERTTj+RTTTj), the blue line, and AATi jk is represented by ARTTj, the pink line.


Unfortunately, because Intel s VMX extensions cannot be used to request VM exits when the guest operating system returns execution to the guest userspace application, AikidoVM has no way of reprotecting these pages before the guest userspace application resumes.

when temporarily unprotecting a page, AikidoVM ensures that it is not userspace accessible (i.e.


This resulted in the anatomy shown in Figure 1, in which the fulfilment of a CSP is dependent on contributions from the CSPs along the path to get there.

the arrows in Figure 1 generally means contributes to .


For this, we check the potential of traf.c localization, by changing the volume (or hit) distribution from even to greedy.

as soon as we observe at least one IP address inside the ISP s network, we count all traf.c for the entire aggregation to be internal.


The transfer of individuals between populations is aimed at improving the overall performance of the GA.

in e.ect, the best performing population is seeded every n number of generations and, as a result, will contribute most to the number of .tness evaluations.


However, because data-.ow propagation provides useful information in all of the cases we examined, according to our scenario of usage, developers would be unlikely to consider the use of data-and control-.ow propagation.

we believe that the results of this case study, albeit preliminary, suggest that our technique can be e.ective in assisting debugging of failures in real applications.


Medical device companies are responsible for ensuring that they take adequate precautions to produce safe and effective software that does not pose a severe hazard should a software-related failure occur.

medical device companies who market within the USA must ensure that they comply with the regulations outlined by the Food and Drug Administration (FDA), for medical devices.


It is only after this elimination that we can pro.tably recognize saturation.

we have to inline the saturating operations, and then individually attempt to prove that the operations are saturating operations.


Once the mobile agent arrives at a node, it determines nearoptimal itinerary among its unvisited but alive nodes, the one with the smallest cost.

the agent searches for suitable services on a map provided by the directory services [10].


Counting clockwise, ri+1 is the next ring node of ri for i .mk, and r1 is = next ring node for rmk.

we have the total number of sensor nodes Ns = PNh For k=1 mk - Nr + Nl on R. instance, in Figure 2, Ns = 20, where Nh = 2, m1 = 13, m2 = 10, Nr2 = 4 and Nl = 1.


A search algorithm might not .nd a global optimum in a reasonable amount of time.

it is common to put premature stopping criteria that are based on the available computational resources.


Otherwise, let q ' be an occurrence of x in r. The replacement of t|p may relocate and/or multiply the occurrence of t at q, but it does not disturb it in any other way.

in this case too, the occurrence of p q ' p '' in u is a descendant [14] of the occurrence of t at q.


Speci.cally, Sympathy will not report a node crash for node N until (1) it has not received any data from N for an epoch, and (2) no other node lists N as a neighbor in its N E I G H B O R L I S T metric (which can either occur if the node explicitly sends a N E I G H B O R L I S T update without N, or if the sink .ushes its cached copy of the N E I G H B O R L I S T because the node has not sent an update during the epoch).

the failure noti.cation latency will depend on the order of events.


As an entire class of instructions can be processed together, a simple tally of the frequency of each register in a given field can be used to increment the register-pair frequency matrix using the following formula: RPFM[rA][rB] += count(rA) Þ count(rB) Step 3: Construct Register Chain This step takes the graph from step 2 and constructs a new graph which will contain a chain made up of edges corresponding to register pairs that must be encoded a Hamming distance of 1 apart.

the new graph initially contains just the vertices from the graph from step 2 and edges are added to this graph in order of frequency (most weighted edges first), even if the edge is disjoint.


cluster), nor for cross-infrastructures.

some WS-PGRADE work.ows implement workarounds for data movement.


It is worth to point out that in the paper we focus on the Size Measures as cost factors.

other factors, such as company expertise, client understanding of the needs, etc, are left to further investigations.


Besides, the types of uncertainties can be formed into the requirements by engineers.

we believe our approach can be extended to solve the real NRP with various uncertainties.


Then, clicking on the waypoint entries in the Waypoints pane opens the associated file editor, positions the editor at the appropriate location, and highlights the waypointed software model element.

programmers can use the Waypoints Viewer to easily navigate to places of interest.


An idea along these lines that we are exploring is that part of the cognitive effort of searching for and memorizing related formulas could be reduced by offloading to the software the task of finding related formulas and displaying them (external memory).

the goal of this work is to encourage the use of disciplined, strategy-based problem solving by enduser programmers through distributed cognition approaches that support a variety of strategies.


Because methods in IGJ have a single method annotation, the immutability of this and OuterClass.this should be the same.

in IGJ an inner class cannot have its own immutability parameter: INNER-CLASS RULE: An inner class inherits the immutability pa rameter of the outer class.


An application can perform a PrivilegedAction considering individual user permissions by invoking the static Subject.doAs(subject, action) method.

the AccessController determines if a Subject is associated with at least one Principal, that provides the permissions Figure 2: JAAS-Authentication Figure 3: JAAS-Authorization necessary to perform this action.


The algorithm in Figure 5 requires ( N )2/2it- K erations.

the time complexity for this local opti `´ mization is O(( N )22K ).


Consequently, a model-to-model transformation realises the transition relation that maps a con.guration to its successor.

executing a DSL program results in a con.guration changing over time.


The properties expressed by a class s invariants can be concluded from the mere existence of an instance in all visible states.

some constructors were changed in this manner, when this was reasonable from the characteristics of the class and implementable without major impact on the JFM s overall design.


For example, in Figure 5b the connector j2 is connected to start component i3.

the list of all start connectors includes the connectors j0 and j1 for Model 1 and the connectors j2, j3, and j4 for Model 2.


Futures are just one of the mechanisms implemented with this framework.

recall that the implicitly-threaded parallel constructs may be nested arbitrarily.asinglefuturecreatedtoevaluate(onesubcomputation of) an implicitly-threaded parallel construct may, in turn, create multiple futures to evaluate nested constructs.


If the + operator is used to combine various branches starting with an accept event ( ?interface .method ), after accepting a particular request all the other requests must not be accepted.

the corresponding method variables have to be reset to false.


While the Ambient Management Service and the Personal Agenda must be aware of the context information that describes Silva s role and location in the organization, the Con.guration Management Service also takes into consideration Silva spersonal preferences.

we notice that the context that fully describes the user Silva comprises not only the context that describes his role at PUC-Rio (location of Silva and his device in the organization), or in the UbiForm Project (schedule of activities), but also the context that describes Silva spersonal preferences and features (the vibration mode to alert about Silva s wife message).


In contrast, our approach identi.es the exact set of input tuples needed in each of even exponentially many derivations (e.g., {{t1}, {t2, t3}}).

in our example, their approach prunes abstractions that contain {t1, t2, t3}, whereas ours also prunes those that only contain {t1} or {t2, t3}.


When translation of a fragment is complete, the SDT layer performs a context switch to the code cache for execution.

the dynamic translator gets control after each fragment executes to translate subsequent fragments.


Instead, we have shown that architectural middleware a middleware platform that provides native implementation-level constructs for the key architectural abstractions can be employed effectively in a number of domains, including embedded systems [7][10].

applying Prism-MW [7], USC s adaptable architectural middleware platform, to WSN-based applications thus seemed like a natural choice, and we decided to undertake the challenge collaboratively between Bosch and USC.


Next, it is possible that an MPI call itself takes a signi.cant amount of time, such as an MPI Alltoall using a large array or a blocking MPI Receive.

we denote A as the value that determines whether an MPI call is long enough any single MPI call that executes longer than A warrants reducing.


Thus, tasks do not interfere with each other, and they do not interrupt each other.

each task can be implemented as an independent module which can be exchanged easily.


The nodes execute their movement based on their velocity, speci.ed in meters per simulation-seconds.

the minimum distance that can be achieved by the node in one command is determined by the duration of the simulation time-step.


It is rendered in Scala as the Session trait, which declares the relation on its type parameter S (which is aliased as Self for convenience) and its abstract type member Dual, which corresponds to an associated type.

an instance of type Session [S] {type Dual = D} is evidence of S DualOf D; such a value witnesses this fact by describing how to compose an instance of S with an instance of D (through the run method).


In addition, the protocols can reach (s1,c1) through the synchronisation on these compatible labels such that COMP0 UC,.[s1,c1]=1.


The benchmark reads 25 points of the neighbouring cells of the grid, in order to calculate the forces.

30% of the shared accesses are remote in this part of the benchmark.


In fact, we often want to know the generated value in order to decide which shrinking steps to add, thus, often having .rst a LET and then a SHRINK macro.

quviq has added a LETSHRINK macro to QuickCheck which combines the two earlier mentioned macros.


As the study focused on children aged 9-11, we took into account the specific capabilities of that age group.

the first adjustment was based on the Belgian school curriculum, showing that children who finished primary school lack the necessary knowledge to be able to draw a mathematical curve with negative values [16].


Components willing to interact need only to declare interfaces they depend on and it is up to the component container to decide and transparently inject (into declaring components) the component that currently best implements the required interface.

our component reconfiguration engine heavily relies on dependency injection primitives to easily reconfigure component references.


The exact maximum sustainable load may .uctuate, depending on uncontrollable events.

load generators should be equipped with a margin within which further shrinking is ignored.


Speci.cally, as suggested in Figure 7, we need be able to distinguish 90 microseconds RTTs from those of 100 microseconds.

in procedure add, it is vital to choose A and B so that they are close to H. This has another e.ect of reducing the runtime critical path of the entire inference operation.


Reducing the pointer size, by using -m32, reduces the number of I-cache data misses dramatically for 181.mcf as can be seen in Figure 2.

our model has learned that data cache misses and branch instructions (via the performance counter data) are the critical characteristics of this program and suggests the compiler convert pointers from 64-bit to 32-bit, because 64bit pointers are reducing the effective cache capacity and memory bandwidth.


With the proposed patterns, BPMN models can be obtained from the source code models obtained from legacy systems.

the recovered business knowledge of the legacy systems is preserved and can be used to modernize and maintain the legacy systems, and preserve the alignment between the business logic and the information system.


However, if it has a positive (or negative) drift, it signals that the quality characteristic values have shifted upward (or downward).

if the CUSUM has either positive or negative trend in the plotted points, this should be considered as a signal that the quality characteristic values have deviated from the target and required value.


However by Corollary 8, there is negligible chance that a matrix created from U can be inverted (since it is unlikely that it has any submatrix that is marked).

if Pr[InvertA,f (t) = 1] is non-negligible in t, then D distinguishes R(1t , 1m ,p) and U(1t , 1m ,p) which contradicts the WSHA.


For cases that occur relatively more frequently, such as pointer arithmetic, array references and assembly code, the types of analyses that depend on precise translation of these cases are rare.

these limitations are not prohibitively restrictive.


A block never has a separate owner it inherits the ownership context of the object that created it, effectively being exported by its creator.

blocks maintain access to the object that created them, and messages sent to them have the same restrictions imposed on them that messages sent to their creator object have.


is depicted in Figure 6.b): The set of current nodes C initially contains S1.

wPSEQ(S1,S2) regarding the data dependency is appended to . '


It should also be noted that the measured values are tied to the hardware and software con.guration used for the experiment.

di.erent con.gurations will yield different results.


In Aspect-Oriented Modelling (AOM), cross-cutting concerns are called aspects.


MODELING AND CONFIGURING CON number of replicas (k o 1) needed to service this workload.

we must estimate the number of replicas k required by a control plane to service a workload of requests arriving at rate oT for a given SLO.


did not appear in G,itwouldhavebeen generalizedand replacedbyapolymorphic bound type variable.

at the point where it is added, a let binding introduces no new univariables into the environment.


Although predictionbased protocols require prior contact history to estimate each node s delivery probability, our preliminary results show that the performance improvement of warming-up over one month of trace was marginal.

for simplicity, we show the results of all protocols without warming-up.


Our goal is to give higher priority to test cases that cover functions infrequently covered in past testing sessions.

for every testing session, i, we execute the following two steps.


The poster session will consist of a videoconference with remote colleagues making live, captioned mini-presentations on the design.

the presentation will be the demo of the system.


The second requirement allows for the possibility of the speci.cation being viewed by people who are unfamiliar with a formal notation.

properties such as readability, clarity [10] and understandability could be relevant to characterise the speci.cation.


This means that there is a signi.cant number of concerns whose inclusion in a particular solution depends on the correct identi.cation of these dependencies, which are not always straightforwardly derived from the requirements of the system.

these dependencies may go unnoticed by the SA even if they should be taken into account to satisfy the requirements of a system; (2) a high degree of variability (metrics 4 6), since modeling the FQAs as a family of products, and the automatic materialization of the FQAs base model considerably increases the number of valid resolutions of a FQA that can be generated; (3) a high degree of automation, due to the high number of architectural elements that are automatically generated in comparison with the manual e.ort that needs to be made in order to include the FQAs inside the software architectures of the applications.


We assumed that the very small companies (<5 employees) did not have the capability to improve their software development processes on a formal basis.

we decided to exclude these companies from our study.


Template Haskell neither supports the splicing of clauses into the body of a case nor provides a quotation syntax for clauses.

instead of the quotations used in Figure 7, the actual implementation of thcase uses the AST constructors provided by Template Haskell.


The combined model performs similar to the change model, but not significantly better.

it does not pay off the extra effort to collect such larger set of predictor variables.


As stated above, LoadHI (I) = 1 guarantees schedulability of an instance I if L(I)= HI.And LoadMIX (I) = 1 guarantees schedulability of the instance if L(I)= LO.

[0, 10000] Ai [Ai + Ci(HI), 10000] Di Ci(LO) [0, 200] Ci(HI) [Ci(LO), 200] Table 1: Generating jobs randomly for experiments Theorem 2 holds.


Nowadays, customers want dynamic solutions and dynamic systems to suit their dynamic business environment.

a visionary architecture and a proper design of such a system leads to success of the project.


In this case, a single change set is generated for the four commits, including 13 classes.

in the co-change graph an edge is created for each pair of classes in this merged change set.


However with our modified coalescing scheme with S(v), we have I(b) = 3 and I(f) = 1, and consequently we have S(b) = C(b)/3 and S(f) = C(f).

even for C(b) = C(f) > 0, we have S(b) < S(f), which places node f in the higher priority for coloring, preventing the spill as the result.


Any two model elements should not be considered same/similar simply because they use the same shared code.

if any two model elements overlap solely in their use of shared code then this should not lead to a trace dependency.


Thus, each value that goes into computing the second checksum is left-rotated by an amount between 0 and 31 (25 - 1) bits, depending on its address.

with a high probability, the corrupted values are rotated by different amounts, which prevents the lined-up erroneous bits in one checksum from lining up to cancel out one another after rotation in the other checksum.


However, the Counter indicates that both these results are false, and in fact R2 is violated, while R3 is valid.

this experiment has generated both a false positive and a false negative.


In this situation, the most likely result of the addition is a pointer that points inside memory area m (e.g., when an offset is added to pointer to index into a dynamically-allocated array).


Alternatively, systems such as AutoBlackTest generate test cases automatically, but leave it to the tester to manually verify the output of each test case.

substantial manual effort is required either before or after exploration.


In common with many network interface cards, the Broadcom BCM5751 used in these tests is capable of interrupt coalescing.

some of the performance characteristics of network communication may be obscured by artificial delays in the hardware, affecting performance measurements of all MPI libraries, as well as the baseline socket-only tests.


If the bound is not extensible, then exploring independent transitions may make local states that were previously reachable within the bound unreachable.

to ensure local state reachability within the bound, the search must explore otherwise independent transitions.


The basic scheduling entity that we consider is the job abstraction.

we use J to denote a job without being task speci.c, as seen by the scheduler at any scheduling event.


The FDX concept was applied for two very different classes of devices.

it was shown that a wide range of devices is covered by this approach.


For example, a given context may enforce only one possible value for a parameter.

this parameter can be replaced by a constant and eliminated under this context.


During execution, any throw and catch operations are de.nitions and uses of that variable, respectively.

we can apply a variant of the traditional Reaching-De.nition [1] data.ow analysis to this problem, but there are some unique aspects of exception-.ow that require special handling: 1.


This information, beyond being useful to re.ne delta analysis, is useful to the programmer.

we also report the whole backward slice results in the Triage report.


But to reduce the forest fire, firemen can use the same activity than for a building fire.

as represented by figure 8, the link between activities of actors and crisis characteristics is ensure by a generic knowledge based on the generic problem and the generic activity .


All other lists have both a head and a rest.

a list of length one has an empty list instance as its rest (as opposed to None).


In general, the task allocation and scheduling issue has been proven as an NP-complete problem [3].

heuristic algorithms are employed to solve the problem in polynomial time.


Unfortunately, none of these implementations can be ported directly to OpenCL, mainly due to portability challenges.

despite memory allocators being well understood, OpenCL is still lacking one, a limitation that becomes obvious for developers who attempt to implement irregular data structures in their OpenCL kernels.


supposethatpEQGH(t)QG(t)ismappedtoqEQG(t) QGH(t).WeshowthathGH(p,t)?hG(q,t).ByLemma3.9 thisimpliesthatv(p)v(q).Reallthatthemapping ofthepaketsinQGH(t)QG(t)isdoneinasendingorderofheightsandthatanysuhpaketismappedtothe thepaketwiththeminimalheightinQG(t)QGH(t)that hasnotbeenmappedsofar.Toobtainaontradition supposethatpisthepaketwiththeminimalheightin QGH(t)QG(t)thatismappedtoqEQG(t)QGH(t),and hGH(p,t)hG(q,t).Considerthepaketp ' EQG(t)suh thathG(p ' ,t)=hGH(p,t).Itmustbethatp ' EQG(t)n QGH(t).WemustalsohavethatthenumberofpaketsbelowpinQGH(t)QG(t)isthesameasthenumberofpakets belowp ' inQG(t)QGH(t).thesetofpaketsbelow pinQGH(t)nQG(t)isthesameasthesetofpaketsbelow ' '' pinQG(t)nQGH(t).ItfollowsthathG(p,t)hGH(p,t), inontraditiontoLemma3.10.


The approximate execution of one kernel may affect the inputs and the execution of the other kernels.

to find the reliability specifications of multiple kernels, the reliability profiler enumerates parts of the induced multidimensional search space.


Other similar manycore processors may be created in the future.

in the long term, a shared memory programming model should support not only multicore processors with cache coherence but also manycore processors without cache coherence.


These are highly redundant since, as just discussed, multiple variation points may be required to express a single feature.

the second difficulty: constraint expressions are redundantly spread throughout the architecture.


As in the production cell example, there already exist two senders in the system.

when adding a new sender, the synchronizations of this sender with the medium (actions begin, end and busy ) can take place as they did with only two senders.


We would like to see this type of rigour more often in software engineering survey articles and PhD theses.

our recommendation is for researchers to adopt as much of the evidence-based approach as is possible, to target systematic reviews (or summaries of such reviews) at practitioner publications, and to treat initial attempts at using EBSE as a means of further assessing the viability of the evidence-based approach.


Although traditional Web Services allow communication between different platforms and operating systems, they only share syntactic information without any machine-understandable semantics: only data structures are exchanged amongst service clients and providers without specifying the meaning of these messages.

dynamic service composition and discovery are di.cult tasks in traditional service infrastructures and human intervention is often required.


However, it should be noted that certain vectors such as (0, 1, 0, 0)T are not legal core vectors, since they do not have any corresponding points in the core space.

the core space for a multicore architecture with a tree-like on-chip cache hierarchy is not continuous.


Although attackers cannot control, but only hope for, the availability of vulnerable apps on users devices, the reality has been working towards attacker s favor due to the large number of under-trained Android developers and an overall lack of app quality assurance.

as a defensive effort, we designed CHEX to assist apps developers, testers, and market operators in .ltering out apps vulnerable to component hijacking attacks before they reach end user devices.


After one time slot, there will be at most () 1s along this column.

at time slot K, there will be 1s along this column, which is greater than or equal to N. min(1,...)minjMjcc.. minc kQ minmaxkcQD.. minmaxkcQDK...  (2) minmaxkNcKQD......... 3) Combined lower bound of K  Based on the above discussion, the lower bound of the value K is the maximum value of the two lower bounds derived above.


Furthermore, we want to obtain a deeper understanding on how to automate validation of formalized hypothesis and identify confounders within these.

through systematization, our DSL will try to minimize bias in the controlled  Table 1.


In the original program, however, this situation only happens if the other thread is never scheduled to change the value of shared , which is different from the semantics of the original program.

we must also consider the progressiveness for the privatization correctness.


In particular, the ON clause is checked to assign a value to every key attribute of the second table, and to refer only to keys or values from the .rst table.

our join is typed more precisely than the SQL join since join conditions are not allowed to underspecify or overspecify the row from the second table.


The development of the device driver strongly depends on the hardware platform, the device controller and on the operating system.

the design of the communication structure (hardware and software) demands a great effort, a lengthy development period and is prone to provoking many errors.


At the same time, both UML-based architectural models and architectural description languages fail to describe appropriately the highly dynamic nature of today s architectures, with unbounded creation and deletion of components and connectors.

we are aiming at a modeling method for architectural styles which is expressive to support full dynamic recon.guration, usable for application developers, and which provides tools for simulation and analysis.


However, on the 4FC-12SC, for the workloads in Table 2 (same benchmarks, different number of threads), PA and CAMP always perform similarly since both schedulers have enough fast cores to effectively accelerate singlethreaded applications as well as serial threads (Figure 6).

there still remains a question, if considering the speedup factor in addition to TLP is important for multithreaded workloads, and in what cases it can bring signi.cant performance improvement over an algorithm that relies on TLP only.


If the same code was written with a synchronous wrap, we would have no guarantee about the consumption of v .Infact, the codewould block, as the send encapsulated by the wrap would be executed by the same thread of control executing f .

the asynchronous event implicitly creates a new evaluation context and a new thread of control;the wrapping functionisevaluatedinthis context,notin the context associated with thread that performedthe synchronization.


Both benchmarks also feature good arithmetic intensity and access relatively few bytes per operation.

one would expect both these benchmarks to vectorize very well and scale nicely with increased parallel resources.


Our analysis suggests that events seem to be generally comparable in granularity to parameters in code interfaces or individual variables in .le interfaces.

an appropriate interface for events may simply be a declaration of those events (topics) a component publishes and subscribes to.


The Job Satisfaction theory describes Job Satisfaction and Job Dissatisfaction as two co-existing states, rather than opposite forces.

we follow a similar rationale to suggest an interpretation for this concept, based on our data, described below.


In order to visualize sensor volume data on space, the data value in any positions is needed.

it is necessary to interpolate data to continual space using the digital data arranged discretely.


In addition, the representation type includes multiple distinct values that could correspond to the same input, obtained by reordering the variables in the blist.

this encoding fails the no junk component of the adequacy property.


For example, if we remove C at the left-hand side of B in the above list of active layers, the call of partial method declared in B that uses methods introduced by C may result in failure.

to .nalize the creation of the list of active layers, we need to remove duplicate layers from that list according to the rule described as follows: If the same layer is activated twice or more in the same list of active layers, we remove those layers other than the one that has the lowest priority from that list.


The execution time of our approach on inferring MRs for each scienti.c function is from 9.87 seconds to 1231.16 seconds, which is acceptable.

our approach is able to infer many MRs quickly.


There is an event that should never occur after no-T&S and before the .rst subsequent obtain-specimen : the nurse can never label the specimen vial (label-vial ) before putting a blood specimen in the vial.

the user could indicate that label-vial is a secondary event and then select the answer, No, other events in the alphabet of the property cannot occur before the .rst subsequent obtain-specimen occurs.


Our work is carried out based on a framework for executing AD programs.

our omniscient debugger can be also used for other AD languages even though it is motivated by AOP.


In practice, frequently, quality management revolves around defects, and delivered defect density, a number of defects per unit size in the delivered software, has become the current de facto industry standard [4][5].

the prediction of software defects, i.e., deviations from specifications or expectations, has been an important research topic in the field of software engineering.


It s still useful, however, to talk about the di.erence of two #P functions.

we de.ne the GapP functions, which are the subtractive closure of the #P functions2 .


Thereturn call onLine5 will returnthecontrol.ow back into the delete method, and execution will continue on Line 11.

the @user object will still be deleted on Line 12, regardless of whether the current_user is an administrator or not, introducing an EAR.