Since C(R[K -1]) = C(R[K]) = C(R[K + 1]), and the cover time is also monotonous with respect to the size of the ring, without a.ecting asymptotic bounds we can assume that K is even an N is odd, i.e., K = 2k and N = 2n-1.

by induction, we can show that the number of agents at node v will be even at all times, and the arrangement of pointers on the ring (except for node v) is symmetric with respect to the axis of symmetry passing through v. the cover time for the N-node ring with K agents is asymptotically the same as the cover time of a n-node path with k agents, starting from an initial placement of all agents on one of the end-points v of the path.


Since definitions of agility and leanness are not clearly agreed and the study is explorative in nature, we did not want to restrict the usage of agile and/or lean to specific definitions.

the survey was designed for whatever software practitioners understand to be using agile and/or lean is, starting with the questions Are you currently applying agile (lean) methods in your organizational unit?


Practitioners are well-versed in these models and so these are likely to be less error-prone compared to building a new unfamiliar type of oracle.

we seek a way to use constructive model-based oracles that can handle the non-determinism introduced during system execution on the target hardware.


In combination with certain runtime checks (e.g., for in-bounds array accesses), these type systems guarantee that at runtime, type-correct programs will respect the abstractions expressed by the language s type system.

programs that have passed the type checker have been veri.ed, albeit with respect to relatively weak speci.cations (i.e., types).


Note that the facade allows simultaneous access to both readers and writers.

components making use of this connector will have to either use a mechanism to detect writers and lock the accessed resource or extend the connector to include such a mechanism.


For this, we .rst use an underlying basic budget assignment (e.g., Budget or Budget & Seeding), and then multiple by a factor h > 1, such that the budget for S becomes zS = h× 2 1 ×zD.

if h = 2 (which is the value we use in the experiments reported in this paper), then the modi.ed simple class S will receive the same amount of time as the unchanged dif.cult class D. Given an overall maximum budget (see Section 3.1), the to tal budget should not exceed this maximum, even in the face of 1 changed classes.


However, full compaction is costly since a substantial fraction of the objects may be moved and all references need to be updated [1, 11, 12].

modern systems tend to either use compaction infrequently, or employ partial compaction, moving some objects in an attempt to reduce fragmentation and keep its cost acceptable [2, 3, 8, 9, 14, 15].


The Program Size section states benchmark sizes in terms of total lines of source code, number of source .les, and the following at the start of the SR phase: total number of basic blocks, and total number of de.ned procedures.

the Files column is indicative of the length of a compilation command-line with the -combine/-fwhole-program combination.


However, the existing pattern-based materials seem to be insufficient for implementation in the classroom, especially when teaching introductory courses that emphasize syntax and programming language features.

alternative methods using applicative models for pattern-based instruction, which emphasize problem solving and program design issues rather than specific language features and syntax, should be developed and assimilated within the CS teaching community.


Flash Lite code executes much slower and consumes more resources than other programming language for mobile devices.

software designers must consider carefully non-functional requirements when de.ning what should be implemented in Flash.


However, in our approach, this e.ort only needs to be made once and then the FQA models can be reused in the development of many systems.

the main e.ort consists of modeling the core architecture of the application.


Given unrestricted pointer operations, aliasing, and arbitrary array indexing, it is in general undecidable to infer exact dependency information for all programs.

many analyses require that programs adhere to a number of constraints, such as af.ne indices (indices computed from just scalar multiplication of indices and addition of constants).


Breaking and unresolvable changes (consistency between artifacts or variability rules are broken and cannot be recovered automatically; therefore developer intervention is necessary) Consistency between metamodels and models is broken.

corresponding models have to be migrated and transformations updated.


The sampling of instantaneous parallelism at a scheduling event between quanta may lead the task scheduler to request either too many or too few processors depending on which phase is currently active, whereas the desirable request might be something in between.

the job may systematically waste processor cycles on the one hand or take too long to complete on the other.


The reason the collector must wait for the mutator to respond is that the mutator is modifying the stack continuously, while running in managed code.

some sort of synchronization must be set up before the concurrent scan can begin.


Each aspect weaves persistent read and write methods to .gure-related classes.

1http://swerl.tudelft.nl/bin/view/AMR/AJHotDraw 2http://www.jhotdraw.org/ 3http://wwwiti.cs.uni-magdeburg.de/iti db/research/berkeley 4http://www.oracle.com/database/berkeley-db these methods have disappeared from the base because the declaration of Storable interface was moved to the aspects.


This makes the costs incurred by delaying the tasks to weigh more than the reduction achieved in job completion time.

wrangler achieves its goal of being robust to modeling errors by the novel use of a con.dence measure.


For users with disabilities and lower levels of ICT literacy the need for customization will be a significant barrier.

personalization which aims at increasing accessibility must include system-initiated adaptations and self-learning mechanisms to identify individual needs.


The || operator denotes instructions that execute in parallel.

ins1 executes in parallel with the dec instruction.


Notice that Lemma 1, Lemma 2 and Lemma 3 all hold for RV-validity.

it is left to show that once the system has stabilized, it does not change its output more than once.


An additional challenge is that multiple car brands belong to the same main company with each brand having a separate identity.

the graphical user interface (GUI) elements require resizing and recomposition which then re.ects the brand s heterogeneous characteristics.


Because Property 4.9 requires isEq to identify e2 and e2' , we know that the ~~' context G * , x = e2 is equivalent to the context G * , x = e2.

by using context conversion (Lemma 4.4), we can ~' conclude G * , x = e2 f t2 = t. To show progress, we must .rst prove a canonical forms lemma.


Rep1 c (Tree a ) where rep1 = rTree1 dict dict  Likewise, the representation of IntSet requires an instance of Sat for its kid, of type [Int ].

3In fact, the type R t is also a singleton type for any t. we could replace the class Rep with Sat (R a ).


However, pure R5RS Scheme is a poor match for the design recipes it lacks native constructs for compound data, mixed data ( sum types ), and noting violations.

we started implementing our own language level, which included the missing features and allowed us to adopt HtDP s design recipes, while staying close to standard Scheme.


A related algorithm, RightSpot uses relative rank ordering based on signal strength as its comparison function [11].

adding a fingerprinting tracker to Place Lab is a good test of its adaptability.


If the meta-metamodel supports a role concept, then a relationship references an object indirectly over a role.

some features of a relationship type are transferred to role type.


However, if the empty slacks are located as shown in Figure 2(Lower), all the three jobs can be scheduled without any deadline miss because J2 can be scheduled in interval [2,3].

we need to identify suitable locations for empty slacks to improve utilization.


The weights .i are recommended to be chosen according to some preferences associated to the objectives [27]; .i selection is a trial-and-error process.

in general, the problem is solved several times with different .


The generated implementation is then embedded in the existing Autosar models.

at run-time, the vehicle s system is able to evaluate the global consumption of a trip and to propose the user a speci.c driving strategy.


We exploit the fact the current interval.

they can immediately transmit that in a Gaussian distribution 68.27% of all measurements a newly placed bid without any rate restrictions.


When a trace is unstable, its con.dence counter is rarely saturated.

removable instructions before and after the dif.cult branch are not removed in practice.


This code must be run before the maintenance code that handles element addition.

either new at/if/de/do clauses are created, or existing ones are modi.ed so that the new maintenance code is prepended to the appropriate do clauses.


These options are all probable, depending on the user s intent.

it is crucial for the user to give appropriate guiding information to get the desired segmentation result.


Also, the basic blocks constituting the program are not reordered during deobfuscation because the deobfuscation transformation does not construct the whole-program control .ow graph.

the numbers we present in Section 4.4 are upper bounds that can still be lowered if one is only interested in building CFGs suited for program understanding, but not in generating working binaries out of them.


The quality of recommendations is depending on the quality of user s implicit and explicit preferences [10].

the quality of the result will be reduced based on the incorrectness or inaccuracy of users preferences.


Indeed, we would like to develop a strategy for generating specialised code that makes use of this property at any state of the automaton for which it is guaranteed.

we wouldn t sacri.ce the generality of patterns by disallowing those that do not bind all variables upfront, but at the same time would get the performance bene.ts whenever possible.


Branch misprediction The Electron compiler does not pro- vide us with detaili~d branch behavior profile information.

oSE-Electron has to approximate branch mispre- diction ratios by using edge profiles.


In contrast, we aim at supporting a mobile device that is owned and actively used by a single user, and occasionally lent to other users.

there is no need to create a system profile for each possible user.


The dedicated focus of activity diagram-based JPDDs on the dependencies between activities and data such as the engagement of the same object in diverse operations, for example makes them an appropriate means to represent join point selections which are based on data flow.

they can help developers to comprehend the selection objectives of such join point selections even if these objectives are disseminated across multiple code abstractions (as it has been the case in this example).


Moreover, it is known that the Axiom of Unique Choice is consistent with Nominal Logic, while it is not with CIC/ToC.

some functions allowed in Nominal Logic, are not available as functions in CIC/ToC but still are available as relations.


When a worker runs out of work, however, it becomes a thief and steals the top (oldest) frame from another victim worker s stack.

the stack is in fact a double-ended queue, or deque,with the worker operating on the bottom and thieves stealing fromthe top.


These assertions are checked during subsequent agitations to detect regressions from the desired behavior.

software agitation does not entail test generation.


FFT, LU, and PBZIP2 each have 8 non-trivial command-line con.guration options.

we write 8 test inputs for each of them, with each input specifying a unique command-line option not speci.ed by any other inputs.


However, a very important requirement of such federations is the capability of the adopted publish/subscribe service to tolerate faults occurring in the network and/or computing nodes composing the federation, without negatively a.ecting the provided event noti.cation.

it is crucial that publish/subscribe services are equipped with proper methods to support reliable event noti.cation.


Flexotasks employ both development-time checking and enforcement atprogram initialization time.

dynamic checks are limited to a small number of less frequently executed operations (e.g.JNI callbacks) that are impossible to check statically.


An object in node xof such a tree can reference an object in node yonly if yis an ancestor of x.

the curved arrows in Figure 3 show some (not all) legal references, while the zig-zag arrows represent some (not all) illegal references.


P s contract is that it will invoke the continuation supplied by the caller, passing it the return value that p computed.

instead of writing (*(+ w x) (-yz)) which would require the + and -procedures to return values to their calling context, we write (+w x(.


The Principle of Uniformity states (1) that all artifacts code and non-code can be given a class structure and (2) that this structure can be refined.

the refinement of code artifacts is essentially no different than the refinement of non-code artifacts; although obviously differing in implementation details, the ideas are fundamentally the same.


Moreover, the amount of data can be more than a mobile user can collect while moving through the sensor network.

data collection techniques should take into account user mobility, speed and the channel bandwidth between user and sensor network.


We currently choose a closeness centrality node for the broker node as closeness centrality implies the best visibility in the community.

once this node gets the message, delivery to any member of the community has high reliability.


Ga but (x, a) / .Ga.However, ß is transitive.

the graph shown in Figure 3(a) is a comparability graph.


Finally, mainstream UML CASE tools do not yet support this relatively novel concept.

we discourage the use of model transformations to structure models.


Note, however, that this code is expected to have good data locality (cache behavior) as successive loop iterations reuse the data in the same cache line (except, of course, at the cache line boundaries).

as it is, the code shown above is preferable from a data locality viewpoint (assuming no con.ict misses occur between the two references shown) but not from an AGU utilization viewpoint, illustrating the potential con.icts between the two goals.


Finally, the popular DOM [8] and XML document tree models [17, 37] can be nicely encoded via this attributed, directed graphbased representation model since their trees form a sub-class of this type of graph.

many types of implementation artifacts in a Web application such as HTML, XML, and other markup documents can be represented using our graph-based model.


The vendor frequently provides updates including major system changes.

the costs of creating and maintaining a reuse infrastructure could easily exceed the benefits.


Mobile peers advertise their data and possibly upload a part of their data to search peers.

searching data only occurs on search peers, while retrieving data occurs on both search peers or mobile peers.


This implies that now there is a second atomic block (controllerInst2.ctlAB) whose execution must not interfere with the execution of controllerInst.ctlAB.

it also must be implemented through the same auxiliary instance (auxInst) and with mutual exclusion on the AB1() operation.


However, our proposal deals with a particular class of equality constraints, called answers, that could be more e.ciently solved than general equality constraints.

our constraint solving metho d is di.erent from general decision metho ds (cf.


10 Now, since I(OPT)is the set of all nodes in the network, the total charge T accumulated by I(OPT) is the size of the correlation dominating set M re turned by the .rst phase of the algorithm.


With atelierB, we proved that queries from user generate events and actions whose security levels are higher than or equal to L and that the associated condition security levels are lower than or equal to L. These formal proofs assure that the formal properties we presented in section 3.4 are indeed satis.ed by our implementation.

finally, we proved using inference systems that the database equivalence invariant and the aforementioned proofs are su.cient to ensure that our model satis.es the con.dentiality property for two equivalent traces w.r.t to requests at level L. we assure that .a, a ' ,s0 ~L s ' 0 .


Moreover,OperationRecorderalwaysgeneratesabackup .lewhosesize is equal to that of the original source .le.

the total size of data stored in the experiment is 504,714 (13,239 + 13,239 + 478,236) bytes.


However, recent surveys showed that an ESB is often the first software purchased for a service-oriented architecture.

commercial ESBs were also included into our comparison.


Therefore, Transformation Templates should be able to be used with different existing approaches for UI modeling, such as [1, 12, 15].

we need to specify how to relate Transformation Templates with different UI modeling approaches.


One further argument for using Java and Groovy was that the subjects we expected to participate already had some programming skills in Java.

it was not necessary to perform any exhaustive training for the subjects.


However, eachprogramhasdi.erent characteristics (or scalability)and contends for shared resources, which are the CPU cores and memory hierarchies, with each other.

it is clear that OS thread scheduling will play a major roleinachievinghigh systemperformanceundersuch conditions.


Like some other middlewares [12] it does not need to send an advertise message before it start publishing.

rEM not only decreases the boot up time to start publication but also reduces the network traffic.


However, the working form of the project was also meant to be a demonstration of how all projects in the development programme were to work when developing production code.

the experiences from the development effort were in themselves interesting in addition to the resulting proof-of-concept.


Third, from the empirical perspective, research on distributed collaborative IT work between China and other countries is limited.

a qualitative case study was conducted to explore how globally distributed information systems development work is affected by cross-cultural factors in the case of Chinese practitioners in the field.


c assigns circle c to shape s and initializes c to a new public class BddStack { private final int MAX; private Object[] contents; private int top; public Stack(int n) { MAX := n; contents := new Object[MAX]; } public void push(Object x) { assert depth() < MAX; contents[top] :=: x; top++; } public void pop(Object x) { assert depth() > 0; top--; x :=: contents[top]; }  public int depth() { result := top; } } circle object.

the approach does not introduce aliasing, but it does require the creation of a new object, and because Tako s underlying implementation guarantees unique references it ultimately requires memory from an old object to be reclaimed.initializing transfer is less efficient than swapping.


Groups are structured hierarchically as a tree with a main root and unlimited levels of subgroups.

chosen a group as the serialization root, a migrate() method recursively serializes its sub-tree of groups and every thread within each group.


Hence, the amortized overhead is at most SL2 (N) = 6N·T (6N) 4N·T (4N) N + N = 6 · T (6N) + 4 · T (4N) block scannings per query.

amortized shuf.ing overhead S(N) is: ( ) L1L.2-1 .


In addition, there is no connection between generated forms in InfoPath or Crystal Reports and the application that generated said data.

given a data artifact visible in those tools, one cannot navigate back to its source.


Pursuing this approach means to have a tool environment which is capable of creating and maintaining arbitrary models that even more important use different meta models as their basis.

the separation between linguistic and ontological aspects allows us to implement a modeling environment that supports these advanced modeling paradigms (modeling patterns) and at the same time can be used for creating any kind of domain-specific model.


However, native untransformed applications do not provide any security of input data.

we compare performance of AU TO CRY P T-ed programs to already known techniques of download-and-compute and fully homomorphic encryption scheme.


The information required to generate the PGT can be extracted from di.erent sources; therefore, the Product Genealogy approach does not go into details on where to .nd the respective information.

this approach is independent of any technology -or SPL -speci.c artifacts.


Therefore, all activities with the same name at different levels of a process inheritance hierarchy represent the same activity.

an instance of PPaperReview can have at most two activities, not four.


The value proposition should be reflected in every aspect of the company.

in a way it is related to FIND YOUR VALUES pattern.


The tool keeps information of the modernisation project, that is, the object model, configuration of the generated services, services deployed and services available.

we only need to load the project of the current case study to deploy new Web Services to fulfil new information requirements.


Now, there are two possibilities to verify this communication: a) Verify both roles for correct re.nement of the abstract role b) Re-verify all properties for the re.ned protocol If a role is a correct re.nement of the abstract role (case a), a communication partner cannot distinguish it from the abstract role.

all properties being veri.ed for the parameterized coordination pattern will hold for the re.ned one as well.


These blocks (and patterns) are varied with respect to data types and scaling information and are executed on different target processors.

it is quite common to have a few hundred thousand test cases.


A substantial fraction (44%) of drivers have behavior outside the class de.nition, and 15% perform signi.cant computations over data.

relying on a generic frontend network driver, as in Xen virtualization, conceals the unique features of different devices.


Similarly, use of different design strategies demands different code generators.

domain of model-based code generators can be described as a feature diagram [9] where intermediate nodes denote the variation points along D, A and T dimensions; the leaf nodes denote choices available for each variation point i.e.


While instrumentations of the read, write, and new operations impose a constant run-time overhead, each contract installation involves a heap traversal to assign access permissions to locations.

we expect calls of contract-annotated methods to be expensive if they impose access permissions on large data structures.


Notice that in the predicate-aware machine, the 1-bit wide PRF can be simultaneously accessed in two pipeline stages: predicate read / dispatch and execute.

twice as many PRF read ports are required.


All of these optimization approaches are targeted to environments di.erent from sensor networks.

they do not speci.cally address the properties of this domain (e.g., access characteristics of .ashmemory, energy considerations, etc.).


They may even produce various artifacts (e.g., use cases, UML sequence diagrams) to specify the scenarios.

forming and verifying hypotheses based on scenarios would allow software developers to e.ectively use their knowledge of the expected software behaviors to guide the debugging process.


In the case of SODA, we decided to group into the same Discipline the activities belonging to the same phase of the SODA development process, which led us to de.ne two disciplines Discipline Analysis and Discipline Design.

each Discipline contains and  Figure 2: Use-case diagram of the SODA process: relationships between phases (left) and workde.nitions expressing sub-phases (right).


Figure 2(d) shows the result of applying copy propagation (after every phase) to the code in Figure 2(c).

we can see that applying copy propagation transmits and replaces r[7] by r[18] on line 6 of Figure 2(d) and eliminates the dead copy instruction on line 2.


QVT Version 1.0 was published in 2008) [3].

a basis of formalised knowledge and experience with model transformation development is not yet available at a broad basis.


For the Cobol system, rating was limited to a random sample of 68 out of the 151 inconsistent clone groups, since the age of the system and the fact that the original developers were not available for rating increased rating effort.

for the Cobol case, the results for RQ 2 and RQ 3 were computed based on this sample.


This is a consequence of the linearity of quantum mechanics.

multiple uses of a variable representing a quantum value must be forbidden under certain circumstances.


By parameterizing class and method declarations with ownership tags, this type system permits owner polymorphism.


for example SPARQL as defacto standard [11]).

semantic spaces bring more Web-style communication patterns to service computing, as alternative to the traditional message-driven approaches of XML-based Web services.


If a change to the configuration is made while one or more service calls on the CF are executing, then the results of these invocations could be compromised or lost.

each CF provides a readers/writers lock for access to the local CF graph.


The overall impact is an increase in the project risks.

the practice of project management faces multiple challenges too.


It is tedious because there are so many attributes to which physical domains must be assigned, and it is error-prone because the many replace operations which move data to the assigned physical domains must be inserted by hand, with no automatic veri.cation of their correctness.

we would like Jedd to relieve the user from having to perform the full assignment by automatically generating a reasonable assignment from a minimum amount of user input.


Other platforms like FRASCATI [6] or the one pointed out in [7] cover the same functionalities but are not QoS oriented.

merging these factors, it would be of interest a QoS enabled application management platform for component based distributed real-time applications, built over a standardized distribution middleware.


Furthermore, we claim that meaningful and misinterpretation-free integration can only be achieved with using formal semantic models of the exchanged data, instead of naming conventions and data schemas.

we use RDF, grounded in ontologies, for event and data exchange.


During the re-inspection where the students used the EAP, there was not a group of subjects doing a reinspection using their standard technique to compare against.

it is possible that a portion of the observed effect may have been caused by the fact that the students were inspecting the artifact for a second time.


A throughput increase due to a lower TLB miss rate as observed for OLTP transactions can not be observed for queries because the access pattern of OLAP queries is sequential, making prefetching possible.

the TLB miss rate in OLAP queries can be assumed to be low and thus no signi.cant performance increase can be expected from reducing TLB misses.


This benchmark suite focuses on applications that utilize little synchronization between threads, and it does not provide various sizes of critical sections or di.erent con.ict rates.

this benchmark suite is not fully capable of evaluating the underlying TM system and discovering interesting transactional behaviors.


This is because the calculated .le position does not exist until all previous output operations have completed.

to break these dependences, we propose a different approach.


It is also referred to as one of the inverse problems of simulation, coarsely speaking: Instead of forward computing starting from given input Ifix and parameter Pfix and producing output behavior Osim, calibration starts with given input Ifix and output values Ofix, searching for the appropriate parameter values Popt so that the output produced Osim when using the latter input and parameter set resembles in su.cient detail the given output: Osim ~ Ofix.

calibration is basically an optimization problem.


Such objects are colocated by the garbage collector.

it is necessary to wait for a full garbage collection that collects both generations.


It is worth mentioning that although this version will yield the same level of performance, it will be smaller in size, as even a null specialization context implicitly implies the exclusion of code features that are not used by the requested functionality.

the resulting code can be seen as the result of a simple dependency analysis where only code that the customized functionality strictly depends upon is returned.


The commit RPC provides a safety guarantee, namely that no .le modi.cations will be lost due to a server crash after the .le has been closed.

a Linux application that modi.es a .le in NFS incurs a performance penalty on close of at least two network round-trips and one synchronous disk access.


If a variable is rejected with duration permanent , it should not be included in any .xes during the con.guration process.


Also, I3 is the weakest precondition which guarantees that I1 holds after executing the controller command associated with the pktIn(s, src !dst, prt(2)) event.

veriCon can infer the inductive invariant from the I1 speci.cation.


Speci.cally, we can prove that, for any program P containing exclusively statements whose corresponding constraints are in a given decidable theory T (i.e., for which the .ag complete always remains 1), the SMART search algorithm provides exactly the same program path coverage as the DART search algorithm.

for those programs P , every feasible path that is exercised by DART is also explored , albeit compositionally, by SMART;and conversely, every compositional execution considered by SMART is guaranteed to correspond to a concrete full execution path.


This leads to the programmer s view that the execution of micro step actions does not take time at all while every macro step of a synchronous program requires the same amount of logical time.

the starting point of our analysis is a system described by a set of synchronous guarded actions of the form (..A)de.ned over a set of variables V. The Boolean condition .is called the guard and Ais called the action.


The rates from cross-layer allocation, in contrast, is media-aware, and favors the faster link supporting the more complex Harbor sequence.

the video quality gap between the two sequences remains around 8 dB for TFRC, yet is less than 4 dB for cross-layer allocation.


* classes are responsible for handling the camera and sensors of an Android smartphone.

they and the classes using them will be automatically anchored by DPartner.


Our performance experiments (Section 7.2) suggest that, on SSE hardware, specializing beyond vectors of length 4 does not provide much performance improvement.

based on both vector length stability and observed performance improvements we only specialize vectors with 1 .


Note that our library is constantly being updated and performance is often enhanced quickly.

this benchmark may be out of date by the time this paper appears in print.


However, we are interested in evaluating performance relative to the total number of unique bugs from all K con.gurations, which may be much greater than the number from one .xed con.guration.

the low-regret guarantee of many MAB algorithms is in fact measuring against a target that is likely to be much lower than what we desire.


Detecting composite operations such as refactorings needs a binding to the language-speci.c modeling concepts.

the generic framework has to be extended for each language with speci.c detection rules.


Selectivity is computed as:  observed selectivity = n , m · n where nobserved is the total number of links observed by the analyst, and m and n are the number of high-level and low-level elements, respectively.

selectivity measures the percentage of all possible links that the analyst has examined.


Often, the on-disk hardware queue does not support request priorities.

many drives may internally reorder pending foreground and idletime operations to lower the combined service time.


3.4 Portfolio benefits vs. uncertainty levels Managing projects as a portfolio offers more flexibility to handle uncertainty and risks than managing each project individually.

portfolio management should be especially beneficial when uncertainties are high.


An additional bene.t of deduplicating at this granularity is that most operating systems use Direct Memory Access (DMA) for I/O, which means the disk is accessed with memory page size granularity.

the 4 KB chunk size is likely to work well for both memory and disk deduplication.


In this paper we identify sources of redundancy that contribute to possible bad performance during test-case creation and execution, and describe an approach based on temporal logic formula rewriting that can be used to reduce the number of modelchecker queries signi.cantly.

the overall time it takes to create a complete test-suite is reduced.


Checking these invariants is easy; hence, we can focus on the validation of function graphs.

the validation algorithm is of the following shape: validate(f, f ' ,.


For example, the Java language specification defines the maximum array size as 0x7fffffff.

we can eliminate a sign extension for the effective address computation of an array access whose subscript expression is i+j, if both i and j have been signextended and if -1 ï i or j ï 0x7fffffff holds.


The insight is that server programs tend to return to the same quiescent states.

instead of processing requests as they arrive, PEREGRINE breaks a continuous request stream down into windows of requests.


For the refactoring case, this is prevented by a constraint rule saying that accessibility of an overloading method that is more specific (in terms of its formal parameter types; here: A.m(String)) than the one a method call currently binds to (here: A.m(Object)) must remain on a level that leaves it inaccessible for the location of the method call: (A.m(String)) < a(A(B.n()), A(A.m(Object))) Again, negating this constraint means demanding a change of accessibility and therefore leads to a change of binding, potentially changing the meaning of the program.

by replacing the original constraint rule with its negation, a constraint solver can generate relevant mutants directly.


The pattern can be as elaborate as any SPL formula.

code generation strategies can be defined for all for- mule patterns regardless of their complexity.


More complicated applications such asOTAand acoustic monitoring may exhaust the .ash after about one and a half hours.

bugs in these applications must be detected within one and a half hours in order to debug them before the log entries are overwritten.


Condition 4.5 ensures that if another task tj « ti executes a method m concurrently, then m commutes with all the operations of ti.

there is necessarily an equivalent serial history in which ti happens before tj.


Because tl is i=1 generally very small, the amount of data that can be consumed by the receiver during time period t is determined by br × (t - tl).

the receiver bu.er is saturated if LM (bwi - br)ti + br × tl >B.


When the risk level increases, anonymity should also be considered.

a con.guration is selected where the anonymity manager is available.


Table entry creation can be done in O(k) time.


To do this, we have chosen GMF (Graphical Modeling Framework) [15] because it provides a generative component and runtime infrastructure for developing graphical editors.

we have created a GMF project where the metamodel in Figure 3 is employed as a domain model (ecore model).


Just as REST requires transparent state exchange, our new style, Computational REST (CREST), further requires the transparent exchange of computation.

in the CREST architectural style, the client is no longer merely a presentation agent for content it is now an execution environment explicitly supporting computation.


While this has an impact on the actual reuse opportunities, it is usually driven from marketing aspects.

it is more appropriate as a topic of marketing science than as a software engineering topic.


That is, all occurrences of free variables in a are resolved using form b.

the context [b] expresses the requirements posed by the free variables of a on its environment [13].


It is most important to accelerate the code running in the default con.guration, which corresponds to all be.

we can include all le in mixed and have only two states of interest.


The state variables carried by any state are unique to that state.

they do not convey any new, distinguishing information about that state.


While social ranking does not provide physical evaluation, it reflects the consumer sentiment.

social ranking may represent extensive experience or practice.


People are its core asset, and the management board believes in the sentence that Knowledge is Power .

it encourages all initiatives related to KM and HRM in the organisation.


However, no state-of-the-art tool including Pex can deal with all complicated situationsin real-world codebases automaticallywithouthumanintervention orguidance.For example, sometimes atool couldfailtogeneratetestinputsfor covering a branch for one or more reasons.

understanding these reasonsbythedevelopersis requiredbeforethedevelopers couldprovideguidancetothetool such as carryingout environmentisolation,instrumenting someframework orlibrarycode that the code undertestinvokes, and writingfactory methods that encode method sequences for generating desirableobjects.While weareactively researchinghowto automatically provide better explanations when encounteringproblems[25], exposing someinternal technicaldetails ofthetooltodevelopers wouldbe still needed(atleastin the nearfuture) to allowdevelopersand atool to cooperate for effectivelycarrying out testing tasks.training developers withsuch skills remainsimportantfuture work.


A consequence of this is that it is impossible to directly implement 64-bit integers in JavaScript, as integer values larger than 32 bits will become doubles, with only 53 bits for the signi.cand.

when Emscripten uses normal JavaScript addition and so forth for 64-bit integers, it runs the risk of rounding effects.


the stub library to the programs address space.

loading or unloading our virtual machine can be easily achieved by just executing the procedures of the stub library in the debuggee s address space.


While the original grid layout maps a graph onto a 2-D plane, our target space is 3-D scheduling space which can have an in.nite search space with varying schedule times.

we limit the search space by placing operations only in slots that minimize routing cost, called primary slots.


[9] In the programming model, we de.ne an entity as a speci.cation that describes which context information and actions are expected from an object (e.g., an area, lights, web service or a person) in an environment.

the set of all entities that are de.ned in a contextaware application provide the full description of requirements for an environment.


the micro-work.ow execution component is practical for developers regardless of what object-oriented language they use.


Doing this step up in the abstraction layers, we also can achieve platform independence as the API of the run-time framework employs platform independent high-level concepts.

we do not have to adjust the replay to a speci.c platform.


For example, interactions between services may be added or removed due to the addition of functionalities to the system at hand or loss of a service [18].

in the context of dynamic IoT environments where a huge number of volatile services are available, adaptability becomes a key feature of services as it provides a way for an application to continuously change itself in order to satisfy new contextual requirements.


The same reasoning is applied to the edges of the DAG, separating them in another set.

for example, all edges linking tasks from the .rst level to the second level have relative cost of 1, thus they would be in the set .rst set E1 of the partially ordered set E. in RCTE, the scheduler receives as input a set of tasks sortedbytheir weights, where a task withlarger weight means only that it takes longer to run than tasks with smaller weights if they are placed in the same processor.


Friends can destroy the information hiding mechanism defined by a private modifier.

students are taught to use friends when thought is very clear and they can control everything relevant.


Although there are opportunities for individual software engineers and managers to adopt EBSE principles, the decision to adopt a technology is often an organisational issue that is influenced by factors such as the organizational culture, the experience and skill of the individual software developers, the requirements of clients, project constraints, and the extent of training required.

to use EBSE in practice may be more demanding than EBM because the decision-making structure and adoption process is often more complex.


Note too that we have made some important restrictions on the kind of program to be optimized.

considerable experience will be required to determine the best combination of optimizations for practical application of the tools for parallel program optimization that this and other theoretical research provide.


Besides, it should be noted that all the elements of our system work on the same network (activity recognition module, assistance module, power analyser, etc.).

when the assistive service determines that it is essential to guide the patient through prompts, the algorithm, which is programmed in C#, evaluates the appropriate prompt to send and finds the pathway to route the hint which must be executed by designated multimedia.


It is possible that this de-pendency becomes the assistance for deciding to learning order.

the extracted dependencies method using sequential patterning was able to extract more dependencies than the conven-tional method, indicating that the proposed method is useful.


When webuild thisexpression,a possible result mightbe SendEnv LANG LC_ALL ... ForwardX11 yes XAuthLocation /nix/store/j1gcgw...-xauth-1.0.2/bin/xauth It is worth noting that due to laziness, xauth will be built if and only if con.g.services.sshd.forwardX11 is true.

the laziness of the Nix expression language directly translates to laziness inbuilding packages.


User studies and industry surveys show that users are likely to be frustrated beyond this two second threshold [28].

it is critical to systematically understand what are the key factors affecting page load times.


Among the 70 found descriptions, seven cannot be expressed in our language SmartScript.

we remark that SmartScript was able to express 90% of the kind of real-life examples that it was designed for.


Data collection and management In order to reason about the behavior of a system, some mechanism must exist to observe the behavior of the system and either collect those observations for later processing or reason about them in real time.

dynamic analysis begins and depends on instru- mentation and data collection techniques.


The AMPED model needs 8 times more cache overhead than the PIPELINED model for 16 processors.

the available data cache in the AMPED and SPED models decreases as the number of PEs increases.


However, the GCHandle.Alloc method accepts an object as its .rst parameter, implicitly boxing the primitive type before pinning and transmitting it.We have introduced several new branches into the implementation of Send, but these branches rely on values known when the type parameter Tis known.

when the CLI runtime creates a specialized implementation of Send for a particular primitive type, the exact MPI datatype will be known immediately.


Moreover, prvObj.data[i] is dead at the end of the outer loop s body under all normal terminations.


0 = y  d) describing the effect of the procedure split called by quicksort does not need the use of the pattern 0 = y1 = y2 < len(res) that is used for the generation of the sortedness property.

during the analysis, at procedure calls and returns, we need to switch from an abstract domain of formulas parametrized by some set of patterns, say P, to an abstract domain parametrized by another set of patterns P1 or P2 as shown in Figure 3(AU(P) denotes the domain of .rst-order formulas parametrized by the set of patterns P).


Since inheritance and polymorphism was used extensively, we preferred to overload new() and delete() at the base class level.

we also wanted to minimize the amount of code that had to be changed, since we had so many classes to change we defined new and delete in a template class, and used the Curiously Recurring Template Pattern [2][5] to create a custom base class from which the class would inherit the new() and delete() functions.


For instance, with the Mobile Work.ow Form Editor (MWFE) that is available with the SUP one can design DADs, yet without variability relations4 .

an SPL integrated into the MEAP s environment should enable variability management in work.ows, and for further hybrid MBAs considerable features.


The rules embody certain strategies for resolving inconsistencies, other or more strategies can typically be devised.

there is no formal veri.cation of the completeness and soundness of the rules foreseen.


Figure 7 shows some examples of the idioms for "fopen".

in the later version, i is seen that the idioms in the previous version appear as the substructure of the new idioms_ by replacing the idioms with the functions in the evolved library, the idioms in the later version should have been smaller in size or it could have been possible to capture more abstract idioms.


However, it is known that the bit error rate of flash memory is proportional to the number of P/E cycles [2].

we adjust the size of striping group considering the age of each flash block.


7.4 External Clock Synchronization There is a lot of work on external clock synchronization algorithms [18, 19, 21], where a source of real time is available and the objective is to synchronize all clocks to this source.

there is a single node v0 for which logical clock time, hardware clock time, and real time are identical.


As far as we know, this is the .rst attempt to apply survival analysis to study open collaborative projects like FLOSS development projects and Wikipedia.

our aim is to contribute to these previous research providing a novel approach suitable for obtaining complementing information that will give us additional insights about the social dynamics of open collaborative projects.


More interestingly, this policy contains all of the declassi.ers which Alice will allow to operate on her data.

we see that Alice s data can .ow to a public output, but only if it is .rst encrypted with AES.


fun f1 ... and f2 ... fun g, if checking g fails, it cannot be blamed on a choice made while checking f1 and f2.

while property types can make checking a particular block very slow, adding a second block of the same complexity will only double typechecking time.


One symptom of this is that type error messages do not necessarily point to the source of the problem (in the metaprogram) but instead point to the generated code.

programmers spend time tracking down the source of type errors.


Suppose a task T A needs to be partitioned into N number of subtasks.


copy objects close together if they were already close together before the garbage collection, and vice versa [29].

they preserve the locality of the allocator.


In addition, theplatform-supplied storage layer and the relational database as a service are mainly designed for multi-tenancy environment and they are more centric to the perspective of the cloud provider.

theydo not provide support for any.exible mechanisms for scaling a single-tenant system (consumer perspective).


Cloud Twin differs by using an intermediate form that abstracts away the logic of either language.

cloud Twin differs by lending itself to being easily extended to other platforms and languages.


in the median Mk values is greater than 20% for all the CR estimators for inspection team size of 1 upto 9 inspectors.

the CR estimators are not recommended for estimating the cost-effectiveness of the inspections with less than ten inspectors; b) The CR estimators belonging to Mh and Mth models improve faster.


Consider an arbitrary target method whose signature is decomposed as follows:  ( p1,  p2, , pn) A method with the signature: public boolean pre( p1,  p2,  pn) is considered its precondition method.

the following method: boolean preGetBMI() {return height >= 0 && weight >= 0} is the precondition method of the target method: public double getBMI() { assert preGetBMI(); return weight / (height*height); } If a target method is a getter for some property P, then ObjectEditor does not display P until its precondition method returns false.


algorithms, speci.cations(RV3).Notethat,eachgroupinoCERTcontainsonlyone report, however, each report in oCERTgenerally describes several vulnerabilities, and manyof them are recurring.

the number in columnRVis larger than thatin column Group.


However this tool has a limited scope, being dedicated to Web only.

the flexibility it supports is not generalized to all existing systems.


The static type of o can thus be any subtype of OutputStream.

when a value is used as a target of a method call m, we regard the value is used as a value of the most general type that declares m, rather than the target type in the signature of m. This will give our weaver a chance to accept more advice.


A recent work of interest strives to minimize the overhead of these inspectors by giving users a means of naming, specifying, and capturing communication schedules [4].

users may assert that a communication schedule is identical between multiple invocations of a loop or from one loop to another.


Moreover, the address of an array element also depends on a subscript variable that is computed at execution time.

analysis for array variables, e.g., liveness, is harder than analysis for simple variables.


Obviously, the downside of this approach is that it limits the degree of prefetching to explore the computation and I/O concurrency because not all writes need to be immediately visible to the process.

it is possible to speculatively perform prefetching for the future reads if they are not con.icting with prior writes.


As we mentioned before, the subset of CRUD operations Modif offers does not involve creation for now.

as far as deletion is not needed, a Modif speci.cation can be easily inverted without loss.


Thus, reports on experiments that follow the information needs model are more effective with respect to supporting software managers in judging a technology s appropriateness and impact than those not following it.

software managers consider the technology as a candidate in the decision-making process.


The description about this processing is out of the scope of this paper.

the algorithm assumes that the request message in req_msg is analyzed.


The second difference is that S, which corresponds to the representations of the type parameters, re.ects the fact that we are providing explicit representations.

s corresponds in this instance to explicit arguments of the function, while with the implicit representation it corresponds to (implicitly passed) type class constraints.


A log entry for a received message must include a matching authenticator; therefore, a node cannot invent log entries for messages it never received.

when i is about to send m to j, it creates a log entry (sk,SEND,{j,m}), attaches hk-1, sk and si(sk||hk)to m, and sends the result to j.recipient j has enough information to calculate hk and to extract aik.


Effect of Priority-Based Compiler Queue The existing HotSpot VM employs a FIFO compiler queue as the communication interface between the application and compiler threads.

methods sent for compilation by the application thread are placed in the compiler queue (and serviced by the compiler thread) in their order of arrival.


Currently, Maxine does not support on-stack replacement (OSR) which allows the VM to replace the stack frame with that of an optimized version.

maxine never gets a chance to recompile the switch-based interpreter for fannkuchredux.


For every other nonterminal N, the concrete syntax of the corresponding model element enclosed in brackets is used for addressing it.

for N, we introduce a new nonterminal .NM EI and add a production of the form: .NM EI implements ModelElementIdentifier = [ N ] Scope Identi.er.


The Hindsight Lemma assumes that the algorithm maintains certain simple invariants which are resilient to interference, and which can themselves be veri.ed using purely thread-local proofs.

the lemma allows us to unlock a perhaps-surprising intuition: a high degree of interference makes non-trivial highlyconcurrent algorithms in some cases much easier to verify than less concurrent ones.


In this tree, each node corresponds to a virtual block to maintain the mapping information of the virtual pages of this virtual block when the up-to-date data of these virtual pages are stored in the out-place area.

as shown in Figure 3, each node has six .elds: The vba .eld is the address of its corresponding virtual block and serves as its key for key searching, and the left and right .elds denote its left child and right child nodes respectively; the pba1 and pba2 .elds point to its corresponding two physical blocks, and the tbl .eld points its corresponding run-length table that maintains the mapping information of its corresponding virtual block.


At the end of every sampling period, function clear is called (line 11 in Figure 7) to increment the generation counter.

a hash table entry is stale if its generation count is smaller than the current generation counter.


The probability of each of these values of X occurring is 1/mk .

the n expected value of X, when k is .xed, is: X H(x)= - p(xi) log2 p(xi ), i=1 where xi =1, ..n are all the possible values contained in the stream and p(xi) is the probability of their occurrence.


[13] propose an approach for managing the di.erent assets present in product lines through applying software con.guration management.

the authors evaluate existing techniques from con.guration management, illustrate problems encountered in doing so, as well as propose extended concepts for dealing with con.guration management in product lines.


Operator parallelism is exposed to high-level synthesis through the unrolling of one or more loops in the nest; any independent operations will be performed in parallel if high-level synthesis deems this bene.cial.

we have de.ned a set of transformations, widely used in conventional computing, that permit us to adjust parallelism and data reuse in FPGA-based systems through a collaboration between parallelizing compiler technology and high-level synthesis.


Total II sizes for varied cluster number for N=2000 (Partial range 0<M<60) According to figure 3, for number of levels and layers H>2, there is no significant reduction in the II size since H increases.

we only compare the total II size with optimal routing table (OPT) [5] size in figure 4 when H=2.


Lines 24-33 in Figure 2 show the advice around logCut that checks the level of the logger against that of the message to decide whether or not to evaluate the parameters and proceed.

the informational log call and its parameter expressions are not evaluated at all.


In most of cases, the operations are almost independent between list nodes and hence probability of con.icts is low.

the compiler turns on the speculation mechanism for these programs and achieves speedup on 2 threads.


Moreover, guards may be used to further restrict the object(s) that may engage in the events depicted on the lifeline.

if we have a universally abstracted MSC lifeline drawn from process class p with guard gp, it will be played by all object(s) of class p which satisfy gp.


4 indicate that on average each feature is selected by numerous products with different values, while many products have the same feature with the same value.

we assume that there are intensive correlations between feature assignments.


Since the size of any quorum in an acceptance set is n, as long as all quorums have at least a positive elements, dual overlap or intersection must be satis.ed.

we construct the following SQS OPT a = .in =aCi.


Our service allows discovering advertisements with arbitrary criteria.

incompatible advertisements are already sorted out at the resource-providing peers.


Simply saving the full extended physical registers into the memory is not necessary since the callee may only use part of them.

a part of untouched registers in the callee function should be utilized to store those live ranges (in the caller function) that are live across the call site.


The complete untangling of new aspects involves both their separation from the core and previously identi.ed aspects.

the complete aspect decomposition model is obtained in an incremental fashion since each identi.cation of new aspects possibly triggers both .rst and second degree refactoring.


As previously reported, there are no current features that show the status of deliveries.

anthony would like to prioritize his needs considering this.


We use physical pages in the same color to hold the .le blocks visited by grep.

grep only pollutes the corresponding cache region, and other cache regions are not affected.


The initialization e.ort for the startup of the respective validation plug-ins yet has a strong in.uence on the results.

the constraint execution rate improves when executing more constraints.


This scheme ensures that all messages within a sequence will be treated equivalently; it enables us to deal with message sequences, not just individual messages.

since functions are composed of message sequences, we provide means to enforce end-to-end deadlines.


This desire to reuse software is unlikely to go away in the face of increasing market pressures to release high-quality products quickly.

there are many opportunities to study reuse programs in progress.


by Minimal is reduced while the underutilization penalty incurred by AllBatch remains constant.

for increasing values of compute time, we observe that the performance of Minimal improves relative to that of AllBatch.


As discussed above, this leads to longer propagation delays for these structures especially for queues.

we observe that when hardware parallelism is limited, optimizing the binary to promote software parallelism can actually increase energy in a timing speculative processor by increasing logic delay and limiting overscaling.


It might as well be, that the discontinuity of two di.erent functions in a given point eliminate each other when they are combined by a certain operator.

information about the extent of the discontinuity at each point of discontinuity of each involved function would be needed.


C(M * (G),B) = S(A,(M, B)) natural in A .S and B .C.

moreover, we can lift the adjunction to the model categories ModT (S)and ModT (C): we have a bijection fA,B : C(A M, B) ~ Theorem 3.


Meanwhile, the impact of these parameters on the FCT of small .ows at lower percentiles is even smaller, and the average FCT of large .ows does not exhibit any clear pattern.


Furthermore, these values are con.rmed by the series of two n-channel transistors that also begin to conduct.

no con.ict is generated between these transistors.


This obeys the capacity constraints of the TEN network edges, while maintaining the same total cost on these edges.

if wehave the T-deadline constrained minimum cost solution to the UB network, Cub(T), we cantransform this solution into a solution with the same cost in the TEN network.


Moreover, the sounds are remixed in accordance with the distance between the hand and ear.

a user watching the film of a concert can enjoy the performance of a particular performer by moving his or her head and by cupping an ear.


The goals of ESC/Java and JML are di.erent: JML is intended to allow full speci.cation of programs, whereas ESC/Java is intended only for light-weight speci.cation.

some di.erences in the two languages remain, both syntactic and semantic.


Thus the single thread task should always be avoided.

to maximize the performance of the d-heap operations, we consider two design objectives: (1) maximizing throughput of the large amount of the SIMD units for faster .nd-maxchild operations, and (2) minimizing negative impact from the single-thread compare-and-swap operations.


Figure 7 shows a less conservative approach using a conversion, if available, from a target implementation type to the original implementation type whenever an actual argument of the latter is required.

the variable s type may be promoted (and changed to the target implementation type) and will be converted back when needed.


Tuning this value can reduce the load imbalance cost, however at the expense of a small increase in thread overhead.

two sets of threads are emulated: the first set consists of the coarse clustered-threads, and the second is the set of the remaining fine-grained unclustered-threads.


When Vj B]o 6 C(j) f~o) _< f(3) + $(.1)~_< f(3o) .4- s(jo)~ ~ :: the index variables j become redundant.

inequal- ities represented the loop (denoted as 27(j)) are removed from c ( j ).


That is, clustering data accesses .rst based on the set of banks they refer enhances data locality at the cache level.

the results it generates are not very far from those obtained through the LOOP scheme.


the information, that the representative of the county of Tyrone is Smith.

dimensions are described by attributes, some of which are descriptive, e.g.


Quality Question Yes To some extent No QQ1 11 1 0 QQ2 9 3 0 QQ3 10 2 0 QQ4 11 1 0 QQ5 5 7 0 QQ6 6 5 1 QQ7 8 4 0 Table 5: Quality Questions answers do not provide concrete evidences yet.

more research is certainly needed for enhancing the maturity of the studies.


However, it causes the trigger of the controller to occur more frequently than what the designer in [20] expected, and thus increases communication between the controller and the actuators (negating much of the bene.ts of self-triggering).

the performance advantages of self-triggered implementations must be evaluated taking the computation time for the trigger time into account.


The latter deals with control rates and the manner in which time is manipulated and reasoned about in the language.

the question is: what is the appropriate level and granularity of control for data and time?


Determining a system configuration .=  means: At a certain moment during the execution, when the values of some conditions are already known, they have to be used to take the best possible decisions on process activations.

after the termination of a process that produces a condition, the value of the condition is broadcasted from the corresponding computation node to all other computation nodes.


This is because optimizing at the higher O level enhances software parallelism, but there is not su.cient hardware parallelism to handle the dispatched instructions.

backend structures (LSQ and IQ) .ll, and propagation delay increases, limiting overscaling.


Did the user open the lid on the machine?).

in addition to commercial tracking systems, AR systems often require custom sensing and reasoning to be implemented.


Thecore model,the Esperanto of architecture knowledge, can be used as a common frame of reference[4].

we intend to map the concepts that are used in the sample process decisions onto the core model as our .rst step.


Weiss [20] establishes the stronger result that J(X)= DF+(X).

the notions of iterated dominance frontier, iterated join set, and join set are all equivalent (for sets that include the entry vertex).


Especially when there is already a mathematical description of the system available (set of di.erential equations), the mapping can be done in a straightforward way.

a focus of the presented approach lies on control systems.


The decision is semi-automatically linked to the new or changes architectural elements.

new or updated decisions are saved together with links to architectural elements and requirements and a rational (in form of answers to the questions) provided by an engineer.


Figure 7: Median distance error of the discrete space estimator for different values of the number of successive samples from each stream per location estimate (m).

a balance is required between the accuracy and latency of the system.


This simpli.es the issue logic by alleviating the need for a dedicated hardware for scheduling.

a signi.cant fraction of the total leakage energy consumption in VLIW architectures is attributed to functional units.


Logging is turned on during the original program run and, in case a bug is encountered, tracing is turned on during replay.


This, however, is not practical in most cases.

the dynamic check should not be restricted to program testing time, but should also be activated each time the program executes, or in case a problem is suspected.


Meanwhile, the prediction accuracy can also be improved.

how to detect the phase change becomes the main challenge.


For instance, a task select payment method will always be realized by a selection element while input credit card number will be realized by an input element.

as there is no need for customizing the tasks, the abstract UI elements do not need to be customized.


Note that the transformed PCFG uses the pattern variable P3, which is bound in the original PCFG.

when the PEC engine .nds a match for G£ in Figure 5, the resulting substitution will have an entry for P3, which essentially captures the fall-through of the matched region of code.


Intention preservation: For any operation o, the e.ects of executing o at all sites are the same as the intention of o, and the e.ect of executing o does not change the e.ects of independent operations.

the following causality detection issues surface.


Thus, some information required for defining interfaces and the behavior of architectural elements was missing.

the evaluated architecture was not detailed enough to provide a sound basis for implementation.


If this instruction is successfully executed, for the instructions that follow them, we know for sure that the length of the accessed array is larger than zero, and that the value of the index variable is larger than or equal to zero and smaller than the length of the array.

the states of the relevant local variables and stack operands must be updated.


Note, that the .i quantities cannot be controlled.

if we want to avoid the ambiguity problem, we need to choose values for the .i such that ambiguity is excluded.


THE OBJECT-ORIENTED PARADIGM 3.1 Integrating the Object-Oriented Paradigm In popular object-oriented programming languages, an object class is also a type.

an object class is a user-defined scalar type as defined by the relational model of data.


However, there may be some other characters between x and y, concurrently inserted or previously deleted.

c must be placed somewhere among these characters.


To represent consecutive MPI ranks in a group, we use ranges of values.

each entry in this representation (i.e., a table) are the tasks that have seen the same number of transitions along that edge, Figure 5.


For example, assuming that there are two servers, each with its own database, and that the server holding the debit account is not operational, the transaction executes only the credit operation, which contradicts the atomicity property.

the procedure of transactions in Subsection 2.1.2 does not support control of distributed transactions.


iMovie Exp calls a Quicktime append function that preallocates space before writing the actual data; however, the data is appended in small 128 KB increments.

the append is not split into multiple write calls; the preallocation is useless.


In particular, errors often occur in multithreaded programs because certain interleavings cause unexpected interactions between concurrent threads.

methods for specifying and controlling the interference between threads are crucial for the development of reliable multithreaded software.


With prediction on, we set the skip threshold to 0%.

we do not skip any collections, and we isolate the performance penalty incurred by YP.


Because the mapping address of libraries may vary across runs, pro.ling runs may not work well either.

we should have a more robust method that can encode the call paths that contain indirect calls dynamically instead of relying on pure static analysis with pro.ling.


With cloud computing in recent years, cloud storage such as network hard drive has generated to store data information on network.

there would be no loss of data even if the computer was attacked.


3.2.3 Load balancing LBPP is inherently load balanced like the traditional loop-level data parallelism, because each thread does the same work, only on different iterations of the loop.

performance tends to scale linearly until we reach the maximum performance.


Viewing the OS as a black box, one can make no assumptions about the implementation, be- havior, or internal state of the OS beyond that specified by its interface.

the only way internal-state information can be acquired and the only way that OS behavior can be controlled is through explicit mechanisms designed by the implementors.


Moreover, the existing models and documents can be used and their validity can be assessed against the implementation.

for the existing software, the role and nature of architecture evaluation can be di.erent than for newly-designed software: the evaluation of planned software on the basis of speci.cations versus the evaluation of the design of an existing implementation.


While Join matched only once, the Match with I(AMSC) is repeated for all occurrences of the template in the original MSC.

once the I(AMSC) has been applied for the .rst time, the operator looks for more occurrences of the template captured byAMSC,possiblywitha di.erent instantiationI1 (AMSC), and applies the aspect again.


Note: In this example we assume that as discussed in Section 2 running the same test automatically and manually may detect different types of failures.

an automated test case should be executed manually too.


We believe that when a program happen may execute two statements in parallel, it should be because the programmer intended it.

may-happen-in-parallel information should be something the programmer has in mind while programming, rather than something discovered after the programming is done.


4.4 Expression typing In theJmask language, the evaluation of an expression might update some type bindings.Forexample, initializinga .eld removes the mask on that .eld, if there is one.

typing judgments, shown in Figure 9, are of the form G f e:T,G', where G' is the typing environment after evaluating e.We write G{ p:T} for environment G with the type binding of pupdated to T. There are two other kinds of judgments in Figure 9.


It is possible to mine for all rules, but typically eROSE mines only for rules with a particular left-hand side.

mining is speeded up and rules are always up-to-date.


CALL FOR ACTION The World Wide Web is the most powerful medium for sharing information in the history of humankind.

it is not surprising that the use of the Web has spread into many new areas outside its original intended use.


Web access is the one technology common to all groups.

the direction in designing the architecture was to use Internet technology as much 1 Author also has an affiliation with the Department of Computer Science at Georgetown University, 234 Reiss Science Building, Washington, DC 20057, blakeb@cs.georgetown.edu , (202) 687-3084 as possible in gathering data request information, delivering the data to the customers, and integrating the sharing of their tools.


Disparity of the interface characteristics sometimes makes it difficult to compare the results of the experiments.

whenever appropriate we report the results normalized to the maximum bandwidth achievable by the underlying interface.


In addition, the generated code does not contain spill code3 which is inserted by the register allocation step.

energy aware optimizations made in early code generation Spill code is necessary in order to move variables into the memory locations if the available number of physical regis phases are potentially nulli.ed in subsequent optimization steps.


We envision a moldable debugger which, unlike a general-purpose debugger, both adapts itself and can be adapted to a debugging context.

we delegate the customisation of the debugger to developers, as they are the ones that know the problem.


Even the participants perceived this item important they don t visualize the whole picture of the overall related decisions.

they can t imagine how to manage the set of intertwined decisions in the contexts of a software system.


But, the main disadvantage of the topological sorting-based algorithms stems from remote communication with the priority queue, which happens outside of the dependency edges between nodes.

these few remote edges suf.ce to show the full effect.


On this example, Synergy works very similar to Dart.In the .rst iteration GetOrderedAbstractTrace returns the ordered abstract trace ((0, 1, 2), 0), where the frontier points to the region {pc =0}.

any test that visits {pc = 0} is a suitable test.


Also, every port is implemented as a single object in order to ensure that every port allow invoking only declared operations.

a single component materializes as multiple objets.


In the merge kernel, each block is used to compute the reduction output of one input array.

this kernel should be launched with Narrays blocks.


However, in this particular case the parameter objects are not referred to by any other object or variable after the root object gets constructed.

if this site is cached, these parameter ob jects would also get garbage collected whenever a root ob ject is thrown away (due to a cache hit).


Since T3 and T2 do not con.ict, strict disjoint-accessparallelism implies that a2 does not contain any non-trivial operation on base ob jects read in .3 .

the pre.x of a3 until the point that o1 is .rst accessed is also a pre.x of .3 .


Unfortunately, thisis ofteninfeasiblebecause of the enormous number of combinations; for example, 20 integer inputs whose values only rangefromzerotoninealreadyleaveuswith1020 combinations.

knowingwhatcombinationsoftestinputdatatoselectfordifferent input parameters to drive the AUT towards the statements nested inside variousbranchesisverydif.cult.afundamentalproblemofsoftwaretestingishowtoachievehigherstatementcoverage faster byselecting speci.c values ofinputparametersthatleadthe executions of applications to cover more statements in a shorter timeperiod.


A win is given to the method that exhibits the highest accuracy.

if we consider the true accuracy of the top 20 candidate outliers, then the GLS-backward-R has won 45 times.


4.1 Local Deployment It is important to note that in the case of local deployment, in contrast to J2EE containers, IIS did not perform any call optimisation to replace the remote call with a normal method call, which happened in JOnAS, for example.

even though the presentation and service layers are deployed in the same container, the communication between them involves serialization; however, the calls are not performed over a network.


SLAs specify the negotiated agreements including Quality of Service (QoS), such as deadline.

datacen ters minimize power consumption without violating these SLAs.


Note that computations that go wrong, such as an integer division by zero, are modeled by the absence of a transition.


Unlike nested inheritance, the base family also inherits from the derived family, acquiring any new functionality that the derived family adds.

sharing is a bidirectional inheritance mechanism.


We must somehow ensure that the original asynchronous message is successfully resolved.

when a synchronous sender is woken, we record the asynchronous message that woke it, transferring responsibility for the message.


A variable s reader is a method that is directly accessing an instance variable.

for further analysing the state of the instance variable, all readers are symbolically evaluated.


Following a store through a pointer p whose points-to set is empty, su[e](a)= {} for all values of a.

in our implementation, we use a boolean .ag to indicate this special value.


Even today, debugging the full BG/L installation at LLNL requires launching 1664 daemons onto the I/O nodes.

petascale tools need better integration with resource management systems.


|T | Assuming that every APT contains the maximum allowed number of entries, the probability that an access point cannot be found within K steps is P r{f ail} = (1 - p)K .

7 Thanks to the fact that APTs can be considered as uniform random samples of the set of active topics, each node can estimate at runtime the value of |T | [19].


In general, it minimizes the need to disclose protected health information outside the health institutions.

it could encourage participation of data owners.


The use of effective regression testing techniques is, therefore, crucial.

test case prioritization [19] is important in regression testing [9][15].


Therefore, we have to disguise the type Shift[A,B,C] as something else, notably something that is compatible with type A because A is the argument type of the expected continuation (recall the de.nition of Shift).

we make use of Scala s pluggable typing facilities and introduce a type annotation @cps[-B,+C], with the intention that any expression of type A @cps[B,C] should be translated to an expression of type Shift[A,B,C].


As a consequence, a traditional approach, i.e., manually programming and adapting the CMS to different facilities, was not feasible.

the domainspecific modeling approach can be seen as the key technology for enabling a new business model for our customer.


UML Components description After describing a development process, descriptions of assets created according to such a process can make reference to the identifier of the resource that represents the development process.

it is possible to provide a set of integrated development tools that make use of a component repository system for managing development processes and their artifacts.


In this approach, each data item has a key associated with it, and a distributed or geographic hash table is used to map keys to nodes that store the corresponding data items.

writes cause data items to be sent to the hashed nodes and also trigger updates to the in-network hash table.


However, in OrangutanServos.cpp, the assignment TIFR1 = 0xFF; sets all the register bits to one which violates the requirement of reserved bits 7:6 and 4:3 in TIFR1 register.


In this example, the Resume policy is automatically applied.

the user navigation is resumed from the last visited page, that is the Loan Ack page (c).


SILT requires approximately 0.7 bytes of DRAM per key-value entry and uses on average only 1.01 .ash reads to handle lookups.

sILT can saturate the random read I/O on our experimental system, performing 46,000 lookups per second for 1024-byte key-value entries, and it can potentially scale to billions of key-value items on a single host.


As designers integrate more of the memory hierarchy onto the processing die, the number and size of memory arrays on these system-ona-chip (SoC) and microprocessors will increase [39].

errors occurring in the embedded memory systems are a growing threat to the overall SoC and processor reliability and yield.


In our approach, however, the compiler writer does not need to worry about ordering, because optimizations do not destructively update the program they simply add equality information.

after an optimization A is applied, the original program is still represented (along with the transformed program), and so any optimization B that could have been applied before A is still applicable after A.


Such variants typically have the same general goal, and also similar intent and consequences that can be generalized to the most common pattern variant.

once a pattern is selected, pattern variant questions help to identify the most suitable pattern variant, and point out possible advantages or disadvantages of it.


Every library has its own policy and creates it independently of other libraries.

libraries are free to choose any library management system to be used and they manage their own collections according to their internal rules.


The problem in this setting is that the veri.er cannot track the ownership status of an unbounded number of elements in a vector.

we restrict access to the vector to one element at a time, requiring an expose of the vector element in the same way as we exposed an entire struct.


If it leaves the network, the streaming obviously ends.

in a good design this component must not be overloaded by many tasks.


When the parameters of higher-priority resources are unknown, it is a safe assumption that the subsequent executions from the ....h release are delayed by .... - .....Thisis pessimistic, since, in reality, high priority resources would suffer no or only a few preemptions.

an exact method is required [4], [5], which, however, is not useful for an optimization of 1When ....,.... .


sgemmToken[i][j] = j; } /* out sgemmToken[i][j] */ } #pragma adf task relaxed execute(1) sgemmToken[j][0] = 0; /* initial sgemmToken[j][0] for column 0*/ } /* end for */ #pragma adf task relaxed execute(1) ssyrkToken[0] = 0; /* initial ssyrkToken[0] for block A[0][0] */ #pragma adf_start #pragma adf_taskwait }         spotrf[0,0]        strsm[j,0]      ssyrk[1,1] sgemm[j,i] a) c) d) f)   Due to the diversity of algorithms and applications, it is therefore unlikely that a single programming model can support efficient implementation of the whole application spectrum [3].

a number of recent proposals aim to combine different well established models into a single programming model that can support a wider range of computation and communication patterns.


To make a reference A[200] in the CUDA kernel access the location of A[0] on the device, we need to shift the start address of the array in the CUDA kernel by -memO.set.

a reference A[i] in the original OpenCL kernel becomes (A-memO.set)[i] in the CUDA kernel.


Adding new relations among the inner components does not e.ect the metric value of the enclosing class as the metric uses external inward projection.


After constructing the new node, mkBalanced frees the original node being replaced, but does so in an RCU-delayed manner.

the old node (and, in turn, the entire old tree) remains valid until every concurrent lookup that may be using the old tree completes.


This is to be expected since the replication factor is the percentage of nodes at which answers are located.

the performance .gures we show here apply to arbitrarily large system sizes.


As regards to semantically describing the relationships amongst tags, the tag ontologies explained earlier are already established and widely used.

it is worth using one of these ontologies to semantically describe the relationships between tags.


The main challenge for addressing these factors is that our dataset contains no direct information about them.

we need to infer them from other available information.


To reiterate, the execution of C.m() with the input of a positive integer k in the new version (b) clearly behaves the same as in the old version (a).

these tests make no contributions to exposing likely faults caused by the 1 If performed at the source code level, existing algorithms are not able to recognize the aspect code.


Similarly, a thread that calls transfer at line S8 will always subsequently call release at line S9.

we can combine the e.ect of the two cases in those two procedures into a single cas.


An invalid recommendationis one whose application can alter the output prior tothe errormarker.Thegoaloffaultrepairisto.xtheinputinsuch a way that the output at the error marker changes to the expected output; all text preceding the error marker is assumed to be correct.

we classify a recommendation as invalid if it can potentially change anyoutput text that precedes the error marker.


One implementation, however, is universally available across all VMs supporting the Java 5 platform.

this agent-based implementation has been surveyed.


Moreover, location logs collected for a long period of time may be able to re.ect lifestyle patterns of the user.

location logs and information derived from these logs may provide useful context information for various applications.


Each TM can communicate with one grid node.

gRAND instantiates one AM per application and can use one or several SMs available in the local network.


Over time, numerous retrofitting aspects may be applied on a complicated legacy system, which may make it even harder to understand.

retrofitting aspects could be viewed as a tactical short-term patch for a long-term problem.


In addition, an increase in weight indicates the retention of excess fluid, which requires increasing the dosage of diuretic medication to counteract fluid accumulation.

close monitoring of patient weight has been shown to decrease the need for hospitalization, thus improving patient quality of life.


Unreachable states always have a value of zero, as they are initialized to zero andare never updatedbya non-zero value (i.e., bya reachable state or an input).

unreachable states can be removed from the state space representation, since they have no e.ect on any other states or output values.


Once such a SP is part of a quorum, after a few re-broadcast rounds, all of the SPs in this future quorum will have their bits set.

all the SPs in the latter quorum will decide to upload.


In other words, they operate, in a sense, a cache oblivious fashion.

the results achieved by these techniques can be unpredictable due to dynamic cache behavior at runtime.


However, this is impossible due to the order of its type parameters; we need a to be the last parameter3 .

we de.ne the type PreProductions for descriptions of (possibly empty) alternative productions.


5.2 Introducing R2 LMS Much in the same way as LMS regression is introduced in comparison to OLS regression, we here de.ne R2 as fol- LMS lows 2 medi.1..n{|yi - axi - b|} RLMS =1 - medi.1..n{|yi - y¯LMS |} where y¯LMS is mLMS for the {yi} data set.

we have P2 (yi-axi-b) i.1..n replaced the average square residuals n and (yi-y¯) i.1..n P2 of Formula (1) medi.1..n{|yi - axi - b|} and n medi.1..n{|yi - y¯LMS |}, which are with their counterparts minimized in LMS regression.


Inagame with weakevent ordering, onlyevents that change the virtual world are totally ordered.

the inventory commandwouldnotbe ordered(andonlyexecuted locally), while a movement command would be ordered.


Thus, their supersets P and Q intersect a contradiction.

the values of S.+-outputp conform to the speci.cation of S.+, for each process p. .+ 3.4 Using (., S)to solve nonuniform consensus The algorithm of Figure 3 uses the failure detector (., S.+)to solve nonuniform consensus.


A suitable validation methodology is currently not in place.

in many cases, software can only be integrated by the ECU supplier, who then requires a detailed design speci.cation from the OEM for executable codegeneration and optimization.


Graphical Models In Section 3 we have explained that Viterbi algorithm iterates through a sequence of observations and for each state it calculates the most probable preceding state.

we need to calculate all the state probabilities for one observation before we can move to the other, which essentially requires a barrier Figure 6a.


In MDD, Uni.ed Modeling Language/Object Constraint Language (UML/OCL) class diagrams play an important role for model design, analysis, and transformation.

the veri.cation of UML/OCL class diagrams at earlier stages in the development process is an essential task in order to check the correctness of model properties, i.e., veri.cation of a 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 pro.t or commercial advantage and that copies bear this notice and the full citation on the .rst page.


Since all versions (by using both DOSC and CDC metrics) demonstrated to be too scattered in relation to their components, we decided to analyze the scattering in a more 1http://www.teccomm.les.inf.puc-rio.br/emagno/ajato/ 2http://aopmetrics.tigris.org/ .ne grained way.

we employed the DOSM metric to measure the degree of how scattered the concurrency concern is in relation to all operations in the target systems.


Served as a negative result, it is shown that (x,p) following (7) (8) oscillates inde.nitely in common multi-path unicast scenarios [27, Section 2.5].

to our best knowledge, almost no solution for multi-path routing utilizes such Primal-dual algorithm.


There are three possible situations and the only one covered is suppliers with orders.

suppliers without orders (null value) and with non-existent orders should be incorporated into the test database.


The list of system components and interfaces, for instance, changes with the target platform.

each project in TOSDev must be associated with a speci.c platform.


In addition, conventional log filtering processes are limited to execution within a post-mortem, reactive time period, as the enormous size of these documents prevents efficient real time interaction.

there exists a strong need within the HPC field for the provision of accurate-yet-concise real time application information.


Also, the memory region containing the veri.cation function is small enough to .t inside the CPU s L1 data cache.

once the CPU caches are warmed up, no more cache misses occur.


It can be used to model maximum .ow problems (that is, no costs are involved), where the .ow on each arc in the graph as well as the total .ow value is represented by a .nite domain variable.

this .ow constraint is less generic than the .ow constraint in [3] and our NFC.


In fact, these faults covered four of the five types of faults we seeded (recall Table 1): three were operator or operator application fanlts, two were incorrect constants, one was an omission, and one was an incorrect reference.

according to Allwood's classification scheme, assertions contributed to effectiveness across a wide range of faults.


However, reordering the instructions of merged concurrent regions can introduce new behaviors.

the cBarrier node ensures that concurrent region merging remains a valid code transformation in the JMM.


Such support for rebalancing workload is also bene.cial to cloud providers.

they can dynamically add nodes to the cluster and seamlessly extend the cluster for business needs.


Though thedevelopment of application-speci.cpluginsis mostly straightforward, they require application knowledge to be developed.

the onus of writing these pluginsis onthe application writers, thoughtheParaMEDIC framework provides tools to ease this e.ort.


More importantly, we .nd again that, for each program,asingle combinationcanachieve83%ofthedatasetoptimal speedup for all data sets, with most programs standing at 90% or higher.

our conclusions are valid for two of the most widely used compilation platforms.


Since all paths in the Kripke structure M are of length one, the minimum total length of H is achieved when H contains the minimum number of witnesses.

a solution for the MLTG' problem in this case will yield the same witness- set which is also a solution to the MNTG' problem.


Also, the guard of a subsequent storei(j) re-quires dirty~,j to be true.

there must be an inter- vening action which sets dirty~j to be true.


This is because executing a pre.x of a system call sequence could possibly drive the program execution to a totally different path from the recorded execution.

the recorded suf.x does not match the executed pre.x; thus making replaying of the suf.x impossible.


The algorithm ensures that, of these processes, the last to update the variable Y eventually gets to its critical section and then reopens the fast path by assigning Y := 0 at line 16.

the algorithm sat- isfies Exclusion and Livelock-freedom.


A few members of the VO are resource providers publishing their services within centralized indexes, while most VO members are resource consumers.

in traditional Grids a considerable wealth, namely the whole amount of user resources (CPU cycles, storage, etc.


Our laws consider the execution and call designators, as well as .ve types of advices: before, after, after returning, after throwing and around.

combining the pointcut designators and advices, we have a total of 10 laws for introducing advices2 .


a CSV .le is a list of rows) and rowspan and colspan may create rows or columns that have di.erent lengths, PCMs may not have rectangular matrices.

a .rst step toward the formalization of PCMs is to normalize their matrices.


In case of reference exposure, it is the alias object that should be restricted from ownership transfer.

to avoid the reference exposure in our design we maintain another alias count in the alias object to count the number of aliases it points to.


Additionally, ARIS supports the customization of the modeling notation.

we could augment the notation with symbols to represent the other layers.


The 3G-network was avail- WLAN: 67.5 MB WLAN: 95.5 MB able for the entire trip and it provided stable performance at all times of day.

our prediction algorithm was able to improve the video quality signi.cantly compared to the reactive scheduler, as shown in .gure 4.


In other words, the code-review process requires engineers to understand code changes.

a better understanding of changes might smooth the code-review process and help reviewers spot bugs more effectively.


Database query languages are often limited in expressiveness: for example, plain SQL conjunctive queries cannot express recursive properties such as transitive closure.

understanding the relative expressiveness of different (Turing-incomplete) query languages, and the tradeoff with complexity of query evaluation or optimisation, are important issues in database theory [1].


We showed that CBR can be computed on basic block bounds with no loss of accuracy.

the computational complexity of the combined approach can be signi.cantly lowered.


These languages are popular because they enable rapid prototyping and are easy to use; as a result, they are increasingly used in infrastructure and systems code [3, 18].

there have been initial efforts to directly implement high-level symbolic execution engines for interpreted languages.


It is important to point out that the system usually does not know the ground truth about whether an object is high-quality or low-quality.

the EC often needs to estimate the ground truth.


In addition, a publication also provides a protocol that represents the invocation dependencybetween provided methods and required methods in the code of the component so that the assembler can compose a new composite component(infact,a publicationofthenew component) accordingto the publications of the existing components.

a publication can be seen as a pair of publication contracts de.ned below together with an invocation protocol.


However, as illustrated in the next section, existing systems only partially fulfill this requirement.

this paper describes a design science research project, which aims at deriving design principles of an accordant system and evaluating the principles based on a corresponding prototype.


(Toavoid cluttering,theinverseedgesinaPAG,suchastheonegiveninFigure 2, are not shown explicitly.)


Afterwards, the user should check the tasks not performed in time again, in case these have changed.

the user looks at screen 1 and has to indicate again if there were changes, and if so, how many.


Weevaluatedtheidealizedtrace utilization measure onthedifferent heap shapes.

a single run for each measurement point suf.cedforthe method of adding shortcuts.Forthe method oftracing through random roots, every measurement point is averaged over5 runs to accountfor the nondeterminism resultingfrompicking roots at random.


The limit is not on the whole execution time of the tool, but rather on the execution time to handle an event.

the analysis tool could potentially be run forever, but with the guarantee that the execution of the analyzed system will be resumed within the speci.ed time limit.


This insight canbe exploitedinlifeguardhandlersbycheckingthe frequent case stable state in a fast path while branching intoa slowpathformoredetailed checks.However,eventhe most optimizedcheckingoperationhastodo metadata access, comparison, andbranch.

(redundant)metadata checks are a secondkeysource oflifeguardoverhead.


When ones write x as an identi.er, the TransLucid interpreter understands this as ID@[name : x].

all variables are understood to be members of the same hyperdaton, namely ID.


When getID() method is invoked on e, we expect Employee.getID() to be executed; however, if the normal method lookup rule of Java stipulating the most speci.c method to be always selected is applied, Student.getID() is called.

because it behaves di.erently from Employee.getID(), the result of method call e.getID() does not satisfy the expectation of the user of e. in this case the alternative method lookup scheme is required.


Second, by placing the mobile class on the web service Si, we can eliminate the corresponding data-flow volume Vi as the data element is local to the web service.

the optimal placement of the mobile class is the web service Si that has the largest aggregated Vi.


The app store auditor manually veri.es both the justi.cation and the declassi.cation.

the auditor validates the developer s claim that the code is well-behaved for some reason that is beyond the precision of the type checker.


We assume that the actual collapse can be carried out in less than O(E+V) time by charging costs to the deleted edges and vertices.

the cost of this naive approach is O(E2+EV).