It is assumed that this point of optimality can probably not be determined precisely, neither ex ante nor post ante.

instead of finding the point of optimality, software manufacturers will in a practical setting be forced to search for a zone of cost effectiveness: a bandwidth in which the marginal net asset value is equal or close to zero.


bi n Bj such that |Cij | = n - f. Zi and Zj both contain one identical point from G(F(Cij )).


For example, barriers, .ag synchronization, and producerconsumer queues are common concurrency constructs that are implemented with deliberate data races [17].

we do not focus on data race detection in this paper, though our method can include it.


R[i] is not [[ modi.ed in the interval [ti,ti].

at time ti, ti reads the value stored in bu.er B[1].


This diversity results from the various implementation platforms and middleware frameworks used.

there is a major tension between reusability and the need to instrument the service and the middleware implementations (IR1, IR2).


At the application-level, messages are invisible until they are received by the application.

at checkpoint time, the application cannot distinguish whether a given message is sitting in a network buffer on the sending processor, being transmitted, or sitting in a network buffer on the destination processor.


For instance, a high-level statement like find can lead to hundreds of alternate states, whereas a primitive integer comparison might just create a single one.

the low-level search strategy is likely to explore multiple ways for find to succeed or fail, without increasing high-level coverage, before eventually exploring the alternate outcome of the comparison.


BubbleStorm: Resilient, Probabilistic, and Exhaustive Peer-to-Peer Search * Wesley W. Terpstra Jussi Kangasharju Christof Leng Alejandro P. Buchmann Technische Universit-University of Helsinki at Darmstadt, Germany {terpstra,cleng,buchmann}@dvs1.informatik.tu-darmstadt.de jakangas@cs.helsinki.. ABSTRACT Peer-to-peer systems promise inexpensive scalability, adaptability, and robustness.

they are an attractive platform for .le sharing, distributed wikis, and search engines.


On the other hand, we show that this system has good properties, including admissibilities of subsumption and application and subject reduction (see Section 5).


4.1 Locks The contention sensor for locks is quite important as locks tend to be the biggest bottlenecks in concurrent programs.

we must take extra care of minimizing the cost of this contention monitoring.


Box 5969, Safat 13060, Kuwait boujarwa@eng.kuniv.edu.kw  ABSTRACT A large part of computer programs consists of data declarations.

an increased focus on data flow testing should be considered.


Moreover, model comparison approaches do neither provide a su.cient level of abstraction nor are they intended for planning purposes.

we propose to take a di.erent approach by focussing on the commonalities and variability between the models over the time.


This has the e.ect of analyzing only the alias possibilities that actually occur during concrete executions without resorting to a global (and necessarily imprecise) alias analysis that reasons about all executions.

in many cases, we can show that Dash produces abstractions that are exponentially smaller than those considered by tools such as Slam [3] and Blast [18].


When Csub :: P is a non-re.ning method, then its allowed behavior is not a subset of the allowed behavior of the superclass method CP :: P it is overriding.

other superclass methods that call down to P may not behave as speci.ed, since they were veri.ed using the superclass speci.cation of CP :: P .


Apps have many features that make static analysis challenging: a vast software development kit (SDK), asynchrony, inter-process communication, databases, and graphical user interfaces (GUIs).

many approaches for analyzing apps are based on dynamic analysis (e.g., [7, 9, 10]).


Toranktypenodes,RRT.rstcalculatesthephase growth factor (g)ofeachtypenodeasgti =pti *(Q-1),wherep isthenumberofphases(orcollections)thatt hasbeenpotentiallygrowingandQ istheratioofvolumesofthisphaseandthepreviousphasesuchthatQ >1.SinceQ >1,g >0.Eachtypenode srankrt iscalculatedbyaccumulatingphasegrowthfactorsg overseveralcollectionssuchthatabsolutegrowthisrewarded(rti =rti.1+gti )anddecayispenalized(rti =rti.1-gti ).Higherranksrepresentahigherlikelihoodthatthecorrespondingvolumeofthetypegrowswithoutbound.SinceRRTonlyreportstypesthathavebeenpotentiallygrowingforsomeminimumnumberofphases,the.rsttimeatypeappearsinagraph,RRTdoesnotreportit.Corkranksreferenceedges(re)usingthesamecalculation.

2.3 Correlating to Data Structures and Allocation Sites Reportingalow-leveltypesuchasString asapotentialcandidateisnotveryuseful.Corkidenti.esthegrowingdatastructurethatcontainsthecandidategrowthbyconstructingaslice intheTPFG.Wede.neaslice throughtheTPFG tobethesetofallpathsoriginatingfromtypenodet0suchthattherankofeachreferenceedgertk -tk+1onthepathispositive.aslicede.nesthegrowthoriginatingattypenodet0followingasequenceoftypenodes{t0,t1,,tn}andasequenceofreferenceedges(tk,tk+1)wheretypenodetk pointstotk+1intheTPFG.


The main goal of this paper is to explore the ad-hoc solution to enable reuse.

a microprocessor (based on the open-source OpenRISC core [11]) and the basic HW (busses, memories, peripherals) and SW (compiler, debugger, RTOS) platform elements have been developed.


In a method body of NProxy, the invokeMethod method of the endpoint is used to forward the method invocation to the may-be-of.oaded class N. The parameters of invokeMethod are: (1) the class N s full quali.ed class name; (2) the instance ID of class N. Each NProxy holds an ID of a class instance N. The ID is initialized when this proxy is created for the corresponding app class instance.

the endpoint can use the class name and ID to locate the N instance uniquely; (3) the bytecode-level method signature.


The space used by P IP E R on any time step is the sum of frame sizes of all contours c which are either (1) associated with a vertex in some worker s extended deque, or (2) suspended, meaning that the earliest unexecuted vertex in the contour is not ready.

let SP denote the maximum over all time steps of the stack space used by PIP E R during a P-worker execution of G. S1 is the stack space used by PIP E R for a serial execution.


Moreover, it is usually impossible to make globally op- timal scheduling decisions at ran-time.

scheduling decisions should be made as much as possible at design-time.


Similarly, multi-core machines distribute their load evenly on each CPU core.

we use an M/M/n/PS queue to capture the performance of an n-core machine.


Note that if the Jikes RVM were written in C or C++, as other VMs are, our dynamic analyses and optimizations would not be needed for the VM code.

we do not analyze VM classes whose names start with com.ibm.JikesRVM , instead we make optimistic assumptions when these classes appear in our call graph, and we neither insert additional fences nor perform fence insertion optimization on those classes.


A closer study shows that the link generation for ..1.CS1 ( ) only cares about satisfaction links from its subformula, but the sub-formula not ( ) on the right branch happens to generate violation links that are not expected by ..1.CS1 ( ) .


Similar to visits, a context updater will be applied to terms of any type.


In case of source code, an individual snippet may represent an entire compilation unit, a method, a single statement, an element of an AST, or even an individual character.

if snippets represent AST elements, an entire compilation unit becomes a graph of interrelated snippets.


It should be interpreted as core hours with the caveat that an SU is defined locally in the context of a particular machine.

the value of an SU varies across resources utilizing varying technologies and, by implication, varies over time as technology advances.


In general, an extension is free to use the entire API provided by the coordination service.

a stateful extension, for example, is allowed to create own regular nodes to manage its internal state.


Node ni repeats this process until the message reaches node nu, the successor of H(u).

routing the search message to node nl via successor routing takes O(log N) hops for N nodes.


This problem can be slightly alleviated using queues of di.erent priorities but the IEEE 802.1D standard allows up to 8 priority levels, only, which is insuf.cient for priority scheduling of tra.c streams.

several real-time Ethernet (RTE) protocols were developed that in one way or another control the tra.c submitted to the network and allow enforcing real-time response, such as AFDX, TTEthernet, PROFINET-IRT, Ether-CAT and EthernetPOWERLINK.


As steering actually adjusts the execution of the model-based oracle, this volume counter also adjusts to re.ect the changes induced by steering.

steering is able to account for the growing difference in the volume infused by the model-based  Table 9: Precision, recall, and F-measure values for .ltering (outputs + volume infused oracle).


naries for the programs we provide results for in Figure 10.

procs only uses procedures for picking the phase markers (no we could not run their reuse-distance analysis to loops).


These experiments are run over the Emulab [21] testbed and do not consider network congestion or latencies.

the factors effecting the protocol are group dynamics, bandwidth resources and NAT/.rewall connectivity restrictions.


Whereas metaphysical realism objectivisticallly takes the viewpoint that the real world exists independently of the knowing or perceiving subject, for metaphysical idealism there is subjectivistically no objective reality independent of the human spirit.

when applied to epistemology, the truth or falsehood of a belief is seen by the objectivist as a decisive objective characteristic which has to be defined in terms of its consistency with objective facts.


Or, the subjects might have a different system embedded in the glass which enables the tinting.

depending on the system, there can be variability in the subject facet.


Assuming, a WiFi AP every 100m, the vehicle may encounter 6 APs.

the 2nd and 3rd chunks of the .le must be available at least in one of the next 6 and 12 APs respectively, starting from the source where the user starts moving.


Locks are acquired and released to protect something.

any concurrency operation implies that the programmer believes the surrounding code is multithreaded.


As discussed above, constraints should be applied to all RBAC entities.

in our model representation, we introduce two components such as SCR (Static Con.icting Roles) and DCR (Dynamic Con.icting Roles) that support SSD and DSD relations in the standard.


As the batch size is increased from 16KB to 24KB and 28 KB, the probability of an aggregated disk write request experiences a full rotation delay decreases but is still nonzero.

the average logging latency also decreases, and the logging throughput increases.


For instance, the programmer can express a mixin class that is only applicable to non-con.icting classes: 1 class SizeMixin extends X { 2  errorif ( some F size : X.fields ) 3 int size = 0; 4 } In this case, the programmer wants to assert that, if the parameter type C already contains a .eld named size, this is not an error in the de.nition of SizeMixin but in the instantiation SizeMixin.

the errorif construct serves as a typical type-cast: it is both an assumption that the type system can use (i.e., when checking SizeMixin it can be assumed that X has no size .eld) and at the same time a type obligation for a later type-checking stage.


It seems reasonable to assume that for an ordering assignment to the SIMD groups that minimizes total permutation costs, each node in the SIMD DFG will have the same ordering as at least one of its neighbors in the graph.

the idea is to take known orderings of SIMD groups of memory operations and propagate them through the SIMD DFG.


Each semantic-chunk has associated with it meta-data, namely regarding consistency.

in Semantic-Chunks (analogously to LBFS chunks), when two neighboring devices need to exchange document contents, they .rst exchange semantic-chunks, and then, if the receiver does not have them, they exchange the comprising lower-level semantic-chunks.


The valuepredicate is provided by our framework and represents the value of a given expression in ..

the invariant for pos indicates that the value of an expression of type int pos should be greater than zero, in any run-time execution state.


1110b means no change , this is useful when the same RSV is consecutively accessed.

the SETBIT entry can change one bit among bit 0 to bit 13 or leaves the offset register unchanged.


2.2 Arguing for Autonomic Recon.guration The set of services run on most networks is not static; this is particularly true of wireless and ad hoc networks.

a static con.guration may not be appropriate over time, as new systems are added to the network, and existing systems are removed from the network.


However, in a weakly consistent system each replica s view of the matrix can differ at any given time.

access control decisions related to the same update may differ depending on time or location.


i j=1 The max-random strategy is the same as max-greedy, except that the covers used for embedding are chosen in a random order.

the number of utilized images can be higher then in the max-greedy strategy.


However, if a star is used around a capturing group, it will only record the last substring matched.

it cannot be used for unbounded list matching.


Folding the columns of Table 4 yields a 1×1 matrix whose entry is equation (5).

the constants that can be derived from Table 1, which already exist (e.g., sgl) or can be computed by foldings, comprise the product-line of L. The inconsistent equations that we encountered earlier, error1 and error2, cannot be derived by folding Table 1.


In addition, each rule is endowed with proof ob jects that correspond to the introduction and elimination forms as shown below.

objects M ::=  .x : A.M | M1 M2 (Linear functions) | M1, M2 | FST M | SND M (Additive conjunction) | (Additive unit) a linear LF representation for the judgment G; .


Step 4.2: the survived 367 dependencies are con.rmed as certain by the tests in step 4.2 and hence there is no uncertain dependency to be solved in step 4.3.

strawBerry directly performs Activity 5.


In order to avoid raising overwhelming memory misses, the hot blocks should be safely held in memory.

we segment thebu.er cache spaceintotwo areas, Priority Region and Energy-Aware Region.


Similar to mass-mailing worms, a downloaded .le must be opened by the user for the .le-sharing worm code to be activated.

we add a .le opening probability (Pif ) for each peer.


The total number of RECUNIF operations is at most Nn, because step (10) is always done together with (9), which decreases by one the number of non-ROW nodes (which are never created after step (2)).

at most Nnm pairs are added to the O(n) initial pairs in W during the algorithm.


However, predicting exactly where an array begins and ends is dif.cult, even for the magical oracle.

the algorithm actually generates a three-.eld struct, where the .rst .eld 3 If parenthetical elements are not well-nested, the meta-tokens are discarded and replaced with ordinary sequences of simple tokens.


An object is only allowed to access: 1) itself and objects it owns, 2) its ancestors in the ownership tree and objects they own, and 3) globally accessible objects, namely objects owned by world.

1 o1 can access all objects in the .gure except for o3 and o7.


This is yet another form of implementation bias, a bane of design expression that IOP attempts to eradicate for software design in general, and IOM should prevent for middleware-based software in particular.

iOM is not just about adaptation, but also about design expression, and this is best handled with a new language.


This is expected because K =(50,000 + 10,000)/10,000 = 1.2 at time instant t0 in the former case of pollution attack and it is K =50,000/50,000 = 1 at time instant 0 in the latter case of pollution recovery.

now let tE be the time x(t) becomes within E of M, i.e., x(tE)= M - E.We have, -µt, M - c1e M - E = 1+ Ke-µt, ent versions of a title explicitly into account, and assume that users select a version to download independently of the number of copies of the versions available.


In our experiments, we have found we need roughly a million samples to accurately cluster the threads.

on the right y-axis of Figure 8 we show how long (in billion CPU cycles) we need to stay in the detection phase to collect a million samples.


However, it only depends on the constant k and not on the the total number of nodes as is the case when broadcasting events.


Complexity has dictated that no one person can do everything in any project of reasonable size.

it becomes an imperative that we behave as both independent specialists and as teams with a singleness of purpose.


The speci.c function to be applied is statically known during the program transformation.

there is no additional overhead for dispatching to one of these functions at run time.


Starting from its start date (5), the next time date where an operation has an activation condition which is not exclusive with the one of our operation is 13.

the future statement is set to give control in 8 (=13-5) time units to the label L5 corresponding to date 13.


systems with the required level of reliability and availability.

new software engineering methods and tools are required to make software systems autonomic [10, 14].


Finally, the quanti.cation over the expiration element can be weakened too, for there is only one such element in the login reply.

all the Interaction Speci.cations shown previously belong to LTL.


As a result, eventually the pre.x q1,...,q|F | of q1,...,qn (lines 8 10) will consists of all processes in F , and will be .xed and the same at all correct processes forever.

anti-O guarantees that F contains at least one correct process, say p. there is an i =|F | such that eventually always qi = p. To .nish the proof, we must show that |F |= n - 1, but this is true because anti-O outputs at least one process in.nitely often.


The main consequence of this being that Application Objects classes can be used to model either CORBA application objects or plain objects interacting with a CORBA application object.

3 In this example only CORBA synchronous operations are taken into account.


[25] introduced the Common Variability Language.

di.erent approaches and a number of di.erent notations for describing variability are available.


For example, if setClass() is omitted, all classes are considered when selecting codepoints.

in Listing 1, line 3 selects native methods in all classes.


The error described above is also said to be caused by additional subgoals.

.rst we aim to detect all additional subgoals.


The counter is cleared when a vCPU succeeds in the stealing.

vCPUs wait for different amount of time before they try to steal again.


In this framework, true robustness exists when the need to react is non-existent.

the less reactive activities in relation to a change, the more robust the process is.


The public conversation .ow speci.cation published by the service provider describes all the possible sequences of turns between the interactants and the next operations represent a subset of those sequences.

the next operations are not discovered by the consumer starting from zero knowledge.


Such speci.cations aresatis.edif and only if each individual iteration meets the speci.cation.

we can verify an iterative process by replacing iteration operators with their enclosed subprocess and checking the resulting non-iterative process.


All edit checkins on the removed branches end up in the victims parent branches (there may be multiple victims if multiple branch removal steps are taken from H0 to create H1).

the maximum number of conflicts occurs when there is perfect interleaving of edits that were created on different branches in H0: PossibleConflicts=NumberOfEditsOnVictims+NumberOfEditsOnParents-1 We normalize isolation by dividing the number of conflicts that the branch avoids by the maximum number of possible conflicts.


Furthermore, since such SRS documcnts represent an incompicte domain model, manual discovery (identification and incorporation) of missing requirements is highly labor intensive and error-prone.

deriving and improving an cfficient adaptation of SRS changes remain a complex problem.


(i; s1) s2 = i;(s1 s2) skip s2 = s2 Instruction async s1 creates a new activity to execute s1, and the current activity continues with the next statement.

rule ASYNC executes the activity (P, async s1; s2) by reducing it to the tree (P, s1) || (P, s2).


Itis also during this stage that video data will be fetched from the data layer.

the xmit stage simultaneously adapts to network and storage bandwidth2 .


To do so, users are connected to co-workers only if they trust them.

the number of connections of a user re.ects the trust of his co-workers.


This means that no new target elements are created, but the rule works on existing elements, re.ning them.

with this approach, phases are loosely coupled as there is no need to make an explicit reference to any rule of another phase.


5.2 Taming unification A unique property of logic programming is that every com- putation step the program executes is expressed as a vari- ant of a universal construct: unification.

a unification such as "X = f(Y)" can be used for quite diverse purposes, depending on the instantiation states of X and Y.


The temperature information can be used by the controller of the heater for proper heating and pressure data can be further transmitted to a control centerthrough othernetwork means(such aslinked infrastructure or cellular communication).

in this paper, wefocus on apipeline segmentbetweentwoadjacent heat stations, which runs from a few kilometers to tens of kilometers.


Data.ow -No binary operations are interactions.

every value belongs to a singleton set, which represents a unique abstract type.


The distributions suggest that the classes are comparable: nearly all of the students had either no experience or only classroom experience in parallel programming.

comparing data across classes is less dangerous than if the subject populations had been more heterogeneous.


With this mapping implemented by the model inferrer, XBASE will also be able to automatically generate JAVA code starting from the mapped JAVA model.

the translation of XTR A ITJ to JAVA sketched in Section 5.1 is implied by our implementation of the model inferrer for XT RA I T J.


By induction, after having waited T(cn)time units p1 releases its lock on r1 and pn may lock both its registers.


The property from Figure 12 failed on the model with non-deterministic scheduling due to the fact that execution of a 20 Hz component was preempted by a 1 Hz component.

the steering component mode settings could change after the 20 Hz timeout and before the display update occurred.


M is represented in Haskell with the type Matrix ShortestDistance, and calling closure calculates the length of the shortest path between any two nodes.

to see this, we can appeal again to the in.nite series view of closure: (Mk)ij is the length of the shortest path with k edges from node i to node j, and M * is the sum (which in this semiring means minimum ) of Mk for any k. (M * )ij is the length of the shortest path with any number of edges from node i to node j.


Table 10 shows an example application of the operator with a test case.

the original program (P) contains a PHP variable (i.e., $_GET( name )) that is placed in htmlspecialchars function in M. The test case results an HTML bold tag in P, but no tag in M. the mutant is killed.


Instead of placing barriers on all read accesses to shared items (eg, reading an integer .eld from an object), we assume that once a reference is read from the heap, the context reading it will eventually read from the object targeted by that reference.

the read barrier is placed only on loads of references from the heap (eg, getfield or arrayload bytecodes in which the type of the .eld or element is a reference).


The experiments showed that to achieve the best performance for the lock-free algorithm, the back-offshould notbe too high.By appropriately choosing the back-offto get the best performance, it turned out that the average number of CAS performed by each instance of the algorithm is two which is bigger than the average number of atomic instructions executed by each instance of CC-Synch and DSM-Synch.

the lock-free algorithm has a performance disadvantage compared to these algorithms.


The only requirement is that each solution can be evaluated for all considered objectives.

afront ofPareto-optimalpointsfrom di.erent approaches can be combined to be used in the following parallelization steps upwards in the hierarchy of the graph.


This method relies on Metropolis sampling, which is too slow for interactive use, as we demonstrate later.

we propose a faster and more direct technique which explicitly tries to maximizes the margin through linear optimization.


Utility-based systems do not consider deadline either.

to optimize a utility-based system, greedily optimizing quality gain at each time unit gives a global optimal solution on the aggregated quality.


Indeed, print is not available to Circle s module.

to modularly ensure that print is complete, we require its module to contain a global default case.


It will accept any structure on its lefthand side, but accepts only a single Boolean on its righthand side.

in the next CSP an NT is done with respect to the when: [(word: a ,count:size([ a when true, b when false, c when false, b when false])), (word: b ,count:size([ a when false, b when true, c when false, b when true]))] The eight when clauses can be evaluated in parallel.


Generally, while the referenced approaches provide a good foundation for studying reliability of component-based systems, few of them can be readily applied in early stages of system development, before an executable version of the entire system is available.

the goals of the approach described in this paper include: The development of a probabilistic technique for reliability analysis that is applicable at the design-level, before the actual development and system integration phases.


However, the tests provided by different carriers are not uniform and present several variations related to their procedures.

we needed to carry out a process of information extraction and consolidation to create a test suite proposal.


So far, the focus of such approaches has been on structural decomposition.

work on ensuring the correctness of feature composition has focused mostly on syntactic and type correctness (e.g., [18] by Thaker et al.


Every CP race (and hence every HB race) is also a lockset race, since the absence of a CP edge between con.icting accesses to a location means that there is no consistently held protecting lock for that location.

a lockset-based race detector would detect all races detected by CP,5 and may also report many additional warnings.Inpractice, many of these extra warnings are false alarms thatdo not correspond to actual races.


When leveraging the network card processor, using a single core to perform the CPU tasks can provide unnoticeably different performance compared to using multiple cores even if processing and transmission times are high.

in some scenarios, a single-core policy should be used when it offers the same performance as the parallel policy because all but one core will be free to perform other tasks.


Many extensible language frameworks (10; 24) do support type-based overloading of existing host language operators.

adding a new numeric type (e.g., complex or rational numbers) may require new syntax to de.ne the type but no new syntax for arithmetic operators over these values.


Even assuming those two issues could be addressed up to an acceptable level, there will still exist uncertainty in the network.

tactical intervention will be necessary in the future to completely ensure safety.


), but it knows very little about standard library functions it would be too much work to deal with each of these separately!

the user of PULSE can specify which library functions should be dealt with as (inward) side-effecting functions, and PULSE has a generic way of dealing with these (see subsection 5.3).


5.2 Solution 2: Workload-Sensitive Adaptive Control Since workload burst cycles may vary, any .xed-length DVFS adjustment period will remain vulnerable to antisynchrony.

a workload-sensitive adjustment method seems a better solution.


A more specialized link type constitutes a subrelation of the more general link type.

the ends of a more specialized link type must at least subset or rede.ne the ends of the more general link type.


That is, for an hour-long run, the amount of data generated is close to 150 terabytes.

the output data has to be managed carefully in order to avoid performance overheads.


In hardware simulation, despite the very high computation e.ort, better results are obtained in comparison with instruction simulation.

instruction simulation has been adopted by the majority of works in order to provide energy consumption estimation in a satisfactory period of time.


According to the concept of membership space in fuzzy sets theory, the value of the parameters should be in the interval [0, 1].

the ratio of the path s length of an instruction against the longest path in the whole DAG is determined as the instruction s P2.


However, in the LCA Review, when the detailed system design and the functional prototype were available, the assumption of avoiding the future rework after LCA phase was more applicable.

the real case scenario for Performance and Evolvability attributes in the DIMS upgrade project was closer to the worst-case scenario.


Basically, this is achieved by transforming each speci.cation into an implication based on the selection of the according feature (see Section 4).

even if two speci.cations contradict each other, the generated speci.cations do not contradict each other when the according features are alternative according to the feature model.


In this case, the spiller tries to schedule one load for those uses.

after spilling, a single load can service multiple uses of a live range.


Finally, when performing an OSR, we need to save the current state (i.e., the set of live values) of an executing function and restore the same state later.

the challenge is how to restore values while at the same time keeping the SSA-form CFG of the function consistent.


And the majority of energy is spent on idle listening, repeated packet sending and reception.

we can use the time of radio on as an equivalent metric of power consumption instead of using absolute power consumption in joules.


When op erationBis placedatcycle0 asshowninthe .gure,its outputis placed in the register write region.

the scheduler makes sure that all the edges coming out from operationB are success  Figure 14:Performanceevaluationof the baseline and CGRA Express architecturesfor three multimedia applications.Performance is broken down into non-innermost loop regions (sequential), inner-most loops whose performance is constrained by the availability of resources (loop (resource)) and inner-most loops whose performance is constrained by cross-iteration dependences (loop (dependency)).


When P2 enables A_A_E_R, however, the progression of its second epoch, meant for P1, is handled and completed out of order.

p1 completely avoids incurring the delay while P2 overlaps it with its second epoch.


And this does not take into account the heap space occupied by the boxed values themselves.

all things considered, miniboxing has a memory footprint larger than the monomorphic and heterogeneous translations, but smaller than homogeneous translations based on boxing.


for(i=0;i<Li;i++) s3 =s3 +X3[i]* X4[i]; s3 =s3 +X3[i]* X4[i]; } This transformation separates accesses to arrays X1 and X2 from accesses to arrays X3 and X4.

if the .rst two arrays are stored in a different set of disks than the last two arrays, this transformation can increase disk idleness, thereby leading to a more effective low-power management of the disk system.


Unlike the TA constraints that have only one goal state (the only accepting state), each property or non-TA constraint may have several goal states (any non-accepting state for the property and any accepting state for the constraint).

the distance from the current property state or non-TA constraint state to its goal state is also not a good predictor of the path length since multi-goals tend to make these distances indi.erently small.


6.1.2 TOMCATVperformance Performance of the Java version of TOMCATV is significantly lower than its Fortran counterpart because one of the outer loops in the program is not covered by a safe region.

no further loop transformations can be applied to this particular loop.


The use of such pure coordinators makes it easier to adapt a coordination policy in different applications.

the language air supports the methodology of com- ponent-based software engineering.


In a Datalog rule, negation is represented with the symbol ¬ and upper case letters are used to denote variables.

the previous rule states that the relation R is a binary relation between two relations S and T if the following conditions are satis.ed.


Even though it is possible that the fault is not caused by this specific node f, we can still take the delegation node to represent the fault origin as the fixed invocation correlation with this node for a specific logic of the test case and the modification traversing property.

we use the delegation node to represent the fault severity of one user interaction step by severity (f).


Some instruction sets, such as IA32, are not amenable to probing because of variable length instructions.

great care must be taken to ensure that probe-based instrumentation does not corrupt the original instructions.


There are potential risks with emailed questionnaires, such as lack of interest and time, and a low response rate.

structured interviews were used to increase the reliability of the data collected [1].


For instance, we could add declarations y1 : private u x1 : private t and legally assign y to y1 and x to x1.

the declaration (y : m t) is equivalent to the C language declaration (tm group(x) * private y) since all variables in the formalism are locals.


As a result, they would be distributed into different loop nests, leading to a loss of data reuse.

for effective loop fusion, steps 1 and 2 must be treated independently and there must be an effective cost model to determine a good pre-fusion schedule.


For loop B, all the three basic blocks can be locked.

the WCET of the optimal solution is (33*4+30*4+3*3+30*3)*10= 3510.


This optimization problem is exactly equivalent to the directed unweighted multi-cut problem, which is known to be NP-complete [1].

instead of .nding the optimal partition of a CFG into nodecuts, the Pleiades compiler uses a heuristic algorithm that works well in practice, as shown in Section 4.


This method has the advantage that the EA executes off-line (in the sense that it does not execute during the development of an application).

compilation time will not necessarily increase.


Each of the queries v, v +b1ui,...v +bq-1ui is uniformly distributed.

in order to prove that di is a Perfectly Smooth Decoder it is enough to prove that di(C(x)) = xi.


For both the target and the host computer, the intercommunication speed is much slower than the processing speed of the target computer.

the execution time is nearly equal to the intercommunication time or the data transfer time.


Any of the three system calls may block,interruptingforsome timethewholeprogram.

let forward in_fd out_fd buffer = let n = Unix.read in_fd buffer 0 1024 in Unix.sleep 3; let n = Unix.write out_fd buffer 0 n in () Thecoreideaofthe libraryistoreplaceapossiblyblockingfunction by a function that returns immediately a promise, that is a value that actsasaproxyfor thevalueeventuallycomputedbythe function.insteadoffunction Unix.sleep, one usesfunction Lwt_unix.sleep of type int -> unit Lwt.t where Lwt.t is the type ofpromises.Likewise, thefunction Unix.read is replaced byafunction Lwt_unix.read oftype file_descr -> string -> int -> int -> int Lwt.t Type Lwt.t can also be interpreted as the type of threads: the function Lwt_unix.read returnsa thread thatreadsfromagiven .ledescriptorand terminateswithreturnvaluethenumberofbyte read.Weadopt this interpretationfor theremainderof thepaper.


This is because we have to think of expressions and values as graphs and our rules as graph reductions: a free variable is actually a place-holder for a shared expression or value from the heap.

the heap state does not matter without a reference to it.


The choice of suitable architecture would be made by selecting a suitable operating system.

even though a software architecture does not realize the functional requirements from the application domain, it has its own functional requirements which would themselves have to be addressed through functional design.


The path from L1to L2 is taken only when the branch b1 is not taken.

when the branch b1 is taken, the branch b2 is not hinted.


Almostallthecodein fdlibmperformpure computation and makes no modi.cation to the Java heap.

thevast majorityofthe8,500linesofcodeis irrelevant for e.g., a points-to analysis.


The Screen Model resulting from our weaving approach will allow the designer to manually customize the UI at an appropriate level of abstraction.

our new Screen Model paves the way for a more powerful semi-automatic WIMP-UI generation as well.


the probability that node v is not informed at Step k of Phase 3 is (1 - 1/64)k = o(n -2).


When applied to the C++ grammar, Purdom s algorithm generates 81 test cases, only 7 of which are valid C++ programs [18].

it is necessary to consider alternative techniques to achieving the same result, i.e.


the index of the newly added non-terminal in the new grammar.


Let Costmig(u, v) denote the migration cost on a path from u to v. (The path will be clear from the context.)


INTRODUCTION Since the 1950s, composers have shown a growing interest in new kinds of music mixing electronic parts and live musicians.

computer music research and industry have focused on real-time interaction between musicians and computers.


Task a could block for many reasons, such as a deadlock due to incorrect thread-level synchronization.

a group of tasks B block in MPI_Bcast in line 11 while other tasks proceed to other code regions tasks group C, D and E block in code lines 15, 17, and 20.


As there are no rules to follow, some people might find themselves a bit lost when being new in a startup.

you might want to create NEW EMPLOYEE HANDBOOK.


When providing tools one should not forget that company processes are not just modeled for quality assessment.

also the daily work of the end users must be supported by these tools.


The algorithm for computing guards sequentially computes the guards for each of the blocks, starting with B1.

before synthesizing the jth guard, it has the guards .1, .


Additionally, variable addresses are cached.

a sequence of statements as given in Example 1(b) results in an internal data structure that links variable addresses to statement actions.


The event E(U2 ,S2 ,g) occurs only if S |= e =0, or ' ' ' S | = e =0 (hence S2 = S ' )and the event E(U ,S ,g) occurs.


In this paper, we choose algebraic high level nets [15] and linear time .rst order temporal logic as the underlying complementary formalisms of SAM.

next we simply introduce the algebraic high level nets used in our approach.


To enable epidemic data dissemination, PDI response messages are sent to the IP limited broadcast address 255.255.255.255 and a well-defined port, too.

all mobile nodes within the radio coverage of the responding node will overhear the message (Figure 1b).


Most of the business processes are required to work in the face of failure of their constituent parts [6], [9].

it is important to make composite services resilient to failure in their execution environment.


The high latency of the response (which currently reaches 30 minutes) is the major factor increasing the severity of the KPI violations and their direct monetary costs.

the major goal of the DEBS 2012 Grand Challenge was to investigate the applicability of the event process  Figure 2: System architecture under evaluation in the DEBS 2012 Grand Challenge ing systems to bridge the gap between the actual occurrence of the event causing a violation of a prede.ned KPI and the detection of such a violation see Figure 2.


In contrast to BlockFrequencyInfo, the other pass ScalarEvolution does not provide any other estimations for the block frequency.

as an intermediate built upon the training data (from the considered programs), which consists of a set of pairs  obtained from the other programs.


Frequent itemset mining solves this exact problem.

the target services to optimize are the frequent sets of services in the top-k hotspot lists computed for SCG instances.


Though the overheads in our VM are similar to other Java virtual machines, we are unaware of any concise review of these overheads in the literature.

we hope to help real-time programmers in understanding the costs of utilizing Java.


int * char,which would erroneously allow the application of the successor function to a character.

mLFintroduces another form of quanti.cation, called rigidly-bounded quanti.cation and written with an = sign.


Changes in the resources context are handled at the middleware level.

the response to resources context changes is an intra-level adaptation.


The WebElement.click() tutorial was only ranked 3rd because it is very common to click on some element only when a certain condition holds.

the two preceding matches contained calls to getter methods before click().


O.er interactions are independent since they do not share any port nor change a common variable.

the order of their execution does not change the .nal state.


Formally, we de.ne the simple adaptive program from program Pi to Pj to be the composition SAi,j = comp(Pi , Pj , Ai,j ).

we formally model an n-plex adaptive program as an EFSM that contains n steady-state programs P1, P2, ··· , Pn , each of which is an EFSM, and there exist adaptations among the Pi s. an n-plex adaptive program M contains the union of all the states, transitions, and initial states of n steadystate programs and the corresponding adaptation sets.


To other participants, this tool presented intermediate results for the E-Shop and OLIS product lines and better results for the Buyer agent.

we conclude from this data that the hypothesis H1 holds.


Furthermore, CnC is likely to .nd new and unusual errors, often idiomatic of a programming or design style.

it is interesting to use CnC to .nd a few potential errors in an application and then search for occurrences of these errors with a bug pattern matcher.


If this is the behavior of the tasks then there is room for reducing the frequency.

the tasks will hold the processor for a longer period of time, and the time slices will be better utilized.


In this case we need as much information as possible because, by the very nature of an exception handling mechanism, the signaller is not supposed to know how to handle it.

he cannot provide an exception that will handle itself, prohibiting the use of subsumption.


Unfortunately, the original MOI selection algorithm in Section 2 does not reflect this new finding.

we have slightly extended the algorithm as shown in Figure 16.


(x, y) belongs to the GR(1) class, then so does X (x, x x, r;y).

claim 3 .. provides an effective ( practical ) way for verifying that a given speci.cation .


Tool Support for Data Validation by End-User Programmers Christopher Scaffidi Institute for Software Research Brad Myers Human-Computer Interaction Institute Mary Shaw Institute for Software Research School of Computer Science School of Computer Science School of Computer Science Carnegie Mellon University Carnegie Mellon University Carnegie Mellon University cscaffid@cs.cmu.edu bam@cs.cmu.edu mary.shaw@cs.cmu.edu  ABSTRACT End-user programming tools for creating spreadsheets and webforms offer no data types except string for storing many kinds of data, such as person names and street addresses.

these tools cannot automatically validate these data.


Furthermore, if the generated applications are going to be used in different hardware platforms (e.g., desktop, handheld platforms) there is not a mechanism that allows generating the UIs in a way that takes advantages or avoids problems in the different platforms.

the application of the transformation profiles approach could be convenient.


For the method exportation, we use a generic SOA framework such as Web services (with SOAP/XML and WSDL).

all interfaces are opened to a network as a set of exported methods (i.e., a service), which achieves the above (A).


Also, many of these paths may be infeasible, i.e., there is no input to the program that can cause a particular path to be executed.

one usually attempts to aggregate paths to clusters or to operate at a higher level than individual statements.


Since a CIO is independent of any computing platform, we do not know yet which interaction modality is used on that platform.

each CIO can be sub-typed into sub-CIOs depending on the interaction modality chosen: graphicalCIO for GUIs, audi-toryCIO for vocal interfaces, 3DCIO for 3D UIs, etc.


;if e knows some of the seals k ' ' ' in s and k in s , it suf.ces to require (k,k ) .R .

our contextual equivalence subsumes standard contextual equivalence where a context knows none, all, or part of the seals (or, more generally, values involving the seals).


It can be veri.ed that the ec-language generated by this Mealy implementation ak SH((o1 SH(r1,b1p1))* , (o2 SH(r2 ,b2p2))*), where SH is the shuf.e operator.

this implementation corresponds to the case where the timing of sending receipt1 from Warehouse1 to Store is independent of the timing of the corresponding messages bill1 and payment1 between Bank and Warehouse1.


Note that due to possible circular dependency among the predicates, we can perform an unbounded number of substitutions.

we restrictthe numberof timesK RYSTAL applies the variable substitutions to two.


In the case of F'2, there are two source transitions with independent firing rates, hence there are two tasks, namely task21 and task22, the cedes of which are given in Tables 6 and 7.

in total there ere three concurrent tasks in the two process code for system 5'.


Equally seriously, no part of Daikon is particularly expensive; its slowness stems from many operations, not from expensive ones.

it is di.cult to .nd a good partition for Daikon.


For e.ciency s sake the study only considers recon.guration workarounds that change a single feature group; we set d in Algorithm 1 to one.

the simulation may wrongly classify failures as unavoidable and bias the data against our technique.


Speci.cally, when a process receives a Consensus Message(IV), it maintains a count of con.rmations for that IV.

it counts the number of witnesses of any state by counting the number of Consensus Messages it receives for that state s IV.


The Update Message Processing Time Tolerance (STi j) specifies the acceptable variance level by the server.

for given CMi jk and di jk, the server independently computes a Proposed Arrival Time (PAT) for command message CMi jk as follows: PATi jk = Ui + di jk + ERTTj + ESi j + RTTTj + STi j.


4.4 Decidability of Type Checking Type re.nements (F) in ..R can be elaborated to a conjunction of bind equations representing semantics of instantiated relations, and a .R type re.nement (f).

we have the following result: TH EO R E M 4.1.


Indeed, three criteria have been adopted to select these variables: relevance for the designers and developers, easiness to collect, and simplicity and consistency of the counting rules [7].

we used both the Length measures proposed by Mendes et al., for hypermedia and web applications, such as number of web pages, new images, animations, text pages typed, audioclips, etc ([15], [16], [17], [18], [19]) and other measures specific of dynamic web applications, such as Number of Server side Scripts and Applications, and Number of External references.


The overriding principle for the design of our Phi-predication ISA was to make register writing instructions always-write a value to the destination register when exe- cuted.

there can be only one potential value at a given time in the region for a given register use.


The barter for such a drastic simpli.cation is that we have to know about the N-representability condition [20]; otherwise, the calculated energy becomes much lower than the exact one.

for actual calculations, we just minimize under suf.cient conditions like P , Q, and G conditions [20], [21].


Evaluation of SRF mapping on Pentium 4: Stream programming converts the memory latency problem to a memory bandwidth problem.

it is important to optimize for memory bandwidth in order to map the SRF effectively.


Compared to other OS level page sharing optimizations we can use additional information about the caller of the alloc function and the knowledge where the R interpreter stores the frequently modi.ed object header.

we do not share the .rst page of the allocation (.rst page .ag in line 16) saving the time required for the page fault taken when the interpreter .rst updates the header.


If the coordinates of an event positively matches that of a pixel in a template (Figure 8), the chances of that template representing an actual feature in the captured subject are increased.

that template s score is incremented accordingly.


Proper value .ow is guaranteed for free because T untainted is a subtype of T but not vice versa.

untainted data can .ow where arbitrary data is expected, but not vice versa.


Thehierarchical structureof thegraphisbased on thehierarchical structure of the application s source code.

e.g., function bodies, loops, or conditional statements create new hierarchical levels which can be parallelized in isolation.


If the program is CPU-bound, our previous WATS scheduler [10, 11] can be adopted to improve its performance on asymmetric multi-core architectures by balancing tasks to asymmetric cores according to the tasks workloads dynamically.

the above limitation will not a.ect the applicability of DWS.


In GUMSMP, the role of the .sh delay value (inherited from GHC-GUM) is more aggravated, due to the role of the gateway HEC in mediating any communication to other PEs.

if the gateway HEC is in a delay period, it will not immediately send a FISH, even though the request is originating from a different HEC.


Now, when a cluster is formed, the register utilization of the kernel represented by the cluster is the sum of the reg values of all nodes and edges in the cluster.

to limit the register utilization of each cluster, we introduce the following constraint for each cluster Ci.


In general, it is about mapping validated ASSL specifications to Java classes by applying the ASSL operational semantics [3].

an operational Java application skeleton is generated for each valid ASSL specification.


.le create, be extensively customizable.

it gives rise to a family .le close and .le read; registry operations, e.g.


Indeed, for the sequencer, instrumental events are only triggers for electronic actions.

the only useful information is the position and the duration of an event.


Furthermore, we shift from few expert system programmers mastering concurrency for a constrained set of problems to mainstream application developers being required to master concurrency for a wide variety of problems.

high-level language virtual machine (VM) research faces interesting questions.


WorkspaceManager updates RefIndex files each time a developer commits his updates: link insertion results in new entries in the RefIndex files, while link removal results in entry deletion in the RefIndex files.

in order to repair links to a moved element E, first WorkspaceManager examines the RefIndex file associated with the model which is the source of moving (Msrc).


However, an important observation for the Visitor pattern is that, since each operation crosscuts each visitor class/aspect, adding a new visitable type to the existing class/aspect hierarchy will cause an invasive change to all of the visitors resulting in a maintenance nightmare.

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


If this commitment has any relation to the original ciphertexts, this means that we have broken the semantic security of the cryptosystem.

the commitment scheme must be non-malleable.


Patterns have to be searched not only in the GUI of the mobile application or in the interactions between the application and the operating system; they can also be found in the structure of the model that is created by GUI rippers.

three sources of patterns are considered: software (i.e., the presence of buttons, search forms, etc.


Then from (6.18) we conclude for random colour schedules MI and NI:  ) .Efind Prob E(MI(MI) ll = Prob(M) N.N (M,a,i).M(N) (6.20) ll e = Prob(N) · 1 - e N.N (M,a,i).M(N) (6.19) l e = k(k + 2) · Prob(N) · 1 - e N.N l e = k(k + 2) · Prob(N) 1 - e N.N e = k(k + 2) · Prob NI .N .

1 - e EfindII Prob (M) E(M ) ) .Efind Prob E(MI(MI) = Prob(E(MI)) e ) .Efind(NI k(k + 2) · Prob E(NI) = 1-e Prob(E(MI)) e EfindII = k(k + 2) · Prob (N) Prob E(N) .


There is a probability of at least d for all processes who run sharedCoin[j] to return the value j, and a probability of at least d for all processes who run sharedCoin[j] to return the value j +1.

for any value in {0,...,k}, there is a probability of at least d2 that this value is not the output of any process running sharedCoin[j], for any 0 = j = k - 1 (because j =0 may be the output only of sharedCoin[0], j = k only of sharedCoin[k - 1], and j .


In specific, a student that answers correctly many questions will aggregate more and more time to TTAC.

we hypothesized: H1: TTAC will have a positive effect on Actual Performance Total_time_answer_wrong (TTAW): We define TTAW as the total time that a student spends on viewing the questions and submitting the wrong answers.


This .ltering reduces the search space, rather than penalizing non-palindromes with a large cost.

the match algebra function does not need to check the characters.


Rather than combine the elements, they transform the elements.


Furthermore, independent of special language and platform, business patterns are suitable for expressing experts knowledge and defining terms of business domain.

business patterns benefit communicating between model designers and business users and make it possible for enterprises and software developers to reuse business knowledge and experiences in many projects as well.


According to the Tarantula suspiciousness formula, these statements have the highest suspiciousness.

the rank of the actual faulty statement drops when more failing runs are applied.


Thus extra[0] is reassigned a negative value as the result of the computation.

the test on line (**) which checks whether the menu .ts on the screen fails and the function tries to shrink the menu as much as possible.


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.


On the other hand, the Map computation in both Xeon-based and Atom-based nodes completely hides the Shuf.e for k-means, inverted-index, term-vector, word-count, and multi-word-count.

the Map computation is the critical path in these .ve MapReductions.


In the context of the method, this is readonly.

it is a type error for a read-only method to change the state of the receiver, and it is a type error for a non-read-only method to be called through a read-only reference.


This is a dynamic concealment technique that transforms all data into another mathematical space, while the program continues to maintain functional equivalence and correctness of the original program at all external points of contact.

only uservisible points of the program retain the original behavior.


Hu and Marculescu compared the advantages and drawbacks of the dynamic and static routing schemes, and concluded that static routing is more suitable for the NoC based systems due to its low cost, ease of implementation, and power ef.ciency [21].

in this paper, we employ static routing for all messages.


Our evaluation is based on four applications, chosen to demonstrate the programming model s capability of supporting applications involving different communication patterns.

we chose one molecular dynamics application (MiniMD), one application involving an unstructured grid (Euler), and two smaller kernels involving stencil computations (Jacobi and Sobel).


It is due to the fact that a named pointcut serves only to improve reuse of the pointcut expression.

the advices point to the same expression it used before and captures the same set of join points.


Page size 2KB OOB size 64B Block size 256KB(data) + 8KB(OOBs) Pages per Block 128 Page read time (Trp ) 60µs OOB read time (Trs ) 20µs Page write time (Tw) 800µs Block erase time (Te) 1500µs Endurance 5000 times ECC coding 4 bits/512B From Table 1, we can see that while we can ef.ciently read pages or OOBs (60µs for one page; 20µs for one OOB), page write and block erase operations are more time consuming (800µs for one page write; 1500µs for one block erase).

when designing FTLs, if we can reduce unnecessary write and erase operations, the system performance can be effectively improved.


Creating feature models and ICCL content The automatically extracted implications and options can be used to automatically create a feature model.

each merged attribute set, which contains components or bindings, is mapped to a feature.Parameter-setting attributes will not be part of the feature diagram.


If the minimized survivor space includes a segment group, then the GC can move the live objects to their preferred CPUs in the survivor space.

we need ten segment groups for the young generation in this example.


For instance, if h is of type int and t of type e(e(int)) then the type of [h|t] is e(intUe(int)).

after uni.cation l =[h|t] succeeds, l is of type e(intUe(int)).


Instead, we de.ne the type-theoretic invariant by lifting every single piece of Boolean information, and then we manipulate the resulting sets in type theory with logical operators on sets.

the invariant we de.ne is the following: invariant :: (a :: Set) |-> m (QueueI a) -> Set = a |-> mp-> let mf = mfst mp; mb = msnd mp in And3 (TM (totalLst mf)) (TM (totalLst mb)) (Or (TM (null mb)) (TM (not (null mf)))) Here, mfst and msnd select the .rst and second element, respectively, of a Maybe pair, And3 is de.ned similarly to And but it performs the conjunction of three sets instead of two, and Or is the disjunction of sets de.ned as data Or (a,b::Set) = inl (x::a) | inr (y::b) Finally, TM lifts a Maybe Bool into a set.


The subsequent analysis of data revealed that subjects heavily round off data when they have to record directly the amount of time they needed to make a decision.

subjects had to track their used time with two time registrations for each made decision in the presented experiment.


The resource utilization of a component also affects other  components that directly or indirectly use the same resource, e.g., through the component s services.

to enable modular resource optimization, the resource utilization of a component and the effect of a component s service on resource consumption must be explicit in the component interface.


For valid inputs of size 4 or less, there are only 372 inputs that demonstrate the error.

random testing has a 0.000009% chance of hitting the bugs.


This encoding is faithful, but it su.ers from a major drawback: it includes an axiom that requires all models of a formula to be in.nite.

an analysis based on .nite cases cannot be applied.


To create the corresponding RTP channel for signing the audio data, MjSip o.ers easy access to the SIP session setup.

the addMediaDescriptor() method is applied to add a new media descriptor to the SDP portion.


Since we implement the MATLAB lookup semantics, and allow the inclusion of the MATLAB path, our callgraph will automatically include available MATLAB library functions.

implementing more features will also bene.t users who do not make direct use of advanced features.


If pi and pj are re- questing different sessions, then PS will have to wait in Line 7 for p~ to change the value in turn~, which p~ wouldn't do until it leaves the CS.

pS will not be able to enter the CS before pi.


However, few of these studies have performed a comprehensive analysis of phase effort distribution patterns and its possible causes.

notable inconsistency exists in results from different researchers regarding phase distribution patterns even for the same development life cycle, RUP, as concluded in [10].


Choice of the dataset and quality assurance The quality of the data set is fundamental in the type of study reported here.

the next subsections illustrate the choice of the data set and the data quality assurance activities performed.


If the stack type is interpS SGCT s at some reachable program point, then obviously interpS SGCT s must be inhabited.

reduction of this de.nition must not have taken the False branch, so it follows that all the frame descriptors in s must be valid in the sense of checkFD.


However, communication latency of messages in a parallel quicksort algorithm increases only with increasing number of processors.

parallel quicksort su.ers less communication latency overhead than the all-to-all personalized communication present in parallel radix sort or sample sort.


2.2 OpenCL Platform on ARM Processors Our OpenCL framework targets multicore ARM processors in embedded systems.

the ARM processor acts as both a host processor and an OpenCL device.


In our scheme, the operating system becomes a manager of data .ows among the various peripheral devices.

it subsumes a role equivalent to that of a network switch a shift from the early-router design that was also driven by the need for higher performance.


This measure allows each benchmark result to be weighted the same, regardless of the number of functions executed in the program.

we can see from Figure 6 that a program-based search strategy requires only about 59% of the number of executions, on average, compared to those required for function-based searches.


With serializability, for any trace (oCr upt, we can change the trace to convert any open transaction nested inside a committed transaction from open to closed while still keeping the same p, and still be serializable.

in some sense, with serializability, open nesting only differs from closed nesting if an open transaction commits, but its parent aborts.


The size of a vector clocks is proportional to the number of sites in the group.

these algorithms are not appropriate for peer-to-p eer networks due to the huge number of sites constituting the system and the fact a site never knows all other sites participating to the collab oration.


Because some entries will cross cache line boundaries, even if the algorithm is correct it writes an entry in its new slot before overwriting the old slot the unpredictability of cache line write-back can still cause data loss on a power failure if the update to the old slot of the entry reaches NVRAM before the update to the entry s new slot.

we append entries in log fashion, at the end of each node s list of child pointers.


As discussed in section 2, the properties of traceability links determine several views over the links.

when showing all the links with a given source, we need to differentiate between the multitude of links types, as only some may be of interest to the user.


Name-based crosscutting corresponds to the literal expression of signatures and type patterns.

with name-based crosscutting the signatures and type patterns used in a pointcut must match those of the targeted join points exactly.


These candidate organizations cause either extensive resource provisioning or poor-quality operator mapping between logical work.ow nodes and the available physical resources nodes.

instantiating a media processing work.ow to the underlying hardware before the work.ow execution begins does not lends itself to adaptive and autonomous operation of the work.ow, scalable to resources and demand.


These tests stress the set of all feasible control .ow paths in the changed program of Figure 1.


In short, process seems to be a good candidate to organize a repository.

process orientation should be considered whenever a repository supports best practices.


Finally, z2 can reach y in P ' , following a straight trajectory that never leaves the closure of P ' .

lemma 4, applied with x0 = x, x1 = z1 and x2 = z, gives a di.erentiable trajectory from x to z,  which never leaves P except for the end point z .


Moreover, a number of available UPC benchmarks do not use the upc f orall loop structure.

the automatic static coalescing is not possible in many realistic scenarios.


5.1 Compilation Threshold with Single Compiler Thread By virtue of sharing the same computation resources, the application and compiler threads share a complex relationship for a VM running on a single-core machine.

a high selective compile threshold may achieve poor overall program performance by spending too much time executing in nonoptimized code resulting in poor application thread time.


Q3 was asked twice with two possible answers each time.

the correct answer score for each group was between 0 and 9.


as an extension of Featherweight Java (FJ) [7], which is a functional core of class-based object-oriented languages.

we model only a minimal set of features: classes, inheritance, .elds, virtual method invocation, this, and, of course, union types.


The number of locks in a CA tree is limited by the key range size.

it is not surprising that the CA trees seem to scale better with larger key range sizes.


As the result, the next fetched instruction is sys kernel suspend in the other kernel instance that is described in Figure 5(a), and the value of the variable of in resume becomes true .

the control .ow goes into the else block of the sys kernel suspend() function.


For instance, COMMENTS, MESSAGE CHAINS, and DUPLICATED CODE can occur with great frequency and also overlap the same location in program text, and so highlighting every occurrence of a smell may be overwhelming.

a scalable smell detector is one that displays smell information without overwhelming the programmer.


Rather, it is a template which produces an interface when instantiated with type parameters.

given any class C, the function iso(C)returns an instance of IsoC.


In addition, dimensional frameworks representation of culture tends to misdirect many researchers into believing that culture revolves around these predetermined dimensions.

researchers are inclined to explain any situation or behavior by .tting these dimensions to the situation or behavior, rather than attempting to determine other potential cultural facets that emerge from those speci.c data.


Since executions of an adaptive program may adapt within its set of steadystate programs in an in.nite number of di.erent sequences, the number of di.erent transitional properties is also in.nite.

it is impossible to verify each transitional property separately.


For a given set of real-time applications, we can analyze the required CPU utilization ui on the base machine.

the above requirement implies that the real-time service is guaranteed when the allocated virtual machine keeps providing ui ×mi amount of processing capacity by the deadline di.


In this paper, we use the term legacy applications with reference to applications that are characterised by some temporal constraints, but are not developed using a speci.c API.

developers of legacy applications contrive (or contrived) to achieve an acceptable timing behaviour by a large range of heuristic solutions (including a generous use of buffering).


RoomFinder In English, this states that when the TripManager service is in a .nalizing state (i.e., when .nalizing is true), it needs to commit transactions involving the processes bound to FlightFinder and RoomFinder.

when codingupthe TripManager service, the developer would write code to signal when a transaction should .nalize rather than write the communication code needed to implement TripManager s role in the commit protocol.


Moreover, a message is broadcast only to MSSs containing the group members which reduces the number of messages sent over wired channels.

bMobi Causal outperforms its counterparts with respect to communication overhead.


To be practically successful, SPL organizations must be able to take care of all dependencies, constraints, and requirements.

well-de.ned manageable processes that can be stopped and analyzed at any time become essentially important.


1 we know that every time p.wi eats, it sets havePingi to false.

when p.wi is scheduled for the .rst time after all ping messages from q.si have been received, it sets havePingi to false.


Due to the complexity of the context of a system, the context needs to be structured.

different structuring mechanisms are presented subsequently.


Without post-tokens, Macroscope is unable to extract the macro.

the Macroscope preprocessor expands empty macro bodies to a special placeholder token.


Neither UnionMod nor HashSetMod statically depends upon the other s interface.

hashSet is unavailable during modular typechecks on UnionModand unionis unavailable during modular typechecks on HashSetMod, so neither module s typechecks ensure that union properly handles HashSets.


We never get back to the blue star, since the collection of dotted paths is vertex disjoint from R1.

we get a walk starting from the blue star, and passing through the vertices r1,b1,r2,b2,... until we reach the red star.


4.2 Greedy execution of actions  In responsive applications, it is not feasible to defer actions until later input events resolve ambiguities.

we perform an action as soon as it is reached: The program in {} A, {} B, {} C out {} Z ( A() B() | A() {!>Z({});} C() ) emits a Z event as soon as an A event arrives, rather than waiting for the next event to determine which alternative should have been selected.


In modeling expected usage, all users are treated as average users.

although each application under test can potentially have many usage models (one for each class of users), one usage model was developed per subject application for the purposes of this work.


Branch merging is a variant of copy-modify-merge, but with merging done with another branch instead of the original codeline.

it has the limitations of copy-modifymerge.


A stage is a labeled elemental instruction in MedScript.

medusa does not de.ne an assignment operator, so variables can TakeVideo is a label for the stage described starting on only be instantiated from stage outputs.


(3): L .i aint (i) hss = = (7) a¯aux .i aaux(i) Our de.nition of hss deviates from convention because we reference it to power consumed by the HVAC rather than cooling energy produced by the HVAC (which we do not measure).

our coef.cient accounts for (1) the thermal resistance of the building shell material, (2) the building shell area, and (3) the COP of the air conditioner.


While the aforementioned objects only serve as placeholders, collection proxies are essential to detect changes in collections.

before each save call and after loading an object as the result of the search query, an instance of SqsCollectionProxy is inserted instead of the original collection.


The domain expert is responsible for creating the KB by providing a set of guidelines and informing transformation rules.

this professional must be an expert in the HCI domain in order to perform those tasks (the domain is not making reference to the knowledge on the domain of the system under development).


Nowadays this relation is hindered by the overabundance of information and events that characterize any environment, due to the pervasiveness in urban spaces of information technologies such as public screens and mobile devices.

the distinction between virtual and real spaces[3] becomes unclear and indeterminate.


In effect, each column contains the probability that a programmer Figure 2: Link topology (adjacency) matrix T  will follow a link from one location to another.

at the end of step 4, the proximal scent relative to the bug report has been calculated, reflecting the information foraging premise that links in the source with proximal cues close to the important words in the bug report will smell more strongly of the bug, and are thus more likely to be followed.


In addition, the translator preserves precise control information (with a few exceptions discussed in Section 6) 1).

for analyses that concern only control .ow [28, 12], the translator is sound.


A one-point crossover at a random position i is applied as recombination operator to create new individuals.

the .rst i of k functions of the .rst parent individual are combined with the last k - i functions of the second parent individual to create an offspring individual.


A more formal specification requires more knowledge of diverse areas like graphical design, interaction design, middleware communication, application interfaces, hardware-dependent loading times, etc.

a formal specification requires either people with knowledge in several areas, more people with different backgrounds, or guesses by the specification writers.


In particular, the order in which a point visits nodes in its traversal is unchanged, as is the order in which a given tree node is visited by different points.

traversal splicing can be performed in the presence of intratraversal dependences (e.g., if some data associated with the point is updated at each leaf node of the point s traversal) or dependences that cross traversals but stay within the same node (e.g., if a counter at each node is updated whenever a point visits the node).


Only transactions that modify values can cause aborts.

an execution where all transactions are read-only cannot be accelerated,but one in which transactions can frequently abort (because of con.icts due to concurrent writes) offer potentialopportunities for memoization.


3.1 s-COMMA models The s-COMMA metamodel de.nes the concepts appearing in s-COMMA models.

conform to this metamodel an s-COMMA model must be composed by two main parts, the model and data.


SCML preserves the location of the statements with the attribute named lineNumber.

besides the names of the program elements and a description text, the CACV error reports also include the line number of the statement(s) where the violation has occurred.


However, since in a pure DSL embedding all implementation aspects are encoded into the host language, domain syntax and static checking are restricted through the host language s syntactic .exibility and type system.

a pure embedding of XML with domain syntax and document validation as in SugarJ remains a distant prospect.


Generally, although coarse-grained changes can lead to higher impacts on system behavior, due to the high cost and low stability, they are more complex to be implemented and tested, particularly in large-scale systems.

.ne-grained changes seem more suitable for limited-impact adaptation changes.


Actual values for ED cannot be obtained for our object programs.

rather than calculate ED, we use Equation 3 to compare techniques (see the following discussion); this causes the value of ED to be cancelled out.


The compositional analysis stage uses the result of the parameterized data-.ow for each module.

the emphasis here is on handling most of the complexity in the modulelevel analysis and performing as little analysis as possible at the compositional level.


The contract checker applies the dependent contract to the original function s arguments before the function itself is applied.

the range portion of a dependent contract can determine key aspects of the state and save them in the closure of the resulting predicate.


Additional cores are not exploited most of the time in mobile devices.

improving the memory usage and execution performance of JavaScript engines by exploiting these additional cores will give the users better browsing experiences.


The cause of this shortcoming is the fact that traditional metametamodels (MOF in this case), in order to be generic, equate is-instance-of and conforms-to relations between the metametamodel, metamodels and models.

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


This helps to make Levels usable with lowpower applications.

the only increase in energy consumption can be attributed to computational overhead.


The difference between the response times we measured in the centralized and hybrid architectures (1676.9ms 1573.5ms) was small given this large standard deviation.

we consider the centralized and hybrid architecture response times as constant and interpret them to be the lowest reported value of 1573.5ms.


Size measures often coincide with shape information for data that is useful for verifying program properties by DML type-checking.

in many cases, DML types that express correctness properties of a program can be reused for establishing the complexity of the program.


Rather, the architecture was developed in the best possible way as described above.

the conceptual architecture approach, we discuss here, partially relies on hindsight.


The pro.le constrains its use to only periodic and sporadic activities.

the HRTJ pro.le proposes new classes: PeriodicThread and SporadicThread, which extends NoHeapRealtimeThread.


However, Java rejects the type SubList,?> even though the wildcard can be implicitly constrained to be a supertype of Integer with which the requirements of the type parameters are satis.ed (in our technical report we formalize when a wildcard can be implicitly constrained [15]).

java s implicit-constraint inference is incomplete and as a consequence types that could be valid are nonetheless rejected by Java.


The second heuristic, referred to as best noise , assume the bug occurs when a sequence of concurrent events accesses a specific shared variable in a specific order.

we thus assume that there is one good event, while the number of bad events is proportional to the program size (n), and this proportion is determined by a parameter c. at each 1 1 +cn execution we choose each event with probability: p = ,the optimal probability given by the model.


If we use a data structure as a seed and out as the coalgebra, we will just recursively split up a data structure and then recollect the results, meaning we get the original data structure back.

the re.ection law for data unfolds is [(out)] = id (7) There is also a fusion law for unfolds.


Finally, our scalability experiments indicate that our extensions add primarily constant overheads to STAT, which has run successfully with 212,992 tasks.

our formal temporal partial order is not merely interesting theoretically but is also an excellent basis for real, useful debugging tools.


However, in many cases the .nal output does not depend on the keys being sorted, instead just requiring that intermediate values be grouped by their key.

we allow programmers to annotate that sorting is not required for correctness of the program, allowing MrCrypt to choose deterministic encryption for the keys (which preserves equality, necessary for grouping values by key) rather than order-preserving encryption.


To provide strong security, the WebPod stores the session on an encrypted .le system.

even if the WebPod device is lost or stolen, an attacker will just be able to use it as his own personal storage device.


The overall efficiency of the code depends strongly on the efficiency of these codelets.

it is essential to have a highly optimized set of DFT codelets in the library.


That is, in these cases WISE .nds worst-case generators that prune away the entire search space except for a single worstcase execution path.

wISE s guided test generation is very ef.cient, producing worst-case executions for input sizes of up to 30 (and beyond) in only a few seconds and with a small number of constraint solver calls.


Also, ARIMA performs signi.cantly better without smoothing the time series (p-value< 0.01) but, again, the e.ect size is small (d=0.10).

di.erently from other applications, where smoothing turned out to be useful for time series forecasting [12], it is not the case here.


Figure 8: Search space size with register remapping, copy propagation compared to default (512 registers)  6.3 Combining Register Remapping and Copy Propagation Interestingly, combining our two techniques is able to further reduce false register dependences and the size of the phase order search spaces.

as shown in Figure 8, implicitly applying both register remapping and copy propagation after every phase reduces the size of the phase order search spaces by over 43.8%, on average, while marginally improving the best average performance by 0.57%.


The algorithm counts an increase of one on the load gain as equal importance to cutting a critical edge, as it will mean the cycle is so overloaded with work that schedule length must be increased by one.

the di.erence in system load is multiplied by the cost of a critical edge, which is currently speci.ed as 10.


In this setting, residual checks are performed by the client browser, which means that their ef.ciency directly affects the browsing experience.

to make residual checks as fast and simple as possible, we have designed our staging framework so that all residual checks are entirely syntactic, eliminating the need to do full-scale information .ow on the client side.


in the utility function, a service description for a desired service includes specifications of the service functionality, QoS dimensions and required QoS properties.

we have extended the OWL-S Service Profile ontology to provide machine understandable information on QoSdimensions and service level requirements to enable a qualityaware service discovery.


Any worthwhile endeavour involves having the right people doing the right things the right way at the right time [30].

people should be involved from different disciplines as they are crucial in translating their insights in technology innovation process.


So, for example, while Mac OS X provides an implementation of ptrace, Windows does not.

an implementation of the escape module for Windows would need to obtain ptrace s capabilities on that platform.


Finally, there is usually an interface for non-programmers, which allows them to define the new types of objects, attributes and behaviors needed for the specified domain.

we can say that the core patterns that may help to describe the AOM architectural style are: TYPE OBJECT, PROPERTY, ENTITY-RELATIONSHIP, ACCOUNTABILITY, STRATEGY, and RULE OBJECT.


The notion of a software component underlying this work arises from a widespread paradigm for formally approaching systems, design: the so-called model oriented speci.cation method, of which VDM [22] and Z [34] are well known representations.

software components are regard as state-based abstract machines which persist and evolve in time, according to a behavioural model capturing, for example, partiality or (di.erent degrees of) non determinism.


Contextual development also considers design to be a non-linear process based on activities (re)engineering work processes rather than performing traditional software-engineering tasks.

contextual development requires usage-relevant (re)presentation and execution mechanisms.


81 papers were initially judged to be relevant.

thedata analysisbegan with81papers,but some articles were excluded.


Then we cannot prove that Necessary .xed Necessary.

when analyzing P ' N we may not suppress all the warnings from P. In general, necessary conditions are more practical as it is easier to craft useful over-approximations than it is to craft useful underapproximations, though our framework can use either approach.


In order to simplify our infrastructure, we currently allow only a single trace to be recorded at a time.

if a nested context wants to start tracing, but an outer context is already recording a trace, we remain in pro.ling mode instead of entering tracing mode.


In terms of broker load, Renewal Wait has very little e.ect, since the Payword 120 1.5 100 80 1   Processing Cost (Hz) Storage (# proofs) 60 40 Processing Cost (Hz) 0.5 20 0 0 Renewal Wait (w) Renewal Wait (w) Credit Window (x) Figure 4: Peer load decreases as Figure 5: Peer storage (aver-Figure 6: Soft credit windows renewal period increases age number of proofs stored over have better broker load by actime) increases as renewal period counting for symmetric peer rela increases number of coins printed due to payment is far higher than the number of coins printed due to expired coins.

since broker load is una.ected and peer load is scalable, we recommend a relatively low Renewal Wait,such as 10 days in our application scenario.


We let the possibility to decrease linearly from the anticipated to the optimistic and pessimistic points.

the e.ect of each design alternative on each property is modeled as a triangular fuzzy value [14].


The data backup system uses the logical block s payload to determine whether it is a duplicate of some existing physical block (whose PBN is DPBN) in the data backup system.

backing up a logical block triggers the updates of the GC-related metadata of up to three physical blocks.


For example, unconstrained casting via void pointers, using ints as Booleans or the weak typing implied by unions can result in runtime errors that are hard to track down.

the unsafe features of C are prohibited in many organizations.


According to Claim 1, pj can change sessionj to a value different than 0 and s during this pe- riod at most once.

for an infinitely long interval of time, sessionj remains unchanged, and contains a value different than 0 and s. That means that pj is blocked for- ever in the Try Section.


Thisschedulingusesadefault chunk size of 1.

di.erent threads frequently modify elements of 2The slope of .


Older adults may not be uniformly open to robot assistance for all home-based activities but may prefer human assistance for some activities [15].

it is important to understand preferences for specific tasks and task demands.


If the stub required to form a route for a closing communication conflicts with the stub found for a previous communication then that stub will not be chosen and a route will not be formed.

all closing communications are ordered before all open or opening communications.


The union of Ei is not necessarily equal to E, because some copy edges might not be included in any Ei if their somcce and target ELRs in~ere or their inclusion causes an unde- termined iteration difference.

the set of copies is divided into two disjoint subsets: those inside some ELRs (Ci,) and those outside (Cost).


PCM stores data by changing the phase of a material called GST of which phase changes when adding electric current on it for certain time duration.

a write operation consumes large energy in PCM, while a read operation just requires sensing a resistance value on each cell.


Even though all the respondents emphasized architecture work as an important success factor for their products, they still seem to need to justify the time spent on architecting and associated architecture-centric practices.

aK knowledge is managed ad hoc or companies rely heavily on experience.


Maintenance involves updates to the software.

even if no new functionality is being developed, software teams must update legacy software.


Line 3 describes the constraints A .[4,8]B.

if the value of variable A is 1, then the value of variable Biseither4,5,6,7or8.


The key operation in computing  Ei is the merge operation over M step functions, each is of size O(ri|Ei+1|).

the time to compute Ei is O(Mri|Ei+1| log2 M) and the number of points in Ei is O(Mri|Ei+1|).


Involving Others Meta-Analysis No single study gives unequivocal results.

it is imperative that the research community integrates and compares studies that address common hypotheses.


While this creates an imbalance of operations on the shaded cluster, it actually has a better performance because the cluster resources can execute the extra operations in the same number of cycles.

the .rst pass data-partitioning path works more as a guide, viewing the entire program and dividing up memory usage for the more detailed computation-based second pass.


Hence, nodes i and j must belong to single MANET and the procedure, Coordinator Election at ori of Phase 1, chooses the highest priority (NW) node as coordinator.

either node i or j become coordinator of MANET.


Although 28% cause segmentation faults and 6.8% make a thread Timeout, all runs successfully complete the work due to the permanent fault recovery mechanism in FTWS.

fTWS provides 100% fault recovery coverage in practice.


It is important to note that while the number of contexts, or the number of call graph node instances, are exponential in relation to |I|, the number of BDD variables used to encode the contexts is logarithmic to the number of contexts.


Recall from Section 4, that when the initial set is a convex polyhedron, reach set computation involves computing this approximated .ow for each vertex.

in our experimental evaluation, we start from a single point, as this will faithfully re.ect the costs of starting from a polyhedron.


However, the speci.cation of 3D components with sophisticated behaviours and complex inner structures can become a tedious an error-prone work, since support for this task primarily exists on code level.

we present SSIML/Components, a visual language for the abstract pre-implementation speci.cation of 3D components.


Importantly, this change must extend to datatype speci.cations as well as datatype declarations.

a structure that exports a datatype must export its implementation transparently, using a signature similar to the one in the .gure otherwise a datatype inside a structure would appear to be generative outside that structure, and there would be little point to the new interpretation.


For example, only by method de.nitions contained in the same class as the .eld declaration; or also by methods de.ned in classes inheriting from the one declaring the .eld.

in this paper we report on the second prototype of a Co-op language and execution environment, Co-op/II.


Furthermore, they require special management skills and critical business decisions.

money and time can be saved if problems in the projects are detected early enough.


Thus, their contribution to the entire execution time becomes very small as shown in the above results.

we can consider that the overhead incurred by our virtual machine itself (the translation overhead) to be unproblematic.


Similarly, when we implement Figure 1(d), we would have to duplicate both the input and output code above.

input and output processing should be in separate objects, which are called controllers and views, respectively.


Consideringhardreal-timesystems,DVS needstobe adopted with caution, since catastrophicissues may occurdueto timing constraint violations.

several scheduling approaches, mainly based on runtime techniques, have been developed in order to cope with DVS in time-critical systems.


While traversal requires a small lattice, navigation requires a navigable lattice.

a combined strategy would work best on a small, navigable lattice.


On the other hand, in a .xed-time campaign, each epoch corresponds to a constant amount of time.

the number of fuzz runs completed may vary across .xed-time epochs.


Application The results of the previous section suggest that the EDFPTIDES scheduler is generally superior and the added complexity is not a seriousfactor, at least for our chosen hardware.

we use the EDFPTIDES scheduler in this section to implement theJAviator control, and we will compare it with non-PTIDES schedulers on the same application.


They are responsible to collect data and execute commands.

attackers will try to in.uence them by analyzing, tampering, and circumventing their software.


4 5 4 3 3 2 2 11 In the 03/01 dataset, when we query for outliers, most non-outliers are identi.ed after the .rst round of histogram collection, and the number of potential outliers is limited.

the cost of histogram collection is thedominantfactor compared with the raw data transfer.


We adopt the definition of XPath expressions in [21].

an XPath expression is defined recursively using the following grammar: q .


for these architectures it is beneficial to incorporate the cost of switching into the optimization problem.


Although numerous approaches to matrix completion have been proposed, few of them are designed for network applications where decentralized processing of data is appreciated.

we developed a fully decentralized approach based on Stochastic Gradient Descent (SGD) which is founded on the stochastic optimization theory with nice convergence guarantees [3].


3.1 Illustrative example Throughout this section, we use a concrete example from the eGovernment scenario discussed in the introduction to illustrate the proposed concepts.

we consider the example of implementing a national law that regulates subsidizing health care costs of citizens in The Netherlands (WMO law).


The de.nition of the constructors Process and Process-ElementEList are not builtin in the language, they are derived from the metamodel given in Figure 1 relying on the EMF Java mapping.

the syntax of patterns strongly depends on the considered metamodel.


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

the number of feasible paths in P is (roughly) the product of the number of paths in its functions locate and top.


This is also due to the fact that today there are few effective techniques for measuring testability and for improving the testability of large and complex software systems.

it is important to find engineering principles that will help architects in building product line architectures with high testability and hence enable easy and cost-effective testing of the reusable product line components as well as of the product line members.


In our two-pass elimination approach, algorithm PreElim is less complex and runs faster than the hybrid algorithm, because it reduces the time complexity of the inter-event constraint check from O(|s[E(k-1)]|)to O(1).

the performance of two-pass elimination algorithm is significantly better than the hybrid algorithm when the number of episodes is very large and the number of episodes culled in the .rst pass is also large as shown by our experimental results described next.


Since the OS doubles as the host, there is no redundancy between domains and resources can be optimized globally.

oS-level virtualization is relatively lightweight.


Both mentioned contexts require self-con.guring, self-adapting and self-optimizing solutions to deal with the changeable conditions which characterize their missions.

despite of their di.erent communication contexts, they share requirements.


Branching statements denote the only exit points of methods.

the issues of inline return statements and the determination of insertion points for postconditions are easier to address.


Effective Fusion and Separation of Distribution, Fault-Tolerance, and Energy-Ef.ciency Concerns Young-Woo Kwon Software Innovations Lab, Virginia Tech ywkwon@cs.vt.edu Abstract As modern software applications are becoming increasingly distributed and mobile, their design and implementation are characterized by distributed software architectures, possibility of faults, and the need for energy awareness.

software developers should be able to simultaneously reason about and handle the concerns of distribution, fault-tolerance, and energy ef.ciency.


We establish a middle-ground between two widely adopted families of approaches, update-based and operational-based.

the problems of each one are avoided, while retaining the advantages of both.


Finally N4 shows the number of modules that are predicted as FP and are actually FP.

n1 + N4 is the number of correctly predicted modules.


A view has no idea what the type variables a and b may be instantiated with.

the controller could contain code of theform case View.abortable (vd, 50000, fn (ab, ca) => Model.computation(ab, ca, md, input)) of (vd, md, NONE) => (* abortion occured *) ... | (vd, md, SOME v) => (* v is the computation s output *) ...  in which the controller starts the model s computation, but lets it be periodically (every 50,000 steps, in this case) monitored and potentiallyabortedby the view.


Which in turn helps in reducing step power and peak power dissipation [35].

it is clear that the proposed scheme is capable of reducing leakage energy consumption, transition energy overheads, as well as peak power and step power dissipation without a.ecting the performance.


tial [29] but its advantage, compared to the fractional representation, is that it can be fully simpli.ed.

lookup-table quasi-polynomials may be of smaller size than fractional ones (when their periods are small).


There are several reasons for this: First, service robots interact closely with humans in a wide range of situations for providing services through robot application components such as vision recognition, speech recognition, navigation, etc.

a well-defined robot control architecture is required for coherently and systematically combining these services into an integrated system.