Firm mutation is de.ned by Woodward and Halewood [24] as the situation where a simple error is introduced into a program and which persists for one or more executions, but not for the entire program execution .

similarly to the AjMutator tool [10], the evaluation of mutants based on partial program executions implemented in JUnit tests characterises .rm mutation in Proteum/AJ .


Note that concurrent UN requires about 28% more heap space than STW UN (Section 4.6).

bounding space overhead in concurrent MC does not seem necessary/practical.


(3) If communication c is performed right after communication (c - 1), this means that an output sent by a node follows multiple links before it reaches its destination.

the communication in the .rst link (c - 1) has to start before the next one (c).


Clearly, reading through each non-sort-key attribute of each tuple in a entire large result set is a slow and arduous task.

our task becomes that of supporting fast browsing (and more speci.cally, scrolling) over such a sorted relational result set.


Note that, before the context transition, GPSNavi is still active and RFNavi is not active yet.

the execution of powerOffDevices() results in the execution where the device controller turns the GPS receiver o.. By EventCJ, we can declaratively specify which context is activated by which event, and this activation is preserved until the next event that deactivate the context is .red.


credential, declaration and policy files) have been designed for TN, the file format interoperability problem continues to be a challenge.

approaches for the establishment of a trust relationship are required to further support communication efficiencies between WS.


Moreover, in principle all approaches need to address concepts like resource demands, consumption costs, quality mappings and selections of configuration parameters, but they don t usually explicitly focus on or expose their descriptions and their relationships.

it would be interesting if one could easily separate the modeling of these concepts, the relations between them, and their usage, from the engineering and technology details selection level, in order to be feasible to easily construct realizations of different system-wide architectural alternatives.


The discussion concerns both the modeling language underlying the approach and the steps taken in the approach.


Like Knuth, they argued that their tools could bene.t by knowing the typical and extreme values of various aspects of software.

their interest is in the low-level details of the code with a view toward future tool support or language design.


We assume that the information bits have already been compressed, such that for any subsequence of length n> 0, the 2n possible sequences are sent by the sender with equal probability.

no set of information bits sent by the sender contains useful information about other bits.


4.3 Workloads creation To exhaustively validate our thesis, we tested all the possible workloads featuring a number of instances for both bodytrack and ferret ranging from 0 to 4, imposing that the total number of applications would be greater than three.

there is always at least one binding domain where two applications share the resources.


In the present paper, we focus on examining the effectiveness of the studied strategies with respect to a set of mutants.

the use of the above restrictions affects only the initial set mutants and not their impact assessment.


One then requires that .nally clauses cannot discard errors (unless maybe, they throw an error themselves).

for example, if a try (or catch) block throws an error E, the .nally block is executed.


Starting with a large set of potentially relevant studies, reviewers rely on several steps of selection, .rst by reading titles and abstracts, followed by full-text reading for quality assessment [3].

the reliability of a secondary study is highly dependent on the repeatability of the selection process [8].


The interaction takes place only between the system and its environment and between the subject and the considered system, respectively.

the syntactic interfaces of U and E are denoted by (OU I IU ) and (OE I IE ), respectively.


Once an object becomes thread-shared, a process which must be signi.ed by the share annotation, it can no longer be mentioned in another object s invariant.

examples like the one shown in Figure 13 where the invariant of the RequestProcessor class depends on the thread-shared RequestPipe object, cannot be veri.ed.


Many LOAD CONST instruction occurrences load objects that have been allocated in the lower memory area below 32 bits.

for all constant objects where this observation holds, we can actually replace the array indirection by a direct push of the instruction argument.


It should be emphasized that the pre-trusted peers are essential to this algorithm, as they guarantee convergence and break up malicious collectives.

the choice of pre-trusted peers is important.


T 2 -46 = 0 (eigenvalues equal and real): The variation of a+a u as a function of time can be calculated as u = u0e -t 2 , where u0 is the initial value of u.

the system converges exponentially quickly from the neighborhood of the second equilibrium point.


As discussed previously, if a bind handle can begarbage collected that signi.es that the advising relationship is never going to be removed.

it can be optimized away using techniques proposed by Bockisch et al.


Although we are investigating the discipline with a plethora of empirical studies, those studies either concentrate on validating speci.c methods or on single companies or countries.

they allow only for limited empirical generalisations.


The difference in program performance between the feature-vector based heuristic and the focus-method GA is scaled with the fraction of overall program time spent in the relevant method.

we can see from Figure 8 that the per-method performance results achieved by the featurevector based heuristic are quite disappointing.


For procedures with multiple return statements, it is inconvenient to add that code in multiple places.

a procedure is transformed such that it has only a single return statement.


3.3 System Implementation The first objective is to identify the possible problem.

one part of the system is to evaluate the user s state.


The feedback that usersprovide ononeversionofanapplication isautomaticallycarried forward, using defect differencing, to the next version.

the feedback-import feature can be used to customize future reports: Invalid and WontFix bugs keep recurring from one version tothe next, but can easily be .lteredout so that the user is not distracted by them.


Both are explicit metastates, which means that they contain user-defined action code.

the modeler is able to specify custom behavior for acceptance and rejection of submitted papers.


on selectors that are themselves unde.ned  have the return type [a], which is again pointed without any condition on a.

launchbury and Paterson s approach to parametricity in the presence of pointed vs. unpointed types can be used to show that law (1) holds without any conditions on p, h, or l, provided all invocations of seq are dropped2 2By contrast, if, e.g., recursion were performed at a type whose (in which case we get precisely the .lter function from Haskell s standard prelude).


In an organization, for example, different stakeholders from different departments can perceive some opportunity for software depending on their knowledge of it and the added value they are looking for behind its adoption.

there is a need for tools to make business value more tangible and limit subjectivity issues.


Since the exit stub stores the CTI location, it is larger compared to the exit stubs used by proactive linking.

the auxiliary code size is larger for lazy linking than for proactive linking.


To eliminate half of the cross-core interference penalty of a is more valuable than b, meaning the bene.t gained, a 20% increase in speed, with a is better than the 1.9% speed up in b.

we should be willing to sacri.ce more utilization to eliminate 50% of the cross-core interference penalty for a than b since a is more cross-core interference sensitive.


This and Lemma 3.2 imply that the CurrSeq parameter of gv(S ' ) has the value written in Rs by S ' .Since gv(S ' ) reads the value written by U,it follows by the code that if U reads in Rs avalue for CurrSeq greater than or equal to the one written there by S ' , gv(S ' ) will terminate by executing line 26, which is a contradiction.

u reads in Rs avalue for CurrSeq less than the one written there by S ' .So, U starts its execution before S ' writes to Rs.


In other words, one loop iteration takes II cycles (ignoring the loop prologue and epilogue).

minimizing the II directly leads to an increased throughput.


However, if the component J modi.ed this data as shown in Figure 1c, then the read element would be authors and the obtained value is Single .

if the component J inserts a data element into the path to some elements accessed by the component C, then the result of interference of these operations is that the component C accesses and reads values of different data elements from what was intended when it uses sequence numbers of elements rather than their names.


As noted, such a generic aspect de.nes both a method (checkInv) and a pointcut (cePC) as abstract.

they a supposed to be de.ned by a concrete aspect which extends it.


coin .ips, the number of distinct algorithms in LII is at most |O|n., where O is the domain of the coin .ips.

by Yao s Principle, for any distribution GII over LII , D is the event that b .nds a process in that phase.


In future work, we plan to investigate, model and evaluate further aspects and their applicability to the domain of distributed service-oriented multimedia content analysis.

one of our targets is to automatically integrate crosscutting concerns such as reliable messaging and pro.ling.


If there is a background volatility in measured values, there is no indication of statistical con.dence that the sample in fact indicates a systemic problem.

unnecessary adaptations maybe performed leading to failures or increased costs associated with adaptation.


We use thisfactto start storingthedata itemsof function bar from the .rst unusedslotinthe chunk aslotthatwouldbeusedbyfunction foo but only after functionbar returns.

foo and bar share those four slots thatwould otherwise remain allocatedbut unutilized.


Reputations are often used to distinguish between users, and in many applications, users care more about relative reputation values than the actual values.

we say that a sybil strategy (G',U') for node i in G is successful, if some sybil has a better relative rank than i in G. Since imay use any of his sybils to perform transactions in the future, a sybil strategy is successful if at least one sybil has higher rank.


However, this category is not within the scope of this paper.


The scenarios recovered are what we called design scenarios, so there are still some levels of abstraction to be traced up to requirements scenarios.

we believe our ideas can complement this work.


As prepare responses arrive, they are forwarded to all servers (line 228).

the threads from the prepare phase do not stop until all servers return responses or the commit phase completes.


Also, when an AD is a pointer to an MD in the MAR, the corresponding MD in MAR is looked up, and the corresponding environment variable is set appropriately.

the time-wise integration of the FAR and MAR activities happens implicitly through the explicit pointers from the FAR to the appropriate entries in the MAR.


There is no semantic requirement to process requests in the order that they originate during the execution of an application.

the specialization controller could likewise traverse the entire queue, sort it into buckets referring to the same module and then make a choice which bucket appears to be the most promising in terms of expected return on investment.


v 3 For the area with size A, there are about A/( D2) 2 cells.

if these cells communicate simultaneously, the total throughput equals 2AR 2AP k2 v = v .


An attacker could exploit this vulnerability by setting the name parameter to ";alert( xss )//.

this would cause the resulting inline JavaScript to be the following, thus executing the attacker s JavaScript code:  var username = "";alert( xss )//";  the code section of the application is dynamically generated with untrusted input and even with the code and data separated, there is still an XSS vulnerability.


The two lists are coordinated, so both ß are drawn if our red-black tree were a dictionary (with a key and value from the same type list ß ' .

for each pair of corre-for each conceptual node), separating the keys and the valsponding nodes, the conditional types must evaluate to the ues could make functions accessing only the keys (e.g., is same branch.


While the deployment began with a few hundred users and has been augmented by early adopters, Rendezvous is beginning a phase of systematic deployments that will make it available to twenty to thirty thousand users over the next year.

while at present our results reflect the experience of volunteer "early adopters," we expect to be able to present a more general set of results in the future, at least for corporate conference callers (a not insignificant usage niche).


3.2.1 Taint Sources The goal of our algorithm is to (1) pinpoint the instructions that have a memory operand that needs to be symbolized and (2) pinpoint every global data location that stores an initial function pointer or a global data pointer which need to be symbolized.

our taint source contains the instruction address (PC) whenever an instruction involves a literal value operand, or a data value that appears to be a global pointer or a function pointer.


Strategies are a remarkably simple idea.

in the original formulation, a strategy is a function of type a -> () for some a: type Strategy a = a -> () a Strategy may evaluate its argument either in full or in part, and it may only return () (or diverge).


The replication management is considered to be an issue internal to the fragmented ob ject.

it is inherently replicated so that no external measures have to be taken to make the replica management fault tolerant.


The insiders are very skilled in the equipments or systems of the organization which they belong to and can delete immediately their traces after their improper activities.

it needs the acquisition of data in conformity with the leak type of confidential information for finding out the evidence.


For instance, for k = 300, at p1 =0.1, this guarantee applies for more than 90% of the acceptable defect rates; but at p1 =0.01, the guarantee applies form less than 3% of the acceptable defect rates.

the simple strategy can be applied only if a large uncertainty region is acceptable, which means that the Dispatcher has a strong con.dence in the fact that the defect rate is actually null.


Java [14] and .NET [2], the value of f in the pristine state is assured to be an appropriately casted zero.

if a reference .eld in the pristine state is loaded into a root y , y will be directly overlooked by an immortal root.


However, we also do not want to impose upon the user the seemingly arbitrary cost of turning scalars into 1x1 matrices.

a scalar is implicitly promoted to be a 1x1 matrix in any context where a matrix is required.


Given this region, a reasonable guess as to the target host s location is at the region s centroid.

cBG uses the centroid of region R as a point estimate of the target s position.


We restricted the test bed to a LAN environment due to the fact that the JavaParty benchmark bundle has only about 100kB size.

the LAN scenario represents the worst-case scenario for OSGi4C becausetheloading timeis equalinaWAN setting(see Table2) butSOAP-basedWebservice invocation times increase.


There will also be a parallel thread with the execution time of (1 + Lfid - fi)Pi max and the relative deadline of (1 + Lfid)Pi max .

if we c si-1 2j m P 2j let Pi = 2 m i , the following inequalities are j=1 i satis.ed: (qi - 2)P max t i (1 + Lfid - fi)P max .i = + i (1 + fi)Pi max (1 + Lfid)Pi max ti.


As shown previously, it is not di.cult to see that the z-links used in this spanning tree are disjoint from other z-links used in case 1 and 2(b); thus all the links in this spanning tree are contention-free.

our algorithm for the construction of the spanning tree on a 3-D torus can be summarized as follows.


INTRODUCTION In the current globalized economic conjuncture of Brazil, the volume of negotiation carried on in the financial market has increased values and the competition, in this market, holds as a success differential the demand of information with more and more quality, transparency, quickness and low cost.

the pursuit for reduction in enterprise processes complexity using Information Technology (IT) is a challenge sought by software developers.


Between the trials, one question was the same.

the experiment contained 51 participants and four challenges.


As mentioned in Section 3.2, instance selection depends on the positions of the type parameters in the advice signature.

the mechanism cannot select an instance if all type parameters are not used in the signature of the instance advice.


Interactive Volume Segmentation Automatic volume segmentation is a dif.cult problem because the image data is often noisy and the segmentation is dependent on the subjective interpretation of the observer [ONI05].

several interactive techniques have been developed to allow the user to specify input for semi-automatic segmentation.


So, a user has just to draw the data .ow graph of his application or follow a special wizard for complex applications.

sDAD generates the (Application.xml, puts data and binary .les in a directory tree, and compresses all these data in a zip .le.


Mer3 has two precondition predecessors: {Mer4 }and {Mer5 }.

pCus2 = {{Cus3 }} and PMer3 = {{Mer4 }, {Mer5 }}.


As a result, they cannot be used, for example, to define the model of an arbitrarilynested tree-widget such as a folder.

each of the approaches above makes a significant compromise.


Quality goals could di.er in di.erent quality levels, even can enter in con.icts.

self-management capabilities can enter in con.icts because of their contribution to quality goals in con.icts.


In order for the results from unsynchronized writes in the untrusted context to be seen in the trusted context, Codejail provides APIs which synchronize speci.ed regions of memory in the untrusted context to the trusted one.3 In addition, system calls are restricted by a speci.ed policy when executing in the untrusted context.

codejail ensures that the untrusted library is sandboxed with respect to memory writes and system calls.


the concerns of version 1.0 of the EAM Pattern Catalog have been split up into problems and forces, etc.

concerns are not explicitly covered in the rest of this article.


We do not display the input document as typed by the user, but an enriched version, to hightlight syntactic constructs.

we have to parse the input and then serialize the result.


Also transformations of basic decision models to feature diagrams are in general not always applicable, as feature modeling approaches in their very basic form usually operates only of a subset of propositional logic [17].

this kind of feature diagrams can be regarded as intermediate step.


Notice that it is di.cult for a node to trust the contents of a message, as it cannot determine whether that message originated at the ostensible sender s, or at a malicious device spoo.ng messages that claim to be from s. However, if a receiver does not receive a message in a round, it can be certain that no message was sent; the malicious nodes cannot forge silence.

we make frequent use of silence to authenticate data.


However, one well-known limitation of wrappers is that they do not preserve object identity.

code that employs == or instanceof on an expression of an interface type can get incorrect results if that expression evaluates to an expanded object.


Table 2 shows typical parameters of The e.ciency of garbage collection largely a.ects the performance of the system.

the block with the lowest garbage collection cost should be chosen as the victim block.


The constraint at s3 node is p and the constraint at s6 node is d, so the PCsets of these two paths respectively are as follows: PCset1 = {p, d} and PCset2= {.p, d}.

the DFC from s2 to s7 is the disjunctive of the two paths, DFC= (p.d) .


Each edge that is not used for the computation of a plane equation is forced to be located on it.

for each face Fi, one obtains deg(Fi)-2 equations, where deg(Fi) is the number of edges adjacent to Fi.


A more aggressive policy would require to completely shut-off the card when no needed by any active application in the system.

more power can be saved, at the price of a larger wake-up delay needed by network reassociation.


For a given analysis granularity, the capacity requirement ofa buffer at any point in time is .xed.

the X coordinate of any buffer in the two dimensional time-memory plane cannotbe modi.ed, i.e., the buffers can not be moved horizontally.


This implies the dominant thread must periodically check the request .ag.

the algorithm ensures starvation-freedom for the non-dominant threads only when the dominant thread checks the request .ag in.nitely often in any in.nite computation.


These barriers affect everybody, not only people with some kind of disability.

in order to avoid the barriers it is essential that both the content and the user agent be accessible.


Note that within the scope of class pattern $$C, the name $$C refers to exactly one element of the eventual set of matches for $$C.

the constructor pattern matches only one constructor, not a set (not that a class could have multiple nullary constructors anyway).


The CHECK-CAST intersection narrows the set down to {T2} (assuming T1 is not a subclass of T2), which is the resulting type set for field B.b.

any optimization can (optimistically) assume that a reference loaded from B.b must point to an object of type T2, as opposed to the closure of the declared type, T~.


Furthermore, the nodes did not live much longer than requested.

the applications were able to provide almost optimal quality subject to the constraints present.


Users find its interface easy to learn and use.

the goal of AgentWeb is to demonstrate that AgentSheets-like applications can be hosted entirely and natively on the Web.


However, there are many legitimate reasons why tests for databases and .le handling may not be independent.

it remains an open question to what extent our technique can be applied in such domains, and to what extent we need to extend its heuristics to reduce the number of false positives reported.


However, an important observation is that, since each operation crosscuts each visitor class, adding a new node to the existing class hierarchy will cause an invasive change to all of the visitor classes resulting in a maintenance nightmare.

no matter if it is a pure object-oriented or aspect-oriented implementation, the visitor pattern is applicable only under conditions when the node structure is static and does not change frequently.


So the last marked object in the path must be dirty, meaning that marking from live, dirty objects will lead to the object allocated during marking.

we could preserve correctness without allocating live during marking.


Thus, the upper bound on R, Rmax= 1,Vfinal1V=1,11(1+1).

since in this example, Vfinalis always smaller than or equal to V, the average value of Vfinalshould then be (1+11(1+1))12xVi the average rate of con.icting reservations, Ravg, equals to 1,Vfinal1V=1,(1+11(1+1))12= (1,11(1+1))12.


This incorrect con.guration makes IE Tab allow user names and password in URL address, which is blocked by IE [29].


In Acme, a component may have a representation, which is a decomposition of that componentintoits constituentparts.

a componentmaybe a subsystem withits owninternal structure.


The library does not provide an interface ManagedRelationship; rather, we use the Set interface from the Java Collections Library.

staticManagedRel implements Set>, but StaticRel does not.


Besides,since.ash memoriesarepurely electronicdevices and have no moving parts, they have no seek or rotation latency like magnetic disks.

random access of .ash memory can be as fast as sequential access and the latency of .ash memory is almost linearlyproportional to the amount of data being accessed, no matter where the data Table 1: Magnetic Disk vs. NAND Flash [19] Read Write Erase Magnetic Disk 12.7 ms 13.7 ms N/A NAND Flash 80 µs (2 KB) 200 µs (2 KB) 1.5 ms (128 KB) is located.


Our experience has been that even with very careful scaffolding and practice exercises, the first few iterations seldom produce meaningful performance data.

we had to plan on many students needing to discard the data from the first two to three iterations.


Move operations can be used in the context of modi.cations of the .ow structure, which occur very often.

exhaustive checking of alternative di.erences would lead to intolerable overheads.


The .rst page of an object stores not just data but also the frequently modi.ed object header which is why we avoid sharing this page.

our system passes R objects smaller than two pages of memory to the standard, non sharing memory allocator.


In the lookup table, the gain of .nding the physical address of replacement block is amortized by the number of OOB data reads incurred during a backwards search to locate a required page.

the advantages of the lookup table are smaller in a .ash with larger block size, since a larger block holds more replacement pages compared to a same size .ash with smaller block size.


In addition, a proxy object might be accessed via re.ection, e.g., by reading the .elds of another object.

the analysis treats all objects obtained that way as possible proxies.


In terms of data structure support, SAP Gravity is more .exible than Apache Wave or ShareJS since it allows syncing graph models that may include cycles.

it is capable to accommodate arbitrary business processes that can be expressed in BPMN.


For the sixth occurrence, we need to .nd CHR constraints of the form leq( ,X) to ensure that B = B ' holds.

we need an index on the second argument.


This contrasts sharply with the physical sciences, in which, for example, a measurement of the electron s charge would have an explicit statistical confidence bound arising from the intrinsic sensitivity of the equipment used in generating the evidence.

it is often difficult to use statistics to combine measurement error and credibility into a confidence bound around one estimate of a software attribute.


An additional issue with the hardware-assisted approach is that the necessary hardware mechanisms are typically speci.c to a particular micro-architecture.

exploiting them in a virtual machine that must ship on several architectures (and an even larger set of micro-architectures) represents a signi.cant engineering investment.


By Lemma 2, CSowner has the value p in some configuration C that lies between the steps Line(p, k, 1) and Line(p, k, 7[last]).

if the value of CSowner is not p in the configuration D, then there must exist a step s' in the fragment of the run from C to D such that s ~ changes the value of CSowner from p to something else.


In order to analyze the result in a better way, it is relevant know the pro.le of the assessors.

some characteristics as, age, gender, education level, knowledge in technology, expert or naive in video quality test, etc.


This is mainly because of the memory accesses and fewer numbers of blocks needed to fully utilize the GPU.

tuning stops increasing the aggressiveness of the optimization because it does not provide any further speedup.


Second,ineach classversionthestaticinitializerisextended toinvoke the pbi_initClass() methods of all class versions inthe end(if thereis no staticinitializerin a class version,itis created).

after merging of the staticinitializers, the pbi_initClass() methods of all class versions willbe executed, independently ofthe executed code version ofthe merged staticinitializer.Thatis,allinsertedstatic .eldswillbeproperlyinitialized.


Hence, we simply add the following line to the tracematch de.nition, giving the clue that actions occur more frequently than other symbols: frequent action ; Association aspects also choose their indexing structure based on the look-up direction.


The class E.F could then be an extension of Top.this.a.b.C.

only if there is a common class wrapping the classes in point and there is a path of .nal .elds to the class that is to be extended.


MEASUREMENT AND RESEARCH ENVIRONMENT Tiwari mentioned in his paper that time the processor used was directly related to the power it needed [3].

to get the same output from similar essential working steps while controlling other kinds of element, the shorter the processor time uses the better performance of the chosen component is - in term of the power optimization.


Abductive exploration just performs the function of a model builder that should be followed for a con.rmatory data analysis.

abduction plays the role of an explorer of viable paths, but further inquiry should determine which are the most plausible solutions [43].


But, the principal contribution of Little-JIL is perhaps its suggestion of abstractions that seem particularly effective in communicating process thought.

little-JIL is a member of a newer family of process definition languages aimed at determining what these models and abstractions need to look like.


In other words, the dynamics of any given software development effort make it necessary to revise written requirements.

waterfall approaches are faulted for not allowing for revision.


This constraint means that, viewed as unsigned 32-bit integers, I1 is strictly less than I2.

we view the machine as capable of manipulating mathematical integers,but the comparisons are limited to a 32-bit perspective on these mathematical integers.


Toautomatethe entireloadingprocessitshould runwithout user interaction.

for dynamic loading of appropriate bundle code at runtime, bundles have to be describable with metadata characterising the OSGi bundle/service requirements and dependencies (see Figure 2).


In a work-stealing program, tasks often have the same features (e.g., number of instruction, compute-intensive or data-intensive).

the workers of a work-stealing program have similar demands on the computation resources as well.


An instruction needs to be dispatched before it can execute, and execute before being committed.

within each instruction s nodes there is a DE edge and an EC edge.


Furthermore, modern supercomputers are often configured by connecting multiple GPUs in large-scale networks due to the advantages of such architectures, including their very high cost/performance ratios and low power consumption.

outside of the GMs, it is also essential to have some way of detecting faults in the interconnections between the SMs and GMs, or in the network between the GPUs.


ECMAScript 5 s frozen objects help to simulate ActionScript 3 classes more accurately.

jangaroo will not become dispensable, but on the contrary, it will be possible to approach full support for Action-Script 3 in modern browsers.


Disabling network bu.ering for puts (this happens to be correct for this benchmark) brings the auto version s performance to within 3% of that of manual blocking, but has no effects on the other benchmarks.

while our framework is e.ective for small to medium transfer sizes, a zero-copy consistency checking algorithm could further bene.t applications with large-sized puts.


Only when they are equal, the proof passed in by the user can be casted to a proof of pf (Cashier says (Paid m)), where m is the value of the stored current nonce.

an old proof with an expired nonce will not reveal the secret.


As you can see in Figure 10, the store replication itself worsens the performance of the program.

we need to cancel such a transformation if the loop cannot be transformed to the faster code.


Although thebenchmarks, when partitioned into tasks, do not contain inter-task dependences, false sharing introduces dependences that occasionally cause speculation to fail.

webelieve that ourresults re.ect theperformance ofbenchmarks with dependences.


In contrast to R.1, we also need to modify annotations on members, because we include the containing class in more variants than before.

we propagate the classes annotations to their members.3 Similar to merging classes from mutually exclusive features, with refactoring R.3, we also merge members with the same name inside a class.


If we were to lock the data structure for each of Q queries, each query might be forced to wait for insertions and other queries, thereby increasing the apparent work by as much as T(QP) and nullifying the advantages of P-way parallelism.

we lock the entire global tier when an insertion occurs, but use a lock-free implementation for the presumably more-numerous queries.


We felt these issues would make it dif.cult to extend Ruby s parser for our own purposes, e.g., to add a type annotation language for DRuby.

we opted to write a Ruby parser from scratch.


For example, collocating two blocks in a 13region, which includes two virtual pages in our system, produces a 50% probability that two blocks are in the same page.

other values of K affect the probability for cache or page collocation.


Consequently, different tools are able to accurately render and edit the globally traced artifacts.

a new artifact can be entered via a Word document, modified through a web data entry form, and viewed in a table-format report.


If we consider a product line with hundreds and thousands of features [1], it becomes obvious that product-based measurement does not scale.

we need better methods for determining quality attributes of all products.


3) Finally, smartphone users can benefit from a more flexible choice of sensors for their intended applications, as long as the sensors have the Dandelion support.

users will also benefit from a wider range of emerging applications and sensors.


Second, if a variable is allowed to have multiple lifetimes, they may be assigned di.erent colors, depending on the order of the basic blocks.

in connecting the data.ow, the number of data.ow transfer instructions needed is also dependent on the order.


This implies that this value can be recovered neither by the rede.ne technique nor by the extract-from use technique.

the RCG algorithm resorts to state saving which is performed by the inserted save instruction before i1.


At a call site to the procedure, the objects accessed via the iterator are resolved to be parts of composite objects.

applying the summary of the procedure results in some points-to relations which have the pointer components of composite objects as sources.


Note that if two or more input (output) transitions have the same output (input) vector, we can fuse them in one transition whose rate is the sum of the rates of the original transitions.

without loss of generality, we assume that all the input (output) transitions have di.erent output (input) vectors.


We assume in this work that the collectors operate on spare processors.

complicated scheduling issues that often appear with uniprocessors do not arise.


2) An atomicity violation may be benign it does not affect the correctness of the program.

in order to understand the effectiveness of the tool, we tried to identify if an atomicity violation error reported by ATOM-FUZZER could lead to a bug.


However, as mentioned in Section 5.2, whenever a formula is satis.able there always exists an in.nity of possible labellings which satisfy it.

rather than proposing just one labelled tree, the solver gives a minimal tree together with labelling constraints representing all labellings which make that particular tree a counter-example.


Additionally, Figure 5(d) con.rms that the latter strategy promises a better temporal workload balance.

thelatter strategyispreferred to cope withpeerheterogeneity.


Since routing nodes in a wide-area pub-sub system are typically managed by entities in di.erent administrative domains, we must assume that publishers do not trust routing nodes in other domains in terms of the con.dentiality of their published data.

our secure aggregation protocol should allow untrusted routing nodes to perform aggregation of raw data without learning the private input values.


since each count c is independently selected with probability g(c), for each occurrence of c, on the average g(1 c) -1 other nodes have (I,c)but did not sample it; that is, each occurrence of ccan be thought of as representing g(1 c) occurrences of c. we estimate the total count fI of I as x1 x2 xk fbI = + + ···+ (1) g(x1) g(x2) g(xk) The following theorem shows that this estimator is unbiased and establishes its MSE.


In order to continue exemplifying the use of negative scenarios let us assume that the new implied scenario is also deemed as undesired behaviour by stakeholders.

we obtain a new negative scenario (Figure 10) from which a new constraint can be built to check for further implied scenarios.


First, for each considered parameter, the values of that parameter in the two samples are being compared; a parameter similarity factor (p SimF) is calculated for each such parameter.

there will be an individual memory usage p SimF, a workload p SimF and so on, for each monitored parameter.


However, a merge combines a data block and a log block into a new data block.

physically, a merge results in using an already erased block but producing two new erased blocks.


Barring special thread interfaces such as OpenMP, however, the number of threads cannot be dynamically adjusted during runtime for most workloads.

if the power cap or workload behavior vary signi.cantly during runtime, it is highly likely that the system operating point will not lie on the power-delay Pareto ef.cient Table 2: A comparison of the average power and execution delay of our MLR classi.er with and without thread packing for a 130W power cap.


On the other hand, a better bound has been proved for C B C -M AC than for our construction, namely on the order of 2-blq2 [7] (when l < 2b/3).

the trade-off between slightly slower performance and better bound should be explored.


Then the derivation ends with TEXP followed by an application of subsumption for the re.exive case.

f f e1 : L and f f e2 : L, and by induction µ(e1)= v(e1) and µ(e2)= v(e2).


Such a script can direct other applications to perform useful functions, but may also call other script .les.

script .les provide a simple mechanism for modularity.


In addition, we also remove the user provided atomicity constraint of incAndLog,sonow M3 (mutator increments) and mutator logging are no longer constrained to execute atomically.

the only atomicity constraints left in the mutator are those forming the individual building blocks.


However, this comes at a higher storage cost in memory, as well as higher mem- ory traffic.

the rest of this subsection gets into greater detail comparing DP with RP, in terms of per- formance implications of these prediction accuracies, par- ticularly for the applications with higher TLB miss rates.


If we do succeed, the new coloring can be committed.

we overwrite the old color with the temporary one and reset the changed .ag for each node in the list.


We deliberately chose to measure the gross effect including all startup and transfer overheads as that is the impact that eventually can be observed by programmers in terms of wall-clock runtime effects.

we present speedups of generated CUDA programs (referred to as SAC-CUDA) against their sequential counterparts (referred to as SAC-SEQ).


Working independently, these algorithms suit different types of programs.

using one or more of these algorithms, a variety of programs can bene.t from the use of Of.ine GC.


Sometimes design patterns introduce complexity.

before applying the transformation process, the impact of pattern oriented refactoring on quality attributes[11] needs to be estimated.


Note that Permissions propagated upwards via a doPriviledged node do not propagate beyond the predecessor of the doPrivileged node.

the above definition (or the algorithm based on it) must be refined to replace G-() by G- n, p), where n ( To clarify all of the concepts introduced in this section, consider the following simple example.


To achieve maximum degree of semantic interoperability, the SNOMED CT ontology is one of the choices to use in standard MLMs.

the use of standard information model HL7 vMR and standard terminologies such as SNOMED CT ontology in MLM provide interoperability and exchangeability features in knowledge base.


However, in terms of emulating the NUMA API, while these results show slightly more variation between the two implementations, the differences, again, are always within the margin of error.

our framework provides an effective implementation of the NUMA optimization in HotSpot.


High-level languages provide type-safety, memory-safety, encapsulation, and strong abstraction over hardware [12], which are desir able goals for system programming as well.

high-level languages are potential candidates for system programming.


At room temperature for silicon, fv is 15.6 THz and the ratio of power for stoke and anti-stoke output is around 10.

in this paper, we will only consider the stoke wave for maximum power emission from the Silicon Raman laser.


In languages such as Java in which objects are always accessed indirectly through references, points-to information is also an important prerequisite for many analyses, and points-to analysis is often interdependent with call graph construction.

tools for comparing points-to analysis results should also be developed, perhaps combined with the call graph comparison tools.


(R ) The secondhypothesis of(R ) creates O(#edge.2) table entries, in contrast to O(1) table entries created by (L ).

we conclude that the right-recursive version should run a constant factor slower.The experimentsinSection6 con.rm this.


In other words, the value of the corresponding logical expression must be changeable through some user interface control.

our approach works in two steps: 1) Identify all the alternative paths to the backbone execution.


In the next O(log k) time units the win- ner of the tournament tree is determined (according to the properties of the tournament tree).

in O(log k) time units some process enters the critical section.


Change in data correlations may result in changes to the correlation graph.

each deleted node s periodically checks for validity of the hyperedge (S, s)usedin its C3 condition by gathering data from the nodes in S (using the piggyback strategy over normal data-gathering process as described in Section 2.3), recomputing the a parameters (Equation (2)), and checking if the least square error (Equation (1)) is within the given bound.


Generally, private cloud platforms may benefit from a better network interconnect, better security, and more user control over the resources.

private cloud platforms are ideal for testing scientific applications and identifying best practices for scientific computing on cloud platforms.


Therefore, the difference between nx (where every ai =1) and R increases, and the given range increases.

the effect of using virtual nodes will increase as the system becomes more heterogeneous.


The former is comparable to the Object... parameter list in Java: variadic arguments can be accessed through void pointers, but also their typeid is available.

the programmer can safely cast the arguments to their expected types and deal with errors in a controlled manner.


However, it still requires all non-deterministic events, even those related to messages exchanged inside a cluster, to be logged during failure-free execution to ensure that the exact same execution can be reproduced after a failure [7].

the performance of these protocols can also be impaired by the overhead of event logging.


0 if |f1 - f2|= a I(f1,f2,a)=(|f1 - f2|) (1) 1 - otherwise a For IEEE 802.11b/g three channels of the 2.4GHz frequency band are theoretically orthogonal.

we set a to 30MHz, which results in the following set of orthogonal channels {1, 7, 13}.


In this paper, we are mainly interested in how this choice of base language affects the design of aspect-oriented features.

we present an aspect-oriented extension to Petri nets and demonstrate its use with an invariant enforcement example.


Thisleaves alotofBluetoothbandwidth unused because the Bluetooth interface in BlueStreaming is always active.

when there are uploading packets pending, un-used Bluetooth bandwidth is .rstly exploited to transmit the uploading traf.c.


3.3 Fault Localization An EFG is a Bayesian network which models the error propagation in a set of program runs.

we can apply an inference technique on the EFG to .nd the root cause of the error.


This highlights that a single ISTOF value (maximum stress traffic) can happen in different time instances, thus suggesting the search landscape for the GA is rather complex for this type of problem.

a testing strategy to further explore would be to cover all (or a subset of) such test requirements with maximum ISTOF values in different time instances.


THE FUNCTIONAL PARADIGM The definition of an MPL-RM function is required to be free of side effects.

neither global variables nor objects may be destructively updated within a function.


We have implemented this idea by creating a predefined concrete interface for each kind of traditional constructor, which extends the set of operations provided by the constructor.

the record constructor is associated with a predefined concrete interface with well-defined semantics.


Taking a snapshot when an object has been converted violates the third safety requirement for using a snapshot from an optimized execution in a debug build.

we restrict the compiler to only convert objects that are non-escaping and whose lifetimes do not cross snapshot safe points.


However, the relevant sets of objects may not be explicitly available in the original program.

in this paper, we present a declarative approach for de.ning sets of objects with the same usage pattern by means of a dedicated language construct.


All graphs of order lower than 11 are also included in this amount.

any possible graph up to Order 11 can be pre-calculated and all instances of known character graphs can be mapped to these pre-calculated models.


This is a hard problem both in theory and in practice [2].

rather than compute the pre cise answer, we seek to bound the probability of satisfaction.


In our solution, we exploit the interpretation that ensembles can be viewed as a con.guration of a .attened SPL reference architecture.

we create an SPL con.guration by (i) transforming the SPL reference architecture to an architecture of DEECo components and ensemble de.nitions, and (ii) re.ecting the establishing and dissolution of DEECo ensembles at the level of the SPL reference architecture.


At the end of each round, the results in array tempU are copied back to U.The (ij)T loop nest implements the actual 5-point stencil computation, and is the focus of our approach.

we will omit the outermost t loop and the array copying part (which is not a stencil computation) in the rest of our discussion.


Because of these problems, it is di.cult to use an only PRAM main memory.

researchers consider a hybrid main memory architecture with DRAM and PRAM.


As a result, based on the concavity of R(ek)inTheorem2and the optimalityof Theorem1,wecandividetheoverall optimization problem into two subproblems, says inter-frame and intra-frame energy assignments.

what we have to do is to determine the intra-frame energy assignment.Byapplying the Lagrange Multiplier method, we can solvethe problem in Equation (1) optimally, as shown in Algorithm 2.


However, with limited profiling, sophisticated path profiling schemes can no longer offer any prediction advantages over simpler schemes that exhibit much lower runtime overheads.

while intuition may call for longer and more elaborate profiling, we will show in fact show that the opposite it true: less profiling actually leads to more effective predictions.


In fact, the least .xed point assigns to each port the empty signal.

deadlock manifests itself as a least .xed point of empty or .nite sequences.


We assume that the security manager establishes an aggregation path such that there between pi and psub.

at least m + 1 colluding parties are required to obtain the value of vi.


By the previous rollback scheme, the federate state is always recovered at the point of an NMR call to the TiMaC layer.

this means that, upon state recovery, the federate automatically re-starts from the epoch with initial time trecovery .after having performed the state recovery phase through the Recovery-Action B, TiMaC skips execution of Step 1 and immediately goes on executing Step 2 and Step 3 for that epoch.


i=1 where n is the number of .elds of o; Lo is the lifetime of th instance o; li is the lifetime of the i.eld of o; r(o)is the idle .eld ratio for o; b is the size of each .eld; and Bo is the total size of o (i.e., Bo = nb).

p(o) is determined by three factors: the idle .eld ratio, size and lifetime of instance o.


While both approaches are potentially good, the .rst one is likely to be harder and, in addition, not very e.ective when the algorithm runs with a small number of processors like in our experiments.

in this paper, we focus on the second approach.


Furthermore, clients also have to pay money for transferring data across the networks to/from the providers.

depending upon how much the client is willing to pay, the client might want to do some processing at the server in order to reduce the amount of data that it has to transfer to the client.


Traditionally, clean-slate design tends to focus on creating effective and elegant networks for a static set of requirements.

the approach is often one of engineering, which tends to neglect competitive effects.


Additionally we assume that time constraints allow us to execute only n% of the original test suite.

lru(n) chooses the n% of the test suite with the highest selection probabilities.


Moreover, the other application processes will be able to use their local checkpoint copies.

this storage mode provides recovery as long as one of the two nodes containing a checkpoint replica is available.


Given variables tl, ..., tl+n .fv(C), representing the types of locations l, ..., l+ n,if a.fv(.ti), then the type at location i contains the variable a.

we report it as a candidate for a type annotation.


DEFINITION1(CAPSULESTATEHART).Aapsule statehartSC=(S,E,A,T,P,port)onsistsof anon-empty,fnitesetSofstates,  afnitesetEofevents,  afnitesetAofations,  atransitionrelationTSxExAxS,where e/a(si,e,a,s})ETisdenotedbysi -s},and  afnitesetPofportnames.


However, there is a dramatic difference between the programming model for a batch message queue and an event handler.

our view might be summarized as event notifications are messages that cause actions.


Output checking The bugs in the benchmarks CB.aget and parsec.streamcluster2, lead to incorrect output.

we added extra code to read the output .le and trigger an assertion failure when incorrect; the output checking code for the CB.aget was provided as a separate program, which we added to the benchmark.


As DMP-B .ushes store buffers on every fence (not distinguishing between different types of fences), it implements a weak ordering memory consistency model [2], speci.cally total store ordering (PowerPC and Sparc processor architectures have a .avor of such a model).

dMP-B does not noticeably weaken the consistency model provided by modern execution stacks.


The results indicate that all the four independent variables are statistically significant at 0.01 level.

all the four propositions are significant.


However, by definition, master data services are shared service across all business service providers, i.e., lines of businesses, and no individual lines of business is responsible for implementing such services.

this is modeled as a new type of enterprise wide business service, used by all other lines of businesses.


The node for an invoked procedure will be pushed into the stack and popped out of the stack when the invocation ends.

the contents of the call stack represent the nodes on the paths from the root of the invocation graph to the currently active procedure.


Two calls were predicted correctly by the system (setText(), setLayoutData()); the third call (setFont()) was not proposed.

the system proposed 2/3rd of the calls the developer actually needed.


Recall that there is an implicit disjunctive mandatory constraint over all the roles played by the same type, since none of the types are independent .

each qi value appears exactly once in the predicates.


This exact match is explained by our observation that all the translation and transformation rules that our compiler applies to Green-Marl programs are what programmers typically do when implementing algorithms manually using the Pregel API.

the compiler-generated implementations run in virtually the same way as the manual implementations do and exhibit similar performance behavior.


This happens as because the number of tracked pending calls never rises above k,after the k successive dispatches, the map value must be zero, thus the k +1-th call yields a ..

the MVP solution for the Ck-reduced instance is an underapproximation of the exact AIFDS solution that includes exactly those paths along which there are at most k successive dispatches to a particular procedure with a given local fact.


While we have included the number of lines of code of the benchmarks, Manticore is a whole-program compiler, including the entire basis library.

in addition to the lines of code, we have also reported the number of expressions, where an expression is an individual term from the intermediate representation shown in Figure 1.


Second, if z has type DPJPartition,then z.get(i) has type DPJArray and points into a DPJArray.

we must not treat z:[i]:* as disjoint from R. Here, we simply do not include this distinction in our type system.


The compositional or hierarchical real-time framework [8, 20] enables a group of real-time applications to be a single real-time resource requirement to the upper layer of realtime environments.

we assume that a RT-VM Vi is de.ned from multiple real-time applications, {tk (rk,wk,dk,pk, fk)|k =1,...,n}, of the service by using compositional realtime technique.


This allows cloud schedulers to randomly distribute jobs to processors with statistically more uniform global behaviour in execution time and processor utilisation.

the principles of CL at a hardware parallelism level and as taught in computer systems engineering undergraduate courses can be exploited for higher-level software coordination in grid and cloud applications through the CL dwarf, as identi.ed in the classi.cation of parallel software architectures.


Additionally, some constructs, such as condition wait, arguably do not lend themselves well to the TM paradigm [20].

lock-based multithreaded programs will continue to be popular even when TM is adopted.


However, previous audio fingerprinting works are not designed exclusively for the MP3 songs.

the prime Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page.


Furthermore, these scrips or scenarios can be tedious to create and maintain.

we propose an approach, supported by the MBPeT tool [1], where load is generated from abstract graphical models describing VU behavior.


Foracompletegraph,PoA =1,andforastar,PoA = 2.Foracompletegraph,whena> 1,bothNashequilibriaandsocialoptimaplaceonereplicaatoneserver,soPoA =1.Forstar,when1 <a < 2,theworstcaseNashequilibriumplacesreplicasatallleafnodes.However,thesocialoptimumplaces (n-1)a+1 onereplicaatthecenternode.Therefore,PoA = = a+(n-1) 2(n-1)+1 = 2.Whena> 2,theworstcaseNashequilibrium 1+(n-1) placesonereplicaataleafnodeandtheothernodesaccesstheremotereplica,andthesocialoptimumplacesonereplicaatthe a+1+2(n-2) n center.PoA = =1+ =2.

a+(n-1) a+(n-1) v Foraline,thepriceofanarchyisO( n).When1 <a < n,theworstcaseNashequilibriumplacesreplicasevery2a sothatthereisnooverlapbetweenareascoveredbytwoadjacentserversthatcachetheobject.Thesocialoptimumplacesreplicasatleast v every2a.Theplacementofreplicasforthesocialoptimumisasfollows.Supposetherearetworeplicasseparatedbydistance d.Byplacinganadditionalreplicainthemiddle,wewanttohavethereductionofdistancetobeatleasta.Thedistancereductionisd/2+2{((d/2-1)-1)+((d/2-2)-2)+... +((d/2- v d/4)-d/4)}=d2/8.dshouldbeatmost2 2a.the v distancebetweenreplicasinthesocialoptimumisatmost2a.


Thus, to guarantee parametrized opacity, we must have v = v '.

t must issue an update instruction to ax with value v. Theorem 1.


However, it is important to keep the underlining principle and philosophy of Wikis, of making it easy to edit and correct errors.

we suggest a pragmatic balance between flexible and rigid approaches with a process rather than product orientation as the underlining objective of the development.


To summarize, as we demonstrated, PPT did not only produce the exact same regression tree showing the same patterns, it also resulted in a reasonable prediction performance when we generated the OLS models from the perturbed data based on the COCOMO model.

pPT successfully met our research objective of preserving privacy while preserving the utility of the perturbed data when used for research purposes.


SOA technology can support the independent infrastructure and allow the autonomous operation of its functional components.

using SOA as a fundamental infrastructure, a virtual community is formed through rewrapping services with additional functionalities.


It is also dif.cult for users to determine suitable values for the parameters without .rst having a good understanding of the MapReduce application characteristics.

it is a challenge to systematically explore the parameter space and select a near-optimal con.guration.


An exception to this overall trend is the LBM benchmark, in which the EDP improvement for coupled execution is larger than for decoupled, due to the fact that its write accesses are coupled with computations during the execute phase.

this application does not take the complete advantage of the decoupled execution which decouples only the read accesses from computation.


The remainder [7, 14, 31] were classi.ed as a study that evaluates, reviews, or presents the state of the art about model-driven development to automatically generate software-intensive SoS.

we observed that there is still opportunities of research to be investigated, since most of the included papers report ongoing research.


Figure 5: Complete lock state transitions when lock reservation is coupled with tasuki lock that precede the release.

when we implement lock reservation on a multiprocessor system with a relaxed memory model [1], we need to issue appropriate types of memory barriers in the functions of lock acquisition and re lease.


The result of this desugaring step is a homogeneous abstract syntax tree, which contains only nodes declared in the initial SugarJ grammar (if some user-speci.c syntax was not desugared, the compiler issues an error message).

this tree represents one of the prede.ned top-level entries in SugarJ and is therefore composed only of nodes describing Java code, grammar rules or desugarings.


However, the included assets for generated product outputs still might change dueto architectural changes.

engineers need to check foreach product if its con.guration can still be created.


These are aggregated into larger messages by the runtime, but overhead is associated with each independent task that issues a remote request.

our cost function has to take into account number of messages in addition to the amount of data moved.


After several tries, we decided that it encompassed the infi'astructure relating to Universal Accessibility, that is, the legal, government, economic and social environment in which UA is embedded.

we had to define what this environment is and also the research issues related to that environment.


In general in order to get bene.t from sleeping period of the sensors, the saved energy due to sleeping for l/vmax should be greater than the energy exhausted for sensors turn-on.

we can allow the sensor network lifetime to be extended by adopting sleeping periods especially when nEon < Ps l .


The reason is that the lack of synchrony may cause P to miss input changes (of the geodesic path) and therefore to reduce the number of output changes.

the number of changes of the output of a processor P in BP is not larger than the values stated in Theorem 3.6.


By using the role diagram and the properties, we are able to express it inside our pattern de.nition.

our MDE approach delivers a complete solution, from the modeling of the pattern, to the last stage of its integration, by insuring at all stages that the pattern properties are respected.


As such, endpoint models require signi.cantly less runtime resources than their real counterparts.

it will become possible to emulate the interaction behaviour of a large number of endpoints on one to a few physical hardware nodes only, allowing testing of enterprise systems in more realistic environments than currently possible.


Usually, DFI checks can detect an error before the checks that we use during normal execution.

we can stop the replay earlier and generate less path conditions.


r ctx} while sound, is useless because the .rst assumption requires e1 and e1 ' to evaluate to syntactically the same function.

a P P V requires the functions to be already values, and checks that their bodies are related whenever the functions are applied to the same arguments.


The reason is that the composed trait may be the subject tolatertrait composition or modi.cation operations.

method speci.cations that were unsatis.able in the original composition may againbe satis.able.


Considering that multiple strategies can be used to .x these interactions, it is up to the designer to select the right one, according to his/her intention.

the way a designer resolves such an interaction is part of the domain variability: it represents a variation point at the domain level.


Federated identity management empowers the cloud tenant to authenticate themselves using their desired identity provider.

an exchange of identity attributes takes place between identity providers and service providers.


For instance, it does not matter how a particular list box may look like in a particular computing platform, for a particular UI.

the physical position (e.g., in terms of absolute coordinates) and the physical dimensions (e.g., in terms of pixels) can be left out if needed.


Therefore, it is guaranteed that a task is blocked (to acquire its mutexes) at most once (when it first tries to lock any mutex) and by at most one lower priority task.

transitive and chained blocking cannot happen.


EXPERIMENT DESCRIPTION The goal of this experiment is to assess whether the use of stereotypes improves the understanding of UML sequence diagrams.

by using the GQM template for goal definition [1], the goal of our experiment is defined as follows: Analyze the use of stereotypes for the purpose of evaluating it with respect to the comprehension of UML sequence diagrams from the point of view of the researcher, in the context of fourth year undergraduate students in Computer Science from the University of Bari .


Since AspectJ s join points are regions in time rather than events, we had to add the before and after keywords to our add and remove expressions.

compiling to a different target language with native support for events (e.g., EScala [11] or Composition Filters [2], the point-in-time join-point model [16]) would in.uence the notation of these expressions.


We prove that our algorithm .nds the optimal solution for a given network and work.ow, decreasing the energy consumed on mobile devices by 32-37% compared to an approach where the entire work.ow is executed in the infrastructure.

in typical domains like logistics and health care, one third of the energy can be saved.


They support the re-use and extension of declarative language speci.cations but lack the modular analyses in Silver and Copper that provide strong guarantees that the automatic composition of speci.cations will result in a translator that will just work.

their audience is primarily those who have some compiler implementation expertise.


The reason for this is that reclationships such as l_< i or i_</, where I denotes a legal type and i denotes an illegal type, would contradict program correctness as we go up the lattice.

a bounabd type lattice s that is serviceable even in the presence of type incorrect programs should have the general form shown in Figure 1.


In contrast, reflective APIs built around the concept of mirrors are characterized by adherence to these three principles.

mirror-based architectures have significant advantages with respect to distribution, deployment and general purpose metaprogramming.


The example above illustrates that the reachability analysis discovers that a loop does not terminate but only if the loop invariant is strong enough.

it would be bene.cial to combine the reachability analysis with techniques for loop invariant generation [10, 17, 23].


6; (atomic (seq(l2 := 7,l1 := !l2))) i (l2 := 4) Weak allows a sequence of steps where the .nal value in l1 is 4.

the two languages are not equivalent,but there are still manyprograms for which they are (i.e., anyresult possible in one language is possible in the other).


3.3 into a Java class following the semantics rules de.ned in [12].

a repository storing some policies, and the related PDP, consists of a Java archive containing all the Java classes generated from the policies.


In fact, when we reach maxLive > 2 · n of reg, we often have to increase the II.

most of the spill instructions added by MIRS are added once a .rst complete schedule of the original loop has been produced.


As Figure 14 illustrates, the problem is that interrupts are not disabled immediately after calling TOSH INTERRUPT at line 1.

a long whistle at the right frequency will cause the tone detector interrupt on the Mica Sensor Board to continually .re, preemptively invoking the handler routine multiple times in a row and causing a stack over.ow.


Through algorithms that are written by experts, composite components are automatically generated before the composition process starts.

our approach is not a substitute for existing composition algorithms but complements them with a preprocessing step.


In this case, Af.nity-Accept s goal is to preserve ef.cient local processing of connections.

af.nity-Accept must match the load offered to each core (by packets from the NIC s RX DMA rings) to the application s throughput on that core.


The pointer operations inevitably insert address calculation code in-between.

unless the compiler can eliminate the code explicitly by utilizing ARs for the address calculation, the multiply and add operations cannot be merged to a MAC instruction.


For example, most keywords, like resource, can contain any nested keyword (as shown in the contract in the lower-right of the .gure), but collection, member, and namespace can contain any keywords except collection and member (as shown in the contract in the upper-right of the .gure).

we see that RDL allows the contract structure and the implementation structure to differ if needed.


for all term t and for all variables x and p free in t, we have: p2 t p x =ß (t x)x p it seems that we should be satis.ed with the KAM description.


In other words, whereas the two-set algorithms maintain two sets X and X' corresponding to variable x, the one-set algorithm only maintains X.

during execution, we may have to rebuild X' from X, which in principle is an expensive operation.


Before the data item d is read on the client in task B,the data item d on the client must be made valid (Vci(B, d)=1).

the state of data item d on the client changes from invalid to valid, which means that a data transfer is required for d from the server to the client on edge (A, B).


To further complicate matters, browser vendors often add new features without consulting other vendors.

each browser de.nes an idiosyncratic JavaScript interpreter, HTML parser, and layout engine.


From these border colors, the teacher is kept informed of which areas of the spreadsheet are tested and to what extent.

in the figure, row 4 s Letter cell s border is partially blue (purple), because some of the dependencies ending at that cell have now been tested.


The typechecker must derive propositions from it and propagate them to the then and else branches.

it .rst computes the propositions derived for each of the three subexpressions, giving Nx |Nx for the test and Sy |Sy for the then branch.


For this implementation, the matrices are stored in the traditional column-major order, and blocks are references into these matrices.


The same holds for parts of the architecture description and its logical statement the parts that describe which layers and allowed dependency directions exist are extensional, and a minimal design model for them exists.

a joint minimal design model can be determined for a description triple as exemplary depicted in the bottom part of Figure 1.


It is enough for the weaver to ensure that aspectual computation is run at a higher level.

our AspectJ extension does not support explicit level shifting at the moment.


Information on template variation can be used to come up with such an optimal set of templates.

statistical information gathered on template reuse and variability has appeared to be very important for the evaluation of the template meta-programming approach.


If the SRT scheduler admitted a SRT task with Eavg/P = 0.1 by using condition U - u0 + Eavg/P = 0.95 < 1, the system would be overloaded with utilization U = 0.95 + 0.1 = 1.05 >1, when VS-CBS0 becomes serving later.

in this algorithm, we use a variable U* to keep track of the amount of reclaimed bandwidth, instead of directly modifying utilization U, when adjusting the speed.


First, for a technical reason in the proof of Theorem 2.3, we need fjj to be small when |j| is small.

we de.ne the following notation f. For any j, de.ne J l |j| fj = +1 .


In this case the part of the input that was most recently removed must be the failure-inducing input difference.

the above approach isolated the failure-inducing input difference for these memory related bugs.


The XSEDE systems are based on an allocation-based accounting system where a project has limited usage hours.

the course must be able to distribute a su.cient number of usage hours to each student while reserving enough to perform extensive scaling studies for all students using the autograder.


But on the other hand, we can use instances of this trait to fold over ASTs or polymorphically embed sentences, as discussed in Section 5.3.

the intended usage is that in a compiler that is modularized with object algebras, each module exports object algebras with context-sensitive operations or context decorators.


In other words, if the compaction is successful in providing suf.cient free space, the compression is not activated.

our approach is oriented towards reducing the impact of compression/decompression on performance.


by every behavioral measure, the testing strategy was strongly tied with males success, but not with females success.


First, given that the network connection between the two sites is shared by other users, the e.ective networkperformance achievableis usually much lower than within the cluster.

with mpiBLAST transferring the entire output result over this network, its performance would be heavily impacted by the network performance.


In fact, this need for evolution is common to all OSes, however, the developers of Linux have chosen to face evolution most directly while others stack layers upon layers leading to an intricate software architecture.

we believe that the use of Coccinelle is not limited to Linux, and could be envisioned in any systematic evolution process.


Our preliminary experiments with these two techniques showed that node splitting can generate better savings than node merging, mainly because the latter sometimes keeps disks in the active mode unnecessarily.

in the rest of our discussion, we focus our attention on node splitting.


While this standard behavior is suitable for most basic operations, it obviously cannot be used during transactions.

each database adapter is aware of its current transaction state and does not return connections to the queue while a transaction is in progress.


We would like to ensure that n1 s and n2 s cost will not increase due to n s leave.

at the beginning of round t+1, n1 s and n2 s outgoing balances with respect to each other are set to B1n and B2n, respectively.


"2 Guy Steele Coming back from general semiotics to programming, the important questions are the following: what would the es 1 The idea of the semiotic triangle has been developed by several philosophers at different times.

the actually used notions for three constituents of the semiotic triangle vary a lot, although the idea behind them is the same.


The test reports a p-value = 0.001, which is below the a threshold.


4.2 Maintaining Coherence on the GPU A GPU kernel cannot transfer data while executing, so inserting coherence checks into kernels would be futile we cannot update stale GPU copies mid-kernel execution.

x10CUDA+AMM must check and update all the Rails in a kernel s read set before it begins execution.


Thus, models conform to, and are considered the instances of metamodels.

metamodels are at the appropriate level for de.ning di.erence metamodels.


One then might want to rely on laziness, as we do, to avoid depending unnecessarily on the tail of the input, but then we hit the problem that the algorithm must be described imperatively.

we think that such an approach would be awkward, if at all applicable.


Software is not only produced by software companies but also within companies and organizations from traditional sectors ranging from automotive to telecommunications to banking and insurance.

the ability to Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page.


Then, we ¯¯can safely substitute every occurrence of M with e in rule (ZR2) from Figure 2.

v now generates the regular * language a¯a *.


USER STUDY II -PROFESSIONAL DEVELOPERS The other type of potential users our approach targets is professional software developers who are experienced with application development.

in addition to studying ASIDE on novice programmers, we ran a similar comparison study on a group of expert programmers.


The approach vouches for a unified environment.

the developer is able to perform all the tasks using a single integrated platform.The succeeding subsections discuss the processes and components that are envisaged as possible solutions in minimizing the challenges of engineering semantic services.


Since the MOM is considered as a black box, we cannot measure its internal time consumption.

we cannot assign the exact load to the sender, receiver, or MOM components, but have to allocate all load to the MOM component.


The distinction between code artifacts (classes and class re.nements) and features (containment hierarchies) requires a special treatment in FFJ s semantics and type system, which is different from prior work (see Section 5).

we use in the type system information about features that has been collected by the composition engine and that does not appear in the program text.


If we were to amortize the manufacturing cost of the home router on the basis of total traffic flow, we would assign almost the entire manufacturing cost of the home router to movie content alone; this seems unreasonable.

instead of attributing cost based on number of bits transmitted, we attribute costs as a percentage of time used for a given service.


The decay organizer periodically decays the profile dy- namic call graph to bias hot edge detection toward recently sampled call edges.

the decay organizer attempts to ensure that the system can adapt to program phase shifts.


SPL tools and training: There is acknowledgment across all groups that tools and training are important and have been neglected in the past.

the fact that an SPL approach depends on the consistent use of tools by trained developers should not pose an insurmountable problem.


Therefore, the number of tables created during s-topdown is no more than during v-topdown, and the number of answers stored in tables that exist in both are equal since they both should compute the same answers.


The HSBColour type can not be translated directly into an X3D type.

the developer has the possibility to adapt the code generation mechanism for every complex type individually.


The rationale of AR is to foster the transition of knowledge from a mature research .eld to practical problems encountered in the daily routine.

aR is capable of providing insights which might be overlooked in a traditional research approach.


Variant-preserving mapping changes the implementation technique of an SPL.

the primary dimension is SPL implementation technique.


Actually, concerning the assistive service, we propose sequences of activities which are related to preparation of breakfast in order to assist the patient with cognitive impairment in these ADL.

our system includes an algorithm for the activity recognition (see Algorithm 1) that allows recognizing the scenario performed according to the electrical appliances used and a prompting algorithm to evaluate the need to intervene if the patient has difficulty to complete it.


However, for the analyzed system, recall was largely preserved of the 72 clone groups to which coupled changes occurred, 68 were still detected by the tailored clone detection, indicating a recall of the tailored compared to the untailored detection of 94.4%.

changes in clone (group) count mostly denote changes in precision.


Opis [11] is recent work, which takes a functional-reactive approach for developing distributed systems in OCaml.


Furthermore, spiking neurons are computationally more powerful than traditional neurons [15].

practitioners can construct small networks of spiking neurons to accomplish the same task as a traditional network of greater size.


Although the Add Product page-design does not have any PAGE IN-PUT blocks, the Edit Product page-design includes a PAGE INPUT block that .ows the ITEMNO data into the page.

clicking the Edit button brings up the Edit Product webpage, allowing the selected product to be updated.


Our system can prove a program safe, but if the program is modi.ed by making some functions non-deterministically diverge, then, we may no longer be able to prove safety.

in future work, it would be valuable to explore other ways to reconcile laziness and re.nement typing.


On the other, their work continues to use LattE as a lattice counting tool to estimate probabilities.

it is restricted to uniform distributions or discretized distributions over .nite data domains.


The design of the evaluation is motivated by the aim to involve external simulation tools for optimization into the framework.

pEPPA supports the handling of calculation extensive .tness evaluation.


For example, most previous approaches to DSE [38,54] typically use a .xed depth-.rst, backtracking search strategy, where the next execution path would always share the longest possible pre.x with the previous execution path.

much resource may be allocated to analyze small parts of the program under test before moving on.


In contrast, the rule processAllAttributes illustrates the binding of the variable A to all of the attributes of Class C (indicated by the use of {} decoration).

a is bound to an ordered collection of Attributes and for a single Class with any number of attributes, only one Something is created.


Amongother information, that database contains a register for each commit in the CVS repository for all the projects stored in SF.net (including additional information such as the date of the commit, author, .les a.ected, etc).

we could easily measure the daily number of changes for each project using the CVSAnalY dataset.


The message payload may contain concrete data, but also expressions on symbolic data.

the predicate PC is the disjunction of predicates path C1 .· · ·.path Cn , where each path Ci is a conjunction of .


By applying the Box and Jenkins approach described in Section 2.4.1, we obtain that the spectrum of the time series of S1 contains a frequency peak at 0.2 i.e., the series has a period every 1/0.2 = 5 days and that ARIMA(2,0,1) and ARIMA(1,0,0) are good models for the time series of S1 and S2 respectively.

we could forecast the future value of X for S1 and S2, by means of these ARIMA models, and .nally, we select the service between S1 and S2 with higher probability to meet the QoS constraint.


cases would only make the ratio even smaller.

we The Google Chrome debugger shows the general class of Object for foo and the Baz.Bar class for bar in their 2 We did not perform any preprocess to exclude third-party or repeated .les in the provided source code bundles.


Although fire followed by the event name is used for Java swing components, in general we can't even count on the existence of a method that throws the event.

we employ the following strategy: we use the fire method if it exists; otherwise we patch the standardized methods for adding and removing listeners, so that we are in control of the firing of the corresponding event.


These CM changes will result in all tests that execute either f() or g() to be identi.ed as a.ected.

all possible e.ects of this change are taken into account, even without the explicit representation of .ow of control due to exceptions in our call graphs.


Furthermore, the OMG does not provide test cases that would allow checking the conformity of implementations with respect to their specifications.

developers working in companies producing COS implementations have to overcome these inaccuracies and underspecifications using their own experience.


Clearly, the expected slowdown ratio (= E[T (x)]/x) [13] is the same for jobs with different service time requirements and equals 1/(1-.).

pS can be considered to be a fair scheme.


As shown in Figures 7 and 8, C-CLR views can be toggled to hide/display code that is irrelevant to a given flag setting.

though the source specifies multiple definitions for this macro, the C-CLR view shows only the one.


Furthermore, if the collector is not running in parallel (which is usually the case), then during the time the program threads are stopped, only one of the processors is utilized.

it is advantageous to use on-the-.y collectors [17, 19, 18].


Speci.cally, the computational cost of each point can be from 100 to 100,000 core-hours, even when executed on a state-of-the-art HPC cluster.

scheduling and coordination of the execution cannot be performed manually, and a single system cannot support it.


For example, in Fig ure 5 we would loose the information about the changed interface of the alternative components C2 and C3.

we would not be able to generate all variants of the software family, because only one interface type would be known.


Our decompiler maps registers in the assembly code to global variables of type int with 32-bit values; the 16bit and 8-bit registers (which are aliases of parts of the 32-bit registers) are also mapped to the appropriate 32bit global.

the 8-bit register %al and the 16-bit register %ax, which refer to the low 8 bits and the low 16 bits of the 32-bit register %eax respectively, are both mapped to the variable eax denoting the 32-bit register %eax.