Many di.erent classes of device drivers, from audio to In.niBand, schedule a worker thread with the same frequency as the clocktickfor periodic maintenance and other reasons1 .

global data that is changed on a core would cause cache line evictions in other cores inthe system, which is aperformancepenalty and scalabilitybottleneck.itisdesirable toavoid the clock tick on all possible cores and move the critical functionality that requirestheperiodicticks toadesignated CPU.


The results strongly support the claim that .nding a non-spurious successful execution will require very few iterations.

di.erences between executions are presented in terms of predicates derived from the speci.cation and program, rather than speci.c changes to variable values.


Resource trees also represent resource dependencies, in which one resource is dependent on another.

a few resources stray from that pattern, such as the AWT Window class, which provides the dispose() method.


As another example, when documentation is written as part of the library that it documents, then the code to produce the documentation is document-time code, which is independent of run-time code.

instead, the module repository  contains all compiled module de.nitions, including those that were submodules.


Related Work: The problem of scheduling real-time tasks that share resources has been studied in the past for identical multiprocessors (e.g., [7,14,16]).

1 Ci Di Ti feas(nmo-np,t ,,,rk,p) (9) 222 Proof.


Liabilities 1 4 Non-Security Known 4 1 Uses 4 Non-Software Example 1 3 Participants and Respon 2 1 sibilities 2 Preconditions 1 1 Problem/Requirements 1 1 and Context 1 properties 1 1 Rationale 1 1 Relationships 1 1 Resultant Context 1 1 Security Factors & Risks 1 1 Security Objectives 1 1 Social Dependencies 1 1 Strategies 1 1 Trade-Offs 1 1 1 Total # of Sections 53 There are 53 different sections or sections, such as Motivation, Solution or Forces that are used in softwaresecurity pattern publications.

we select one of them to represent the section for the comparison process.


Similar to distributed stream processing systems, applications built on object-, component-, or service-based architectures, such as CORBA [11, 12, 14, 21] or Enterprise JavaBeans [36], or on multi-tier architectures [13, 22] are composite.

each component has a primary and a number of backup replicas.


The variability information is organized as a tree with a single root.

initial results are promising and serve as a first proof-of-concept regarding the automatic generation of variability models with the help of our tool-supported approach.


This problem is mainly due to the fact that current Virtual Machine Monitors (VMMs) do not simultaneously coordinate/schedule Virtual CPUs (VCPUs) that host threads/processes of parallel applications with synchronization requirements.

such types of applications su.er from signi.cant performance degradation, especially as the overcommitment is common in cloud.


We also keep in RAM the addresses of the last few non-bad erase units that we accessed, to avoid checkingfor abad unitin every read.

after every 10 16 KB sequential read accesses(or writes), weperformedtwo200B random read(or write)tothe100MB.le.randomreads/writescomprise about 16% of the total number of system calls, and sequential accesses comprise about84%.


While such dependency on call order is less common in Java, it still occurs in programs that have low-level access to OS data structures.

b is interpreted as follows: whenever a programmer inserts calls to all methods in A, she also insert the calls of all methods in B.


these approaches utilize domain knowledge in a way that enables domain experts without programming skills to develop designs that can be converted to optimized implementations by efficient code generators.


On the Java side, the following interface speci.es the operations that a client can request from a server: package rli; import java.rmi.Remote; import java.rmi.RemoteException; public interface ServerStub extends Remote { public Object rli_in() throws RemoteException; public void rli_out(Object T) throws RemoteException; public int rli_ping() throws RemoteException; public int rli_stop_server() throws RemoteException; public Object rli_call(Object T) throws RemoteException; } Among them, rli_in and rli_out can be used to implement message queues, rli_ping can test if a server is alive and rli_stop_server can be used to shut down a server remotely.

the following example illustrates how one can emulate message exchanges between agents coordinated cooperatively using the Linda protocol.


Also it might be interesting to investigate how the atomic e-business models can help understand the reuse of product software components in other software domains.

is there a way that we can consolidate the identi.ed commonalities in the Web Application Engineering in the software product line, thereby adjusting the software product to improve future implementations.


3 VC Requirements Analysis (RA) As was illustrated in the previous section, use of an SPV tool with an unsound assertion semantics can at best lead to surprises, at worse, a false sense of security.

the new definition of assertion validity gives rise to another kind of responsibility that comes to rest upon the specifier: he or she must ensure that the assertions written in contracts be always defined.


Of.ine compression algorithms algorithms that produce compressed output only after seeing the complete input such as the ones proposed by Apostolico and Lonardi [1] and by Larsson and Moffat [23] explore how to reduce the compression ratio by compressing the whole .le instead of using online techniques such as SLZW [34].

pM deployment had 13 locations while PDG deployment had 9 locations.


Phillimore was a genealogist and his avowed aim was to start with marriage transcriptions, for as many counties as possible, and to complete the transcription work .rst, before making any attempt to produce indexes.

the second task in the list given above is performed by an awk script, imaginatively named ascript.


Methods which convert if-then-else statements and simple loops into conditional assignments effectively merge variable values by unifying the path simulators [10].

the latter case generally indicates a loop in the simulated code simulation is halted, and the user is given a trace of the path leading to the loop.


INTRODUCTION In contrast to the speed of memories, processor speed has increased dramatically in the past.

if it can be excluded that vi is contained in the cache immediately before it comes to the execution of vj , the edge ei,j can be removed from the con.ict graph.


For example, the Adobe Flash platform is widely used to develop and design multimedia applications, as it provides lots of features to help the graphical design.

more and more research has been done in the .eld of development of multimedia applications, and it has become important to use sophisticated software engineering techniques to improve the multimedia application development, such as the model-driven development (MDD).


While the second case ensures the aggregate won t exceed 100 Mbps, it can arti.cially constrain the capacity at individual sites if demand is not uniform.

aCM Transactions on Computer Systems 16, 2 (1998), 133 169.


The rest of the paper is organized as follows.

from now on, we de.ne a set of noti.cation rules simply as a set P of execution intervals.


Consequently,when messages must be forwarded to an intermediary peer, they are is forwarded to a randomly selected peers from the intermediary sgroup.

we must also ensure that remote peers remain honest.


Assume A = B; if object a has type A and ob ject b has type B, we say that a is equivalent to b when MA (a) = MB (b).

we have observed in some data binders that the following property is satis.ed, although not formally speci.ed: the di.erent pairs of functions are mutual quasi-inverses.


It defined the term principle , an essential step in the analysis of the proposed principles from the literature.

the authors who put forward these candidate principles did not share a common approach for defining them, referring to them variously as laws, principles, and fundamental principles, and expressing them in several formats: definitions, descriptions, and prescriptions.


The .rst is a synthetic IPA whose analysis cost is adjustable, and whose analysis results are that no object escapes.

the Pensieve system maintains sequential consistency by enforcing these delays.


we developed  in conjunction with research project VizBoard [22] an ontology browser which is geared towards the handling of big datasets by facilitating automatic data reduction and appropriate interaction metaphors.


.S at the end of H, then according to the set speci.cation, executing two add(k) s sequentially in a row cannot lead to both add(k) s returning the same result.

on the space complexity of randomized synchronization.


It provides a means for the dynamic creation and modification of software based on multiple levels of detail and complexity.

component-based applications represent groups of interconnected component plug-ins in a composite architecture.


Collaboration has become the essential part of software development, and distributed software engineering has emerged as an important research subfield [14].

[36] L. R. Neal, "A System for Example-Based Programming," in Human Factors in Computing Systems (CHI'89).


, E3 [18] Several earlier process language and models, such as EPOS [8], and CSPL [6], claims to be object-oriented.

for example, Figure 3 shows the supporting class for process PApplication, which has five member variables.


MA, USA: Kluwer Academic Publishers, 2000.

this is accomplished by using the high-speed reintegration links to copy the memory state of the correctly functioning processors to the failed processor.


are infected, we must show that they violate the speci.cation.

a sequence of relevant deltas C = [Lt1 , Lt2 , .


modules split between sites This is related to Module architecture and represents a possible solution, so we remove it.


For example, performance problems are often associated with faulty components that only partially operational.

proceedings of the 2nd international Petascale Data Storage Workshop (PDSW '07) held during Supercomputing '07.


Unfortunately, neither gcc nor icc are able to detect this, and are forced to transcribe the code as written.

attempting to factor the optimization problem into a collection of small subproblems that can be solved independently, although suitable for generating consistently good code, leads to the well-known phase ordering problem.


Fortunately it is straightforward to make Parser also an instance of the Monad class.

[] f  q = pSucceed f  q p  p  q f <$ q = const f  q Figure 1: Backtracking implementation the constructed result can be returned as it is being produced.


Dazzle s attribute-selection algorithm employs a hill-climbing search to determine a (locally) optimal selection of attributes.

a value entry of type ValueEntry x a also has an attribute typedValue of type Maybe x that contains the typed content.


Conclusions We have conducted several experimental studies to evaluate our initial use of NLPA.

case Study: Supplementing Program Analysis with Natural Language Analysis to Improve a Reverse Engineering Task.


Values near 1 indicate that the system behaves more fairly since a device is accessing remote resources and sharing its local ones in the same ratio.

0 0 15 30 45 60 90 120150180 15 30 45 60 90 120 150180 Time Threshold (seconds) Time Threshold (seconds) Figure 1: Relative average energy savings (left) and fairness (right) over all the subjects (95 % confdence interval) by enablingaccess to nearby GPS data from neighbouringdevicesif available over Bluetooth.


Communicating with a Large Customer Base via Mobile Messaging Richard Hable Thomas Ebner Evolaris Next Level GmbH Evolaris Next Level GmbH HugoWolfGasse 88A HugoWolfGasse 88A A8010 Graz A8010 Graz +43(0)664/8414439 +43(0)664/8414434 richard.hable@evolaris.net thomas.ebner@evolaris.net ABSTRACT The widespread use of mobile phones has opened up new ways of communicating with large numbers of people.

the platform administrative user interface had to be implemented as a clientserver web application.


Based on the communication links and nodes being used by processes we search for potential bene.ts that can be brought from each PCP.

a modular simulation framework for spatial and temporal task mapping onto multi-processor soc platforms.


Furthermore, we only modi.ed or added 132 lines of code for our port (Table 5.2).

we introduce recovery mechanisms semi-automatically into an existing multi-threaded software system where the synchronization mechanisms are pessimistic (e.g., locks, semaphores, or monitors), i.e., they do not support rollback of program state.


[9] M. McLaughlin, G. Sukhatme, W. Peng, W. Zhu, and J.

the evaluation is severely degraded when the network delay is greater than 100 ms on the system where both student s and teacher s constraint force is calculated based on spring model [4].


From a type checking perspective, the only information that a negative constraint can propagate into the template body is the fact that a particular model does not exist, which presumably could resolve ambiguities in the template.

to exhibit a difference, assume a fourth overload of sort() with constraint set A1, such that B .


MOTIVATING EXAMPLE In this section, we present a motivating example using our aforementioned self-adaptive robot-car application.

one outstanding challenge in fault detection for self-adaptive applications is that these applications keep interacting with dynamic environments.


Such grammar .les can be used to provide the real trees for our evaluation.

our evaluation shows that the proposed techniques are highly effective and produce input syntax trees with high quality.


One of these arrays is an array of 256 random gradient vectors in sn; the second is a random permutation array of byte-sized indices.

a call to map like the one for the union function in the previous section List.map (fn ABS s => s) ss does not actually expose the representation of the abstract values.


Every dereference of a pointer has an implicit non-null check preceding it.

we assume that there is a single globalvariable g of type T.Weintentionally leave T unde.ned.3We only requirethe presenceof certain predicatesover T. Let Failedbe a predicate of type T .


the screen local flow of control (the sequence of screen objects activation) is specified in the interface definition section.


Note that, since the objects are aligned to word (4 bytes) boundaries, this bit is not used by a reference.

e1 and E2 synchronize with each other using the synchronization APIs provided by the operating system.


Following this, we present our static analyses in Sections 3 through 5, and then describe the optimizations based on these analyses in Section 6.

since these techniques operate entirely at runtime, they are constrained to use very light-weight analysis techniques.


[15] J. D. Procaccino et al., "What do software practitioners really think about project success: an exploratory study.

it has already passed nine years from the Agile Manifesto [2] publication and there are still only little empirical evidence on the actual effect of adopting agile practices on the project success as a whole [5].


the inherently dynamic nature of grid work.ow scheduling, stemming from the unavailability of scheduling information and from resource contention among the (multiple) work.ows and the non-work.ow system load, may lead to poor or unpredictable performance.


The decreased number of passed arguments minimizes the number of required instructions for both the caller and the callee.

procedure cloning solves this problem by cloning this function twice, one spe TriCore ARM Thumb Figure 4: Relative WCETs after Procedure Cloning cialized version for the constant 13 and one for 120.


Traits were proposed as a mechanism for .nergrained reuse, to solve the reuse problems caused by mixins and multiple inheritance [19, 23, 40].


Characteristics of this bu.er over.ow are identical to those of the second two, except access to the bu.er is through a string function instead of through a pointer.

here the string is guaranteed to be null terminated because it is initialized with a string literal [17].


The goal of this workshop is to provide a forum for researchers and professionals interested in global software development to meet and exchange ideas.

wORKSHOP THEMES The workshop solicited submissions on topics that included: Software processes and practices improvement  Organizational models and strategies  Project management (e.g., risk management, progress monitoring, quality control, configuration management)  Knowledge management  Team communication and coordination  Managing peopleware (e.g., cross-cultural conflicts, distributed collaboration)  System architecture  Productivity and quality issues  IP protection and other legal aspects  Education and training of practitioners  3.


Each processor node includes a set of processes called Data Requester Processor Pollers (DRPPs) responsible for retrieving data from the devices.

communication between the DRPPs and the devices is synchronous, so the DRPP remains blocked until the device responds to a request for data or a timeout expires.


In order to accommodate larger, more realistic, multithreaded programs, we extend the initial type system with a number of additional features.

the core of our type system is a set of rules for reasoning about the type judgment P; E; ls f e: t. Here, P (the program being checked) is included in the judgment to provide information about class de.nitions in the program; E is an environment providing types for the free variables of e; ls is a set of .nal expressions describing the locks that are held when the expression e is evaluated; and t is thetypeof e.the type rules track the set of locks held each program point.


The dynamic pro- gramming post optimization (DPPO) [2] performs dynamic programming over a given actor ordering (computed by any topological sort) to generate a buffer- efficient looped schedule.

it in- cludes all of the automatically generated main() func- tion and subroutines, but excludes fine-grain functions unrelated to the DIF-to-C framework (i.e., those that are either obtained from libraries or implemented by hand).


[6] Baynon, M. Curry, B. Morgan, P. 2000.

software project management is often burdened by huge sources of epistemic uncertainties due to the lack of information for objectives of evaluation, differences in knowledge and experience of participating experts, fuzzy reviews of experts, and Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page.


5.2 Essentials of Object-Oriented Programming Language Programs compiled by object-oriented language are widely applied at present.

c language, as an advanced computer language, is free from many format requirements, helping to reduce compilation complexity and enhance its standardability.


[16] Pennell L. & Maiden N.A.M., 2003, Creating Requirements Techniques and Experiences in the Policing Domain , Proceedings REFSQ 2003 Workshop, June 2003, Velden Austria.

contingency templates (i) Failure types; (ii) Strikes incidents; (iii)Drop low priority activities; (iv) Get itimproved, who?


It keeps information about the allocated memory chunks, their respective sizes, and some control information.

[17] Plank, J. S., amd G. Kingsley, M. B., and Li, K. Libckpt: Transparent chieckpointing under unix.


The remaining cycle of three nodes is reduced by reducing (any) node with the ReduceII reduction.

this includes removing redundant re- gions and shrinking or merging partly redundant regions.


This would require all type variable binders in F# source code to have a corresponding binding in compiled .NET code, an unacceptable constraint when compiling an ML language.

for example, all F# type variables have inten 2.2 F# Quotations sional representations available at runtime, largely as a side effect This paper utilizes a modest experimental meta-programming ex of the use of CLI generics to implement type parameterization.


Although they are not object-oriented, we were able to integrate C and Haskell well into FSTCOM-POSER.

"{" 7 "return" Expression ";" 8 "}"; Figure 4.


In this section, we compare our work with other existing work in the area.

truly data-centric applications will not specify their operation in terms of sensor locations and communication paths.


For example there are not only patterns concerning how to display information, but also patterns to structure and improve human workflows.

dialog patterns are used to describe recurring navigational aspects of the user interface [13].


Some of the tags will represent concerns, functional and non-functional, others will represent information about the concerns, such as importance, or stakeholders to whom they matter.

later on, however, it might be beneficial to refactor to use said by relationships between items and interviewees instead of the tags.


The resultsgiven in this paper do not include these advantages.

further, due to lower register file accesstime, a multiple register file architecture would offer lower operation latency than a central register file architecture.


The result, C, is also of GPUdouble type.

this also points to the existence of further opportunities in leveraging data locality.


If no client corresponds to the given data, an error message is produced.

each use case must correspond to one or more operations of the application interface.


Aspect-Specification Based on Structural Type Information Stefan Hanenberg, Mohammed Al-Mansari, Rainer Unland University of Duisburg-Essen, Institute for Computer Science and Business Information Systems, Schützenbahn 70, D-45117 Essen {shanenbe, almansari, unlandr}@cs.uni-essen.de ABSTRACT Aspects developed in aspect-oriented systems often need to hook onto multiple objects that share common structural characteristics such as attributes and operations.

even in independent developed types there are structural similarities that result from common naming conventions, guidelines, idioms or commonalities between domain models.


For example if basic blocks 1, 2, 4, and 5 are executed the edges originate from node 1245 while if blocks 1, 2, 4, and 6 are executed the edges originate from nodes 1, 2, 4, and 6.

in other words the optimizations we have developed must be applied to construct the static component.


For the domain expert it is often suf.cient to look at the (simple) ESMs to integrate building blocks correctly into a system.

as modeled by waitEvent(ID), when the activity wants to send a token through the wait pin, we may accept that the EESM does not allow it, due to the semantics of discarding tokens that attempt to travel via pins at the wrong time.


partial type inference techniques should be used so that suf.cient type and coercion information can be reconstructed, but new approaches may be needed.


As defined in the previous section, a solution consists of a sequence of n refactoring operations applied to different code elements in the source code to fix.

secondly, a search method requires a very high number of solutions (some thousands and even more) to cover the Pareto front when the number of objectives increases.


Clearly, every Nash equilibrium is also a weak Nash equilibrium, though the reverse is not necessarily true.

a potential function argument shows that every symmetric additively-sparable hedonic game has a Nash equilibrium, but .nding it is PLS-hard [13].


The advices of aspects that matched the current join point are then chained together, each one nesting the next one (step 3).

we come back on aspect weaving in Section 4.2, when describing the implementation of AspectScript.


of OOPSLA Onward!, pages 623 638, October 2007.

expensive multi phase logic is required to handle non-monotonic changes, while programmers can easily encode paradoxes ([x = !x]) directly or indirectly, causing divergence.


In contrast to our model, it simulated the concurrent development that allows overlapping between increments.

it was reported that 279 defects remains in the final product by Tvedt s model, which was calibrated with the real project.


Using a context-sensitive naming scheme may allow the algorithm to compute more precise reference information.

we will develop and evaluate new approaches for identifying the invocation contexts so that we can further improve the precision of Andersen s algorithm.


Consider a speci.c trace of jobs that arrive at times t =(0,0.25, 0.4,0.65, 1)s. We study the execution of the jobs undertwopolicies:(a)aworkload conservingexecution(WC) with no DTM policy enabled, and (b) a shaped execution (Sh) where the jobs are delayed according to a speci.cally designed shaping curve s shown in Figure 1(a).

thermal management hasbecome akey system design issue.


(For additional examples, see our prior work [16].)

we should not discount our overall conclusion that our approach is usually comparable to the type-checker s messages and is often better.


In Proceedings of the 32nd ACM SIGPLAN Conference on Programming Language Design and Implementation, PLDI 11, pages 132 141, San Jose, California, USA, June 2011.

even if the server is implemented in Scala, there are always nontrivial parts of the model that have to be implemented in a dynamic language.


With NDT-Quality, the traceability between requirements and analysis is automatically analyzed.

basically, each table generates a class with the same attributes.


The following shows the data elements extracted from the ontology and loaded to the RDB data store: x URI a Unique Resource Identifier.


Web services such as Twitter [33], Dodgeball [34], etc.

since it was near the end of the semester, students found it dif.cult to .nd excess free time.


While the proposed metric has the ability to distinguish solutions based on timing, it still does not incorporate any flavor of congestion.

examining such a metric along with traditional wirelength based measures to analyze placement solutions for a physical synthesis flow, would lead to generating a more timing- friendly placement that can potentially reduce the design closure time.


This increases the cumulative cost of GC.

that is also the reason why PH slows down the collector for db, while causing no signi.cant change in collector time for javac.


A productivity study of ClusterSs has been performed, comparing it to the X10 language.

the APGAS communication model is based on one-sided communications, as opposed to the two-sided communication modelinMPI; theformerhasprovento achievebetteroverlap and scalability for large-scale clusters [2].


in Software Process Workshop, Proceedings of the 6th International, pages 19 29.


Kernel The management of the JADE component framework takes place in the JADE kernel.

the result is a monolithic architecture, albeit modular.


Secondly, to generate XPath expressions is not so simple as for our current pointcuts.

in order to construct executable models, two basic elements are required: (1) an actions language, which contains those elements that abstract the atomic actions the models can carry out; and (2) an operational semantics, which speci.es where and how the actions can be placed in a model and how a model must be interpreted.


If the second readings of labels and timestamps produce the same values as the .rst readings, then the query attempt succeeds and the order of labels determines the order of X and Y .


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

5), 2008 [6] Booch, G. The Accidental Architecture.


[10] J. Horning, B. Kalsow, P. McJones, and G. Nelson.

.nalization in languages like Java is necessary in order to manage resources other than garbage-collected memorybased on garbage-collector-discovered reachability.


So although the 99th percentile of the event queuing time for 20 000 peers is 5 seconds when using 1 processing core, it drops to under 1 second when using 8 cores.

the PeerMonitor-Client component provided in the framework can be con.gured to monitor Chord or Cyclon.


4.EXPERIMENTS The experiments are conductedbyusingNS-3network simulatortomeasureIPTVperformancewithregardtoQoS  measurements (delayandthroughput).Experiment set up includesconfiguringnetworktopology, settingupQoS  mechanism for each router, and configuring five mathematical functionmodels torepresent themodelsof  thenumbersofusers joiningmulticast streams.Due to storage limitation we set eachsimulation experiment is executedforabout 6-7secondsandproducesabout 2250 packetsofdatainbothunicast andmulticast.Runningthe  experiment for6-7secondsisnoffilledt tooshort,becauseaupthequeuecapacityfter2 secondsthe traicalreadyf becauseweuseUDPtraffic(not burst traffic)whichhas constant rate.Inotherwordswecancreateaqueueduring  thefirst2-3secondsofeachexperiment.

besidesdeliveringIPTV sunicastvideoondemand(VoD),  anIPTVprovideralsoservesmultiplechannelswhereeach channel sendsamulticast stream.On theotherhand, IPTV ssubscribersmay viewmore thanonedifferent channel whichcanbe from thesameordifferent IPTV providers.eachmulticast stream(channel)may havedifferentnumberofsubscribers.


In this sense, prototyping collects concrete data about key component characteristics that is used to evaluate and reduce the uncertainties associated with the dependability of the proposed architecture.

since the source of uncertainties may spread several models in the analysis toolkit, it remains a challenging issue to quantify the uncertainties at individual models.


Note that the e.ectiveness of statistical fault-localization techniques is premised on the availability of a high-quality test suite that provides good coverage of the application s statements.

the Impact of Test Suite Composition on Fault Localization.


Our current community detection algorithms detect approximately 80% of communities compared to the centralised approach.

managing membership of the community indirectly controls part of publish/subscribe functionality.


Test criteria are designed to cover the software code and functionalities as much as possible.

communications of ACM, 37(9), September 1994.


Second, we take a look at other JVM languages supporting the de.nition of internal DSLs.

an internal DSL (sometimes also called embedded DSL) leverages a so called host language to solve domain-speci.c problems.


Functional design using behavioural and structural components.

is it possible we observe the difference between letx=X1in [x,x] and [X 1,X 1] using reifyGraph?


The layout approach has some shortcomings.

3.2.1 The Evo-Streets Layout In the secondary model the decomposition hierarchy is represented by a hierarchical street system as shown in figure 1.


Validation: We set up experimental studies on various programs to validate our detection and correction results.

our method generalises previous work and it is built on our own experience.


All database tasks are implemented using the Java Persistence API (JPA).

j concentrators can deliver the same request rate q of j/2 concentrators where each deliver 2q request rate.


In addition, by exposing the message latency as part of the language, the compiler can infer the true dependences between actor .rings and reorder the execution so long as the message constraints are respected.

as showninFigure 7,the last .ring of C requires only 5 executions of A.


Thus, for these three benchmarks the frequency of lock requests is comparatively low.

second, the graph is dif.cult to partition for coarse-grained parallelism due to the irregular access pattern and data dependency.


In these engines, the basic constructs of the dynamic runtime such as object layout, heap, garbage collector, compilers, pro.lers and call frames, have been designed and implemented from scratch in the low-level language.

ironJS [10] translates JavaScript to Dynamic Language Runtime (DLR) expression trees [5] and leaves dynamic optimizations to the DLR.


[4] D. Cassou, E. Balland, C. Consel, and J. Lawall.

because most existing approaches are general purpose, their guidance is limited, causing inconsistencies to be introduced in the design and along the development process.


4.2 Speech Recognition in Adverse Conditions There are various influences which have a negative effect on the recognition rate.

these classical development approaches and implementation technologies mainly focus on the specific requirements of the systems and components under consideration.


Finding and removing performance bottlenecks in large systems.

for some programs this N-input branch policy G may not generate any worst-case execution paths for some smaller input size k. (Consider a program which runs one procedure for even-size inputs and one for odd-size inputs.)


it would be appropriate to try to insert a roll with a box code that was not included in the box table to ensure the database has considered this constraint.


Migrations are handled at thread level for accuracy.

rEFERENCES [1] Christoph Reinke, Nils Hoeller, Volker Linnemann, Adaptive Atomic Transaction Support for Service Migration in Wireless Sensor Networks , Wireless And Optical Communications Network (WOCN), Seventh International Conference OnDigital Object Identifier, 2010.


Current revision control systems permit to set up a pending head codeline [4] where developers check in and from where check-ins are promoted to the mainline if their quality is acceptable.


Most modelers only have knowledge of the modeling notation but not of the internal structures used for automatic processing of the models.

refactorings are an integral part of software development (for an overview see [8]).


This is necessary because without some idea about how these ideas are embedded in the problems of sending bit messages it is difficult to understand whether or not the ideas are relevant to software engineering.

use frequency of use of operators because operators have certain natural probability distributions Allen and A modular system can be Obeys Briand et A worked example plus Software design is an Khoshgoftaar represented as a graph with al s properties.


Also, the protocol does not implement any mechanism to ensure that NBART properties 5-7 are ful.lled.

if we assume that during the .rst instance, all non-Byzantine producers obtain the same input, then, by induction, the value ¯v is preserved across multiple instances.


[6] B.-M. Chang, J.-W. Jo, K. Yi, and K.-M. Choe.

an automated tool could provide speci.c and useful documentation that would be easy to keep synchronized with an evolving code base.


But we can use a bridge predicate to assert that, no matter what schedule is taken, the resulting set is semantically equal.

void P () { deterministic assume(Pre(s0,s 0' )){ ... body of P ... } assert(true); } To address the problem of inferring interesting deterministic speci.cations, we argue that a (Pre, Post) pair is interesting if the following two conditions hold.


WCET-based reservation wastes more energy with more unused bandwidth, but the reclamation and adaptive algorithms are able to reclaim the unused bandwidth, thus reducing energy wasting.

vS-CBS0 executes BE jobs on a roundrobin (RR) basis.


In retrieving interdisciplinary documents we have encountered two problems: the lack of appropriate taxonomies and the inadequate expression power of the Boolean model.

we consider the drawbacks of the Boolean model, and illustrate how such drawbacks can be avoided by the Vector Model.


Finally, refactoring cues are somewhat similar to domain/j: both tools provide a separate view containing a list of available refactorings and both assist the programmer in selecting code [14].

refactoring cues were inspired by several existing tools.


However, as mentioned before, actions are commonly associated in feature models with the objects on which they are performed.

if a customer pays with a credit card, the system approves first the payment by contacting the credit card company.


In this work, we present a sensor fusion technique that relies on a consistency function also.

also, while it is interesting that one can do away with time synchronization, its value is questionable as time synchronization is one of the mature services available in WSNs today.


We can imagine that directory "bin" which resides in M2 is an NFS partition remotely mounted in M1.

acknowledgments We would like to thank Rocco De Nicola and GianLuigi Ferrari for helpful comments.


This is coupled with the use of Pair Programming [4] in order to promote knowledge sharing between students.

in the pairing process, we didn t want to allow students to pair themselves up fearing that friends, and possibly strong programmers, pair together.


Because test generation for each block is independent from another, it can be parallelized.

as an example, the built-in Abs block of Simulink calculates the mathematical absolute value function of the input x (i.e.


The Object Management Group (OMG) has adopted BPMN as a standard and the long expected version 2.0 was finally released in 2011 [11].

we thus deliberately exclude approaches such as stochastic Petri nets that allow for defining business workflows [6] and provide a suitable mathematical model for the control flow of agent-based processes, which are less applied in practice.


There is a fundamental limit though, the origin of which to be found at archive build time: if CARE is able to detect and analyze .le system dependencies on all executed program paths, .nding all dependencies that could be accessed on all possible program paths is an undecidable problem.

the CARE/CDE approach to replicability and reproducibility is a much more lightweight approach than traditional virtual machines.


The sensors include light intensity, temperature, proximity, movement (PIR), force, RFID and magnetic switch sensors.

developing new applications can be di.cult due to the large diversity of protocols that exist today.


One of the pending works is to unify all the tools under the same platform.

the multiplicities different from one can also imply optional situations.


We extended the existing modeling environment with the visual representation of the variables used in the business process.

purchase Order is a data variable and is annotated with the financial tag.


0 -1 01 0801 There are three neighboring processor pairs, and all the neighboring direction vectors between them are of the form (0 1)T .


Furthermore, the data structures are dynamically allocated, and hence can be scattered throughout memory.

these applications all follow the same general pattern.


We do not consider all Alloy constructs; for instance we omit imports.

the models in Figure 1 are intuitively equivalent, but they are not equivalent using this notion.


Unannotated pointers are considered kernel pointers, which marks them as address_space(0) and permits dereferencing.


the transfer function for this assignment is Ident[u .


line key features of our tool as well as our demonstration plan.

in enterprise computing, many non-functional concerns, including persistence, security, and distribution, are implemented using frameworks.


3.2.1 Branching Ideally, Macroscope would translate every possible con.guration of a C program.

if the directive guards an incomplete syntactic unit, then Macroscope is forced to hoist the if statement to a place where one is valid in ASTEC;ASTEC only allows if statements at the level of declarations, statements, and expressions.


This example suggests that the issue of context is subtle and can easily be overlooked in the quest for better software engineering research.

for example, suppose we are interested in replicating Dehnadi and Bornat s study which suggested that a simple test predicts whether or not students will succeed in an introductory programming class [2].


The problems mentioned in the previous paragraph are all speci.ctothe secondphase ofthedisassemblyprocess(i.e.,the selectionof thenextinstructiontodisassemble).

theinstruction writesintothe memory and thus causes apage fault.


(We could not .nd source code for a fourth test case used in their paper.)

c-Reduce currently has 30 sourceto-source transformations for C code including:  performing scalar replacement of aggregates;  removing a level of indirection from a pointer-or array-typed variable;  factoring a function call out of a complex expression;  combining multiple, same-typed variable de.nitions into a single compound de.nition;  moving a function-scoped variable to global scope;  removing a parameter from a function and all of its call sites, while adding a variable of the same name and type at function scope;  removing an unused function or variable;  giving a function, variable, or parameter a new, shorter name;  changing a function to return void, and deleting all return statements in it;  performing inline substitution of small function bodies;  performing copy propagation; and  turning unions into structs.


S(vf ,vg,x2)) In this example, the .rst application of Eq.


{N} which orders everything in the .rst two sets before the other two, but imposes no other order.

source-to-source optimizers may never introduce a data race.


The state is necessary to store the references of the input .elds of the HTML expression in order to enable the event handler to extract the corresponding user inputs.

this structure of CGI programming is made possible by the functional as well as logic programming features of Curry.


In this tutorial, the participants will be guided on how to use the Agda proof assistant to write a normalization by evaluation (NBE) algorithm in CPS, starting with simply typed lambda calculus and ending with G ¨odel s System T extended with delimited control operators.

since proofs using classical logic can be translated to intuitionistic ones by the continuation-passing style, or double-In this tutorial, we will inves tigate how constructive CPS proofs can be applied to situations where a straightforward constructive proof does not appear to be possible.


Importantly, merges and splits are not globally ordered: a merge between assemblies i1 and i2 can proceed in parallel with a merge between j1 and j2 (where j1 and j2 are distinct from i1 and i2), or with a split of j1.

partitions that looked useful initially could very well turn useless during the execution, so that any workable data partitioning strategy for this setting must be adaptive.


https://wiki.in-chemnitz.de/bin/view/RST/Jake2  Figure 4: Screenshot of Quake II in p2p using Quiver [3] for game synchronization.

the Networking module provides the other Quiver modules with high-level networked channels to communicate using message exchanges that can be either reliable or best effort.


The method of teaching variability modeling was roughly aligned with the suggested method for a two-lecture module course in [27].

in Proceedings of the 13th International Software Product Line Conference, pages 81 90.


A connection is always directed from one port to another.

unlike the SDF model, the CTA model has compositional analysis properties.


two terms are equivalent if they can be reduced to the same normal form by equational rules, but not by rewriting rules.


The type of a top-level expression cannot contain type variables, according to the value restriction rule of SML 97 [19], unless it is syntactically a simple value (in which case the computation and hence also the run-time stack is trivial).

we then look at variance annotations both at the declaration site and the use site of parametric classes, the latter approach being the starting point for the design of the wildcard mechanism.


Applying the same argument as in the previous example, we can calculate X Y and check that it agrees with Tanaka s construction of a substitution monoidal structure, namely (X Y )m = (X n × (Y (n) )m)/.

ps-Tsm -Alg is the 2-category SymMonstr and Tsm(C) is the free symmetric monoidal category on C. Taking C = 1, it follows, up to equivalence, that Tsm(C) op is the category lof .nite sets and permutations used by Tanaka [23].


A formal language should be used to describe content objects, object relationships as well as their operational and presentational features.

to achieve this enhanced overview a minor requirement has to be met.


In.uence of averaged expert annotations compared to averaged non-expert annotations on system ranking Finally, the in.uence of the non-expert annotations on the system ranking is investigated.

a merged ground-truth .le was composed from the HITs by computing the majority vote for each concept in each image.


There is essentially only one way to get a more predictable language, namely to select a set of features which makes it controllable.

as Ravenscar-Java is targeted towards smaller and embedded systems implemented on top of J2ME and CLDC, it would perhaps have been more natural to define a Ravenscar-Java application as a -let , e.g.


with Ginger s linear commitment primitive [52, 53] (which strengthens a primitive of Ishai et al.


Mobile phones are the m o s t w i d e l y p o r t a b l e d e v i c e s u s e d t o d a y .

high-level Specification of a Middleware Framework for Mobile Ad Hoc Networks Spontaneousware Case  Vando de Freitas Batista Federal University of Pernambuco, Informatics Center, Av.


Middleware 2004 Companion CUROCO: a distributed architecture for the dynamic generation, composition and use of context in highly dynamic and heterogeneous environments* [extended version] Gorka Guardiola Muzquiz Laboratorio de Sistemas, Universidad Rey Juan Carlos Madrid, Spain paurea@lsub.org ABSTRACT The use of context is necessary for a rich interaction with the users and adaptation of the system to their needs.


we cover only the Component-Connector view and leave certain sub-systems un-touched.

as shown in Figure 4, each .lter in the Imaging component acts as a data processor by receiving input at one end and forwarding processed data to the next .lter in the chain.


With a small memory footprint, pages of.ined represent 2.5% and 4.1% of memory used by the application, respectively.

the repeated activation of a costly and complex error correction can be seen as an ef.ciency problem in itself.


4.2 Factor Maps A factor map is 3x3 grid of influence categories, populated with concrete factors.


fun invAllowedToUseKey (s:State) { all p: EPE, m1,m2:Message | // m1 is the plaintext, m2 the ciphertext encryptAndAuthenticate(s,p,m1,m2) => canAccess(s.bound.p,m1)  } // If an encryption device has a key, // then the process is allowed // to communicate in that direction, // i.e.

all connections between two AAPs are simplex.


In Section 5, we report the results of the project.

it does not require any domain knowledge.


There was also a technical director and trainer (Shaun), a customer relationship manager - CRM (Gordon), and a financial administrator (Brian).

different customers (and by extension users) are more valuable than others, likewise the future market is very valuable, and so certain users and their opinions and ideas are given more credence.


To provide su.cient write bandwidth to continue to support the demands of scienti.c applications, the HPC community has developed a number of I/O middleware layers, that structure output into write-optimized .le formats.

the closer that data is stored together, the better the overall performance.


Their experiments indicate that comparing method call sequences is a better defect indicator than a simple coverage-based metric, such as the one by Jones et al.

although we make recommendations for when each of the two preferred change classi.ers should be used, it is clear that further investigation is needed, and we consider such investigations to be a fruitful topic for future work.


[11] S. Soares, E. Laureano, and P. Borba.

most of these models are not well-suited for the particular conditions, scale and complexity of the problems inherent to distributed systems.


Lucene provides many other features and in particular a tf-idf based weighting system for search terms.

we have extended this capability by storing information from successfully evolved queries for use in classifying other categories.


Categories and Subject Descriptors C.2.0 [Computer Communication Networks]: General Security and protection; D.3.1 [Programming Languages]: Formal De.nitions and Theory Syntax General Terms Security, languages, algorithms 1.

some memory-safety violations are not harmful and may be fully intended by programmers.


The user access layer consists of a set of inline wrapper functions and classes and does not lead to any extra overhead.

match expressions are already primitive pointcut expressions and yield a set of name join-points.


We gave DomR a privilege for reading XenStore s entries only for its target DomU.

conversely, they can save power if they consolidate lightly loaded VMs into a fewer hosts.


Our server will (when behaving as an adversary) attempt to .gure out, from its transcripts of the protocol, the private inputs and outputs of the outsourced computation, and may also try to sabotage the answer by giving wrong answers.

it might be possible for an adversary to exploit special structure to do better than randomly checking subsets of rows.


Those virtual hard disks are designed to work with the whole virtual system and cannot work alone outside the virtual system.


When events are sent, tickling the scheduler to immediately preempt a lower priority domain can sometimes reduce response latency.

these differences are consistent across all con.gurations of the Credit scheduler that include the event channel .x.


XDTv: Agile Development of Applications for Digital TV Mario Godoy Neto Universidade Federal do Vale do São Francisco (UNIVASF).

the contributions of this research are not restricted to ISDB-Tb.


The conclusions apply in particular to production languages like C++, JAVA or EIFFEL.

accessor simulation (AS) involves pointer adjustment and represents a convenient lower bound of the overhead yielded by subobjects.


polySPIN[6] and Mockingbird[2]hidemostofanFFI smechanismandpolicybyauto matically mapping between data structures and functions of languages with recursive (but not polymorphic) types.


(e) BB Sketch (f) RW Figure 6: Sketch recording examples.

during each replay, we use the RW recording s cheme to record the global order of accesses to each shared variable.


function calls) is executed, which gives less opportunity for runtime improvements.

in this section we want to give an overview of the solve algorithm.


We ran these programs on well-tested inputs to seriously search forbugs,wewould subject these programstoa much wider variety of inputs.

second, HeapSafe does not check for type-safety issues such as array bound over.ows, walking pointers past the end of arrays, incorrect use of unions and casts, etc, which can cause or hide memory safety problems.


Additionally the e.ort needed to apply the techniques must be measured to investigate the cost of the techniques.

in its current version 2.0 the UML o.ers 13 diagram types.


It is not clear whether a variable declared by the eval call shadows the already declared variable with the same name.

a variable declaration in a code string passed to the eval function as its argument is not evaluated as a variable declaration in the enclosing code; the variable declaration is bound after evaluating the eval function call, which behaves differently from static variable declarations.


advertising the controller via Rendezvous can be disabled by editing /Library/Preferences/com.apple.xgrid.controller.plist.


In particular, whole program paths [11] represent traces with grammar rules.

the algorithm is presented in Algorithm 2.


In MakeList, DSA also detects that heap objects are allocated (H) and returned, whereas in Length, memory is not allocated or freed (no H .ag).

once the indexable pools and the compressible index variables have been identi.ed in the function, a single linear scan over the function is used to rewrite instructions that address the indexable pools.


Due to their criticality, NFPs should not be considered as an afterthought during system development.

we de.ne a reasonable set of expected information about the operational pro.le during architectural design: 1.


In Figure 4, we wish to check that page Y cannot be reached unless the user is logged on, but this is not a condition of all the links that reach Y.

navigation models such as HMBS (Hypermedia Model Based on Statecharts) [20] and the navigation model by Leung et.


If u , d, i , o , x or X conversion speci.er is found, it sets the length modi.er to ll (through the PRIdMAX variable de.ned in header .le system.h) and if .oat conversion character ( a , e , f , g , A , E , F or G ) is found, it sets the length modi.er to L. The format we speci.ed on the command line (%Lu) was changed to %llu and passed on to the print routine.

consider the example where the WP constraints obtained from the golden program are .


When necessary, the k-driver for pro.t or commercial advantage and that copies bear this notice and the full citation on the .rst page.To copyotherwise, to republish, to post on servers or to redistribute may invoke the u-driver.

the communication mechanism copies data between the kdriver and the u-driver on an upcall.


The type system gives type Vtable( a) to r7, indicating that r7 points to the vtable of r4 s dynamic type.


Best Worst GA (Steady State) -18.56 4.94 -10.95 -38.75 GA (Generational) -30.48 12.91 -15.66 -75.05 PSO (Inertia) -36.60 28.04 -9.12 -116.13 PSO (Constriction) -64.40 53.17 -11.70 -210.80 BSO(Inertia) -25.59 20.46 -5.72 -88.79 BSO (Constriction) -46.73 43.10 -10.01 -177.16 Time (sec) Figure 7: The BSO .nds a solution which uses the a.erent feedback pathways and activates the triceps 5.2 Behaviors  even though it receives no descending input.

pSO-style algorithms usually do not need arti.cial constraints on position values unless the problem itself requires certain constraints.


The client gets a connection from the pool, uses it and then returns it.

given the earlier speci.cations, these implications can never hold as they require a one element heap to be the same size as a two element heap.


Clearly, the majority of the flows are very weak, for all subject programs; only 14% to 23% of the flows have measurable entropy-based strengths and only a small proportion of them are very strong.

dynamic information flow analysis (DIFA) is based on the assumption that the presence of a dynamic program dependence Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page.


(These graphs follow the same format as the graphs in Figures 1 and 2.)

different optimizations have very different properties in terms of how they affect code size, how long they take, and when and to what extent they are effective.


Because required services are often unavailable, a remote object reference should be able to address services which have not yet been discovered.

addressing Objects in Mobile Networks This section identi.es four characteristics which remote object references should exhibit in order to adequately cope with the above hardware phenomena.


If the source component is disabled and the target pin is non-optional, the connection will still be correct.

dX9.DevClear clears the frame-buffer, then TexPaint draws the texture on the frame-buffer.


Cascaded Refactoring for Framework Evolution Greg Butler Department of Computer Science Concordia University Montreal, Quebec, H3G 1M8 Canada gregb@cs.concordia.ca ABSTRACT Refatoringofsoureodehasbeenstudiedasapreliminary stepintheevolutionofobjetorientedsoftware.Weextend theoneptofrefatoringtothewholerangeofmodelsused todesribeaframeworkinourmethodology:featuremodel, useasemodel,arhiteture,design,andode.Weview frameworkevolutionasatwostepproess:refatoringand extension.Therefatoringstepisasetofrefatorings,one foreahmodel,thatasadesthroughthem.Therefatoringshosenforamodelbeometherationaleoronstraints forthehoieofrefatoringsofthenextmodel.


A special type of demand driven approaches is to derive information requirements by analyzing business processes in increasing detail and transform relevant data structures of business processes into data structures of the data warehouse [2].

5.3 Case C: Logistics at Swiss Armed Services The performance of modern armed forces significantly depends on effective / efficient logistics and respective information systems.


We include a partial transcript of her head-cam ride commentary here (taken from our recorded data) as an illustration of her experience.

a recent paper has proposed a framework for addressing this question based on a distinction between performers (those who are directly using an interface) and spectators (those who are nearby and who may be observing its use) [3].


[22] Charles Lefurgy, Karthick Rajamani, Freeman Rawson, Wes Felter, Michael Kistler, and Tom W. Keller.

4.2.3 Sources of error Here we examine the sources of error in our system.


http://parlab.eecs.berkeley.edu/bootcampagenda , 2009 [12] Lew, H. and J.J. Dujmovic, Performance Evaluation and Comparison of C++ Compilers.

our approach to generating simple synthetic procedural benchmark programs is generally applicable in the majority of programming languages.


In addition to this information, a standard ATI proprietary notice is found in every file.

the display and GUI are not the focus of our development.


Two of them, in which the authors are participating, are the NSF-funded EUSES project [14] and the European Network of Excellence EUD-Net [1] on End-User Development.

a closer look at all these initiatives reveals that accepted and well-known software engineering principles, which have been successfully applied in large-scale professional software development pro jects, are in general ignored during the creation of spreadsheets.


Our synthesis algorithm performs type-based synthesis that refers to a class of search techniques that use typing information/abstraction to perform search and produces a ranked set of results.

the space of all possible mappings from an NL description to a set of components is large.


SUPPORTING DOMAIN OPERATIONS Our framework provides capabilities to tackle operations and issues commonly encountered in sensor networks.

ours does not target particular applications but instead provides a generic framework which ful.lls common requirements.


Indeed, we will show that even when f is small and G(H.,1,W(k,t)) is not always percolated, if two nodes u and v are within the giant component of G(H.,1), information can eventually be transmitted from u to v over multi-hop relays.

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


Yield x (True,s ' ) The full translation is given in Figure 3.

we do hope, however, that improvements to GHC s optimiser will allow us to experiment with alternatives in the future.


Unlike applications that only collect performance data and encourage self-reflection by persuasion and complex visualizations, ESTHER 1.3 builds on these systems by empowering the user to have deeper reflection moments.

these initiatives do not directly support the worker to implement and accomplish the minimal required in physical activity at work.


Thehardwareatomicity also alleviates thecomplexityofproving thecorrectnessof software optimizationsin thepresenceofmultiprocessing.

as a result, speculative optimizations can be performed without compensationcode,enablinga great reductionincompiler complexityto achieveagiven code quality.


Distributed Garbage Collection for Managed X10 KiyokuniKawachiya MikioTakeuchi Salikh Zakirov* Tamiya Onodera IBM Research -Tokyo 5-6-52,Toyosu,Koto-ku,Tokyo 135-8511, Japan  Abstract X10 is a programming language that incorporates distributed processing functions.Theexecution modelofX10is called APGAS , where each object belongs to a speci.c place (an abstraction of a shared-memory computer),but can be remotely referenced from other places using a mechanism named GlobalRef.

inthisoverviewofthe distributedGCbehavior,additionalinterplace communication is performed only when a remote reference is removed.


This last factor is published by a Border Server, managed by the Cel lular Server located at Embrapa-Lowlands cell, specialized in Agroclimatological Station and located at Cap ao do Le ao Campus (campus of Federal University of Pelotas, where the LDAS is situated).

the software components should be aware of their contexts of interest and, when appropriate, automatically adapt to their changes, characterizing by that context awareness [9].


The paper presents a constructive approach to the modeling, specification and analysis of applicationspecific security requirements.

the epistemic operator KnowsVag is defined on state variables as follows: KnowsVag (v) = .x: Knowsag (x = v) ( knows value ) Knowsag (P) = Beliefag (P) .


In fact, we show the following: LEMMA 1.

the Intel StrongARM 1100 processor was considered as the target embedded processor for the two experiments.


The pervasiveness of the Cloud hosting model presents an incentive for the entertainment industry to migrate from the in-house model of hosting and operation towards the IaaS model.

in the second step, the game provider selects the best matching O-SLA template for the game zones based on its own policy composed of four terms: (1) the amount of clients to service computed as an estimated concurrently active accounts ratio from the total MMOG subscriptions, (2) the minimum instantaneous non-interruption ratio, (3) the minimum total non-interruption ratio, and (4) an interval of acceptable O-SLA validity periods.


[6] Instead of being pictured as nodes in a UML-like object diagram, objects are shown textually in a list.

gUIGraph works equally well with any integrated development environment or with a text editor and the command line.


With each memory location a taint bit is associated, which indicates whether that memory location is data dependent on an input.

secondly, we wanted to measure the additional overhead caused by our modi.ed coherence algorithm.


The only di.erence between these models are the two blocks C0 (Delay) and C1 (Integrator).

these graphs are clustered by merging them if they are close enough according to the metric.


Strict referential equality, which is the default in the OCL language and is written simply _ = _ in the standard, is an overloaded concept and has to be de.ned for each OCL type individually; for ob jects resulting from class de.nitions, it is implemented by simply comparing the references to the objects.

this formalization revealed several inconsistencies and contradictions in the current version of the OCL standard.


Based upon this observation, we decompose the interpreter implementation into two parts: 1) traversal strategy, which can be described either on graphical models or on textual specifications, and 2) user action, which is a fragment of the user-defined code written in IL.

there is a fundamental problem in keeping the model interpreters up to date with metamodel changes.


Conditions for resolving observability problems in distributed testing.

prioritized messages add an extra layer of complexity to both the message sequence generation and to the handling of a .lled queue.


3.2 TechSuRe Applying TechSuRe typically does not require huge efforts from the development teams.

additionally, developers can specify custom queries to the fact databases using the declarative Code Query Language (CQL).


When the engine is used in standalone mode the technologies should be registered invoking the TMR API.

an eclipse-based tool framework for software model management.


In this way, an event is disseminated to the whole tree.

node 8 will send a message to node 13 to delete replica which it kept on behalf of node 8.


WORKSHOP PLAN In the months prior the event, the workshop has been publicized to a broad inter-disciplinary community through related email, newsletters and at http://www.eud4services.org.

he is an author of multiple international publications and owns numerous patents.


We describe an implementation of our system for the OCaml to C foreign function interface.

int may represent any integer, and so it is not compatible with any sum types.


The oracle therefore needs to have knowledge of the intended interpretation of the program.

figure 1: The EDT for a succeeded call to all pairs are in table We construct the EDT on demand, based on a representation of the execution we call the annotated trace.


Out of 37 genealogies that lasted more than half of carol s software history (18 versions out of 37 versions), 29 of them include consistent change patterns, 24 of them comprise locally unfactorable clones, and 19 of them include both consistent change patterns and locally unfactorable clones.

if programmers wait too long before they restructure code, they would get only marginal bene.t on their investment.


note that, no matter whether we use the general recursive semantics (3) or the recursive semantics (2) with PCC, access by d is con.ned to the graphs produced by e anyway.


During this time, many academics examining the phenomena were concerned with how these changes might shape, and possibly even devalue, the technical communication profession.

but not all technical communicators are joining in single sourcing s rallying cry.


Our sampling strategy based on slice fragments is bene.cial in cases where the slice of a program may itself become very large [30, 32]; in some cases as large as the program.

we use sampling on precomputed property-relevant fragments for pro.ling.


We de.ne the churn overhead as the ratio of the query response time with churn versus the response time without churn.

for our experimental evaluation, we chose to use our own independent OpenDHT deployment.


Two, for process enactment, when protocols are .exible, they enable each party to exercise some discretion in applying its local policies or preferences while obeying a protocol.

participants would then use the re.ned version of a protocol that best matches their local preferences.


Although these computations may appear very expensive, for the practical cases arising from programs, this can be done very quickly so using Heuristic 1.a is possible in practice.

given such an integer lattice, it is easy to build a mapping (M,.b)whose kernel is .


Consumers: Are looking for user assistance to complete the tasks to do their job.

promoting a culture of collaboration with consumers of content makes them active participants in creating more accurate and complete content and is also a key to validating content development designs and delivery.


This is somehow in contrast to what is often perceived by AO research.

[Wa07, PSRY05] emphasize that aspect-oriented programming (AOP) is attractive because of its ability to modularize crosscutting concerns in aspects [MBB08], orthogonally to the main decomposition of a program, thus reaching a higher modularity [So04].


The algorithms utilised for adapting PD and PI values will be given in the subsequent paragraphs.

only some of them are known as power-law search, interestbased shortcuts and routing indices.


the serializability of concurrent database updates.


In this way, developers weave the aspect into the jQuery based code and get the expected results.

the method speci.ed by the .rst argument is called before the point speci.ed by the call joinpoint; similarly the method speci.ed by the second argument is called afterwards.


There are clear bene.ts to be gained from preserving and propagating information about how timers have been set, and by whom, throughout the system.

inferring, or allowing programmers to explicitly declare, such relationships between timers would not only lead to better traceability and debugging, it would allow the timer implementation to optimize and adapt their behavior.


To make this problem worst, the dependencies and con.icts between refactorings have to be taken into account.

an automated planner can be used to compute refactoring plans from refactoring strategies.


A Fudget is a value of type F a b that receives messages of type a and sends messages of type b. Fudgets can be composed to make more complex fudgets in a functional style.

franTk extends Fran with support for hierarchical interactive displays, allowing access to input from individual components rather from one monolithic window.


It is possible to allocate the object on the stack and eliminate any synchronization on it.

it turned out to be a good heuristic to inline methods up to twice as large as the normal threshold if there is at least one parameter that does neither escape the caller nor the callee.


the generality of the attributes makes their customization hard for specific characteristics of MBT, what could represent a risk for a software project when using this type of technique selection mechanism.


Given the workloads that a VM host need to serve, the above analysis can also help determine the appropriate size of the .ash cache.


Unlike in the previous case study, we know that adaptive instrumentation necessarily impairs result completeness.

knowing what .elds are stationary simpli.es reasoning about object aliases and opens up opportunities for aggressive compiler optimizations.


In these protocols, we used effective priorities for priority inheritance and regular priorities for priority ceilings of mutexes.

the integrated scheme, which minimizes worst-case context switches, is appropriate for the automated implementation of real-time object-oriented design models Categories and Subject Descriptors D.4.1 [Operating Systems]: Process Management scheduling.


Connectivity: In addition to the collaboration within marketplaces, a collaboration with other instances can be considered, e.g.

characteristics of distributed digital marketplaces are drawn up for they are essentially in the decentralized approach.


3.2.2 Grammar Though Python s speci.cation presents its indentation rules quite differently from Haskell s speci.cation, once we translate it to use our indentation operators, it shares many similarities with that of Haskell.

parsec (Leijen and Martini 2012), like many combinatorbased libraries, does not use the LR(k) algorithm.


universe x] Here we make essential use of a feature of list comprehensions: if a pattern does not match, then the item is skipped.

if we were to use |+ when the righthand value was an Int, or other primitive type we did not wish to examine, we would require a PlateAll de.nition for Int.To omit these unnecessary instances, we can use |--to indicate that the type is not of interest.


Actual Statistics: in some cases it is not possible to gather accurate statistics about the data sources.

location aware applications use location sensing systems like GPS to locate objects in mobile computing.


We purposefully implemented a limited prototype to explore the bene.ts of our compaction technique.

it di.ers from these works, however, in that it is interactive (users do not need to provide a prior speci.cation of compaction rules as in BLOOM or AVID [16, 21]), and localised (users can apply di.erent levels of compaction to the same program elements in di.erent parts of the pro.ling tree, contrarily for instance to the work of Cornelissen et al [5]).


Note that this may result in some loss of parallelism, since this transformation always moves an async to the end of the enclosing async, even if S1 does not con.ict with S2 and the two could potentially run in parallel.

note that references to A, B, C are intended to denote general assemblies, whereas A1, A2, .


Second, how to choose the write caching polices?

the existing literature does not provide adequate answers to the key questions on whether there is good locality in typical cloud workloads and whether .ash caches can e.ectively utilize the locality to achieve good speedup.


And it can be done rather easily, with gcc for instance, using compiler switches specifying what registers must not be used.

pure software approaches would be ideal in this case, but previous approaches that are based on program duplication have very signi.cant runtime overheads, and others based on instruction scheduling are only moderately effective due to local scope.


Thus, instead of physically copying the reference image, a new VM can be equivalently instantiated via a copy-on-write optimization, which we term delta virtualization.

two driving factors motivate this concern.


SmartEiffel generates the smallest binaries because prmc does not remove all the detected dead code.

with VFT implementation, resolvers only contain a jump to the required method in the function table.


As was noted earlier, serverclass systemsdonot usually support sleep states, requiring length shutdown and boot cycles for energy savings.

theirwork speci.callydealswithlonglived connections as in instant messengers while we concentrate on short lived request-responsetypeof workloads.


If these values match within some tolerance given by the constraint then it advises no changes.

[15] S. Whitsitt, J. Sprinkle, and R. Lysecky, Model based development with the skeleton design method, 2013, pp.


The splitting thresholds for each attribute change from release to release.

in Section 3, we report standard accuracy indicators for binary classification and present the idea of cost-sensitive classification in the context of software defect prediction.


The dotted lines in Figure 2 denote the control messages among three components.

its e.ectiveness is circumscribed by the available free space and the access locality in the running environment.


But most people will find the exercises boring because they appear to be disconnected from their goal of being a better ball player, runner, etc.

the proceedings of the thirtieth SIGCSE technical symposium on Computer science education (New Orleans, LA, 1999).


The success of security-oriented program transformations may depend on how they beautify automatically generated code.

[9] Erich Gamma, Richard Helm, Ralph Johnson, and John Vlissides.


Dynamic deployment means that the language features an explicit deploy operator that, when run at level n, dynamically installs an instantiated aspect at level n +1.

taking into account levels when weaving aspects statically can be done in different ways.


As is common when dealing with multiagent networks, we model the networked multi-agent system with a (.nite, simple, labelled) digraph, D =(V, E) [12].

categories and Subject Descriptors C.2.4 [Computer-Communication Networks]: Distributed Systems; H.1.1 [Models and Principles]: Systems and Information Theory General Systems Theory General Terms Algorithms, Security, Theory  Keywords Consensus, Multi-agent network, Resilience, Adversary, Byzantine Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for pro.t or commercial advantage and that copies bear this notice and the full citation on the .rst page.


The advantage of this approach is that the most frequently used parts of the system are exercised the most often, and this makes it more likely that latent defects in common system uses will be detected.

based on experience, we can estimate how often experienced engineers make these kinds of mistakes, and we then have an estimate of the likelihood that this kind of assurance deficiency is present.


If Xohpaeen(oCd, then let Q=xipnCAetss( r .


INTRODUCTION Parallel computers are common today, making it possible to reduce computational time substantially and to run memory demanding applications.

in order to add a code in a processing icon we provide a simple menu by just clicking on an option called Add Code (the pop-up window in Figure 4).


This paper is organized as follows: the next Section presents related work in the literature taking into account two areas, spatial services and geographic integration.

this survey is focused on conventional systems, and it does not analyze systems based on geographic information.


[22] Z. Shao, C. League, and S. Monnier.


In Hbg, the capturerecapture estimations seem to be more accurate than both the subjective estimations.

the reviewers were asked to fill in a questionnaire consisting of seven questions.


We also added BB_IllegalOperationException to signal illegal operations and BB-InternalFailureException to represent internal failures.

we began with the Buffered I/O compartment.


NSHL measures the number of separated hierarchical relation while NSRL measures the number of separated hierarchical relation in a module.

modules and modularization process as well as tools were evaluated as follows.


For instance, suppose one of Bob s colleagues in the of.ce updates the address of a candidate who has moved to a new city but Bob s cell phone can only store the city and state .elds of the address.

it cannot currently support common complex operations, such as a red-eye reduction.


Second, once the system is implemented, in.nitesimal variations of some delays may lead to dramatic changes in the global behavior, and lead to a violation of the speci.cation.

the data sent by MPI communications have varying sizes.


To simplify our testing tasks, we also construct shell scripts to carry out the testing tasks.

it can be redistributed and/or modi.ed with the GNU General Public License.


This could imply changing many lines of code (e.g.

this library is used to support agents communication while forcing them to interact under given constraints.


Irrespective of the type of obfuscation, the key is to have a function that predicts if two observed queries are from the same user, i.e., they are linkable.

to evaluate the privacy gain of using an obfuscation mechanism, we subtract the e.ect of user s randomness and compute the relative privacy of users.


The four that have a de.nite NPA and possible NPAs as part of the con.guration cannot occur because, if a de.nite NPAis found, there can be no possible NPAs.

in such cases, using our approach, the developer would know which NPA de.nitely caused the exception and, 6 http://wala.sourceforge.net  Table 3: Distribution of NPA typesfor our subjects.


Examples of changes in different elements of a transition ti are as follows: Change on the input of ti: from Card(PIN) to Card(PIN, b).

we may not necessarily have an NDPM associated with each EM.


of 15th Annual ACM Symposium on Principles of Distributed Computing, 1996.

the variations of overall message complexity of the algorithm for varying number of nodes in the unidirectional ring are illustrated in Figure 5 for different GMR ratio values.


ESP is a conservative system; when it does not report any errors, the programmer is guaranteed that the speci.ed property is not violated by the program.

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


When applying these rules to a given graph, always the maximal rule is chosen among all applicable ones (cf.

in order to distinguish those items that are deleted or newly created, constraints {destroyed} and {new} are used.


Even cache hit accesses can be captured at the system call level and the order of access logs is the same as the access sequence by applications.

3.2.1 Association Rule Mining and Frequent Sequences Association rule mining is a data mining technique.


the bulk of the nodes of the facts tree is concerned with product characteristics.


r a t e = r a t e e n d , } ]] , } , } , } Listing 4: Protocol ob ject used to apply roles and re-combine component.

we have developed the OiL ORB as a replacement for it.


Finally, Bug #8 was related to applying the subclassing strategy.

drawSWF simple animation application http://drawswf.sourceforge.net/ 7540 All functionalityfor creatingand modifyingtext .gures.


This suggests that it is possible to decrease both delay and power dissipation by consolidation if g is large enough.

a Study of the Effectiveness of CPU Consolidation in a Virtualized Multi-Core Server System * Inkwon Hwang and Massoud Pedram University of Southern California Los Angeles CA 90089 {inkwonhw, pedram}@usc.edu ABSTRACT The focus of this paper is on dynamic power management in virtualized multi-core server systems.


Next, we motivate and explain how Synoptic works by describing BisimH, the central algorithm Synoptic uses.

of the 18 groups in the class, 11 reported that Synoptic increased their con.dence in their implementations.


Table 2 reports the number of concepts, the number of users, and the number of active users in the three forums.

one difference is that the messages in PFs contain not only texts but also, in most cases, fragments of code.


The SA-1100 processor used in the Itsy supports 11 different clock rates or clock steps .

this pin is connected to the external trigger of the DAQ system; toggling the GPIO causes the DAQ system to begin recording measurements.


These transformations allow to build from raw PCMs, corresponding PCM models that can be then enriched with further editing and validation services.


SUMMARY The transformation of best practices from business enterprise models to education enterprise models creates stability in the security lab environment.

retrieved June 29, 2004 [6] Mattord, H.J., Whitman, M.E.


Effectiveness can be defineed as the adeqquacy of a givven solution to acccomplish a purppose.

from here, decision models can be modified by adding, removing, moving, or modifying decisions, folders, and constraints.


The APL constructs are well matched to the concept of the BDI-agent model.

the intention, DeposiLChecking..intention, shares the belief Deposit::Checking__AccounLID with the belief Account::Checking__AccounLID.


Integrating eCommerce into eLearning allows furthermore an integration of business processes into electronic learning .ows.

after this, the speci.ed target group may access and execute the protected target function.


When the third event occurs these constraints are both split, because there is a non-deterministic choice.

this strategy can break down for patterns using alternation.


A) :: A{} Classes that represent pairs are just data containers with no methods at all.

compiling with proofs does impose an overhead .NET assemblies that carry proof terms extracted from Z3 can, in some cases, be as much as 50 times larger than those without proofs.


3, an additional attribute, called block label, is added in each node, e.g., G, to indicate the physical blocks 5: Select block with the smallest del version as victim block.

a larger value of {B0, B1, B2, ...} vth(t) need to purge the data block 1 in Fig.


Given a query (vp, vo), we could then test whether v1 reaches v2 by checking whether there is a landmark in GQ covering (vp, vo).

(2) We then remove from Gl node v and a nodes that connect to v (if they exist), where a = .a 2 ., and select the next best node from the updated a|Gl-1| Gl.


This invariant is crucial; as discussed in section 4, it ensures that no dangling pointersexist.However,it snotobvioushowtoprovethat this invariant is maintained when $toAbs[Mem[i,0]] changes.

since thegarbage collectors are written in BoogiePL, the Boogie and Z3 tools guarantee that we really have veri.ed the collectors, at least in BoogiePL form, even if our BoogiePL-to-x86 translation subsequently turns theveri.ed BoogiePL into erroneous x86 code.


The Raise & lower gate requirement can be expressed in several ways.

some criteria for building the model (e.g., the criteria for identifying data groups ) are not free from ambiguities, and the modelling notation is neither standard nor sufficient to support requirements analysis or development.


2.3.4 Each affiliate has an affiliate category , and a contact name , and an address , and a contact title .

we embraced the goal of creating a CASE tool for requirements speci.cation.


This availability of information implies that the participants unconditionally trust each other.

tremendous amount and variety of resources and services are emerging in this environment.


The main reason is that the two sets of programs are based on the same management APIs and there are some extra operations in runtime model based approach, which are aimed to ensure the synchronization between the runtime model and the running system.

furthermore, as the programs are built on the codes that directly connect with the runtime systems, they are not easy for reuse.


[Safeness conditions]Asame-edges(R1 ,i, R2 ) in the regionpoints-tographof aprocedure q isgoodifthefollowing conditions are satis.ed.

the derivation of live region variables at the program points in q is based on its region points-to graph and will need to be done again.


Through simulation assessment, we have shown that this approach is able to improve overall resource provisioning in cloud computing systems.

we are interested in characterizing when DTVM is a better choice and when the cost of live migration should simply be incurred.


We attempted to address this threat by using di.erent, speci.cally tailored measures for di.erent RQs: lines for RQ1, density for RQs 2a, 2b, and 3, and the very demanding aucec for the rest.

the Predictor Models in Software Engineering (PROMISE) series of events at ICSE are a well-known venue in this sub-discipline.


All approaches mentioned so far have in common that their applicability is limited to homogeneous architectures.

the approach is able to evaluate the bene.t of a parallel solution depending on the mapping of tasks to processor classes which is also extracted by the presented approach.


Moreover, there exists a large potential for optimizing the energy consumption of the memory subsystem.

these allocators perform near-optimal allocation for regular architectures with a large number of processor registers.


So, we extended LLVM by implementing a new calling convention (cc11) which describes the scheme used by the HiPE compiler for the X86 and the X86 64 architectures1.

since November 2011 the research time of the .rst and the third author has been supported in part by the European Union grant IST2011-287510 RELEASE: A High-Level Paradigm for Reliable Large-scale Server Software .


Such a difference may be explained by the .ne grain we adopted in our analysis.

we restrict our experiment to Pharo programmers.


e : t, the witness type W represents the .ow the expression e receives from the virtual source nodes.

note that this also implies that every function type can be restricted to have either 1 or 8 as the quali.er.


This is because the texture information of the closest base layer is already reconstructed and upsampled.


In previous systems [21, 13], data collection has been triggered manually or on a simple periodic schedule.

if the tokenbucket foragiven node m has E(m)joules, ADUs for which E(m) <cim are excluded from consideration.


[10] C. Collberg, E. Carter, S. Debray, A. Huntwork, C. Linn, and M. Stepp.

a similar attack can be used to remove calls to a branch function which were inserted to thwart the static disassembly of a program.


Furthermore, combining di.erent kinds of variability is also on the research agenda recently discussed in a workshop on Model-Driven Product Line Engineering (MDPLE) [3].


In this paper, we address the preceding challenges and present an automatic test generation approach for database applications.

such a mock database replicates the effect of operations over an actual database by performing the same operations on itself, so that the state of the  Figure 1: Architectural Overview of MODA actual database is faithfully mirrored and only feasible values are returned for database queries.


Exterior merge improves over total merge frequently when using Base aliasing, and occasionally under APFocus aliasing.

in a second (dynamic) phase, the system checks whether candidate temporal patterns actually appear in representative program traces.


Let a = 1(2p - 1)Trdpg/Terl denote the number of partial steps into which a read phase can be split as multiple of Ter.

the write queue length can be calculated at design time by looking at the .ash specs.


3.1 User-Level Support To support trace-based search for similar bugs, OSCILLO-SCOPE must harvest traces, allow users to de.ne bug similarity either by selecting prede.ned queries or by writing custom queries, process those queries to search a trace-indexed database of bug reports, display the results, and present a user interface that makes this functionality easy to use.

oSCILLOSCOPE rests on BQL, which we describe next.


I already tried Super-Collider, Overtone and all this other stu., it s nice that it s all browser based and there aren t any dependencies, build issues, etc.

some of the knowledge gained while using domain-speci.c languages (at minimum, a knowledge of syntax) is inevitably lost when users attempt to transfer it to domains employing di.erent languages.


Reading and understanding such a composition specification is not an easy task, as one needs to constantly refer back to the corresponding viewpoint/aspect to see what a requirement with a particular id meant.

[14], and Levin [20] that classify the verbs in accordance with their semantics (interested reader is referred to Chitchyan et.


numerical) observations and their handling during pruning and sorting.

during the sunny period the number of traces reduces signi.cantly since the cost minimum dominance strongly prunes alternatives.


To avoid the definition of traceability models, the integration of analysis methods can be designed as a three steps process including (a) the extraction of relevant input data (CDG and scenarios); (b) the control of the tool supporting the execution of the analysis; and (c) the integration of the reliability results back into the ABC/ADL model.

some approaches are proposed to facilitate the use of multiple analysis methods during SA design.


For example, the entity personal email was converted to a relationship between   Figure 1.

constraints are often implicitly de.ned and certain parts of an application may accidentally violate a constraint.


We show the advantages of XMI for XP pro ject data collection and interchange.

the scienti.c and professional community requires an objective validation of XP and Agile Methodologies (AMs) as a further step toward broader adoption.


Also if fi represents the in input message for the ith operation in a WSDL-S spec, then we can de.ne the set of all possible inputs to N as I = f1 .

standards (such as WSDL-S [1]) are being proposed to rectify this limitation.


4.2.2 Simple LED On/Off To compare performance of CI and FI, we evaluate performance on the simple LED on and off application.

the existing schemes are coarse-grained, because they do not consider the execution rate of each call instruction, rather the overall rate including every call instruction which calls the function f .


It is an often occurring question how speci.c or in contrast generic a certain solution should be realised.

modelling languages are typically considered to have a higher level of abstraction as programming languages and they often come with a graphical notation to support comprehension.


In a subsequent post-processing step, the resulting model is .ltered by removing all hidden resources.

the impacts of software product management.


An interesting direction for future work is to provide to the application using the view an indication of how good the view represents reality at this point in time - in other words, estimate the accuracy of the view and show this to the application.

while in TOTA the sender of a message (the agent that adds a distributed tuple) determines both who it reaches and what the content is, in ObjectPlaces the receivers of a message (the clients that build a view) can determine both content and representation.


[63] H. Barringer, A. Goldberg, K. Havelund, and K. Sen, Rule-based runtime veri.cation, in VMCAI, pp.

nathaniel Husted thinks that there is a chain of custody issue that holds API developers responsible for security issues involving the API.


The constituent systems of a SoS correspond to the executors (see Section 2.3.2), i.e., the elements responsible for executing the tasks that composes the missions, including the holistic mission of the SoS.

in these three studies, missions can be represented as a set of goals, which in turn can be re.ned into .ne-grained tasks or commands to be executed by entities of the system, thus aiming at accomplishing the established missions.


In the DHT layer, each node maintains a routing table consisting of b node lists for a b-bit ID space.

even if a region is occupied by the malicious peers, the redundant lookup operations can retrieve the desired (key, value) pair from owners in other regions of the network.


We consider each concept of a broadcasting system can be represented as a feature model (FM) independant in which the user can choose one or more products by means of con.gurations [4].

revues des Sciences et Technologies de l Information (RSTI), pages 93 118, December 2007.


Visualization of program-execution data for deployed software.

for instance, techniques for self adaptation and repair could leverage behavior prediction information to recon.gure a system when its performance is likely to decay or implement some corrective action when the software is likely to malfunction.


*); How would a developer know whether this pointcut is correct?

our results provide no conclusions about the usefulness of these types of information considered in isolation.


2.1 GAR Generic Autonomy Requirements Despite their differences in terms of application domain and functionality, all autonomous systems are capable of autonomous behavior driven by one or more self-management objectives [3].

mobility (for both the Composite Module and MPO): o trajectory maneuvers for avoiding orbit and/or altitude perturbations.


Automated transformations will be faster and more reliable than manual ones.

not as much work has been done on adding features.


Corollary 2.15 shows that the only passively testable properties are timed safety properties.


The variation of diversity from the original to the changed test set is computed, applying Equation 2.

we can recognize in DOTG some singular characteristics when compared to the described techniques.


Finally, we present an experimental evaluation of our PPP implementation that demonstrates that it results in signi.cantly lower overheads than Ball-Larus pro.ling (Section 5).

pPP fails to compute such assignments since we restrict ourselves to the class of solutions where edge intervals do not overlap.


A different meaning to the unused property of code units can have interesting effects: an application could run by keeping in memory only the currently executing method and not all the methods on the call stack.

on average, frequent collection incurs 1 KB smaller miss penalty than EC, while the overall execution time with EC is approximately 70 million cycles faster.


The ping-pong setup consists of n peers which periodically send a ping message to a central peer.

we de.ne a functor working on any gossipprotocol speci.cation(Fig.3).


The intention is to support a range of schedulers, all of them conforming to the abstract Scheduler class.

we can replace or combine it with other scheduler automata, as long as we keep the same interface, i.e.


We provide panes as uniform building blocks, which describe where to show information on screen.

http://dx.doi.org/10.1145/2661136.2661150  master the graphical user interface, that is, learn about features, shortcuts, and best practices.


The time necessary for the analysis varies from one quarter to half of the total compilation time.

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


We thus remove all duplicates from each list of statements.


[25] T. C. Mowry, M. S. Lam, and A. Gupta.

proceedings of the 35th International Symposium on Microachitecture, 2002.


Consider one implementation of control .ow analysis on the GPU [22].

(vector [r1] v1 v2) explicitly indicates that the vector is allocated from region r1.


Suggestions for Stream Based Parallel Systems in Ada M. Ward* * and N. C. Audsley Real Time Systems Group University of York York, England (mward,neil)@cs.york.ac.uk Abstract Ada provides good support for the implementation of dependable, real-time, control systems.

the broadcast semantic will allow the same data to be written to multiple protected objects at the same time.


An example of code that uses eflags across indirect branches.

later implementations of memset and strlen from gcc and in the C library used by DynamoRIO and clients began to use register xmm0, violating the assumption and causing application crashes.


The typing environment contains the declared owner parameters, the declared constraints among owners, and the declared locks clause in scope: E ::= Ø|E, owner f |E, constr |E, locks(cn.l*) F , S, LS,and Lmin provide respectively the types of local variables, the types of stack slots, the locks that are statically known to be held, and the sequence of minimum lock levels at every program point.

the rule appropriately renames the expressions and types used outside their declared context.


CommentWeaver contributed to the modularity of those crosscutting doc comments.

the doc comments of the makeClass and makeInterface methods still contain the text about the con.rmation code, which is @throws RuntimeException if the existing class/interface is frozen.


According to the algorithm, the statement executions that potentially depends on S4 are also tested in order to facilitate pruning.

the con.dence of 10 is computed based upon the range of a, which can be approximated by the value pro.le.