The debug information is generated for the architecture independent byte codes.

the debug information in a class file is sufficient if the Java byte codes are only interpreted by a JVM.


Using such polytypic-function extension, a term borrowed from [14], it is possible to replace or re.ne the behaviour of polytypic functions at speci.c types.

it is possible to extend polytypic functions with cases for speci.c ADTs.


Performance measurements demonstrate the efficiency of Hoover s online monitoring and analysis, as well as its utility for adjusting Flume performance to current conditions and needs.

they show only a small increase in anycast round-trip times as the number of nodes in the Pastry-based monitoring overlay increases.


Our performance results represent a signi.cant improvement over that reported for LIFT [26].

our slowpath performance is about 3 times faster than their slowpath performance, while our fastpath performance is about twice as fast as theirs.


The bene.t of distance learning is that the learner can access information at their own pace and can continually reference recorded material.

in some models where lecture materials are provided through a recorded medium, students can pause, fast-forward, reverse, and replay lectured content.


We gave illustrations of how to use the tool for both schema and query evolution on realistic examples.

we considered typical situations in applications involving W3C schemas evolution such as XHTML and MathML.


The .rst contribution of this paper is a complete characterization of consistency for MTS with same alphabets.

a method for determining if two partial models have at least one common re.nement.


These four questions align with the traditional life cycle considerations of requirements, user interface, high-level design, and low-level design, but cast as design, we now know that there are some similarities to be expected in how they are explored, some unique aspects and challenges, but most of all a very strong relationship.

in light of the in-depth explorations that are frequently necessary, it means that designers will need to address the questions in parallel, for example already creating some of the architecture and implementation while still in the process of developing the requirements or interaction mechanisms.


In addition, Chord s multi-JVM mode offers less straightforward support API relative to the unisolated default mode.

program metadata such as class and method names is only available by accessing .les dumped from the instrumented JVM, making it more dif.cult to use.


Sequences may be treated as sets when the meaning is clear in context.

a sequence may be used as an operand to a set operation.


It is structured information that describes the characteristics of a particular resource.

it consists of a number of pre-de.ned elements that represent the speci.c attributes of a particular resource.


there can be a maximum of Tr - 1 active processes with annotation 1 or higher.

processes  with annotations higher than 0 cannot exhaust the resources.


In discussing the case with the students, it quickly became clear that they did not hold parsimony as a principle of modeling.

the students who learned of general and subsidiary ledgers did not ask, How can I capture these two notions in a compact model?


The reader may verify that, after this .nal step of the transformation, the program is reentrant.

the behavior of testFoo() and testBar() no longer depends on whether they are executed in isolation or not, i.e., testBar() passes even if executed after testFoo() or if the tests are executed in parallel.


We plan to conduct new studies where we manipulate the group prediction process regarding bias, previous prediction accuracy, background, and inter-correlation between prediction sources.

we will evaluate the performance of the strategies actually used by software professionals compared with alternative strategies.


For example, the relationship between Java source sf of program f and its bytecode bf is expressed by javac.

javac is a transformation that maps sf to bf .


Further work is planned in several directions.

harmony needs the refinement of its design and the completion of its implementation, which will allow us to validate the useful features of the environment and improve its functionality.


S ' performs an instru- If the instrumented semantics admits a particular execution, then not only is that execution reducible, but many similar executions are also reducible.

when an atomic block is being executed, the only scheduling decision that affects program behavior is when the commit operation (the transition from InRight to InLeft) is scheduled.


Furthermore, there are programming styles that can cause a given analysis technique to fail.

for example, while it is easy to recognize a two-dimensional array created in a single operation: double[] [] a = new double[m] [n] ; it may be more difficult to detect one whose creation is spread over many steps: double[][] a = new double[m][]; for (int i=O; i<m; i++) a[i] = new double[n]; the simple runtime analysis with the dense flag, described in Section 3.1, would fail on the latter code (i.e., it would indicate a nondense array).


d ::= f (x1,..., xn)= e Table 1: The language syntax In LJB-analysis, the graphs approximate the relation between the sizes of source parameters and destination arguments for each call to a function.

we record if it is the same size (=), smaller (.


Safety Quality Attribute Scenario Source: A request by the Ambulance Dispatch System Stimulus: A request for a spatial mapping for a dispatched ambula nce Artefact: Ambulance Dispatch System Services Environment: Runtime Response: Directions and routing information is provided Response Probability of a dangerou s failure is less than Measure: 10-4/hour  5.2 Replay and Adaptation When the recorded architectural process is replayed in the design of the new architecture, design mismatches occur at the second decomposition level when the safety aspects of the Ambulance Dispatch System are considered.

adaptation is required to deal with mismatches in the GIS service subsystem.


Ideally, it would build a term with a type that is somehow isomorphic to the type the quoted term has in the type system of the quoted language.

when we quote a term in core Haskell, it should receive a core Haskell type suitably lifted to Haskell.


When suspect versions are removed from a replica, the replica s knowledge must be updated appropriately.

versions that were previously known to have been superseded but are now the most recent innocent version of an item must be dropped from the replica s knowledge so that the replica will reacquire such versions during future synchronizations.


Most requirements prioritization methods involve examining requirements through the framework of benefit and cost [2, 12, 13].

requirements are analyzed on the basis of how much benefit that fulfilling the requirement will provide to the customer, as well as any costs associated with its implementation.


In it, one will find entries (in XML) that define all the assets of the app.

there are XML entries for each activity as well as others for various app characteristics.


Code should be modi.ed if the design is changed, and the design should be changed if the code is modi.ed.

bidirectional traceability between design and code is needed.


Thus, given that the target data generated by a mapping can be used as the source data in other mappings, it is natural to ask whether the same result holds when naive instances are considered as source instances.

it is natural to ask whether for every mapping M speci.ed by a set of st-tgds and for every source naive instance I1, there exists a target naive instance I2 such that rep(I2)= SOLM(rep(I1)).


A number of modeling languages have been proposed in the past.


Unlike the other test teams, FCT created their test cases from expectations raised by marketing material and product documentation, not from product design specifications.

if the marketing material or customer documentation promised that the product could do something, it was considered an acceptable area to test.


RT-FRP is given an operational semantics [29] that provides a well-de.ned notion of cost.

the size of the derivation for the judgment(s) de.ning a step of execution provides a measure of the amount of time and space needed to execute that step on a digital computer.


It creates a strong pointer to an object that may be collected otherwise.

if the roots were already marked and the object becomes reach- able directly from the roots, then the trace of the collection may not shade it, and the sweep may collect it.


For a variety of reasons, these data centers are typically located in different geographical sites, and connected to one or multiple ISPs at the nearby major Internet interconnection regions or Points-of-Presence(PoPs)1 .

the content servicedby alargecontentprovidertypically .owsfromone of its data centers through one of these PoPs to enter these ISPs, and is then carried to eventually reach various users.


This might be caused by the fact that RE diagrams contain too many details when compared with D diagrams.

rE sequence diagrams are twice as large in terms of messages when compared to D diagrams.


We can then model the Macro-Micro.ow Re.nement primitive by constraining the stereotypes.

if the refinedNodes tag value of a Microflow is not empty, the Microflow is a re.nement of another Microflow or a Macroflow.If refinedNodes of a Macroflow is not empty, it must be re.ned by another Macroflow.


We used Set 2 as the query data (about 12 million trips) to test our system.

for each trip t in Set 2, we produced predicted durations and fares for t using every predictor con.gured with various static or dynamic zones and/or time windows (c.f.


This results in the possibility to make different choices for the same execution path.

given the same controllable actions invoked, and the same input data provided, the application can react in different ways.


With regard to genetic diversity and fragment frequencies, it is clear that through the combined e.ects of inheritance (via crossover) and selection, the amount of shared genetic material increases during the run.

the genetic diversity of the population decreases.


Therefore, testing criteria focused on the object-program may provide a better indicator of testing quality.

the web application model contains several types of elements, whose coverage may represent effective testing requirements.


They are based on "mental models" of the user and the system.

(how each interprets the task, its components and the flow of information required to achieve it).


A software factory is then defined as an SF schema populated with the necessary software development assets.

to build a software factory, software factory developers need to define an appropriate SF schema, and populate each of its viewpoints with software development assets such as DSL (to allow models of that viewpoint to be constructed), transformation engines (to allow models of that viewpoint to be transformed to models or codes of adjacent viewpoints), etc.


We abstract a web application P :S * ,...,S * .S * as a mapping from user inputs (over an alphabet S) to query strings (over S).

p is given by {f1,...,fn,s1,...,sm}where fi :S * .S * is an input .lter;  si :S * is a constant string.


Suppose instead that we inadvertently insert only faults that do not change the functional coverage.


The theory already developed for the core languages readily extends to intensional code analysis.

it is easy to establish the new cases arising in the Substitution Principles (Lemma 1), Parametricity of Typing (Lemma 2), and especially in the Progress and Preservation theorem (Theorem 4).


On the other hand, for ParaMEDIC, there is practically no di.erence in the I/O time with increasing query sizes.

paraMEDIC is only minimally impacted by the limited I/O of the subsystem and it e.ciently distributes its computational resources across the system to achieve high performance.


The object specialization using a rolebased approach gives ownership transfer, however as a side effect needs the pointer exposure outside the ownership boundary.

in delegation, the delegator s this reference is exposed to the delegatee object [7, 5] located outside the owner (parent).


It is calculated as the product of number of unique faults found during an inspection (Dr) and the average cost to detect a fault in testing (ct).

.Ct = Dr * ct Finally, Cvt - Virtual testing cost, (i.e., testing cost expended if no inspections are performed) is the sum of the testing cost required to detect the faults remaining post-inspection (Ct) and the testing cost saved by inspection (.Ct) .


How to combine the elements of FM with testing and vice versa to get the best possible technological and business profits out of it?

we want to handle the problems of error, fault and failure detection as well as their mitigation.


However, there may be a substantial time difference between those two activities.

the probability that the activity of the developers is related to the same functionality would be lower.


The Eclipse platform is in the middle of the approach and it plays a pivotal role.

the Eclipse platform is involved in three main components: EMF, UML2 and Papyrus.


The reason is that if x changes too rapidly, the system cannot observe all these changes and respond quickly enough.

since in an asynchronous setting steps of the environment and of the system interleave, there is no way (unlike the synchronous model) that x and y can both change in the same step.


+ = 1 pl pi l=1 We know that el /pl =ul and WCRT WCRT .i= pimin1=k=n (pk) and so a system of tasks Ti in our system is schedulable if n WCRT .

ul + = 1 l=1 min1=k=n (pk) a task set that would be feasible under preemptive EDF (i.e.


Dealing with changes to the tree is an interesting problem that we have not addressed yet.

we have to make sure that the text positions stored in the annotated tree stay correct after an edit.


To improve this situation, we chose to associate hardware spectra with function invocations.


Based on the rules in De.nition 2, we can enrich a safety constraint with extra coordination messages and coordinators to make the decomposed sub-constraints consistent with the safety constraints.

rule 1 addresses the out-of-order messages by adding a synchronization message between two consecutive global tasks, (i.e., interactions) where the receiver in the .rst one is different from the sender in the second one.


The detection of such copy-&-paste code clones has been an ongoing research topic.


In fact, as reported in the JVM specifications [7], a constructor must initialize the super-class before performing any other operation on the object being built.

it is not possible to export the reference to this , using it as a parameter for any method calls, before the super-class constructor has returned: Failure to do so will result in a runtime exception.


Second, we reduce the set of supported applications to "uni-directional client-server".

we assume that NLPCs act as active clients only, and are not servers of any interaction 1.


To this end, it is possible to exploit the reasoner service provided by any Description Logic-based system that allows to query the ABox through a TBox-based description and obtain the set of individuals that satisfy such a query.

in Section 4.2 we show how it is possible to exploit an OWL-DL reasoner in order to extend the tuple matching mechanism of TuCSoN tuple centres.


This section contains an empirical evaluation of the different strategies.

we aim at answering the following research questions: RQ1: What are the effects of smart Budget allocation?


CONCLUSION AND FUTURE WORK This work establishes an explicit connection between testing and diagnosis.

the main contribution is the identification of a test for diagnosis criterion which is defined to ensure a satisfactory fault locating power for a test suite with respect to the studied diagnosis techniques.


As a matter of fact, the original code of the two threads wastes over 20% CPU due to improper sharing of CPU and long latency instructions.

with precise timing control of the threads, CPU cycle wastage is negligible.


Therefore, we adapt and generalize several notions and de.nitions.

our algorithm (see Section 5) considers constructor terms only.


Rather, allowing coercion from type A to type B should be a deliberate decision by the designer of B that in every circumstance that a function, method or operator expects an argument of type B, a value of type A may be used instead.

every instance of A should represent the same conceptual entity as some instance of B.


One of the benefits of SVG is that it is a managed graphics system.

a SVG graphics engine manages the entire state of the display itself, without requiring intervention or particular attention from the application developer.


Let Bd = {b .Bd : Fb = F} be the set of boxes F in the class that store exactly F. These sets partition Bd into sub-classes, each comprising boxes that store identical contents.

let the number of boxes B = |B| go to in.nity, while scalingboth the request arrival rates rc ·d andthe size of the subclasses BF d = |Bd to B. F|proportionally the quantitiesrc.d F/Bare constants thatdo notdepend on /B, Bd B as the latter increases.


In our modi.ed malloc() we also extend the memory allocator to aggregate blocks with the same classi.cation and to keep them page aligned.

data blocks with di.erent classi.cations are not permitted to be allocated within the same page.


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

both will evaluate to unit (an empty member ) faster.


The additional complexity over the similar rules of sections 2 and 3 handles the addition of .at contracts con taining recursive contracts, disjunctive and conjunctive contracts, and pair contracts.

to check disjunctive contracts, we must test if the left disjunct passes the contract, and branch on the result, whereas our earlier reduction rules for .at contracts simply fail for contracts that don t pass.


SYSTEMATIC REVIEW The systematic literature review was motivated by the lack of systematic guidance on the metrics, criteria, and metrics which security software architects require upon evaluating identity management architectures.

the systematic review seeks to provide answers to the following questions (i) what are the architectural primitives that secure identity management architectures should support?


So, a program using only user threads, would be fully deterministic and predictable.

the system guarantees a precise scheduling order for program using only user threads.


5.1 Address Space Reservation One of the biggest potential overheads of pointer compression is the need to keep the memory pools contiguous for indexed pools.

any pool must be able to grow in size as memory is allocated from it.


WS Binder: a Framework to enable Dynamic Binding of Composite Web Services Massimiliano Di Penta1 , Raffaele Esposito1 , Maria Luisa Villani1 Roberto Codato2 , Massimiliano Colombo2 and Elisabetta Di Nitto2 dipenta@unisannio.it, r.esposito@unisannio.it, villani@unisannio.it roberto.codato@cefriel.it, mcolombo@cefriel.it, dinitto@elet.polimi.it 1 2 RCOST University of Sannio CEFRIEL Politecnico di Milano Via Traiano, 82100 Benevento, Italy Via Fucini 2, 20133 Milano, Italy ABSTRACT The rapid di.usion of service oriented systems is becoming a reality in today s software engineering.

an aspect that is gathering the interest of researchers and practitioners is the possibility to create compositions of dynamically bound services.


For example, TCP NewReno uses a heuristic interpretation of duplicate acknowledgments to avoid timeouts, but it is widely accepted that TCP SACK (in Category 1) provides better recovery from losses [18].

we argue these extensions are impacted to some extent by the pressure of backwards-compatibility.1 Finally, the remaining six extensions in Category 3 inherently require changes to only one endpoint.


This view is enshrined in the design of the TCP/IP protocol architecture which has four layers, each playing a speci.c, well-de.ned role.

the application layer, at the top, remained agnostic about the details of the lower layers.


Notice, however, that both the pre-condition and the post-condition treat ehi s as if it represents a mathematical set of integers.

this is treated abstractly rather than concretely.


cJ, just like regular Java, does not automatically relate different instantiations of a generic class via subtyping.

in the Java and cJ type systems, an instantiation C is never a subtype of C for two distinct classes A and B, regardless of the contents of C or how A and B are related.


There are two types of analysis tools: static analysis tools that collect information about a program by studying its binary but without executing it (e.g., disassemblers and decompilers), and dynamic analysis tools that collect information from program runs (e.g., debuggers, simulators, dynamic analysis frameworks, and emulators [18, 34, 55]).

the development and availability of dynamic tools has strengthened the attacker s capabilities because many static protec  Term Notation De.nition Guest Application P The software application Protective PVM V A process-level virtual machine that has been con.gured to apply various protection techniques at run time.


Based on the pilot study, we revised our material according to the comments of the pilot tester.

we rephrased task descriptions that have been ambiguous to make them more understandable.


Thus, there is no cycle in G. Note that our termination algorithm discovers all the termination situations detected by the previous algorithms [3, 5, 8, 9, 10, 11, 12, 131.

the termination situations discovered by the Path Removing Technique [lo] and the Cycle Unrolling [ 1 l] are discovered by our algorithm.


Let us now consider a cumulative weight that contains weights associated with the subdomains belonging to an equivalence class IND(k)(e.g., k = 3 in our example, i.e., IND(3) = {f,g,h}), but not IND(k + 1), IND(k + 2), etc.

take any total order(e.g., total order  for Figure 1) and consider the cumulative weights for a given sequence of subdomains in the total order that reaches level k (e.g.,<b,a,d,c,e,f,h > for level k = 3) but go no further.


For consensus, a signi.cant e.ciency improvement has been established when considering the effective number of failures [5, 10, 15].

it was shown that for any integer f = t, any consensus algorithm has a run with at most f failures in which some processor decides not earlier than in round min(f+2,t+1), and there is an algorithm where all correct processors decide by round min(f +2,t+ 1) for all f [5, 15].


That is, si entails AF.I and AF.O includes some DCs which are not in si.

the AF can be applied in state si and applying the AF to si can produce new DCs.


The objective of this case study is to answer the two following research questions: [RQ1] Is F capable of leading to a ful.llment of the three objectives?

does the minimization of F results in a maximization of F1 (or a mininimization of (-F1)), a minimization of F2 and a minimization of F3?


Drawing on analogies from disk termi- nology, we refer to the set of all bits with identical values for  as a cylinder (shown in Figure 5).

a cyiinder consists of all bits that are accessible by any tip without moving the sled along the X axis; there are N cylin- ders per device.


However, prior research [22, 24] showed that NoC power consumption can be a signi.cant portion of the total chip power, making it an important target for both hardware designers and software writers.

scaling voltage/frequency of communication channels in an NoC * This work is supported in part by NSF Career Award #0093082, and grants from GSRC and SRC.


It should be noted that all other methods under that tool have been tried, each time with results similar to or worse than the ones from our sample.

the following methods had a TPR of less than 5%: Logistic regression, AD Tree, J48 (C4.5 decision tree), LMT (Logistic Model tree), KStar, and many others.


Unlike conventional disks, for which rotation speed is independent of seek arm positioning, the time required for MEMS-based storage devices to switch tracks depends di- rectly upon the access velocity (Equation 6).

because of their Cartesian nature, MEMS-based storage de- vices turn around each time a media transfer crosses a track boundary.


The other purpose of signaling is to aid in congestion control.


The same is true for triangular domains, see the example hereafter.

this tool should be viewed as a platform for the development, understanding, and exploration of mappings.


By the identi.cation of different business-logic layers (i.e., further structuring the middle tier) and/or introducing additional data access layers (i.e., identifying additional layers in the data tier), multi-tier architectures emerged.

modern middleware platforms with their provision of application servers for server side components (such as J2EE and .NET) and pre-de.ned data access methods through containers and standardized data access techniques (ODBC, JDBC, etc) support multi-tier architectures as an underlying technology.


The eu- tire analysis flow has been implemented within a prototype tooiset that we are currently using for validating and tuning the model parameters.

the obtained estimates on timing fits very well actual values, for a broad range of benchnmrks with & Ganssian distribution of the absolute rel- ative errors, whose magnitude is around 3-4%.


A simpli.ed description for the sake of this paper is that if a special rotating branch brtop is taken, the rotating registers are rotated, that is, RRi becomes accessible as RR(i+1)%n if there are n rotating registers.

brtop is the same as a regular branch br plus n copy instructions copying from RRi to RR(i+1)%n on the taken path.


As a result, existing implementations of IRMs for the x86 architecture restrict control .ow so that it can go only to the start of valid instructions of the subject programs.

control .ow to the middle of checking sequences, or directly to the instructions that those sequences protect, is prohibited.


The first option is to annotate the global variable using a SPARK annotation.

the global annotation can be added to the procedure that is using the global variable.


To support such demanding application types, significant progress is needed in the field of software engineering.

advances are expected in run-time frameworks and supporting tools.


f mapList · fromList we .rst decompose the list, then apply the polytypic map function, and .nally compose the list again.


More importantly, they also account for 90% of the total size of unique object B0.

2 only about 10% of B. comes from multiple-access objects.


kids (unroll ti)} As a subgoal, we claim that .xT kids p f :: TTest D is a WQO.

the union of all children of the minimal sequence is well-quasi ordered by .xT kids p f .


In both heuristics, each node n tries to cover K times each of the topics in which it is interested.

for each topic t in which n is interested, n tries to maintain connections to K other nodes that are also interested in topic t. The random and greedy coverage heuristics di.er in the way they choose the next neighbor, and are assigned di.erent coverage parameters Kg and Kr, respectively.


False Sharing For reasons of performance and simplicity, garbage collectors typically reclaim only entire objects, rather than reclaiming parts of objects that contain dead .elds.

memory management is done with object-level granularity.


elems(inputs(t, i)) and the input in is the last element of thehistory g(i).

ift(i)= res( , , in, ) theng(i) isapermutation of the sequence ofpreviousinputs at i and ends with theinput in.


Classboxes were .rst introduced with an implementation in Smalltalk [5] and subsequently formally described [4].

we were able to demonstrate that classboxes could be implemented ef.ciently in a dynamically-typed language with minimal run-time overhead.


First, we only show two simple return collection.get(0); utility methods returning the .rst element and the last element of an } iterable object (these methods are not part of the JAVA Iterable interface).

for the method last we have specialized class CLifo implements ILifo } and optimized implementations for speci.c iterable types (again, uses TLifo[hide old pop], inspired by the implementation of the Guava library).


24-0 Given these normalized preference functions, we then de.ned a utility function re.ecting the stakeholder s goals for optimizing the measured system qualities.

the stakeholder declared that it is 10 times as important to optimize throughput and to optimize memory usage as it is to optimize disk usage, since disk storage is becoming increasingly cheaper.


influenced nodes(m), i. destroyed dff(m) n useful dff(m, n) = Ø.

a node n is in.uenced by a destructive merge m when, if one of the data-.ow facts d destroyed by node m were to hold true at node m, then node n could be optimized.


However, we were interested in getting a first insight into what these definitions (and the related understanding) could be.

several questions used in the survey depend on the definition of variability.


Tools are built iteratively and adaptations should take place whenever de.ciencies are discovered.

however, of low interest for the tool user if the corresponding source code cannot be localized and modi.ed with low e.ort.


When making the tile selection decision the tiles, if multiple tiles have the same value of CV D (Algorithm 1) or CFT (Algorithm 3), we always select the ones that have the accesses to the banks in the memory controller with the smallest counter.

by exposing the bank-to-memory controller mapping to the compiler, for each L3 miss, we .gure out the memory controller (MC) that will be accessed.


5.2 Context locking To implement the event model in Mace programs, transitions are annotated with the context in which they expect to be executed.

transitions that expect to modify service state will be annotated with global, transitions that only read state will be annotated with anon, and transitions that are purely functional are annotated null.


113 prbocca@fing.edu.uy ABSTRACT One of the fundamental decisions in content networks is how the information about the existing contents is deployed and accessed.

there are two main alternatives, either to publish the information when contents are changed, or to search for the contents when a query is received.


This attention can be partially explained by the fact that diversity enhances and promotes the use of soft skills, such as teamwork, time management, negotiation, and presentation skills, both on the individual level and on the team level.

since soft skills are implemented differently by different people (according to the individual s personality and skills) and should be implemented differently according to the specific circumstances, no one person can successfully implement them all in the myriad of possible situations encountered in the changing world.


Thus we can represent the L-bit value xi as .k symbols from Galois Field GF(2L/.k ).

we represent xi as a vector Xi = [Xi(1), Xi(2), ··· , Xi(.k)], where each symbol Xi(j) .


We observe that incorrect parallelization can lead to violation of data dependences by the parallelized version, i.e., dependences enforced by the sequential version are not preserved by the parallelized version.

data dependence faults introduced during parallelization can result in data races and atomicity violations.


The trace represents only one of the possible choices that the program may have made at a branch point, and an assume must be added to the slice if along any of these directions something may happen that affects the slice suf.x.

an assume 1 modulo termination, see Section 3 for details.


there is no coupling between different parts.


However, the length of statements in program code differs; thus, the conventional LCS algorithm does not work well.

for short statements, such as if, for, and try statements, the LCS algorithm returns small LCS values for matching.


When considering AUC value shown in Table 3, for most of projects, the methods using redundant analysis performs better than the methods only using relevance analysis.

when using IB1 and NB as the classi.cation algorithms, the methods using redundant analysis obviously performs better than the methods only using relevance analysis, except for KC1 project.


Beyond advanced optimizations, different implementations of the deployment interface can also provide advanced features such as synchronized or transactional aspect deployment.

the meta-model serves as the interface between AO compilers and execution environments, hence, decoupling the front-end from the back-end of an AO language.


Approach Overview Our approach entails raising the level of abstraction when porting GUIs.

our goal is to manipulate a GUI model whose abstraction level is higher than that of the underlying source code.


As evidenced by Figure 3, this paper uses automatically generated tree models to describe the trends in the data sets.

we use the recursive partitioning algorithm [1] to determine how the explanatory variables (i.e., greedy choice metric and regression testing technique) impact the evaluation metrics.


Only when all tokens are available on the fork can execution proceed, with objects o1 and o2 moving to node sd2 and objects o3 and o4 returning to node sd1.

a fork is used to synchronise the objects associated with the edges it cuts accross.


A perfect graph, is so-named because it is one for which a perfect modularization exists.

it is possible to cluster the modules of the graph in such a way that all modules in a cluster are related to all other modules and there are no extra cluster relationships.


Typically, the selection problem is formulated to push as much computation as possible onto the accelerators, while minimizing overlap between subgraphs.

given a set of enumerated subgraphs, .nd the group that covers the largest portion of the DFG while minimizing the number of nodes appearing in multiple subgraphs.


A growing body of empirical research has examined large, successful open source software projects such as the Linux kernel, Apache web server, and Mozilla web browser.

evidence suggests that, rather than eliciting needs from users, documenting those needs in a speci.cation, then analyzing and validating the speci.cation, open source developers frequently assert the existence of requirements, sometimes by supplying a complete implementation [29] Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page.


In order to be usable, the transformation process must be fast enough for the user operations.

it is critical that modifications of the source document or the transformation sheets are reflected promptly to the user.


In this paper, we describe an approach for using the UML to specify aspects of the static semantics of programming languages.

we describe a tech- nique for solving the name lookup problem for the recently standardized C++ programming language[3].


2.1.1 Replica Management Replica management involves creating or removing replicas at a data grid site [19].

the role of a replica manager is to create or delete replicas, within specified storage systems.


To make sure any alias between them is detected, we must let r(a, i) = r(b, i + d) .i.

(4) lifetime a(i) needs to be placed in the same register as b(i + d) or in a lower-indexed register than b(i + d).


In order to introduce our requires constraint, we take as example the Jelastic PaaS.

we use the following speci.cations from the Jelastic documentation2 that have to be expressed in the Jelastic fm (see Fig.


While many e.ective improvements to CMPs have been proposed, many optimization opportunities are lost unless speci.c characteristics of the application(s) running on the system can be leveraged.

the lack of information about characteristics of a running application such as data access patterns, communication behavior, memory usage, etc., typically results in a more generic but less e.cient method for utilizing on-chip caches, interconnect and coherence directories.


The work is primarily focused on the distributed maintenance of log tables, which are used to achieve atomic transactions (another common technique for fault tolerance).

they use cryptography to protect against forged messages from attackers trying to disrupt these logs.


For a vector fa=[a1 a2 ... am]T , where each element ai is a subset of I, we de.ne fa=.kak.

fa forms a set union of all the iterators present in fa.


Therefore, it o.ers a unique solution to .nd actual con.icts that uses the most accurate detectors of integration problems, i.e., compilation and testing.

developers may use tests to detect con.icts that are very hard or undecidable via algorithmic analysis [9].


Given any instance that is MC-schedulable upon a unit-speed processor (by Theorem 1, determining this fact is NP-hard in the strong sense), OCBP successfully schedules it in polynomial time, upon a proces v  sor of speed ( 5+1)/2 (i.e., 1.618).

a processor speedup factor of approximately 1.618 is su.cient for OCBP to deal with the intractability (NP-hardness in the strong sense) of MC-schedulability.


In most cases, one and only one mapping with a high confidence level will be found, and thus the mechanism will be transparent to the user.

an appropriate structural view will be displayed without user interaction.


The idea is simple: instead of de.ning two type arguments to be related only if they are the same, allow any two different type arguments to be related by an (almost) arbitrary relational interpretation (subject to certain admissibility constraints).

we parameterize the logical relation at type t by an interpretation function ., which maps each free type variable of t to a pair of types t1' ,t2 ' together with some (admissible) relation between values of those types.


Subtyping hence allows a great amount of .exibility with respect to composing modules.

it is robust against extension or re.nement of a module interface.


Eitherway, OPT cannotincurmuchsmallercoststhan MIG.

by using MIG for moving to good locations in the network, a possible of.ine algorithm that migrates less frequently cannot have much lower access costs than MIG; on the other hand, an of.ine strategy with frequent migrations will have a cost similar to CostMIG mig.


Thus, the total aggregate time Ti cannot exceed Ti m-1 +Tmax , i.e., Ti =Ti m-1 +Tmax .Since, Ti m-1 <Qi, Ti <Qi +Tmax .


printOrc :: Show a => Orc a -> IO () printOrc p = runOrc $ do x <-p liftIO $ putStrLn ("Ans = " ++ show x) for each value x obtained from the Orc computation p, print a line displaying the answer.


In terms of attitudes toward robot-specific assistance, within the healthcare domain, Broadbent and colleagues [4] have shown that older adults were more positive toward healthcare robots than family or staff.

all participants reported the healthcare robot would be most useful in detecting falls and lifting heavy things.


To reduce .uctuations in the values of dependent variables caused by randomness (e.g., the random seeds used by solvers to return a solution), we evaluated each combination of the independent variables 10 times.

for each subject system, we executed each of the algorithms with the same number of assigned cores 10 times, and we measured the resulting execution times.


Then the group action of Gon terms of rank n is de.ned by induction, and every term of rank n has a .nite support.

the set of terms of each rank n is a nominal set and we may meaningfully speak of its .nitary subsets used in the set()construct.


i=1 j=1 k=1 Mixed random walks: it is intuitive and natural to consider a hybrid design that constitutes more than one of the aforementioned random walks.

the interaction and similarity-based models rank different nodes differently and locally assign weights to them.


Leakage aware scheduling has been recently explored on DVS platforms, such as [3, 9, 10].


An incorrect output, known as a fault or a defect, is any output which does not match the value and timing explicitly specified in the behaviour.

we define defects implicitly rather than explicitly as in [6].


In this context thread placement refers to an instance of the scheduling problem where a scheduler decides how to space share the hardware among threads.

the threads which are to be run on the machine are assigned, i.e., mapped, to speci.c cores.


The reliability of such network is fundamental for the whole IC s behavior.

when the clock speed grows it may become sensitive to faults such as delay and transient faults affecting the buffers, or crosstalks.


In [4], the author propose C-based design patterns for embedded systems.

the author de.nes two patterns for deadlocks avoidance (Simultaneous Locking Pattern and Ordered Locking) for embedded systems based on C language.


That contract uses the form dsl from to add the player spec contract to the block argument to initialize.

dsl from is just like dsl, but instead of taking a block de.ning the DSL-sublanguage, it takes a instance of RDL::Dsl.


The fundamental di.erence between the two systems is that a Dryad application may specify an arbitrary communication DAG rather than requiring a sequence of map/distribute/sort/reduce operations.

graph vertices may consume multiple inputs, and generate multiple outputs, of different types.


The composition model supports a one to many publisher/subscriber relationship among presentation components.


INTRODUCTION The architecture of a software system plays a crucial role in the system s lifecycle since it guides its evolution and maintenance.

the software architecture is a means to cope with the inherent system complexity and to coordinate di.erent maintenance tasks (e.g., assigning the right people to the right problems or planning and monitoring the activities).


Thus, observed bounds on waste and completion time may actually be smaller than the theoretical bounds we have proved.

in this paper we proved that the waste is at most a constant factor of the work.


The algorithm above, in order to compute a relation R in an equation system with R = B in it, essentially tries to .nd a .xed-point by starting with interpreting R as the empty set, and in each round replacing R with its current interpretation, evaluating the remaining equation system, and substituting those relations in B to obtain the next interpretation of R.  The Tarski-Knaster theorem says that the above iterative algorithm will always converge to the least .xed-point of the relations, when all the expressions are positive.

there is a smallest interpretation for each of the Ri s that satis.es all the equations in the system, and the above algorithm computes it.


A solution to this problem is to use a more expressive scoping strategy for the security aspect [30].

we want to deploy the aspect in the maliciousApplication with a pervasive scoping strategy [31]: AS.deployOn(securityAspect, maliciousApplication, pervasive); In general, a scoping strategy speci.es how an aspect propagates along the call stack as well as in newly-created procedural values (objects and functions in JavaScript)5 [30, 31].


Thus, composition of actors remains associative, as it is with SR. Of course, this execution strategy does not guarantee that time will advance forever.

by invoking .reAt with su.ciently small time increments, any actor may block the progress of time.


However, keep in mind that by virtue of rank generalisation we perform the one-dimensional transform in parallel on all vectors of a cuboid.

if we apply fft3D to a 64 × 64 × 64 cube, then fft1D still operates on 64 * 64 * 2 = 8192 complex numbers in one parallel step at the base case, where n =2.


We have veri.ed for these projects that they essentially implement or test large frameworks (such as ofbiz.apache.org).

these outliers embody large numbers of self-calls for a large number of API methods.


In addition, in the proposed scheme clustered nodes have priority over single nodes.

as soon as the scheduler has scheduled all producers of a clustered node, that node is immediately scheduled regardless of its height in the clustered DFG.


Conclusions In this paper, we presented our experiments on design pattern discovery from open-source systems using our tool, DP-Miner.

our experiments discover the Adapter, Bridge, Strategy, and Composite patterns from the Java.AWT, JUnit, JEdit, and JHotDraw systems.


This off-line analysis of collected .les cannot reproduce the experiences of real users, so we are designing a study to examine the reactions of users to SEMINAL s suggestions.

we intend to run a controlled study that evaluates different ranking strategies and SEMINAL s messages compared to the underlying type-checker s messages.


6.1 Effectiveness of Parallelization Our results indicate that speedup can be realized for all systems.

for NPW in the range of modern multi-core machines (2, 4, and 8), the % maximum speedup is relatively high for most systems, with many observed values higher than 90%.


Another significant advantage is the ability to regulate and harmonize operating modes.

working on a pure communication model ensures that business processing always takes place in the same location and that the role of OpenDataServer is exclusively to send data to the calculators.


27 loop think; eating := true; eat; eating := false; end concurrency eating ~ left_fork ^ right_fork However, there are also a few critical differences.

the abstract, descriptive assignments to eating become explicit concur- rency control statements in Linda, and more importantly, they refer to implementation details regarding the topology of forks rather than the abstract status of the computation (i.e., thinking vs. eating).


INTRODUCTION Content Distribution Networks (CDNs) have been introduced and extensively used in the Internet as effective solution for improving the performance of content delivery by means of coordinated content replication [1].

a CDN manages a geographically distributed set of surrogate servers, located at the network edge, that archive copies of identical content, so that users requests can be fulfilled by the optimal surrogate servers.


In this paper, we will discuss what we consider major ingredients to an approach that is able to derive long-term stable architectures.

we will discuss the concepts of an approach, which we call a conceptual architecture, and we will discuss the application of this approach in a large-scale industrial case study in which this concept was used.


To setup the needed environment variables inside the active shell, source the script bin/setup.bash from the KESO root directory and ensure that the script does not re port any errors.

the JDK environment variable needs to be set to the installation directory of the JDK to be used prior to running the setup script.


Lamport's fast-path code sequence also has implications for research on time complexity lower bounds [4, 5, 14].

for many synchronization problems, this code se- quence implies that one cannot simply focus on contention- free program executions when trying to establish a nontrivial (i.e., nonconstant) lower bound on time.


Discussion: Even though males and females had equal tinkering opportunities, these results show trends towards opposite effects of treatment on gender in the Low-Cost treatment.

we found a surprisingly large effect of treatment number of tinkering instances.


we cannot use this implementation variant to create stacks according to all seven feature compositions speci.ed.


Constructive query containment is aimed at building a counterexample that shows that containment does not hold for the given pair of queries.

the containment test of Q1 in Q2 denoted will fail, if there is a consistent instance in which the2Q .


Instead, it must be regarded as the outermost composite of all components and sets up the context for the global version space.

the scope of the current version is at the project level.


DISCUSSION AND FUTURE WORK We have presented an economic model of user behavior in P2P systems and derived some useful observations.

a mechanism that penalizes free-riders can improve system performance by reducing the cost placed on contributors.


All applications are portable across CPU and GPU devices.

we can run the applications either on CPU devices or GPU devices without any source code modi.cation.


It is worth noting that in this copyon-write scheme, if a node is only read by a speculative thread, it will never have an entry in the mapping table.

all mapping entries contain nodes that have been modi.ed by the speculative thread.


Hart and Saunders (1997) asserted that once an organization adopted EDI, it would decide to extend the use of EDI based on the degree of trust between business partners.

when the degree of integration between business partners is increased, business partners can access information that was not available or accessible  3.2 Power The resource dependency theory of Pfeffer and Salanzick (1978) is also applicable to the explanation of EDI implementation.


But this goal raises a critical question: accurate with respect to what?

what is the execution model that we want the trace to represent?


We also assume that all the necessary components can be either (identi.ed and) constructed from scratch or retrieved from an existing repository.

of the standard CBD life cycle [10, 11, 24] (which contains a component development process and a system development process) we focus only on the system development process.


However, if the question is how to improve on current practice, the same implementation would probably be completely unsatisfactory as the sole evidence.


One way to ensure type soundness in the presence of side e.ects is to give type abstraction a call-by-name semantics.

apolymorphic expressionmustbe reevaluated every time it is specialized.


Therefore, we transform constraint (2) into a theorem to be veri.ed by a SAT solver.

instead of verifying that every legal composition ful.lls the composition constraint of feature R, we verify whether there is a composition that is legal for a feature model but that does not ful.ll R s constraint.


The subtyping relation = captures the fact that a scenario in which a task has been released but not yet terminated is worse in terms of CPU utilization than one in which the task has not been released.

t. can be scheduled if T is schedulable.


One approach to reduce the overhead of runtime monitoring is to utilize the recent advances in the many-core architectures.

the monitor works along with the program in parallel and evaluates a set of properties.


Figure 14 shows the 10th-percentile performance of the entire set of nodes and high contributors across each trace for Cont-Aware and Cont-Agnostic.

90% of all nodes see better performance than the numbers presented here.


For positive scenarios, we can specify both mandatory and provisional behaviors.

it is possible to specify that the run of the system must or may continue to complete the described interaction.


For the former, we desugar an XML schema into a set of Stratego rules that traverse a given XML document to check whether this document conforms to the schema.

we generate a type checker for each XML schema.


(i) The MA has visited all the remote servers in the region that contain the requested information.


As shown in Figure 1(a), there are nine jobs in the hyper-period3 , and the scheduling decision is made 10 times.

there is only one preemption in this case.


This paper addresses the adaptation of a telemedicine system to support the teletreatment trial, with a focus on the early redesign phase.

this paper discusses how to elicit requirements in the domain of telemedicine and presents the assessment of the requirements in respect of their importance to the trial and the feasibility of the corresponding adaptations within the trial project constraints.


In fact, the main insight of LC is, to us, the idea that the introduction rules in sequent calculus of negation, taken as a connective, hide cuts.

the following focalisation steps have to be performed during cut-elimination in classical sequent calculus, when p is not simple enough (i.e.


Quoting from [12]: "If the problem's flow functions are distributive, the derived demand algorithms provide as precise information as the corresponding exhaustive analysis."

if the flow functions are not distributive, the demand-driven anal- ysis might return results that are less accurate than the ex- haustive analysis.


Among the main advantages of using ontologies are their reusability and shareability.

the ontology used in this study is based on linked open data and stores its contents in RDF format; as a direct consequence it is interoperable [1,13].


TRUSTWORTHINESS ASSESSMENT 3.1 Unreliable Data The presence or the absence of an aPOI (as a barrier or a facility) can be evaluated by one or more sources and the system has to cope with the availability of multiple data, produced by sources with different levels of trustworthiness.

starting from the whole set of reports related to a specific aPOI, mPASS has to decide if there is a barrier or a facility, what type it is and which characteristics it has got.


In our analysis, for example, some feeds .ll the pubDate element with the fetching time.

although the actual contents remain unchanged, the element keeps changing each time a document is fetched.


Our approach to such problems is to use a process definition language with semantic features such as abstraction, concurrency, and exception management.

we used the Little-JIL process language to define PDGs, using our experiences to help evaluate the importance of various language semantic features.


Software faults are essentially due to design problems, hence in order to provide means to tolerate software faults diverse design can be exploited at several levels, for example requiring hardware redundancy as well.

diversity is to be applied where other forms of guaranteeing the absence of faults are not in place.


The more fundamental question is whether the 20 data sets in MiDataSets cover mostof the spacebuiltupby the 1000 data sets.

do the 1000 data sets cover a much broader spectrum of the data set space to justify its usage over the 20 data sets that were previously collected?


This observation allows .le allocations to be organised so as to achieve product-forms, facilitating simple quantitative analysis.

since the number of free input probabilities is n(n - 1) - n(n - 2) = n, which is the number of inputs that do not fork, one strategy is to choose the non-forking input probabilities in any way desired, for example proportional to the rates of the corresponding disk drives.


This paper, in contrast, explores the possibility of performing register allocation for programs in Static Single Information (SSI) Form rather than SSA Form.

we prove that the interference graph for a program in SSI Form is an interval graph, a subclass of the chordal graphs.


With more processors contention is higher, and the system loses responsiveness.

task switching, with movements of contexts and stacks for many applications from and to shared memory, generates consistent traf.c, even with a cleverimplementation of the algorithm that limits switching only when necessary.


The main principle underlying many routing algorithms is to build a distributed data structure (implemented by means of a set of distributed routing tables) suitable to provide route information.

this data structure creates paths in the network enabling agents to forward messages in the right direction.


The practical use of a visual DSL is reported by Karaila [12].

the evolutionary history is described and a supervised evolution process is considered a requirement for successful language development.


tion, data distribution, and fault-tolerance [65, 66].

analysis and rewriting of the query plan allows FayLINQ to automatically derive optimized code that runs within the .nite space and time constraints of simple probe processing, and can be used even in the operating system kernel.


where MEMOENTRY : (ans : AST, pos : POS) MEMO maps a rule-position pair (R, P) to a tuple consisting of the AST (or the special value FAIL1) resulting from applying R at position P, and  the position of the next character on the input stream.


From collective experience at Cisco, using the time window (as shown in Figure 1 of Section 4) to guide scoping of the goalsetting discussions has shown to be an accurate way of viewing the team s status.

cisco managers have found that using a time window for goal-setting is more advantageous than tracking failures by individual features and branches because a time window accounts for the entire team s activity (e.g.


Towards Early Emergent Property Understanding Merging Behavior Space Exploration and Model-Based Software Engineering Georg Hackenberg Technische Universität München Boltzmannstrasse 3 85748 Garching b. München, Germany hackenbe@in.tum.de ABSTRACT During early phases of complex systems engineering typically many structural and behavioral aspects are unclear.

when it comes to constraints on the result of interactions between distributed components (emergent properties) current software engineering approaches provide limited support.


A sequence pointcut is a sequence of messages to be matched against in the base sequence diagram.

the aspect will only apply if a collection of messages are found to occur in a particular order.


The bottom two instead incur a preemption interval before each idletime request in a burst: (bt)+ I (BPI )+ .

the top two variants are strongly work-conserving for idletime requests once state B is reached and idletime use begins, whereas the bottom two variants are always weakly workconserving for idletime requests.


Different jobs of the same task (e.g., decoding I, P, and B frames) may need different amount of cycles.

the instantaneous cycle demand for individual jobs changes largely.


Intuitively, the problem arises because there exists an in.nite number of vectors which have the same lexicographic ordering.

the order is invariant to translation of all coef.cients of .


An implementation of I is downward compatible with all the implementations of interfaces that I extends.

any implementation of I can be used in place of any implementation of I. .


Therefore, a tool that allows users to interactively compare two models must not restrict users to a certain work.ow.

it should not only support them when comparing models, it might also enable to explore individual ideas by, for instance, adapting available comparison metrics.


Another way we deal with the imprecision is to use some context information.

we leverage caller-callee information in creating the models.


Only the logs in this rectangle will be presented to the developer, aligned with statements in the static slice.

autoLog intrinsically solves the problem of information overloading caused by irrelevant logs.


Traditionally, these have comprised wrappers around lowlevel system calls or higher-level calls such as system(), which is speci.ed to be as if a child process were created using fork(), and the child process invoked the sh utility using execl() (POSIX 2004).

to run a command (represented as a string) by passing it off to the system shell to interpret: system("cut -d: /etc/passwd ...").


TVLA utilizes an extra unary predicate active, which indicates if an individual de.nitely exists in the universe or not, so that the structure (S) can be used as an abstraction of every structure * in S. Thus, if S is a set of 2-valued structures, then the predicate active is true for an individual o in (S) iff the equivalence class * represented by o includes at least one individual from every structure in S. Heterogeneous Abstraction Separation creates the possibility for achieving better ef.ciency by adapting the abstractions to model chosen individuals more precisely and the other individuals less precisely.

this can be done by: Adapting individual merging: We can make .ner distinctions between chosen individuals than for unchosen individuals, when we decide which individuals should be merged together.


The value of this property is given by the macro @VMMaster.IPforMaster, which in turn refers to the value of the property IPforMaster de.ned in the master con.guration.

it contains the IP address of the master4 (this example is shown at Section 3.2.3).


Mobl has been used to develop a number of real-world applications (e.g., e-learning, podcatching, and time management).3 3http://docs.mobl-lang.org/showcase Mobl has been developed with Spoofax.

its syntax and semantics as well as editor services and so on are de.ned by means of SDF and Stratego.


5.2.2 Empty type elimination Inthisoptimization,weeliminatealltypesdenotingthe emptysetbeforestartingthesubtypingalgorithm.Doing soallowsthealgorithmtoshort-cutsometestslater,since itcanassumethatanytypeitencountersisnotempty.thealgorithmnowdoesnothavetogeneratetwo goalsoftheformA<:fateachapplicationoftheruleRec.


If the results do not exhibit the expected properties, the program must be at fault.

metamorphic testing is a property-based test case selection strategy that can be used along with other test case selection strategies.


The type of myOn is inferred automatically, and checked for validity when used to join two particular tables.

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


In order to measure the satisfaction with task performance, we defined a 4-item 4-point Likert scale to assess participants perception of whether tasks were performed positively, with participants feeling actively involved in group communication when reaching shared decisions.

we aimed to verify that information exchanged, and optionally translated, was properly processed when using both communication modes.


The list includes at least workflows, collaboration templates (a collection of services connected by a set of workflows), architecture, application templates (i.e., a family of related applications that can be substantiated by a variety of published services and workflows), test cases and test scripts, test evaluation results, policies (commonly used in SOC), and various social ranking.

reusability potentially can cover the entire lifecycle from identification to modeling, from model analysis to simulation, from architecture to components, from automated code generation using code templates to reuse software services, from testing to verification, from monitoring to policy enforcement.


The relation R = {(C0, C1) |Ce1 ~ [C0]init}is a bisimulation.

any typed con.guration is bisimilar to its translation.


on a common metamodel for the Web application domain [16].

these methodologies propose different views comprising at least the conceptual model, a navigation and a presentation model, although with a different terminology.


This aspect-oriented view on AP carries over to SP, but SP addresses an additional form of separation of concerns.

one can capture reusable definitions of generic traversal schemes while exploring various variation points.


In order to take advantage of data abstraction, reasoning about program modules in terms of the narrow interfaces they export to manipulate private state, we decided to integrate data abstraction into the operational semantics of our source language.

we avoid needing to reason about the operational semantics of many different languages by getting all the languages to agree on one axiomatic semantics for method calls.


We observe that Rate and RGR are in the lead for the ma jority of the time during our 10-day simulations.

not only do they .nd more unique bugs at the end of the simulations, but they also outperform other algorithms at almost any given time.


Of course, the system call can still completeby returning an error,but the workerthread executingthe system call cannotbekilled prematurely whenone ofits sibling threadsiskilled within the user-level .le-system.

by using noninterruptible system calls, Re-FUSE allows a user-level.lesystem thread to continue to execute a system call to completion even when another .le-system thread is terminated due to a crash.


The key challenge we faced in designing our algorithms is how to avoid the need for special atomic instructions (i.e.

cAS or LL/SC) and store-load ordering in our put and take operations while guaranteeing the following: No lost tasks: each inserted tasks will eventually be extracted (one or more times).


Finally, DoublePlay applies ideas from research on using speculation to run applications in parallel, such as thread-level speculation [29, 35, 37].

master/Slave Speculative Parallelization [48], Speck [26], and Fast Track [14] also use a fast execution to start multiple slow executions in parallel.


We will introduce a small running example of a .ight selection UI to illustrate the problem and our solution.

we will use this example to describe our approach and the effects of different con.guration criteria and our Layout Hints .


According to its man page [11], target component resolution on these operating systems is done in a similar manner as what is done on Microsoft Windows as we discussed in Section 2.

the fullpath speci.cation starting with / determines the target component directly, while the .lename speci.cation iterates through a list of prede.ned directories to .nd the .le with the speci.ed name.


To achieve the lowest GC overhead, we need to make the GC frequency in every memory almost the same.


Type-Safe Marshalling For early detection of errors, marshalling should be type-safe.

unmarshalling should fail if the type of the marshalled value is not what is expected (this is a dynamic failure, but it should be at unmarshal-time rather than during later computation).


2.3 Kalman Filter Kalman filter (KF) can be viewed as a concept derived from the combination of Bayesian inference and OLS it results in maximum a posteriori (MAP)estimates (in the linear case).

the recursive version of LS is derived from Kalman filter with an identity function describing the evolution of the system over time [12].


Using data and pipeline parallelism, any set of .lters can execute in parallel during the steady state.

(each stateful .lter can now execute in parallel with others; the stateful .lter itself is not parallelized.)


The transformations simply introduce auxiliary relations with necessary arguments to hold the results of combining two hypotheses at a time.

we repeatedly apply the following transformations to each rule with more than two hypotheses until only rules with at most two hypotheses are left: (i) replace any two hypotheses, say Pi(Xi1, ..., Xiai ) and Pj(Xj1, ..., Xjaj ), of the rule with a new hypothesis, Q(X1, ..., Xa), where Q is a fresh relation, and Xk s are variables in the arguments of Pi or Pj that occur also in the arguments of other hypotheses or the conclusion of this rule, and (ii) add a new rule Pi(Xi1, ..., Xiai ).Pj (Xj1, ..., Xjaj ) .


The synthetic service speci.cations are created by manip ulating the real-world service speci.cations to validate the e.ectiveness of protocol-aware approaches in scenarios not covered by real-world examples.

we validate the e.ectiveness and usage of protocol-aware approaches in cases that 1 - 1 matching (syntactical) results are correct (where only protocol-level mismatches are present).


Then, var1, var2, and var3 are loaded as input arguments for the last two subsequent method calls in Figure 4.

the method call var0.add() adds the loaded instance to FastTreeMap and var0.putAll() adds all elements of a captured instance of BeanMap.


In this paper, we present an extension to our earlier work on MapReduce in Kepler to record the provenance of MapReduce work.ows created using the Kepler+Hadoop framework.

we present: (i) adatamodelthat is able to capture provenance inside a MapReduce job as well as the provenance for the work.ow that submitted it; (ii) an extension to the Kepler+Hadoop architecture to record provenance using this data model on MySQL Cluster; (iii) a programming interface to query the collected information; and (iv) an evaluation of the scalability of collecting and querying this provenance information using two scenarios with di.erent characteristics.


The NLA mode has no information on the leakage rate of the ultra-capacitor.

the system in the non-leakage-aware mode predicts the expected lifetime and controls the duty cycle of the working node, based on the current energy consumption and remaining energyinside theultra-capacitor.


However, project managers are not always keen on using AO or having AspectJ in their running projects.

our project managers are afraid of having uncontrollable behavior if several developers use aspect-oriented programming.


Lam m This equivalence shows how tail-calls collapse out an intermediate stack frame.

it illustrates how a term of the form <e eats all surrounding context, freeing the entire pending stack of call frames represented by surrounding multi-return contexts.


On the other hand, the re.ection model isolates the adaptation capabilities of an application.

each Service Plan re.ects an alternative service realization and its potential explicit dependenciesupon other service types (relationship depends on) as well as its implicit dependency upon the hosting platform (e.g., run-time environment type and version), which is re.ected by the service realization stereotype.


Quanti.ers in OPTT range over values (excluding non-terminating terms), and hence this restriction is required for soundness.

inductionproofs establish universally quanti.ed formulasbycase analysis on the form of data in a particular datatype.


), Ministry of Education  Department of Computer Science, University of Toronto, tzwang@cs.toronto.edu ABSTRACT Smartphones are becoming increasingly energy-hungry to support feature-rich applications, posing a lot of pressure on battery lifetime and making energy consumption a nonnegligible issue.

dRAM is among the most demanding components in energy consumption.


Itis wellknown,however,thatproportional-share schedulingalone does notfunction wellin systems where over-demandfor resources is common.

as demand for resources increases, the time-share per resource received by each user decreases, while overheads remain constant (or, in some cases, increase due to thrashing).


To obtain a feature model that meets these requirements, we followed a bottom-up strategy.

we studied a large number of development frameworks in order to extract concepts that would form the structure or metamodel of the feature model.


Combining the this modi.er with any modi.er u yields u.

for a rep .eld f, the .eld access this.f has a rep type, whereas for any other receiver p, the .eld access p.f has an any type.


First consideration we can do is related with the guarantees o.ered by the di.erent protocols.

kER is the only protocol that is capable of precisely notifying the publisher when all replies have been collected.


While .-expanding a variable may seem useless, it is actually necessary to obtain a type-preserving translation.


The primary advantage is the ability to extend the kernel functionality in an userspeci.ed way.

java, due to its prominence and its write-once run-anywhere property, helps to ease the development and the deployment of kernel extensions.


KESO does not support all aspects of the Java language and the Java virtual machine and does not provide the full Java standard class library.

kESO requires static applications and does neither support dynamic class loading nor Java re.ection.


In the common case that a sequence pro.le fis not available, making a guess for ffHallows a test engineer to work systematically.

a data invariant Ican be used to de.ne a state pro.le like ffHas a uniform sampling of all states for which Iholds.


We illustrate these techniques by showing how to embed Cryptol (Galois, Inc. 2002), a high-level speci.cation language for low-level cryptographic algorithms, in a dependently typed language (Section 2).

we will write a domain-speci.c library for Cryptol s most characteristic feature: bitvectors of a .xed length equipped with a special pattern matching principle.


To see why the solution is a valid feasibility bound, let us assume that the tasks are assigned to a particular processor and the resulting processor utilization is Ui.If UiiF, at least one of the constraints in (3) B must be violated.

the .rst request of Tias well as higher priority tasks can be completed before either one of the pT's or k , which is equivalent to the system being feasible [13].


First, unlike the previous approach, here we decouple the scheduler from the threads.

the scheduler will no longer be part of the program,but is embedded in the model checking algorithm.


5.3 Peak Power and Cooling-Awareness Next, we consider what happens if the dynamic cost-aware policies do not account for the cost of cooling and/or peak power demand.

we consider versions of the CA and CAM policies that use Equations 1 and 9 without the CostPd component and/or Equation 3 without the P C d,t component.


In contrast, Russo s extension to Moscow ML treats sig merely as a forward declaration, not as a sealing signature.

it allows the recursive module to export components that appear in mod but are not forward-declared in sig.


It follows that theaveragepath lengthof queries issuedbydpcpeers will be equal to the average path length in networks without an additional contact structure.

there now is a direct relationship between contributing to the network structure andpro.ting from it.


In the case of software reuse, both institutional and individual commitment to explaining the system makes it possible for clients to use it.

producers of reusable assets carry the burden of articulating their systems through verbal explanation and tool support.


For the coming sections we will simply assume that cast is available, and that every type is an instance of Typeable.

given cast, we can write mkT, which we met in Section 3: mkT :: (Typeable a, Typeable b) => (b ->b) -> a -> a mkT f = case cast f of Justg ->g Nothing -> id mkT f x applies f to x if x s type is the same as f s argument type, and otherwise applies the identity function to x.


In Figure 6, for instance, exercising XQ(UserAddress, //city/) once may not execute the definition for the variable w at R6 because, when V at R5 is empty, R6 will not be evaluated.

a test set that satisfies the all-queries criterion may not cover all the def-use associations of variables in X-WSBPEL.


The browser extension then examines the objects returned by the server (step 3) to decide whether to enable the services of its automatic-workaround module.

the browser extension looks for references to the API of known third-party Web applications for which the extension may be able to generate workarounds.


Access is granted to a user u that requests a resource r at a site x if t(x, u) = h(r).

access to a resource is granted if the site has equal or greater trust in the requesting user than the threshold for that resource.


In such a scenario, the polyhedral framework would either apply the loop shifting transformation to remove the backward dependence or issue a cut between statements to satisfy the dependence.

if the pre-fusion schedule satis.es the precedence constraint, then the polyhedral framework guarantees legal fusion partitioning that satis.es the fusion-preventing constraint.


XUIB Mapper processes these files without concerning how these files were produced or what GUI builders produced these files.

xUIB Mapper does not depend on specific GUI builders (but it does depend on the standard java jar file format).


Second, the feasibility of utilizing existing variability modeling techniques for describing variability within Core Components is discussed.

we elaborate on the applicability of CBFM for expressing variability within the Core Component approach.


As a visual language for describing parametrised designs, LSD has similar characteristics to the visual language shell proposed by the designers of PLaSM.

it is a visual language shell that can be customised by the addition of domain-specific components and operations, and accommodates both designers and programmers (who could be the same person).


An essential characteristic of this model-driven process is the existence of a causal connection between the models and the underlying source representation.

as model changes are made to certain properties of a system, those changes must have a corresponding effect at the implementation level.


D The above theorem shows that in order to ensure that the execution of a program e corresponds to an E-differentially private randomized function from values in s to values in t, it is suf.cient to check that the program e has a type of this form: f e : !Es -Ot  5.4 Primitive Operations for Privacy As outlined in Section 3, one important property of DFuzz is that it can be extended by means of primitive operations.

we are interested in adding two basic building blocks, allowing us to build more involved differentially private examples.


Current commodity hardware is capable of meeting these demands, but software has lagged behind.

there is a pressing need for a programming model that allows programmers to design e.cient and robust servers with ease.


the last two lines prevent e1 from being con.ned if the meaning of e1 may be changed by an assignment in e2.


Although this is easy to automate using a traditional parser, our goals are larger.

we wish to establish a common framework for statecharts semantics which can support reasoning about the semantics, reasoning about statecharts using theorem provers, and model checking statecharts, with all of these goals supporting multiple semantic variations.


2.3 Untrusted code execution Purity gives us a way to execute untrusted code safely: we .rst verify that the untrusted code is pure, and then many useful privacy and security properties will follow.

the lack of side effects means that the pure, untrusted computation cannot violate the integrity of the rest of the program it interacts with2, so pure code inherently executes in a sandbox.


We use the Pin [15] dynamic instrumentation framework to implement the tool.

we make the following contributions: We develop a tool, called the Performance Opportunity Finder (POF), that identi.es potentially redundant computations matching three patterns: redundant sign/zero extension, redundant constant spill, and missing copy/constant propagation.


...Sim ) 2. the subgraph induced by M in CGis connected, where CG is the communication graph of the sensor network.

any sensor Iij in the connected sensor cover can communicate with any other sensor Iik in the cover, possibly through other sensors in the selected set  M. A set of sensors that satis.es only the .rst condition is called a sensor cover for Q in the network.


Second,wewishtomakenomodi.cationstothe system s communication topology.

we do not want to add extra data or control channels; rather, we will avoid deadlock using only tokens sent on the existing data channels.


Incumng considerable additional coding to store application objects is not an attractive feature of a persistent storage service.

it seems inappropriate to require application programmers to develop additional interfaces and classes for providing persistence for application objects.


The provisioning time for a cognitive VM ranges from 10 seconds to 33 seconds depending on VM size.

just 10 seconds after associating with a new cloudlet, a Glass user can start transmitting sensor data to Gabriel.


If e is an expres ion denoting the sequence (e0,e1,.......,en), the expres ion pre(e) denotesthe sequence (nil,e0,.......,en ) where nil is an undefined value.

pre(e) returns, at a moment t , the value ofthe expres ion e at the moment (t -1) .


But only if that particular request processor took longer than any of its predecessors.

the .eld deadMaxTime is the statistical maximum over all requests processed by all request processors in that particular group.


they are modeled in the same way) and they can all possess functionality of their own.

all operations of S, A and B can contain rich algorithmic content.


The hierarchical nature of Plaid s dimension prevent us from using all of the trait mechanisms for solving the problems of multiple inheritance.

a multiple inheritance system must deal with the case when one class inherits from two classes that share a (transitive) parent.


He has been working with many component-based technologies in all phases of the software cycle.

he has led the effort to evolve the legacy AMS into a component-based system.


Otherwise, the result of the hash function for the shorter input would be the same as one of the intermediate states for the longer one, which would mean that one function result could be predicted from another.

the construction requires that the set of queried inputs is pre.x-free.


Our work studies the predictive and classificatory role of timing statistics more broadly.

this paper shows that time-based techniques are quite effective in deducing as- pects of cache behavior that have previously been either hard to discern on-the-fly in a single program run, or hard to dis- cern at all.


In this first part we define and study the explicitly-typed version of the calculus in which type instantiation is driven by explicit instantiation annotations.

we define an explicitly-typed .-calculus with intersection types and an efficient evaluation model for it.


In order to overcome the limitations of certifying compilers, earlier work [6, 5, 7, 18] has considered expressive veri.cation methods for executable code and established their adequacy with respect to veri.cation methods for source programs.

burdy and Pavlova [7] have developed a proof compiler for Java, that enables certi.cates of Java bytecode programs to be constructed from source code veri.cation with JML-based tools such as ESC/Java and Jack.


Moreover, once the point of collection allocation is found, it is not clear how to choose an alternative collection implementation.

choosing an alternative collection implementation with lower space overhead is not always desirable.


Intuitively, these are violated, unless the state to be achieved is achieved immediately .

norms with zero time to ful.ll, which introduce such obligations, would lead to violation without immediate ful.llment.


We notice that WCET-based reservation increases the energy consumption and EPWU.

the utilization-based SRT-DVS algorithm consumes 5% more energy, while the reclamation and adaptive algorithms consumes only about 1% more energy.


The facet implementations of .gure 9 cover a large subset of the space of distributed implementations identi.ed in section 3.

the currently implemented facets support: Concurrency control: Both optimistic and pessimistic concurrency control are supported.


The bu.er requirements for each of these tasks are as follows: t1 has only one lower-priority reader without unitdelay.


Furthermore, we consider that in any class de.nition: class C extends B {...} the class names being de.ned and extended have the implicit annotation > as follows: class C> extends B> {...} where This denotes ThisType in our type system.

thisType is an implicit exact type variable in our mechanism.


Fortunately, however, many useful changes to programs are modest in size and scope.

bug .xes tend to be relatively small and rarely change core application semantics [13, 29].


In the beginning, the product line engineer creates a Stage-Model for the product line (Figure 5, step 1).

the StageModel 1pure::variants feature models, domain-speci.c models based on Ecore, domain-speci.c textual languages based on Xtext, XMLSchema XML, Java property .les, Kcon.g .les, and C header .les with #de.nes (cf.


EDAs do not use the operators found in many conventional forms of evolutionary computation, but instead utilize correlation information among variables.

each new generation is sampled from a joint probability distribution that approximates the discrete empirical distribution of selected individuals in the previous population.


Data represents the actual data collected by the Group.


RELATED WORK In this section, we discuss existing techniques that are closely related to MIMIC.

we discuss statistical fault localization, anomaly detection, experimental debugging, and techniques exploiting synthesized executions.


Notice that answering whether spilling is necessary or not is easy even if there can be some subtleties [5]  while minimizing the amount of load and store instructions is the real issue.

if the search space is now cleanly delimited, the objective function that corresponds to minimizing the spill cost has still some open issues.


Moreover, the actual time measured in code execution can be re.ected in the usage of a resource.

each Simulation-Thread is associated with a resource that represents the processor.


Since stage of a is the same as or before stage of b, any new stage inserted before stage of a is also before stage of b.

newStagesBef ore(stage(a)) = newStagesBef ore(stage(b)) Hence after the insertion, the new dependence distance d+ newStagesBef ore(b)-newS tagesBef ore(a) = d = 0.


ten in TAL itself for instance, the actual implementation (capabilities) A ::= a |Ø | {l1} | {l+} | of the memory management runtime system.

|A the runtime system here consists of malloc/free code which (constructors) c ::= l |A manages a free list and pointers to allocated objects.


string)) (define load-interactive-checked (apply-contract load-interactive-contract load-interactive))  Contracts more clearly express the intended checks, and the compiler ensures that the intended checks are actually applied (in an e.cient way, and with clear error messages).

after declaring contracts, the programmer can think of the function arguments as having the declared types, although the type requirements are enforced dynamically.


AOP plays a critical role here: the program transformer synthesizes AOP code and invokes AOP compilers to merge the monitors within the program.

as discussed in Section 3.3, JavaMOP transforms generated monitoring code into AspectJ code.


The combination mechanism we propose, based on an unfolding/folding technique combined with partial reduction operators, could be applied for other abstract domains than those considered in this paper.

other abstract domains based on .rst-order formulas, e.g., the one de.ned in [13], can be used to strengthen the analysis in our domain of universal formulas.


7.4 Future Work In the future we plan to make some more experiences to re.ne our blueprint naming scheme and to enhance the visualization part, as the success of the approach heavily depends on it.

we would like to apply it on legacy systems to evaluate the percentage of classes which cannot be categorized using the class blueprints.


We have compared several variants of a self-adaptive IRK solver, which exploits thetime-stepping nature ofthesolutionprocedureto select the best implementation variant from a candidate pool at runtime.

we have investigated the empirical selection of tile sizes for loop tiling from a set of tile size samples, where the set of tile size samples is determined by a model-based approach.


1Here independent speci.cally refers to a type of communication involving calls to MPI-IO functions.

we distinguish between independent MPI-IO parallel .le operations and .le activity that does not involve the MPI-IO library (e.g.


One issue when deploying a new processing architecture is deciding what communication architecture and scheduling policy should be used until they are also changed.

since the new processing architecture redefines which users process input commands, a previous multicast architecture may distribute input commands to new slave computers, which is inconsistent with the notion of collaboration architectures.


The advantage of this approach is that it admits the possi- bility of the underlying distributions changing through time (non-stationarity) since the NWS forecasting techniques are highly adaptive.

we do not treat each trace as a sample, but rather as a series, each value of which may de- pend on the time it is taken.


LTL model checking of an FTS with n features against a property f with our algorithm is O(|FTS|.2|f|+nlog9).

the complexity of IsPersistent, O(|FTS|.9n), multiplied by the factor 2|f| for the LTL to BA translation.


In view of the type of collective we have studied here, an open system seems to be indicated, as suggested in section 4.

it does not seem to be necessary to restrict access to this platform to caregivers who are members of the RPM network.


Most of these are generalisations of the type equalities of [5], but will not be identities in our model.

for all the type isomorphisms listed, the term from left to right can be de.ned canonically in our calculus, but we add the term going the other way, plus two equalities of terms, stating that the added term is an inverse to the existing one.


they do not contain or embed functions in the data they construct (§3.4).


Z and an associated con.dentiality policy acli(vi)= Ø.

pi is not willing to disclose vi to any other principal.


Little software engineering research has focused on this issue [8].

we found no validated ways of how to measure the complexity of software portfolios.


But HiDP assumes local barriers before and after each of them.

the range of the synchronization is constrained to the necessary range to guarantee correctness of each instance.


The canonical form of the constraint abstraction .a.C1.

this is the type scheme that was inferred for x, and that was associated with x while solving C2.


Central to the B method is a formally de.ned concept of re.nement by which two models written at di.erent levels of abstraction can be compared.

the re.nement relation ensures that all properties of interest that hold of the abstract model are preserved by the re.ned one.


The default for symbols in the body is that they are variable symbols.

in pure pattern calculus, this case is given by [x, y] z x y .


As in Java, multiple interface inheritance is supported in BCOOPL.

an interface may extend one or more sub-interfaces.


All our experiments in this section employ cross-validation.

the evaluated benchmark or method (with both the small and large/default inputs) is never included in the training set for that benchmark or method.


APT::Solver::name "aspcud-paranoid-1.3"; APT::Solver::criteria "-removed,-changed"; Since MPM aims to replace only the dependency solver part of apt, everything else will still be handled by the underlying library.

once a solution is found by the dependency solver, apt will be in charge of .nding a installation plan for the proposed solution.


This has to be kept in mind when extending the type exn which is, in Objective Caml, a variant type that can hold any other type .

the global propagation of local exceptions has a power equivalent to that of proj; this means that values that can be raised locally must be restricted in the same way that local return values are.


Furthermore, the semantics also ensures that methods canbeinvoked onlyifboththe caller and method arein the same component.

this prevents a mixin from invoking a method without protection, preventing the faulty invocation from the search-mixin examplein section2.3.all method invocation must either be dispatched locally or through a contract monitor.


Another advantage of static superinstructions is that their code can be optimized across their component instructions, whereas dynamic superinstructions simply concatenate the components without optimization.

static superinstructions can keep stack items in registers across components, and combine the stack pointer updates of the components.


When S1 holds, we can prove that out-or-order processing of transforms does not cause problems.

we can show that: applications do not interfere with transform functions, transform functions of unrelated objects do not interfere with each other, and transform functions of related objects run in a pre-determined order (namely an object is transformed before its owned subobjects).


Using a Table Re-Organized for ULMT We now attempt to improve coverage by exploiting the low cost of storage in ULMT solutions.

we expand the table to allow replicated information.


This does not complicate the application of mixins because,inpractice, type application of rows canbeinferred[35].In contrast, our type system does allow width subtyping on the types of objects, since objects inRacket cannotbe extended after creation.

our approachispay-as-you-go.Programmers needtobe awareofrowpolymorphismonlywhendealing with abstractions that are not provided in most typed object-orientedlanguages, such as mixins.Meanwhile,programmers neednot consider rowpolymorphism whendealingwithobjects,andcaninsteadreasonabouttheirprograms usingfamiliar subtyping rules.


CHINLE considersa wide rangeof individualhypotheses for each of these parameters.

one possible representation for String is a conditional, which is represented as a join of a version space for the condition being tested, and values for the true andfalse branches [18].


4.1.4 Prior ERP Knowledge Company B was the only one among the three companies studied whose acquisition team members (the IT Director and the Factory GM) possessed prior knowledge on ERP.

the Factory GM had a favorable experience of using QAD products during his prior employment in the same industry.


It was almost immediate to recognize that UML [23] owns all the desired characteristics.

uML was chosen on the basis of previous experiences, when the first author employed UML to write software process models precise and detailed enough to be usable as executable process descriptions [11].


A mobile user with the master mDev will consider a mobile service with mClouds useful if there is surplus in utility after paying the slaves: u - w * t - m * s - q> 0 (2) And mClouds provides real cost savings (compared to equation 1) only if: w * T + p>w * t + m * s + q (3) That is, the added payment to the slaves should be lower than the savings achieved through reduced waiting time and reduced payment to the wireless carrier by using mClouds.

note that if the carrier is willing to cover the cost to signi.cantly reduce the network congestion, then the slave payment cost (q) from the master is reduced to 0 and mClouds is bene.cial to the master as long as: w * T + p>w * t + q (4) incentives provided by carriers intended to reduce congestion in their networks may signi.cantly boost the adoption of mClouds.


Fortunately, initial algebra semantics is robust enough to explain these inductive families.

one can simply apply the standard theory of initial algebra semantics in a more sophisticated category so as to derive recursion operators, induction principles, Church encodings and short cut fusion rules etc.


a can be executed by di.erent datacenters.

we do not consider the suitability of a Cloud to run an entire application but the ability to run an appliance, in isolation with respect to the other appliances.


Our use of abst and cont coercions generalizes this idea to nonabstract named types, and permits more .ne-grained determination of safe update points.

we could discover points within an abstract module at which it could be safely updated.


Since edges are established with probability padd = 1 - exp(-2J ß) if and only if the involved spins both are aligned (2 cases out of 4), the expected number of elements to be transferred is 0.29 N¯in two ¯ dimensions and 0.18 N¯in three dimensions, where N is the number of border sites in this step.

the expected amount of data to be send is 8×0.29N¯bytes, and 8×0.18N¯bytes, respectively.


As a result, variability realizations tend to erode in the sense that they become overly complex and difficult to understand [13].

the code layout in variability code using conditional compilation is obfuscated by #ifdef directives, which are nested, tangled, and scattered in the code [8] [10].


In the second part of our evaluation, we explore some of the connections between the different dimensions.

we set out to answer the following questions: 1.


In order to move from point A to point B, 100 manual test executions have to be abandoned.

automating one test case incurs opportunity costs of 4 manual test executions.


Web Services, the second layer, are the integration point and provide access to a wide range of resources in a third layer, including compute and file resources, databases and Grids.

resources available to our experiment belong to the Italian Grid Infrastructure (IGI) [3], which is based on gLite, and to our local cluster, which is based on LSF [4].


We use obfuscation transformations applied to known malware to obtain a large number of new test programs that are semantically equivalent to the original malware thus, the new test samples are just as malicious as the original malware and should be .agged by the detector.

our test set PT is created by applying semantics-preserving obfuscation transformations to a set of known malware.


In the translation process we exploit XML standard parsers and translators.

as shown in Figure 9, the first step is carried out by defming a set of fixed XSLT rules and by processing them by means of the Xalan XSLT processor.


In this subsection, we complement Theorem 1 by proving that using warp reorganization does not change the NP-completeness of the problem.

we prove the following strengthened complexity theorem: Theorem 2.


As an example, let us consider a constraint requiring that every association has at least two ends: context Association inv: memberEnd->size() > 1 (4) Without considering its presence conditions, the model in Figure 1(b) satis.es this constraint since every association in that model has at least two ends.

evaluating memberEnd ->size() > 1 on a1 in Figure 6 using the standard OCL interpretation clearly yields true since a1 is associated with two ends, namely e1 and e2.


PREDICTABILITYOFTWORUNS When using random testing, how much do we rely on chance?

how predictable are the results of random testing?