When it is found that no solution can exist based on the current partial instantiation, it backtracks to the previous variable instantiated, and re-instantiates it with a different value from its domain.

a backtracking algorithm has both forward (where we select the next variable and instantiate it with a value) and backward phases (where we return to the previously instantiated variable and assign a new value to it).


The separations of concerns (e.g., the logical assertions in DBC) not only exists in the application code, but also are reflected at the design level.

there is a need for tools that can employ DBC at different software abstraction levels to ensure the consistency between each level.


In real life projects, schedule pressures tend to hurry reviews.

for those projects there has been substantial investment in enhancing the tools validation resources with home-made scripts.


In our example, the RailCabDriveControl triggers the ConvoyCoordination component to create a new coordinator port.

it sends a recon.guration message with the corresponding request to the ConvoyCoordination component instance.


Such a data sharing pattern can be expected from this stencil, since in this stencil, both the neighbors of a seed element are in the same row and there is no data sharing between two neighboring processors if they access different rows of the array.

for two neighboring processors Pf1 and Pf2 to share data, the direction from Pf1 to Pf2, captured by Pf2 -Pf1, needs to be compatible with some direction vector in the stencil direction matrix D. In mathematical terms, such a compatibility can be formulated as follows: (Pf2 -Pf1)T D = f0.


From the point of view of a meta-model based tool, the multi-level modeling content at L1 is just a regular model.

although MelanEE remains a two-level tool in the linguistic dimension, it is a multi-level tool in the ontological dimension.


In the simple periodic-collection applications we measure, these thresholds are the same for all nodes; per-node thresholds allow Sympathy to monitor other applications, regardless of differential transmission rates or in-network aggregation, as long as the sink knows the quantity and/or quality of data it should expect.

the sink has received suf.cient packets from a node component if its S I N K PAC K E T S R E C E I V E D counter at least equals the corresponding threshold.


The allocation process will often "split" a free block, creating an allocated block and a remaining free block, both smaller than the original free block.

to prevent the average block size from continuously decreas- ing, the sweeping process must also perform some form of coalescing, that is, combination of consecutive free chunks into one larger free chunk.


This is required in AspectScheme to address obvious looping issues: because pointcuts and advice are standard .rst-class functions, even applying the proceed function itself can generate an in.nite loop.

app/prim is typically used to apply the proceed function as well as to apply functions in pointcuts.


It is thus possible to feed models with run-time data to update their internal parameters.

modi.ed models provide increasingly more accurate descriptions and allow us to automatically check the desired requirements while the system is running.


In contrast, a standard SLR is driven by very speci.c, precise research questions that can be answered by empirical research, e.g., best practices with respect to speci.c procedures, technologies, methods or tools [4].

a SM could be conducted .rst aiming at providing an overview of the investigated topic and identifying whether there are subtopics with su.cient primary studies to conduct a SLR.


The tool simpli.es the interdependencies between diagrams and checks their completeness and coherence.

all the diagrams of the same model are connected and designers can navigate from one view to another clicking into the main entity of the diagram.


For example, di.enciating automatically a program requires to reverse the order of the instructions.


for the model in Figure 1, the input to the system over n time steps should be a sequence , and the corresponding (single) output should also be a sequence .


In a Plug&Play-capable system, the communication partners are determined at runtime.

policies must be formulated in a different fashion.


Our first prototype is meant for an advanced Web application development class.

aSIDE searches for vulnerabilities resulting from lack of input validation or output encoding, and the use of unsafe SQL statements.


As a future work, we intend to systematize the refactoring applied using our laws.

providing some con.dence that the refactored middleware preserves behaviour.


On most architectures (see, for instance, [7]), the size of virtual memory for which address resolution can be performed in hardware using the TLB is signi.cantly larger when using large pages than when small pages are used.

tLB misses occur less frequently thus increasing transaction throughput.


Due to monetary constraints as well as space and power limitations, the replication of each node and link is not an option in most embedded systems.

we will present a hardware/software partitioning algorithm for recon.gurable networks that optimizes the task binding onto resources at runtime such that node/link defects can be handled and data tra.c on links between computational nodes will be minimized.


That is, pings can be easily extended to carry additional information, and not only timestamps.

an HBAgent will, in the response to a ping from a neighbor, also include the current computational load imposed on its host computer.


Indeed, DCPU producesinoutput onlypartial information about theformat of theinstruction(i.e.,thelength, the opcode, and theformat of non-implicit operands) while D1, ..., D4 output an assembly representation oftheinstruction.

we can only check if the format inferred by DCPU is compatible with theformat reportedby D1, ..., D4.


An application s power settings take effect only when it is scheduled, and further, applications get the same share of the CPU regardless of their power settings.

applications are isolated from one another and from the settings used by malicious or misbehaving applications.


The POI represents the ideal coordinates within the utility space of the most useful piece of information to the user.

the utility of each ADU can be measured as the inverse of the distance (as measured by a speci.ed distance function) between the coordinates of the ADU to those of the POI.


As the tuples in these moveable transactions did not participate into any DTs, they are residing in isolation within the workload network.

they are highly likely to be preserved together in the same cluster after k-way clustering.


Implicitly, we assume a form of memory coherence between CPU and GPU.

we will make use of the SVM feature introduced in OpenCL 2.0.


3.1 Goals and Hypotheses As outlined in the last section, past experiments have not sufficiently addressed the characteristics of a reuse-centered development environment when investigating the defect finding potentials of different quality assurance techniques.

we performed a controlled class-room experiment in which the following hypotheses have been investigated.


Thereafter, the optimized code is now amenable to the built-in optimizations.

after going through both custom and built-in optimizations, the added instrumentation code can be reduced to a minimum, ensuring the best performance of the rewritten bytecode program.


4.1 Code coverage information Although UMD has obtained a license to use the Clover code coverage tool in courses, students sometimes .nd the tool dif.cult to install and use.

we also provide code coverage through the web interface.


Moreover, it is impossible to get a deep understanding of a pattern without seeing an implementation of all the objects participating in it.

we present below an example that motivates the pattern and requires both the implementation and use of an iterator interface.


Like many other web application development approaches we utilize a database management system for content storage.

the designated publishing environment has to provide a database interface that provides access to the DBMS.


The Third Frontier Network within Ohio (more recently named OSCnet) has connected 68 of the 88 Ohio counties with OC12 links, which o.er 622 Mbps.

an important questions we are also examining is How does the overhead of processing data from remote sites, i.e., the slowdown compared to applications that process data from within the same cluster, vary with the available WAN bandwidths ?


Finding, and encoding an enforcement mechanism using edit-automata is not an intuitive operation, and there is usually a gap between the initial property and the associated edit automata.

ensuring formally that the edit automata obtained enforces the correct property is not an easy task.


Unfortunately, graph theory is not well-suited to the problem of dynamically changing graphs.

we rely on simulation rather than analysis.


For example, the usage interface of the design model of a concern is typically comprised of all public classes and methods made available by the concern.

to reuse a concern, a software engineer must 1) select the feature(s) with the best impact on relevant non-functional properties from the variation interface based on provided impact analysis, then 2) adapt the generated detailed models to the application context by mapping customization interface elements to application-speci.c model elements, to .nally 3) use the behaviour provided by the selected concern features through the usage interface.


First, we observe that timestamps are used only to disambiguate concurrent updates and to recover from previous failures.

when all replicas of a logical block are functional, timestamps can be discarded after all of them have acknowledged an update.


To add a third monad m, we change the type to Plus t (Plus s (Plus m Id)), and write inr (inr (inl e)) etc.

the monad Id serves as a placeholder for future extensions and these extensions do not alter the currently existing code.4 As a brief example, assume that above we would have started with a recursive version of the count function.


The relationships are intrinsically linked to their domains and images.

the categories of features work as limiters to the set of relations that can be added.


Unlike XSLT that allows optional template parameters, in XQuery all function parameters are mandatory.

when invoking an XQuery function, all its parameters must be explicitly bound.


These decisions really depend on the performanceof the individualkernel under differentexecution con.gurations.

our approach is to predetermine the performance of each workload across different number of thread blocks as well as the number of threads in each thread block.


The program is assumed to be correct if the actual distribution of outputs for each dimension1 has the same mean as the expected distribution.

we will perform a test on means of normal distributions with unknown variance using a likelihood-ratio test statistic (LRTS).


Also, it is important to note that supervisors do not cause events to occur they only allow them.

when a waiting thread is signaled, it is possible for another thread to execute an event and re-disable the waiting thread before it acts.


However, the components in our framework are more complex and the actions from each component can hardly be prede.ned.

we created a language to describe the interaction rules in a DVE application instead of applying Behavior3D in our framework.


Compared with RBFs, UK can predict continuous and much smoother scalar distribution from given scattered samples.


Identifying failure points in analysis code is dif.cult (and in general impossible) if the analysis writer does not somehow mark these points in the code.

for our work we write our analyses inalanguage thatexplicitly identi.esfailure points.


Some instructions are not matched due to the features of the VLIW machine used only by the optimized version and optimizations such as strength reduction which introduce computations that produce different intermediate results in the two versions.

to determine the completeness of the above matches we examined the codes and the matches generated.


That is, when the .re method of either director is invoked, the director does not commit to any state changes, and it does not invoke post.re on any actors contained in its composite.

if those actors conform to the actor abstract semantics, then so does the opaque composite actor containing the director.


We do not expect to have space to store all data on disk for a complete simulation run.

.les should be transferred to a mass storage system on the .y and then removed from the disk to make space for more data coming from the simulation.


This requires servers to maintain intermediate states for actions that are not committed by maintaining a session state for a transaction.


The initial similarities stemming from the bottom-up phase can be improved since parent elements or referenced elements can have been matched meanwhile.

other matchings can be found, which are propagated top-down further on.


Since it is likely that multiple ICLs will need the same parameters, we share this information in a common repository.

all of our mi-crobenchmarks report performance numbers (e.g., expected disk seek time, expected disk bandwidth, time for the OS to allocate and zero a page, time to access a page in memory, time to access a page on disk) in a common format kept in persistent storage; each microbenchmark then only needs to be run once, or when the performance is suspected to have changed.


The runtime of at most 0.02 s for 2000 test cases is also quite low for all localization algorithms.

aRT-BD-ART seems to be an e.ective and e.cient alternative to D-ART and RRT.


It should be emphasized that only one subject was capable to solve the task with generic types within the time limit at all.

although the experiment cannot give any exact approximation how much faster subjects are with the raw in comparison to the generic version, it seems clear that the difference is large.


This cross-reference information, however, does not exist in many digital content.

we will start with the most popular and well-studied statistical IR algorithms, vector space model (VSM) and latent semantic indexing (LSI) [1, 7], which do not rely on the cross-reference information.


The COOL mechanism de.nes two types of advice, lock and unlock, which are executed before and after the synchronized method, respectively.

cOOL s lock and unlock advice are inserted in the context of the caller method and not in the context of the callee.


For example, a high-performance server with 300Watt power consumption consumes 2628 kiloWatt hours.

within one year, the annual power cost of the server is around$263,if theelectricity costis$0.1perkiloWatthour.


For example, the contents of two memory buffers A and B could be multiplied and stored in a buffer C by calling the gemm() function which, given the .oating point arguments a and ß, performs the following operation: C .

aAB + ßC by passing a =1.0 and ß =0.0, we obtain C .


An EESM also takes into account that a block can be instantiated as multi-session, which means that several instances of a block execute concurrently.

every variable of the EESM is an array in which each block instance has its own index, i.


Because Nsap =Nr+Nw+Nsync and normally Nsap > Nsync , the size of Frw is far larger than Fmo and Fso.

the total size of the constraints can be approximated as Nbr+N3 sap.


Because the pieces in the expected in-order range are also less likely to be available, the hybrid policy never gets a chance to escape to the randomized region.

it behaves just like the in-order policy.


The work presented in this paper focuses on the problem of managing scienti.c data in the .eld of cosmology.

it .ts in the context of e-Science.5 In the next section we provide some details regarding ma terial and resources that are used in our experiments.


It can be also optimized by an existing approach [1].

our interest focuses on the copying of the array a to the SPM.


Moreover, a thread t may yield at most once in t .

the set S(t) contains both E(t) and D(t) at the unique yield point of t, if any.


The number of times that a thread needs to wait for the token is inversely proportional to the chunk size.

when a sequential stage is critical (e.g., SS1 in Figure 1(b)), chunking minimizes the overhead of executing that stage in different cores.


this new experiment extends this .nding to generics, with the caveat that generics do not help universally only under certain conditions.


As seen in Figure 1, after inserting the NOP, the result is no longer forwarded directly from the execution unit in the EX stage, it instead is forwarded from a pipeline register in the MEM stage.

all input values arrive at pipeline registers in suf.cient time and no timing errors occur.


Unfortunately, it only works for packets generated by dom0 itself; traf.c from guest VMs is routed or bridged directly, without segmentation, before reaching the NICs.

a straightforward solution is simply to disallow guest VMs to send large packets and force them to segment in software before packets are copied to backend.


This extra work reduces the capacity of each node to handle queries.

p cannot be too large lest nodes CPUs saturate, and it cannot be too small or nodes storage will saturate.


Other three programs show similar shapes of scalability curve, however, the number ontop of thegraph showing the maximum speedup against a single core assignment is the largest for ferret which is 17.22x.

it is bene.cial to give the resource to ferret to maximize the multiprogramming performance.


records the type of each running session k. We assume that we can write G, a : G only if a does not occur in G; the same holds for .

wrt sessions k. Furthermore, we can write T, t : k[p] only if t is not associated to any other role in the same session k in T. a thread can participate in multiple sessions playing different roles, but it cannot participate in the same session with more than one role.


With .at-nesting, I s reads and writes are added directly to the readset and writeset of A.

in Figure 1, if a concurrent transaction Btries to modify variable i while Iis running, but before Ihas committed, then if Iaborts, it also causes Ato abort (since ibelongs to the readset of Aas well).


Depending on the task size and the set of preempting tasks, this computation can be very time-consuming.

we present a precomputation to speed up the instantiation by reducing the number of program points that need to be considered.


The JMM allows certain reordering of operations within a thread and thus permits more behav- iors than the interleaving based execution model.

programs verified by assuming interleaved thread execution may not behave correctly for certain Java multithreading implementations.


Though, models still need to be debugged at early stage to ensure quality.

the debuggers have to propose views adapted to models and support also some additional features related to the model world: Incomplete models the ability to debug incomplete models.


1.3 Scheduling Cellular radios consume more power and su.er reduced data rate when the signal is weak.

the energy per bit can, according to our measurements, be as much as 6xhigher whenthe signalis weak thanwhenitis strong[4].


These instructions are inserted into the application at appropriate locations.

the PVM is con.gured to handle these instructions uniquely as follows: At run time, when the protective PVM encounters any of these select instructions, it interprets them in a custom manner, di.erent from the semantics speci.ed by the platform documentation, i.e., the protective PVM instance will interpret these instructions using customized semantics, whereas other interpreter instances will interpret it in the conventional manner (e.g., according to the platform documentation).


These programs were executed with size 10 to produce dynamic pro.les.

the results do not follow the o.cial SPEC rules.


Finally, m0 is the memory location whose address is stored in bx.Also, Sign(Post(p)) = (R#,M #) where: R# R# (r0)=(+, +) (r1)=(+, 0) M# (m0) = ((+, 0), (+, +)) Recall that S[7]l= S[8] = (+, +).

(+, 0) and lCount(Sign(Post(p))) = lx ly lz,where: lx[7] = lx[8] = ly[7] = lz[8]=1 , and all other elements of lx, ly,and lz are zero.


Indeed, the only reduction rule for which the type of a function really matters is function application.

as a function of type ...cannot be applied to any value, any function can have this type.


1 the resulting matrix is multiplied by a square n A × n A diagonal For the application to pattern detection, the algorithm takes as matrix, where element (i, i) is equal to 1/ ki .

input the graph that represents the system under study as well as the normalized scores that will eventually the graph describing the pattern of interest.


We argue that the fUML virtual machine should empower the use of both the Controller and Monitor concepts inside the Execution Model to bring such .exibility, controllability and observability during the execution.

the Controller answers the lack of controllability while the Monitor handles the need of observability.


Persea uses a replication mechanism in which each (key,value) pair is stored in nodes that are evenly spaced over the network.

even if a given region is occupied by attackers, the desired (key,value) pair can be retrieved from other regions.


Because DSMLs are designed for different domains and sometimes used in closed groups, it is difficult to collect all kinds of DSMLs.

our feature model may not reflect features that are mandatory for all types of DSMLs.


Precisely characterizing this imprecision is di.cult.

we employ empirical methods for measuring e.ectiveness.


Note that a contains operation never restarts.

we add proving the wait-freedom of contains to our veri.cation goal.


For nearly all of our benchmarks, DETERMIN infers deterministic preconditions and postconditions equivalent to, slightly stronger than, or more accurate than those in our previous, manual speci.cations.

we argue that DETERMIN can capture the intended and natural deterministic behavior of parallel programs.


However, it is the common situation to consider multiple quality attributes which usually conflict with each other.

how to make tradeoff between conflicting quality attributes will be improved in the future.


Figure 2: Thread scalability on Xeon Phi  3.3.2 Utilization A host process only periodically offloads work to the coprocessor, and each offload does not typically use all the 240 hardware threads of the Xeon Phi.

in a single host process situation, the coprocessor not only idles most of the time, but even during offloads, it is seldom that all of its cores are used.


An aspect captures the functionality of a crosscutting concern and can be applied at different parts of the application.

our ongoing work concentrates on applying principles of Aspect-Oriented Programming to Web design, thus separating a given Web application design from the specification of additional context-dependency design concerns.


Most .les, especially large .les, are sequentially accessed [Leung 2008, Roselli 2000].

sRM-buffer allocates physical pages in the same color to every Tl consecutively accessed blocks in the same .le to prevent accessing these blocks from polluting CPU cache.


In [14], we have shown that the code size of some benchmarks increased by more than 300%.

the classical Procedure Cloning should be used with caution, and a trade-off between the resulting WCET and the code size increase is required.


In a direct-mapped cache, datafrom eachmemorylocationhas only onelocationinthe cache (cache line)where it can be stored.

a cache con.ict and thenacachemiss may occurevenif thecacheisnot full.Thesemissesareknownascon.ict misses.Ina set-associative cache,datafrom each memorylocationhas a set of several cache linesinthecache whereitcanbestored.Thesetsofcachelinesare disjoint.


This is because the generated CG character lacks of subjects Personal Characteristics such as whole head geometry with hair and person-speci.c facial expressions.

we need to model these characteristics and to re.ect it to a CG character so that the generated CG character becomes more realistic.


The decoder needs to receive at least (n-k) packets of a group to decode all the data packets.

if less than k packets in a group are lost then the receiver can recover the lost packets by using the extra packets from that group.


Transforming the constraint speci.cations (which are transformation rules using a special syntax that transform objects of the source metamodel to objects of the target metamodel) into a metamodel that is used by the transformation tool to encode transformation rules is a form of a HOT.

in MTS we de.ne a HOT to transform the constraint speci.cations into what we call a Variability Meta Model (VMM).


Otherwise, if a process sets M = {m ' ,m}in round r,it sets v at lines 28 or 42, or crashes; according to the algorithm, since p delivered m ' at lines 23 or 37, any process that sets v, at lines 28 and 42, respectively, sets v = m ' .

any process that sets v in round r sets v = m ' .


For example, we should stop the monitor for x in Figure 5(a) at the end of the IFR for the second access to x, not the .rst.

at release calls, we insert stop monitor calls only for variables in A[p] - RW[p] (i.e., variables for which this program point does not fall in an IFR).


,.. ,, , oi,toi to= x(1,( ()+ 1 i (25) () Matdo)) ii From expression (20), any instructionoi.O must start executing no later than (l+ 1 doi).

() equation (25) transforms to: Min l 1 ()),t ((+ do) i .


Control mechanisms should respect and retain this loose coupling at the business level, and consequently, should be non-intrusive to the core business logic of an application.

the control mechanisms and core business logic should also be loosely coupled, to allow changes to the service/component structure at both management and business levels with minimal e.ects on each other.


In consequence, the availability analyses ignores that the state of service providers and access points can change in the near future.

the user will be dissatis.ed if the system becomes unavailable because he had been informed that the access to the stream was granted.


All the constraints can be satis.ed by assuming that the assignment in statement (2) transfers ownership from p to q.


Mathematical model is set up when faced actual need, then corresponding programming can be compiled to solve practical problems.

calculus plays an important role in computer programming, and calculus concept should be adopt to set up clear logical relations.


Even better, any 22k+1 -Clock problem can be solved with A1, A2 that solve the 22k -Clock problem.

the k-Clock problem can be solved for in.nitely many values.


Notice that some of these ideas have to do with the design of applications, some with the validation of those designs, and some with the operation of applications.

multiplicity computing would have an impact on nearly every aspect of how we go about the engineering of applications.


For example, the Linux kernel is executed in ring 1 instead of ring 0 of the IA-32 (user-level processes execute in ring 3 as in standard Linux and run unmodi.ed Linux binaries).

operations which require the privileges of ring 0, e.g., page table updates, are provided through a different interface rather than virtualised one.


In this particular scenario, this may lead to a fatal situation as the mixture of the two chemicals may ignite the .re instead of extinguishing it.

developing a context-aware system requires the programmer to clearly implement how the system reasons about adaptation dependencies before activating the system behaviour that matches the current context of use.


Factors are features that intentionally vary during executions of an experiment.

the understanding of their effects on response variables are the goals of an experiment.


However, this may not be the case for embedded systems where threads running on different cores can be heterogeneous as well.

the MRAPI nodes relaxes this condition and allows nodes in a team to be distinct with its own attributes and data structures.


A Synchronous Embedding of Antescofo, a Domain-Speci.c Language for Interactive Mixed Music * Guillaume Baudart  Louis Mandel ABSTRACT Antescofo is recently developed software for musical score following and mixed music: it automatically, and in realtime, synchronizes electronic instruments with a musician playing on a classical instrument.

it faces some of the same major challenges as embedded systems.


The media objects supported depends on the media players embedded in an NCL engine (the Ginga-NCL).

ginga can run any HTML application, depending only on its embedded XHTML player implementation, as for example, a BML application2, or an HbbTV application.


For example, noninterference [8], which is one of the best known information .ow security properties, is not a safety property [22].

it can never be precisely enforced by a monitor [19], although it is possible to enforce more restrictive properties such as isolation of untrusted code [16].


When a process pi completes WriteInView in line 62 of Traverse, the latest state of the register has been transfered to desired-View, and thus it is no longer necessary for other processes to start traversals from earlier views.

after Traverse completes returning desiredView, pi invokes NotifyQ with this view as its parameter (lines 15, 20 and 25), to let other processes know about the new view.


In the Reference Scheduler, SI is determined by the lowest value of MSI of all stations; if a station has MSI larger than SI allocated from the AP, the polling period can be smaller than expected.

it will increase the overhead due to the polled frame and cause ine.cient allocation of TXOP.


In the context of software evolution analysis, it would make sense to consider the version in the reference set that a) precedes in time the version under examination and b) is closer in terms of elapsed versions.

for version v.9 it would be preferable to study the properties of version v.8.


5.2 Synchronous Observer In ReactiveML, signals are broadcast communication channels.

one can easily write synchronous observers [11], i.e., processes that listen to the inputs and outputs of a process without altering its behavior.


No transition of either the form (s s2 ) or (s 2 2 p p .

l no transitions in N violate the strong re.nement condition, and thus N is a strong re.nement of M.  4.


The size of GIMPLE statements is constant, and the size of patterns is under user control, and may be eventually bounded by a constant.

on-demand inlining changes the complexity of the checking algorithm by replacing the factor related to the size of program statements, labelsize, with the size of the patterns, patternsize.


For example, different content can be made available to developers, administrators, and solutions consultants or even third parties for industry or customer specific solutions as well as to managers, team leads, and various other administrators, analysts, and other users of a solution.

[8, 9, 11, 20] a key aspect to all design is in determining and defining what interfaces are to be visible and what is to remain transparent in a system of systems and services.


Example: using Iterable infer type constructor arguments.

type argument lists that contain type constructors, must be supplied manually.


In addition, the object targeted by y need not always be reachable from the same root.

oRCS accommodates a more dynamic 2 Because the overlooking roots relation is irre.exive, the object targeted by y must always be reachable in l from another live root.


capital value (Just x) = x While findCapital computes the right result, the predicate used with select is not as elegant as we would like.

for our second solution we de.ne a specialized equivalence relation that works similar to the SQL semantics.


It is because it needs to parse extra spaces, parentheses etc.

we cannot expect that the resulting parser is (left and right) invertible, because different input sentences, may lead to the same result.


4.6 Message reordering The motivation for extending Fredlund s single-node semantics was to capture the distributed behavior where messages were reordered.

we conclude the presentation of the extended semantics with an example of such a reordering.


Simply handing over a reference to another source often provides too much control to that source.

it is common to place a membrane around the reference before it is passed to untrusted code.


Concurrency between applications running on the same processor can be handled as if the system was a single processor one.

the solutions proposed in the SP-SD section still apply.


Participants also almost universally lacked detailed knowledge of secure programming practices, which meant that while they gained knowledge through using ASIDE, they also struggled to fully understand either the code generated or the explanation provided.

any tool targeted at improving secure programming for developers needs to be able to be used and learned by those without little prior secure programming knowledge.


Although the Wi-Fi radio has a longer communication range, it has a higher idle energy cost.

it is not desirable for all devices to turn on their Wi-Fi radios all of the time.


Search query traffic entered by automated means are not subject to these physical limitations.

the following features may be used to discriminate between web search traffic from humans and automated bots.


We incorporate this technique in DVSleak by allowing jobs to scale below fth if and only if a sleep mode is not entered for a given period of time (and only for this period).

equation 4 is constrained to only be applicable prior or after sleeping, as depicted in Figure 5 for Ti s execution and the sleep duration but not for any idle intervals.


Additionally, method compile priorities provided by of.ine pro.ling may be invalidated if the input/environment during the actual program run varies from that used during the pro.ling run.

it may be important to .nd techniques that can assess method priorities dynamically during every program run.


Improvement of requirements quality through defects discovery involves many issues such as the types of requirements and their representation, types of defects, and the efficiency of the methods and applicability.

there is no single best universal approach for the requirements defects discovery and should depend upon many factors.


These instance fields have package visibility, i.e., they are visible to all package members.


The start task has no predecessor and the end task has no successor that is connected by the association has in that subtree hierarchy.

only chains and no cycles of temporal operators are allowed to relate tasks to each other.


If we expect the system to have an upper-bound around 3000 tests, we might be satis.ed with a margin of 100, or 10 around the actual failing case.

if a test fails for UB and succeeds for LB with the difference between these two less than a given margin, then no tests need to be tried within that margin.


In addition, it seems reasonable to assume that the bias of entities to maliciously cooperate with other entities depends on who or what the other components are.

we account for joint distributions of stochastically dependent variables, and we consequently apply conditional probabilities4 .


The history of a software module usually manifests itself as indirect evidences scattered in di.erent development 2 artifacts, including the project s documentation, repositories of source code, defect tracking databases, and mailing list archives.

as part of the project we need to devise techniques and heuristics for collecting meaningful metrics from such historic databases.


Second, guest VMs may encounter additional protection faults, context switches and hypercalls (unshare in the case of Xen) as a result of writes to pages that are protected by the copy-onwrite mechanism.

a guest VM s run-time performance penalty depends on the number of unshare calls it triggers.


These techniques are described in a separate paper [21] and are guaranteed to result in a correct (yet sometimes too conservative) scheduler.

the extracted scheduler characteristics (instruction latencies and reservation tables) are additionally displayed in the GUI to the user, who may decide to manually override certain instruction latencies in case of too conservative latency estimations.


Furthermore, the choice is made in the update tail, not in the application.

different choices can be made for different updates.


L(Tn2 ) that contributes to strings in the pre-T2 language, that same substring will be included in L(Tn1/n2 in the post-T2 .ow graph.

property (1) holds.8 Property (2) also remains vaild throughout the construction because the T1 and T1 transformations do not a.ect the total number of leaves in the forest of annotations.


As has been discussed earlier, this helps improve TR reuse and reduce the number of TR updates/dTLB references.

our chainbuilding strategy tries to place such nodes into the same chain.


Like Squeak, the heart of the VM in this case the interpreter, and garbage collector are written in a Java subset that is translated to C and compiled by the C compiler.

it relates to Klein s principles much in the same way as Squeak does.


According to Lemma A.1, no successful SC(svar) can happen inside S. Consider an execution of a LL-SC block on svar.

there are two cases: case 1: the successful SC happens before S. the whole LL-SC block happens before S. Obviously, the theorem holds in this case.


A senselet may need to process data with timing, periodically or aperiodically.

a senselet can register a timer with: timer_id = RegisterTimer (interval) sensor runtime will invoke its OnTimer() method at the desired interval.


For example, consider the counterexample in which both arguments of the outermost Add constructor contain values causing the failure: Add (Div (C 1) (Add (C (-2)) (C 2))) (Div (C 0) (Add (C (-1)) (C 1))) Since no matter what random value the .rst .eld of the outermost Add constructor is replaced with, the property fails by Add s second .eld, and vice versa for replacing the second .eld.

the universal generalization algorithm might return the formula forall values x0 x1 .


Out of them, ATOMFUZZER found 21 to be real atomicity violations.

aTOMFUZZER reduced the number of false warnings by a factor of 6x.


Indeed, the communication interface we de.ned for communication between virtual node does not verify any FIFO property.

to iterate the process on virtual nodes, we need to work under non-FIFO hypothesis.


In contrast, AVIO-S is a pure software approach which is more accurate than AVIO-H but incurs larger but still moderate overhead.

aVIO-S is more suitable for in-house bug detection and postmortem diagnosis while AVIO-H can be used for bug detection during production runs.


These features can be annotated with a rationale to select them [6].

we de.ne rationale as an attribute for a feature class to capture the reasoning about its selection.


Furthermore, the releasing daemon has been specialized for the purpose of freeing pre-identi.ed pages.

it requires fewer locks overall and can do much less processing per page while locks are held.


Understandability and e.ciency are desiderable software properties, usually opposed [19, 37, 38].

we are interesting in understanding-oriented refactorings [4].


We know which files are being developed and released in 2.1 and 3.0 based on the data in Promise repository [15].

we first defined the start dates of the development periods for releases 2.1 and 3.0 as well as their milestones by looking at Eclipse project plans [12].


Legacy migration entails some critical decisions including but not limited to decisions about cloud providers, cost-risk analysis, legal and cultural issues.

in contrast to [25, 26] in our framework we argue about the needs for a migration planning process that drives architectural migration.


The dimensionality NH of H is higher than the dimensionality r of the input space.

after performing this transformation, a linear PCA can be carried out in the feature space.


Our .rst implementation of Vicinity contained a logical error that broke this invariant.

our buggy implementation of Vicinity was not able to converge to reasonable semantic value: this behavior appears clearly in Figure 14(b), which was drawn from the trace produced by Opis simulator.


As a data-.ow analysis, reaching constants is implemented by using a data-.ow analysis framework that is part of Open-Analysis.

it is necessary to implement only initialization, transfer, and meet functions.


Moreover, the algorithm used to select a particular job at a particular time from amongst the various queues is not typically published and can potentially change under administrator control.

while the implementation of multiple policies for a given machine through multiple queues can provide a high-level, qualitative expectation of how a speci.c job will be treated, it substantially complicates the problem of making a quantitative prediction for that job s wait time.


However, most of the Web services speci.ed with OWL-S are related to concrete Web services.

the composition reasoning process is primarily focused on concrete Web services, thereby having to deal with very large search spaces.


This happens, for example, if the .rst method-identifying gene of a test program identi.es neither a constructor nor a static method.

an objective function must evaluate whether a genotype individual can be decoded into a test program on the one hand (issue 1) and whether the optimization problem can be solved on the other hand (issue 2).


Identi.ers not yet bound in the runtime environment are instantiated by the trust management system, if possible, to values that make the formulas F true.

on line 1 of the Andrew role, a new channel is instantiated to accept a connection.


The control unit manages the life cycle of the functional component and the interactions with the runtime platform.

the platform supervises all elementary processors and indirectly all functional components.


(2003) show that statically detecting race conditions is NP-complete if more than one semaphore is used.

restricting eqc par statem to execute only two processes in parallel is a pragmatic choice.


r0(= q) By appending the statement *d p=&zto the above sequence we can realize the pair (q,z).

we have proved the claim that if there is a path of length d from p to q (in the graph constructed so far), then (q,z) is realizable.


Moreover, in this case the shape of the equations is such that the traf.c can no longer be expressed as a function of F .

we plot the function D(ap, ae) = T SF - T EF .


MatchMaker hypothesis: In order for two objects to interact with each other, there must be a chain of references linking them together.

the set of actions that led to the creation of the chain is the set of actions that need to take place to enable the interaction.


CONCLUSIONS There has been a broad assumption that code clones are inherently bad because they defy the principle of abstraction.

previous research e.orts focused on mainly two areas: automatically detecting code clones and educating programmers how to remove or avoid clones.


7.2 Inconsistency resolution for operations Because an operation can be called on behalf of more than one Use Case, and thus can inherit permissions from more than one Use Case, applying rules such as (14) may introduce conflicts.

conflict resolution must be applied to operations, as we stated it before, we assume that each positive permission of a Use Case is inherited by all its operations.


(A.u .B.r) =A.t .B.r .A.u .A.t .B.r .B.r distributivity =A.t .B.r .B.r A.t .A.u =false =A.t .B.r absorption Note that the tag expression A.t .B.r .A.u is unsatis.able because it needs both tags A.t and A.u, whereas we can choose at most one tag from each dimension.

this expression can be viewed as the zero identity to the connective .. A.t.B.r With the simpli.ed tag expression, the semantics of [p]D can be easily computed.


When selecting a speci.c framework for the ColADA implementation, we took into account the three identi.ed framework requirements: (1) the availability of a noti.cation mechanism, (2) the subgraph-based data structure and (3) the MVC compliance.

only four frameworks in Table 1 are eligible for adding shared editing capabilities.


However, such runtime updates can introduce undesired consequences to the application (e.g., incompatibilities involving drivers, device, and system components).

by taking into account these dependability requirements, where applications need a high level of availability, our platform had to provide mechanisms for reliability (reducing mean time to failure) and maintainability (reducing mean time to repair).


On such a setup, the co-existence of multiple Carbon components look much similar to a system composed of multiple Web Services, where the chance of con.ict due to di.erent combinations of its parts are minimal.

right now, we do not do any special handling to resolve con.icts among components.


For n tasks, M((Kj )) i=1j=1 variables are needed to describe the linear programming.

the time complexity is exponential in the number of tasks.


With this assumption, replaying the same sequence of non-deterministic events at the same moment makes possible the recovery of the state preceding a failure.

for every process, these protocols consist of saving all its non-deterministic events in a reliable manner and to checkpoint regularly.


They assume the existence of some mechanical method of producing all the necessary representations and cases for toSpine.However,inorder to provideopenextension, they use type classes in a fashion inspired by L¨ ammel and Peyton Jones.

their approach to open extension has many of the same problems with type classes.


For instance, the mobile device would supply an item of information to the server and the latter would act depending on the current state of the application.

there should be a way to create both server and mobile (client) sides of the application with the same workflow for both and a certain degree of synchronization.


Moreover, the thread that participates in a barrier need not block until all other patterns in the match expression are satis.ed.

speculation occurs both in the expression protected by the barrier as well as in all threads which participate with it.


(4) Here, the ordering of the computations determines if the right hand side terms u(i,j,k) of Equation 4 contain the old solution value or the already computed new value.

equation 4 represents a family of Gauss-Seidel smoothers, which produce di.erent results for di.erent orderings of the computations.


As it turns out, de.ning appropriate permissions using JAAS policy .les becomes more complex and error-prone with an increasing number of different users and roles.

jDOSecure comprises a management solution for users, roles, and permissions.


Our agent-based auction server solution combines the best features of: (i) generic software framework for automated negotiations [1]; (ii) market architecture for auction development [13]; (iii) rule-based declarative representation of auction mechanisms [5]; (iv) special computing nodes available in active networks and realized by means of proxy agents [9].

it provides certain advantages, including: service orientation, openness, .exibility, generality, and scalability (see [6] and [14] for more details on these aspects).


Yet, active users sometimes do choose to spend time learning, because taking the time to learn may pay off in getting the task done more quickly now or in future instances of it (benefits/payoffs, in Attention Investment).

minimalist Learning Theory emphasizes the task at hand in situations that require new learning of a tool, whereas Attention Investment more generally predicts users trade-off decisions in any kind of usage situation having to do with abstractions.


distinguish those patterns or yields too many false positives.

we developed a pattern detection approach that integrates a static, structural analysis with a subsequent, dynamic runtime behavior analysis.


More threads in the system mean each group has more threads, which also means each group has more time in each period.


Successful login will execute to the branch of 0x485bcd, while failed login leads to another branch.

we log the content acquired by GetWindowTextW when it is invoked at 0x449dbd and 0x437a23, and then we use the call stack path to prune those belonging to failed logins.


Again, the results are quite promising, but no further statistical analysis was possible because of the small sample size.

the results can only be seen as provisional.


Also, the overhead of CINT is reduced from 24.8 times to 9.0 times and the overhead of CFP is reduced from 22.2 times to 6.1 times when optimization is enabled.

execution speeds up by two to three times.


3.1 Training The modeling step generalizes from the training data, and the mode selector bases its decisions on the models.

better training runs yield better overall performance.


Programmers cannot be expected to simply abandon their familiar editors, compilers, debuggers, and pro.lers; further, it is unreasonable to expect that all future tools will be implemented within the .ne-grained model.

we believe that the aggregate system must provide support for generating external forms of aggregate artifacts suitable for use by other software development tools, and importing and extracting aggregates from output produced by such tools.


{f1} does not .ow to any inNode of printRtl at call site j, resulting in an empty alias set.

simulation is not triggered in printRtl.A similar argument holds for {f2}.


The highvariance for target sizesof10 and 15 pixels was due to the dif.cultyof acquiring small targets with this particular eye tracker.

eT01 s performance markedly improved at the 25 pixel target sizebut did not change substantially beyond 40 pixels.


In the 3 investigated compositions with attribute overlapping, the shared attribute was transferred to one of the aspects and accessed by the other pattern aspect through the invocation of aspectOf.

the separation of pattern roles is increased, but the coupling is stronger.


cable in an equation if all its .elds are both constant and with a replicable type (so that the replication cannot cause unwanted interferences); and that the set of writable .elds is disjoint (non-overlapping) when splitting a view (to ensure a unique writer for each .eld).

on a split, the set of .elds of a view is either disjoint, or non-disjoint .elds are const and replicable.


We provide two declarations for class D which differ only in that the constraint on the wildcard is implicit in the .rst declaration and explicit in the second declaration.

one would expect these two programs to be equivalent in that one would be valid if and only if the other is valid.


E.ectively, the exact lab .eld at a given node memo-izes the local labels of all the nodes on the path from that node to the root of the document tree.

to determine whether access to a given node is to be granted, the code needs only to consult the exact label, and make no further reference to other labels of other nodes.


that the set of paths satisfy the coverage guarantee.

we derive guaranteed lower bounds on the coverage of the set of paths C collected.


Reduced reliance on peer contributions: The infrastructure can absorb the cost of a certain degree of freeloading.

it is not as important to force peers to reciprocate, or to fairly distribute the workload.


This is due to re.nements belonging to features that exclude each other mutually (XOR).

multiple state-a.ecting re.nements may not always contribute to complex object states, especially not in the case of XOR-features.


Not only did this cost time, but programmers also frequently made risky assumptions about the program s runtime behavior in the process, often leading to errors.

instead of requiring programmers to answer these why and how questions themselves, programming environments could provide an interface for asking directly about program output and have the system automatically build a working set of task-relevant code with a precise dynamic slice [18] on the output in question.


Currently, no constraints on parameters are considered since those are checked by the Design by ContractTM tool anyway.

for a parameter of type Double the EasyMock.anyDouble() matcher is generated.


If a reference to this array is also stored in a local variable i.e., [xn,yn]=[*,j] andlengthof this arrayis unknown, we create a new abstract (symbolic) value representing the length of this array.

we have: » « ..., ai, ...; ..., xn-1, * f+ arraylength, ..., bi, ...; ..., yn-1,i » ..., ai  vk, ...; ..., xn-1,ai  vk, = ..., bi L vk, ...; ..., yn-1,bi L vk,, where vk is a symbolic value that is not does not appear in » ..., ai, ...; ..., xn-1, * ..., bi, ...; ..., yn-1,i , and  and L are de.ned as: { q, if we can conservatively determine p<q p  q = p, otherwise { q, if we can conservatively determine p>q p L q = p, otherwise Particularly, since symbolic value vk .


we use Ui (·) to denote task Ti s TUF, and use Ui,j (·) to denote the TUF of Ti s jth job, which has the same shape as Ui (·).


3.4.2 Dead Code Removal In raytrace benchmark there are 17 allocation sites with the same behavior: an object is allocated and assigned to an array element; the object's last use occurs during its ini- tialization, which is done in its constructor.

all objects allocated at these sites are considered never-used.


Not only is all the state of the updated module lost (this also accounts for dependent modules recursively), but stale objects instantiated from out-dated class definitions can still hang around causing hard-to-track class cast exceptions and linkage errors.

javeleon injects correspondence and identity handling between differently versioned classes and objects.


First, these results are not exact facts, in other words, the results are not metrics from a project.

the results can be biased in either favor of RaPiD7 or against the method.


However, BPFS does not create a total ordering of updates; instead, it allows concurrent, in-place updates to different portions of the .le system tree.

if two processes execute sequentially on two different CPUs, then their updates may be committed to PCM in any order, since there is no dependency within the .le system that forces serialization.


In contrast, in our approach the number of messages sent depends on the frequency with which nodes cross region boundaries.

for example, if two nodes remain in the same regions forever, they need not exchange additional messages to maintain the status of the link between them.


To ensure that the document replicas at each cooperating sites can always exactly re.ect the initial intentions of each cooperating users, and can eventually arrive at the same consistent status at the end of collaborative session, whenever to synchronize a remote operation, it must take into account the impact of all the concurrent operations executed previously.

precise capture of causality is crucial in real-time group editors[2, 7, 8].


The search cannot know whether these backtrack points lead to the same states yet, however, because it has not yet searched the intervening state space.

the search must add both backtrack points.


For the second rule, there are possibly three(second-order) substitutions obtained from matching S2( ) with k1[k2[ ]]: k1 = ,k2 = S2( ), k1 = S( ),k2 = S( ), and k1 = S2( ),k2 = .

recall that k1 and k2 are de.ned by k1 = evAc(x1) and k2 = evAc(x2),and x1 and x2 come fromthe patternAdd(x1,x2).wegeneratethefollowing rules.


By de.nition, a product-linespeci.c type error always involves, at least, two features.

the corresponding presence condition always contains, at least, two features, but possibly more.


In this example, we consider a test suite to be reliable when it satisfies test adequacy criterion that covers all message paths (covers all paths in the sequence diagram) [12].

the information obtained with the proposed model-based coverage measurement approach allows the tester to conclude the test suite used does not satisfy the desired test adequacy criteria.


This test is also known as the Extreme Value test and handles only af.ne pair-wise dependence problems.

it is known to be less powerful than exact tests on coupled subscripts.


The caches at these sites already exist (were introduced by the developer).

we (1) ran the tool with caches disabled at all sites to produce an estimate for each site, and (2) for each site ran the original (uninstrumented) program, with the cache disabled .rst and then enabled, to determine the actual savings in .nal tenured heap due to the cache at that site.


This can be described by two mathematical properties: ..(..(..)).... =0, ..2..(..)..2.. =0.

the utility functions U are concave upper-bounded functions defined on .. which is a convex and compact subset of RN.


This can be gleaned from Figure 7a, as the utility range for the solutions selected by both POISED and traditional approach in E4 are larger than E5.

from Figure 7b we can see that the solution selected by POISED in E4 achieves more improvement over the traditional than in E5.


Indeed, a stabilize action causes the timed-out request to be transparently re-processed, or allows the webserver to process a new request, depending on the desired behavior.

each module only has to manage its own components and does not have to explicitly communicate with other modules in the case of a timeout error.


A newtype (Seq a) that shares the representation of [a ] runtime overhead.

the methods (==) and compare of the (Eq (Seq a)) instance use the methods of the (Eq [a ]) instance without any coercion overhead because the types (Seq a)and [a ] share the same representation.


Since the observation likelihood P(o)is .xed across all candidate locations, the decision rule becomes: l = argmax [P(o|l)P(l)].

(2) l.L it remains to estimate the class-conditional probability, P(o|l), and the prior probability, P(l), for each candidate location l .


Annotations are only the information useful and necessary for the programmers or people who need to look into the source code for understanding.

we believe annotation should not intervene the similarity measure for the source code programs.


The component is neither involved in the game mechanics of a Risk game nor with the graphical representation of the world.

the reuser can use it with his own game mechanics, such as offensive and defensive rules, and GUI.


When u.-1 does the third sweep, the density of u.-1 is (t.-2 +t.-1)/2 > t.-1,so u.-1 is above threshold.

the end of phase 3 is the .rst rebalance of u..


The CPU operations are done in a symmetrical way.

between acquire and release points the LRB and CPU operate out of their local memory and communicate with each other only at the explicit synchronization points.


Textual files usu- ally contain far less than nominal 256 possible characters used in most text encoding schemes.

compression al- gorithms leverage on inherent redundancy of the encoding to achieve low compression ratios.


[] tail (ConsE False (ConsO True NilE)) .

[True ] a programmer has a design choice of using either GADTs or SSubtypes in certain situations.


Byperforming this rescheduling,thedependence chains that produce many of the latencies identi.ed in the JVM Instruction iadd arebroken(seeFigure1).

the compiler is given room to produce improved scheduled code and thedispatchphase of theinstruction cycle canbeissued without a data dependant delay.


Of course, most of those procedures are regular parts of the development process, and defects are not a problem per se, provided they are removed before delivery.

evaluating effectiveness is partially done by assessing how many defects remain in the delivered material.


One result of this extension is that strict enforcement policies reduce the size of a layer s run because there are fewer possible operations to assess.

a layer Nt s con.guration at time t is de.ned as a tuple (E,p,H,Rt ), where E and p are the current entities (code or programs running in the layer) and policies, respectively.


5.2 Arrays Arrays do not have constructors and their number of elements might not be statically known.

it is not easily possible to use a de.nite assignment analysis to determine when an array has been initialised.


Even for a small s/µ=0.06, the variation is very signi.cant.

variation-aware algorithms for application scheduling and power management have good potential.


A Systematic Method for Generating Quality Requirements Spectrum Shunichi Suzuki Tomonori Sato Masaaki Tanigawa Shinshu University, Japan Shinshu University, Japan Shinshu University, Japan Akira Osada Haruhiko Kaiya Kenji Kaijiri Shinshu University, Japan Shinshu University and Shinshu University, Japan GRACE Center NII, Japan http://www.cs.shinshu-u.ac.jp/ kaiya/ ABSTRACT Spectrum analysis for quality requirements is useful for measuring and tracking them, but current spectrum analysis largely depends on expertise of each analyst.

it takes a lot of efforts to perform the analysis and is hard to reuse experiences for such analysis.


The weights specify the importance of each objective, and .........1.

the final complete optimization problem, including the constraints (Eq.


Batista et al [2] state that aspects are not differentfrom other components in the system and that thedistinction between aspects and regular componentsis in the way aspects compose with the rest of thesystem the scope of the composition is broad andaffects multiple components or multiple architecturalelements.

it is not necessary to introduce another abstraction at the architecture level to represent an aspect.


Also, the channel watching activities of each node is mostly limited to a small number of channels that it is mostly interested in [7, 8, 9].

sAVE clusters channels with frequent interactions.


For a given MS/MC pair and a media content item, it is difficult to nominate the canonical set of services that are required in an a priori fashion since the MediaPorts that are available to perform a given required service may introduce dependencies that also need to be accounted for.

the ability to avoid explicit management of MediaPort dependencies serves as another motivation for a peer-to-peer approach to service composition whereby each MediaPort on a given service path is directly responsible for choosing its successors on the path.


In C++, the detachment of the string representation from the Rational class is considered inappropriate because that would be unreasonably scattered.

an automatic translation from HASKELL to C++ would need to be able to infer when to encapsulate such a function in the class.


Since arbitrarily dividing E into subsets does not compromise soundness, a speci.c division such as in C Gpp also does not lead to loss of information.


In some applications such as test-case generation, it is more usefulto enumeratethe setofthe correspondinginputsinstead ofreturning oneofthecorrespondinginputs.

the useof memoizationisimplicitin ourinversecomputa ?


As a result, CRR is 1, but with trivial clusters.

we must maximize CRR, but without generating too many clusters.


With the increase in the number of objects, classes, and integration of source code, it is likely that a developer writes a pointcut that does not serve its intended purpose.

there is a need to test pointcuts for validating the correctness of their expressions.


The AT language helps these architects to make such decisions explicit, analyzable, and reusable.

software architects bene.t from a lower risk of implementing SaaS applications with unsatisfying scalability and elasticity properties.


The proposed methodology is based on the assumption that the CPU of a perfect virtual machine behaves exactly as the physical CPU it simulates.

the intent of the testing is to verify whether such assumption holds.


First of all, the features are associated with behavior graphs, rather than individual APIs.

it is much harder for an attacker to engineer confusing samples at the behavioral-level.


Notice further that the semantics of the try-catch-finally statement prescribes that any abrupt completion of the finally block discards the throw of value V .

any return, break or continue statement would have a similar e.ect.


||Xw1 -Xw2 ||.8 ||Xw1 - Xw2 || Moreover, as in the proof for Theorem 2-(ii), the distances ||Xu - Xw1 || and ||Xw2 - Xv|| are .nite, and T(Xu,Xw1 ) < 8 and T(Xw2 ,Xv) < 8 with probability 1.

we have T(Xu,Xv) T(Xw1 ,Xw2 ) lim = lim , ||Xu-Xv||.8 ||Xu - Xv|| ||Xw1 -Xw2 ||.8 ||Xw1 - Xw2 || so that (32) holds.


Each such node is recorded as a binary document with preserved relational information with regards to the other nodes.

it is possible to retrieve any sub-part of the entire graph if required.


The new BorderWindow also contains its own inner call in paint, so that the content of the window can be painted by subclasses.

button is implemented as follows: class Button extends BorderWindow { ... void paintLabel() {.


This is the bound on the number of iterations of the main loop in Figure 3.

all (N-t) white nodes eventually become black, and the main loop in Figure 3 ter- minates.


When dealing with XML data, there are situations which cannot be captured easily (or cannot be captured at all) with traditional evaluation of XPath queries.

we mightwantto .lter notjustspeci.c elements of theXML document but entire hierarchies under these speci.c elements.


A completed statechart is encoded in the XMI format, from XMI translated into the APRIL format and finally included in the APRIL overall presentation description.

every UML Case Tool supporting XMI export can be used for authoring.


And that practice corresponds in ISO 9001 to the 5.4.2 clause (quality management system planning) and 8.4 (analysis of data).

it s not possible to affirm that OPD is a ML3 process that few organizations can/will run if a company is ISO 9001 certified.


Letting the compiler choose an implementation was only possible if this did not change the semantics, so we were forced to de.ne the semantics abstractly.

the semantics of parameter passing cannot depend on the relative locations of the invoker and the invoked.


In fact, in all modern object-oriented programming languages the objects tend to be small and self-contained, consisting of only strongly related data .elds.

the object granularity is indeed the proper granularity to be employed.


3.2.1 Field Appearance and Attribute Descriptions Field is displayed as a rectangular region on the display screen.

it has attributes regarding its position and keywords.


Each student produces an individual report that is marked independently of other group members.

each team member can (and often did) receive different assessment marks.


Furthermore, the JVM will be suitable for different kinds of processors and save RAM without any additional change in it.

we have selected Specialized data access only toextend theTakaTuka JVM and for detailed evaluation.


Lnext , pair (Ni,Nj ) must be part of any instance of .eld next (allowing us to replace variable pNi,Nj by the truth value true).

the presence of bounds allows us to determine the value of some entries in the KodKod representation of a given Java .eld.


Any exhaustive interleaving searcher that attempts to handle shared variable access, and thus be complete in this aspect, would face the problem of state space explosion.

an exhaustive searcher does not obviate the other types of tools, but rather complements them.


[· ] min Hence [·]T only yields .-term-graphs without sharing of S-vertices, and therefore its image cannot be all of Teag.

we cannot hope to de.ne a readback function rb with respect to min ·that has the desired property (P3), because that requires that []T the image of the semantics is Teag in its entirety.


For tra.c networks with two sorts, the velocity dimension is unit distance/unit time, e.g., kilometer/hour, and the density dimension is unit mass/unit distance, e.g., ton/kilometer.

multiplying a velocity v by a density d produces a quantity v * d, namely a .ow, which is measured in unit mass/unit time, e.g., ton/hour.


In the above instance, even though the subject is correct, it eats for in.nite time.

the underlying WF-OWX dining layer need not satisfy its speci.cations in this instance.


With an interactive construction of queries, each operation the user specifies in the query leads to an intermediate result that the user can accede.

he can better choose the next operation, change an operation already introduced or manipulate intermediate results, until arriving to the desired result.


3 The tree view report, which gives an overall graphical structure of how users move through the application.

it can be used to analyze users navigation patterns.


Due to the sizes of projects 7, 23 and 25 and high computing resources, we were unable to derive call graphs for them.


The effective change in relative load of a node is the product of these three effects.

for the relative node to change by a factor of 8 from 2 e L, at least one of the values has to change by a e L to 16 factor of 2.


For example, a graph type may refer to the types of edges and vertices, which are used in most graph operations.

the concept Graph used to express generic graph algorithms may require that a graph type name its edge and vertex types, so that the concept can refer to these types in its signatures: concept Graph { typename edge; typename vertex; ... edge .nd edge(vertex u, vertex v, const G& g); }; Associated types are are place-holders for actual types, that is, concept they are implicit parameters to the concept.


Keeping the modification count for each page, however, may incur considerable overhead.

we choose to monitor at a much larger granularity and keep a modification count for each file which is updated when the modification time is updated.


No research has been done to develop a selective mutation technique for class mutation operators.

we implemented the entire set of class mutation operators, which are listed in Table 2.


http://dx.doi.org/10.1145/2633628.2633635 Central to this technique is the idea to represent a recursive data type as a two-level type (Sheard and Pasalic 2004) Fix f consisting of a signature functor f and a knot-tying .xpoint constructor Fix .

modularity over the data type Fix f can be expressed in terms of the signature functor f .


Foralli, p_< ~ <-ft. Then for A = 1 - ~ fi, we have that 2ai  -]: <- e+ + p_ Zx Proof: If p -= ~ = p then fi = ~ p for all/, and hence A = 1 - ~.


Current work focuses on applying the quality model to a set of selected software development projects at Ecopetrol.

a tool chain is being created that will automate large parts of the measurement data collection.


In this pattern, various subscriber objects can register with a publisher object to receive asynchronous noti.cation callbacks when information is published via the publisher.

this example includes both objects and in.nite state space, as well as reactive behavior.


CMP Configuration Calling Location Param Threshold L2 Size # Cores File Line .... .... .... .... .... .... .... .... .... .... (b) Table for implementing the Parallelize function grouping.

compared to the right bar, an individual task of the middle case may be less e.cient because it still contains the parallel code (e.g., parallel merging).


Methods that directly compute an exact solution for x, such as Gaussian elimination, are generally expensive, particularly if A is sparse.

most applications use iterative methods, such as multi-grid.


However, lower values will also increase co-allocation times, and hence, increase co-allocation costs.

the internet environment, transferred file sizes, and co-allocation costs should all be considered in determining optimum thresholds.


To keep its service satisfactory, the system needs to adapt to changes of the environment.

software homeostasis mechanisms are necessary to monitor system behavior and dynamically modify the system to repair abnormalities, or deviations from the expected behavior [18].


This means, after removing all columns exc ept the c olumns in the test, all the rows belonging to diff erent classes are different.

the attributes in a test are sufficient to distinguish the classes in the training data.


This observation suggests that the naive rejection policy, which rejects the request whose deadline is violated, would suf.ce.

joserlin uses this as the rejection policy.


Currently, the Brazilian standard for DTV has not completed, especially the sections that discuss interactivity and supported APIs.

it is possible to suggest the expansion of the standard to enable support for 3D applications by extending the architecture of middleware Ginga.


M - d0 + g2/w(0) E When M is large, the above simpli.es to µg2tE M ~ M ln .

w(0) E Fraction of total number of peers 0.9 0.8 0.7 0.6 0.5 0.4 0.3 0.2 0.1 0  0 100 200 300 400 500 600 0 100 200 300 400 500 600 Time (days) Time (days) (a)g =25 (b)g=50 Figure 8: Proliferation of pollution for Version Centric model: Recovery Hence, MM tE = O( ln ) (19) µE Comparing the above with (13), we note the additional factor M. From equations (14) and (16) we note that here the rate of growth of polluted versions is proportional to the rate of growth of good copies, whereas the number of good version stays at the constant g. as time goes by, it becomes increasingly more di.cult to get a good copy.


Our restrictions force delegations and declassi.cations to be static, global entities.

the policy must be established at the outset of the program and the policy checks could be integrated into the typechecker, which would give static enforcement, as we have in FJifP.


Thus for every data constructor of every GADT there is an appropriate Kan extension which can be used to trade that data constructor for one based on existentials and the Eql GADT, and from which an initial algebra semantics for the original GADT can be derived.

the proliferation of different codings of Kan extensions, which seems a drawback at .rst, simply re.ects the fact that Haskell does not have a proper polymorphic system of kinds.


For example, if students have written few or no test cases, Marmoset can be con.gured to provide less information when students perform a release test.

students will be motivated to write test cases early in their development, so that their early release tests will return as much information as possible.


Any job, once allocated, cannot be revoked / moved to another choice.

a job p will not be served if, at the time of its arrival, all the servers it can be allocated to already have more than dp jobs in them.


Intermediate fusion points perform application-speci.c processing on streaming data.

an application is a directed graph, with the data .ow (i.e.


The subtree size is chosen such that it .ts within the available memory in the system.

the entire subtree .le can be read into memory.


All agents may see the contents of each others stores, but only the associated agent may delete its contents, and only then if the rules of the dialogue game provide a locution effecting this.

commitment stores are private-write, public-read spaces.


At the end, we are left with a formula f(X " ) where X " denotes the set of all remaining symbolic variables xi " .X for which there SC are no concretization constraints in ALT (pcw ).

we know that all expressions of the form e(xi" ) in f(X " ) are in T, that they did not introduce imprecision in symbolic execution, and that they are represented in the exact same way in ALT (pc SC).


Once such a bug is identi.ed, attack programs can be devised, they will for instance install a payload on the victim host.

one important line of defense is to prevent the identi.cation of such vulnerabilities (often referred to as 0-days ) in the host program.


Indeed, it is difficult to have a unique model that can satisfy all requirements of various fields.

hybrid or incorporated approaches are often used in sophisticated applications in [7] where a hybrid approach for an MPEG-7 Description Definition Language (DDL) is proposed.


However,if statement7happensbefore statement2(Case2), then thetainttagforI0 would notbepropagated toThread1.

serializing an executionpotentiallyleads to undertainting.


On the other hand, communications that send a result already use this payload to carry the size of the result bu.er.

we had to use an extra message, which is sent before the size of the result bu.er.


6 Shuf.e Transfers During the shuf.e phase of a MapReduce job, each reducer is assigned a range of the key space produced by the mappers and must fetch some elements from every mapper.

shuf.e transfers are some of the most common transfer patterns in datacenters.


Based on the policies for handling read/write requests mentioned in Section 3.1, updated data of write requests are written to the out-place area to enhance the endurance of physical blocks in the in-place area.

when a read request is received, the run-length tree of the out-place area is .rst searched for the requested data.


When the target computing platform is already decided, going through the AUI step is no longer required.

the phase of defining an AUI could be skipped.


Since the taken path of the diverge branch candidate at A always reaches C before it reaches D, even if both C and D are selected as CFM points, dynamic predication would always stop at C. D would never be reached by both dynamically-predicated paths of the branch at A in dpred-mode, and thus choosing D as a CFM point does not provide any bene.t if C is chosen as a CFM point.

the compiler should choose either C or D as a CFM point, but not both.


Another di.erence between BDF and BPDF is that, in BPDF, the graph iteration is cleanly de.ned using either constant values or integer parameters.

the number of .rings of each actor is known at the beginning of each graph iteration.


Secondly, in the cases where all possible violations cannot be ruled out, the program can be instrumented with dynamic checks only for operations which were not ruled out by the static analysis.

the runtime overheadofa purely dynamic checker canbe reducedby reducing the instrumentation points.


As a result, a static .ow graph that iTarget constructs can be considered as a projection from an execution .ow graph: invocations of the same functions are merged into single operation nodes, and variables that may alias are merged into single value nodes.

the approximation is sound, as a cut in a static .ow graph is easily translated to one in a corresponding execution .ow graph.


On the other hand, in GFDL, there is a condition that invariant sections cannot be modi.ed even when derivative use is permitted.

the following condition is added only for GFDL.


Since guidance is received once per second, a doppelg¨ anger s state is unlikely to deviate substantially from the actual player s state.

unless a player deliberately focuses on the doppelg¨ anger, he is unlikely to notice the di.erence.


On the other hand, Select homogeneous sample is an action to address Heterogeneity of subjects.

there is a trade-off between types of validity (see Section 4).


The routing .exibilities of connections [[ a, a ' ]] , [[ b, b ' ]] , [[ c, c ' ]] , [[ d, d ' ]] , and [[ e, e ' ]] are 4, 1, 10, 6, and 1, respectively.

the order in which the connections are to be routed is [[ b, b ' ]] , [[ e, e ' ]] , [[ a, a ' ]] , [[ d, d ' ]] , and [[ c, c ' ]] .


INTRODUCTION A recent document [1] about Argentina formulates: "Information is power because is the basis of knowledge and this is crucial for action.

the refusal to provide information, concealment or distortion prevents certain realities to be known or disseminated.


Additionally, our algorithm provides detection of denial-of-service attacks aimed at increasing the window: replicas can time how long a recovery takes and alert their administrator if it exceeds some pre-established bound.

integrity can be preserved even when there is a denial-of-service attack.


Because of this .ne granularity of Observer-based DFA algorithms, .-observer-DFA appears to be more natural than observer-DFA.

in this paper, we do not discuss or experiment with observer-DFA.


However, the inductive synthesizer can only eliminate candidates based on violation of safety properties on a trace.

we require that any liveness properties be approximated as safety properties which must hold after a bounded number of steps.


A cell in the array post wait contains the value m: This implies that the post the thread Tj is waiting for has been executed.

the thread Tj can come out of the spin-wait-loop .


However, self-loops are not permitted in the dependency network formalism on which PPDGs are based.

our technique eliminates self-loops from a PDG by introducing new nodes and edges.


This means that node i (or possibly its children) will have to combine the proofs that they receive to generate a proof of the rest of path quality.

the combined process is itself a rest of path monitor.


Objects and components have been successful at delivering reuse within an application (where an application is defined as code that is developed and deployed as a unit), SOA, however, depends on achieving reuse between applications.

e-business applications with service-oriented architecture are more customizable and easier to be integrated.


Furthermore, both implicits can be brought into scope using import and the user can choose which implicit to use by explicitly parameterizing a declaration that requires a monoid.

the result of executing test is (15,120,120).


4.4 User interface When a VM is created, it is a high-throughput VM by default, and the user interface should be provided to the system administrator, so that the type of a VM can be changed by the system administrator according to the characteristic of the workload in the VM.

we added new option xm sched-pe into the Xen management tool, that is xm.


If In and Ii do not intersect, according to LPEDF, the ending point of In can be no later than ri.

jn needs to be .nished before the arrival of Ji or it may block the execution of Ji and cause Ji to miss its deadline.


Clearly, the only siphon in NCFG is the entire set of places, which cannot become empty during the execution of the program.

any siphon in NG must include lock places.


However, context modeling and management techniques presuppose significant domain expertise in the areas of mobile, distributed and ubiquitous computing [1, 2].

mobile developers transitioning from enterprise and desktop scenarios face significant (and often prohibitive) complexity when creating context-aware apps.


Unlike many previous approaches, our AVIO does not require programmers to provide any speci.cations about synchronization primitives or atomic region assumptions.

our idea applies for not only multi-threaded programs using standard lock-based synchronization, but also those using application-speci.c synchronizations as well as future applications that are written in transactional memory models.


Non-assessable criteria can inherently not have any impact, unjusti.ed ones become ignored.

e.ective criteria must be both well-founded and checkable.


The enzyme assay (Figure 11), creates four different dilutions for each of the enzyme, substrate and inhibitor using the same diluent.


INTRODUCTION Sequential consistency constrains the possible optimizations and requires complex cache coherence protocols.

multiprocessors often features weaker memory models.


Currently, there exists no generic model for the identification and specification of software FUR for implementing system reliability requirements (system NFR) based on the various views documented in international standards and in the literature.

it is challenging to measure these reliability-related software FUR, and take them into account quantitatively for estimation purposes.


Proprietary ERP (Enterprise Resource Planning): Mapping expression is used for the personalisation purpose of ERP applications [2], [12].

we need to put the mapping guideline inside the system meta-data and use this meta-data to reduce the complexity of manual definition of mapping expression.


An e.ective copy protection mechanism makes investments into software products substantially more calculable and much easier to handle.

we are convinced that the copyprotection enabled by the cloud has the potential to boost investments into software development and to empower a more competitive, more vibrant software market.


range(M) such that M. = {(I, J ) .M| J = J .}

satis.es that M. =S M. intuitively, we say that a mapping M is target non-redundant if we cannot remove any target instance from M, and still be able to transfer the same amount of information.


In all of these steps the speci.cation is derived from an example created directly in the concrete syntax of the modeling language and the preferred environment of the user.

no programming is necessary to adapt AMOR.


Following a symmetric approach, the crosscutting nature of a component only depends on the connections with other components, which in ADLs are speci.ed in connectors.

another contribution of AO-ADL is the extension of the semantic of traditional connectors to represent the crosscutting effect of aspectual components.


Otherwise, there exist some paths that the data flow from R_A fails to reach R_F, it indicates the resource may be leaked in these paths.

the resource leak detecting is reduced to the satisfiability of DFC.


On the other hand, the architectural modeling of the soughtafter HIS e.g., to provide users with easy interaction to permanently available clinical systems is far from a trivial task.

either by being model-driven or not, for those systems to be what has been called future-proof [1], a careful architectural design is important, if not indispensable.


This java actor runs on the local host and therefore creates the list of .les to be archived at once on the local host (this is why the SshDirectoryListing emits size information for the .les besides their names).

the Archiver takes care of copying the list to the remote machine and the execution of the archive command on the list remotely.


(I x @ ref b) Thanks to the name introduction form, instead of planning ahead and quantifying x in front of the function type, one names the .rst argument x on the .y.

in the surface syntax, one writes: .a, b.


Later, the database method was called on this object.

when the redirecthappens, the object willbe nil.


phical location, the memory size, and the price are clearly de.ned by all providers, the processing power of the o.ered virtual processing units is not concretely quanti.ed.

we express it using an appropriate metric called RS unit representing the equivalent computational requirements of one RuneScape server servicing 2000 concurrent clients.


By Invariant 5 in Lemma 6, it fol- X lows that (, where ahnCAetss(, and hence ahnCtetss(by Lemma 12.

we have ainCAetsm(N , and Cio(XN=ptetsds( r .


Though not explicit in the .gures, this follow the renewables routing has the bene.t of signi.cantly reducing the brown energy usage since energy use is more correlated with the availability of renewables.

geographical load balancing provides the opportunity to aid the incorporation of renewables into the grid.


Also, most network applications are streaming applications that are typically processed in a pipelined fashion.

the tasks on different micro-engines are pipelined in such a way as to maximize the throughput.


The security concerns are related to the privacy of resources, since LANs are usually for private access, while public clouds are open to users.

more security problems are needed to consider for applications like performance testing.


Such a large component implementing everything would go against the component model philosophy where a reusableparthastobe encapsulatedin a component.

an algorithm should be encapsulated in the implementation of a component.


This is because in the random walk mobility model, a mobile node tends to move around its origin after the simulation starts.

the link can often last longer than with the random waypoint model.


These roles are aggregated by type and proposed to the developer as a list of query re.nements: //s : COMP UT E//idf : FILE (3) //s : CLEAR//idf : FILE (4) //s : SELECT//idf : FILE (5) //s : CALL METHOD//idf : FILE (6) //s : LOOP//idf : FILE (7) In our interviews with developers, we discovered that statements are typical targets of search while conducting code reviews or searches for examples.

the .rst list of proposals is restricted to statements.


Each stakeholder has his/her own perspective in defining variability.

stakeholders are able to maintain their own partial models about the domain and its variability.


(Typical properties include the violation degree of a constraint and the set of variables violating the constraint.)

although they are used to model the combinatorial problem in a declarative fashion, constraints also encapsulate sophisticated incremental algorithms and data structures.


In most cases there are only few well performing task partitionings while the others show rather poor performance.

the random scheduler is not a good solution and even lags behind the two default strategies.


Type-3 clones decrease stability with probability 0.08 which is much less than the probability of non-cloned code (0.33).

both (i) exact copy-paste activities and (ii) cloning by renaming identi.ers and changing data types should be given more attention during development as well as maintenance phase.


Still, CFG signi.cantly out-performs DOM on the Nehalem-GCC con.guration and remains competitive on all other con.gurations.


For example, access control restrictions or high collect costs might limit the ability gather all required records.

one key question is how to analytically quantify the quality of scores computed using incomplete information.


We believe that there is no universal solution to this problem; addressing the issue of application portability across platforms that don t share any common characteristics is practically impossible.

we attempt a high-level classification of cloud application platforms and thereafter we narrow down on a specific category of platforms where our interest will focus on.


Speci.cally, anynode a that waited at the barrier would have received all messages from another node bthat were sent before breached line 12 and that were received before all nodes reached line 12.

mDB creates thehypothetical barrier by updating the state of the logically synchronous view at line 12 with all such cache update messages.


The authors of Livecodelab began with JavaScript as the end-user language, moving to Co.eeScript (an expressive language that compiles to JavaScript) and .nally to developing their own custom DSL.

instead of seeking greater expressivity through abstraction, Livecodelab s developers focused on designing a language customized to their needs.


Since the physical address has been changed, the pointer of its parent node also should be changed.

since the all nodes from the leaf node to root node have to be changed.


I. Kolcu Computation Department University of Manchester e-mail: ikolcu@umist.ac.uk the compressed form) can be overwhelming.

compression/decompression decisions must be made based on a careful analysis of data access pattern of the application.


The transformation takes into effect almost immediately as certain behavioral changes detected through monitoring.

a greener and rapidly evolving software system transformation based on predictions from historical behavior pattern as well as runtime monitored action is finally achieved.


However, there is one aspect of the modeling notation we want to highlight here: All systems that were expected to be developed share a lot of commonalities.

it was a requirement that the modeling notation should be able to represent the similarities among the systems.


Once, the generated proxy is installed, it publishes (4) a UPnP printer device which is rei.ed (5) and exported (6) by the UPnP BD [1] as a real de vice on the network.

the UPnP application interacts (7) with the exported virtual device and the invocations are transfered to the proxy by the UPnP BD.


The WSA is also used for processing SOAP messages, because in general, local services may not be able to process them.

during the CS execution, the API calls to the service stubs actually make calls to the WSA.


However, since no node will be at the root of two tiles (this would imply that the exact same value would be computed twice), the number of tiles in a tiling is proportional to the number of nodes.

the top down pass, which traverses tiles, has linear time complexity.


As discussed in detail in Section 5, it is not intended to translate all possible conditions in WUIs into corresponding JavaScript code.

one has to select the conditions satisfying the criteria presented in Section 5 before the translation starts.


Now we perform analysis to compute the ratio of received frames with the total transmitted frames for secondary user.

as Pd is 100% for all the measurement runs for the scenario, the SU transmitter sends during TOF F and remains in idle state in TON .


In case those computations have to be performed again, it simply reads the results in from the memory.

for input sets which cause a lot of duplicate computations, including Adult and USPS, GPUSVM performs better than Adaptic-generated code.


So even if a job cannot complete before its critical time, it may still accrue some utility, as long as it .nishes before its termination time.

we need to prevent over-killing in feasible().


[15] used the formal concept analysis to analyze the dependencies between prede.ned features and their required components, which are extracted by scenario traces.

the complete lattice is calculated using standard tools and it is used for the creation of mappings between features and components.


4.3 Heterogeneous Compute with Intel Xeon Phi The results based on STAC Pack RevC provide the expected performance and core utilization for a dual-socket system based on Intel Xeon E5-2697 v2 processor(s).

additional performance scaling can be achieved only by increasing the amount of compute resources.


After a number of modified or rejected refactorings, or the introduction of several new code changes, the generated Pareto front of refactoring solutions by NSGA-II is updated since the system was modified in different locations.

the next component of DINAR is executed to update the refactoring solutions based on the new software system.


An example is shown in Figure 3d -applying the transformation pattern to a model instance that already has some elements in the desired location.

a more flexible and generic mechanism is needed.


the types of the parameters, where the owner of the declaration is provided as the type of a self parameter, and the return type).

whether a component satis.es the overloading requirements can be checked modularly by looking only at the signatures of declarations in the component and in components it imports.


From a technical perspective, it should be mentioned that the constant EDGEn,m,j-i is known when the ILP is created.

constraints are only generated if an edge between n and m with the matching interleaving level exists.


In foreseeable future, the number of processor cores in a single processor will continue to double steadily [11].

we will reach the era of hyperscale virtual server consolidation where hundreds or even thousands of virtual servers can be packed on a single many-core based physical server.


Thus, the scheme o.ers only short-term anonymity.

we propose that encrypted credentials should not be published alongside the plaintext names of the voters.


However, planning experimentation based studies for real industrial needs, in particular concerning qualitative and quantitative results associated to software development reference models, is a complex task.

we believe that publishing and discussing this experimental plan with the academy could allow us to gather feedback for additional tailoring and improvement of the plan, which is already being enacted in the context of a nationwide software process improvement program.


In Figure 1, points A, B, C, D, E and F constitute the convex hull.

a triangulation of a set of all points in P ..2 is a set of triangles Figure 1: Sample triangulation and use of CCW predicate: F, A, E turn is counter-clockwise thus, CCW (F, A, E) > 0 T whose vertices are elements of P .


At least for larger software systems, it is however rather dif.cult and prohibitively time consuming.

testing gains importance also for declarative languages (Claessen and Hughes 2000; Koopman et al.


If an earlier task fails to arrive, a task will be stuck in the pending queue till it is recti.ed.

the ordering mechanism depends on an external mechanism such as the monitoring system to diagnose errors and rectify it.


Each statement calls a composite or leaf function on input and output variables.

statements serve as links from task outputs to inputs, forming an implicit, distributed task graph as the script executes.


Since LRU list size is variable, we set B1 and B2 to the percentage of total list size.

the numbers of files in three sections are dynamically adjusted.


Under these assumptions, the probability that no process is delayed on any nodes is (1 -p)n .

dp(n)= 1-(1 -p)n (1) denotes the probability that the job is delayed within the current computation phase.


For instance, if you want to associate information with classes, you cannot add a .eld to Class ob jects but you have to rely on external structures such as hashtables.

using re.ection may lead to important performance penalties in terms of time and space if implementation is carried out without caution.


For simplicity, let us assume that, in the original layout (a), all the accesses to the highlighted data elements (grey boxes), x, y, u and v, incur last level cache misses.1 In this layout, x and y are mapped to di.erent rows.

if an access to x and an access to y incur successive cache misses (x is accessed .rst), then the access to y will also incur a row-bu.er miss.