There is almost no intersection of signi.cance between all the seven of them, but the possible intersections grow when considering only pairs of project, especially from the point of view of the time period studied.

while at the moment there is little practical space and time concordance in the project s scope, there are very relevant a.nities in the research subjects, both when considered as conceptual entities (e.g: people, especially scholars, universities, locations...) and on their related properties (e.g: simple biographical information about a person, or their curriculum studiorum).


In subsequent work [8], Daniel and colleagues presented a symbolic-analysisbased repair technique that overcomes some of the limitations of ReAssert (e.g., its ineffectiveness in the presence of conditional control .ow).

this technique also focuses exclusively on repairing assertions.


If the one-bit error occurs at a parity check bit, and only the circle that contains the parity check bit does not meet the condition of the Even Parity rule, we can easily spot the error without any confusion.

if the one-bit error occurs at one of the data bits d1, d2 or d3, this will effect the number of 1s in two circles and therefore, we have to take the two circles into consideration for correcting the one-bit error.


Finally, the meta-program appends to the implementation the necessary mechanisms for serializing/un-serializing ChatService instances to/from the portable ChatServiceState containers.

it is worth noting that the user can, before the final compilation step, customize the Portable Serializable code generated in order to introduce some optimization or any complementary treatment.


In other words, uncoupling ability of IC-DCN is con.ned within a cloud.

notion of uncoupling addressed in this paper comes while interfacing mobile applications with the cloud.


Scheduling tasks on demand by random work stealing performs well with irregular parallelism.

it tends to under-utilise large scale architectures at the beginning of the computation.


[7] is the .rst to investigate client placements that optimize delivery delay and system load.

the work focused on the placement of a few known publishers under .xed subscribers subscriptions and broker overlay topologies.


Therefore, the rating of importance of ROIs can only be done independently of the context and is based on general assumptions.


It should be noted that although we have used an exists query here, we did not really need to in this case we are looking for a single node that satis.es certain conditions, not an entire path.

it turns out to be convenient to express the query in this way because predicates such as use are already de.ned with respect to edges.


The popularity of visual query systems [18] indicates that the visual domain is popular for at least some relational operations.

the use of relational algebra for all controller operations may be problematic.


In the example, statement l2 de.nes the whole structure a and the statement in l3 de.nes only a.f2, partially killing the previous de.nition to a.

the previous reaching de.nition for ranges of the aggregate variable that were not killed are still valid and a new reaching de.nition only to the range that was reassigned is generated.


In addition, if the data accessed by different threads on the same multiprocessor are aligned and continuous in the device memory, they can be coalesced into a single memory operation to increase memory bandwidth.

the most frequently reused data are likely to be copied into the shared memory to reduce access latency, and the banks of the shared memory provide parallel data accesses.


CONCLUSIONS AND FUTURE WORK Model-based testing automates the generation and execution of test cases from a model of the system under test.

the need to build detailed models of the systems under test creates a barrier for the adoption of this testing approach.


First, due to the relatively limited CPU and memory resources, the tools should support searching for bottle necks in the inspected applications.

the tools themselves should be as light as possible.


In practice, the TinyOS task that resets the array index completes before the ADC interrupt next .res.

it is worth .nding even latent bugs: TinyOS is designed as a collection of reusable components, and the next application in which the Oscilloscope component is used may have a higher duty cycle, causing the bug to manifest.


Hence, committing pending updates immediately before a TLB .ush usually suf.ces for correctness.

some guest OSes elide the .ush when it is certain that no stale entry exists in the TLB.


In other words, these are often based on physical items such as the test cases, test results, or software components.

one can also use a social process, i.e., opinions and comments by peers and/or participants.


When compared to the stack of the .rst solution, the re.ective capabilities have greatly improved the QoS provided by the service.

utilisation of such capabilities removes the independence provided by the open MP3 format, resulting in lock-in to a particular propriety re.ective implementation.


That would be a new (and even more pernicious) form of non-modularity.

it leads us in an interesting new direction.


DATA-AWARE PLANNING Scheduling all the jobs in a DAG on the same machine eliminates the need to transfer pipeline data across the network.

it signi.cantly reduces the degree of parallelism obtained.


Game cheats often exploit loopholes in game rules or speci.c implementations, so researchers attempt to guarantee the correctness of game systems by, for example, runtime veri.cation of transaction atomicity [5].

the correctness proof approach does not apply to bot detection problems because game bots obey the game rules completely.


It is not possible to determine the exact application mix for the protocol speci.c traces, as we only focus on the speci.c protocol.

we use full traces to cross check the general application mix evolution.


A Relational Database Model for Representation of Formal Specifications Robert Leithiser Department of Computer Science and Software Engineering Auburn University 334 201-4536 leithrm@auburn.edu   ABSTRACT Literature has established the effectiveness of formal specifications for modeling specifications for computer system properties as well as for verifying program correctness.

tools that can enable the typical commercial software developer to utilize formal methods are not in widespread use.


to detect changes in application states if the accurate editing operations cannot be intercepted.

their work assumes that the application follows custom programming patterns such that the logical structure of the application state can be introspected, which is di.erent from our work.


DarSens: A Framework for Distributed Activity Recognition from Body-Worn Sensors* Michael Haslgrübler Johannes Kepler University Linz, Institute for Pervasive Computing Altenberger Straße 69, 4040 Linz, Austria michael@haslgruebler.eu ABSTRACT With the increasing amount of sensors in our environment, the desire to reuse existing sensors for di.erent applications grows.

most appliances do not provide access to their sensors in a cross-application manner, but rather use them for a speci.c purpose only.


The study proposed in [13] focuses on the interaction between mobile users and infomobility services, proposing XUL-based interfaces that have some similarities with the Web-based approach proposed in this paper.

the study does not address the architectural issues of scalability, availability and privacy in the deployment of infomobility services.


0, depending on whether one uses the axiom .x.x*0 = 0or .x.0*x = 0to prove correctness.

once we settle on a given proof of correctness, not only does there exists a most general optimization rule given the proof structure,but we can also show that our algorithm infers it.


Fortunately, a lot of progress has been made here by at least two projects that we aim to introduce and evaluate their usefulness in the context of bringing together di.erent MOP frameworks.

.rst we want to describe the scripting capabilities and how we allow writing and executing code within the running HeuristicLab application.


A sampling period must last long enough time to cover at least one pair of consecutive accesses to a shared memory location in order to accurately record one CCI-Prev predicate.

the sampling period cannot be too long, or else performance will suffer.


Specifications such as SOAP, WSDL, BPEL, WS-Policy, and WS-Agreement already constitute the first step to realize the technical aspects in some of the SSE tenets, including tenets 1, 2, 4, and 5.

it is evident that research is needed to more effectively satisfy the open world assumption .


Our previous paper [1] proposed an auto-scaling method to provide efficient resource utilization in a hybrid cloud computing environment.

proposed auto-scaling algorithm needs to be extended in order to support various patterns of task execution, which are Bag-of-Tasks [2] and workflows.


Another important application of sketching sets is comparison of documents such as web pages wherein a document is viewed as a set of words.

we lose the structure of the document by viewing it as a set.


This is advantageous, since it ensures that all of our knowledge about initial algebras can be brought to bear on GADTs.

theorem 1 is the key to structured programming with GADTs since it can be used to derive from every GADT, directly from its declaration, a collection of tools for structured programming with data of that type.


AnEf.cientCodeUpdateSchemeforDSPApplications in MobileEmbeddedSystems WeijiaLi ,YoutaoZhang ComputerScienceDepartment,University ofPittsburgh,Pittsburgh,PA15260 {weijiali,zhangyt}@cs.pitt.edu Abstract DSPprocessors usuallyprovidededicated addressgeneration units (AGUs)to assistaddress computation.By carefully allocating variables in the memory, DSP compilers take advantage of AGUs and generate ef.cient code with compact size and improved performance.

dSP applications running on mobile embedded systems often need tobe updated aftertheirinitial releases.Studies showed that small changes at the source code level may signi.cantly change the variable layout in the memory and thus the binary code, which causes large energy overheads to mobile embeddedsystemsthatpatchthrough wireless or satellitecommunication, and oftenpecuniaryburden to the users.


if (x is I) then (x + 1) else xl Function id is parametric, because it acts uniformly on values of all types; while functions inc and test are not, since the former acts only on integers, while the latter acts on values of any type but behaves differently on integers than on other arguments.


Because of the small size of our example, the con.gurations P1 P5 are also the theoretically possible con.gurations.

con.guration P0 is an incomplete con.guration having unbound variability points, i.e.


As such, educators have searched for an effective means through which to introduce design patterns early in the undergraduate curriculum (for example, [2]).

some people have found the proposed approaches to be overly complicated for entry-level students [3].


6.2 Optimization through Credible Threats The Guaranteed Response protocols allows data to be replicated only where necessary.

requests and responses are still sent to every node that is part of the replicated state machine and, because backup requests contain the data being backed up, they can be large.


If the program is properly synchronized (free of data races), this is suf.cient for CETS to be thread safe.

programs with data races may exhibit two sorts of races.


In a context-sensitive call graph, we can distinguish function parameter properties on each clone and perform a more precise analysis to reduce false alarms.

the cloning-based approach would lead to a large number of calling contexts.


Inputs and outputs of the system would then be bound to roles, and some external mechanism would mediate the connection between roles and users.

if we admit the possibility of personal data then the information .ow perspective becomes considerably richer.


The idea of a joint use of megamodeling and model weaving was first presented in [11].

this work was really exploratory and at the time mostly focused on traceability in model transformation.


If we have a large amount of shared memory to hold all local variables, then we can directly start assigning shared memory slots to individual variables.

the shared memory is a scarce resource, as its size is the same or even smaller than the register .le size.


2005], which reduces indeed the visualization complexity [Voinea and Telea 2006].

it is not clear which level of detail, i.e.


As a next step, the applied change operation is tried to be matched in the Change Variability Model Con.guration.

the applied operation add is not contained in the sub-features of the feature BBIE.


Bug Finding Tools Schedules: Even though program testingisdifferentfromdebugging, wedrewinspirationfor schedule synthesis from tools that search for concurrency bugs,likeChess[29]andDeadlockFuzzer[21].Still, there existmajordifferences.Thesetoolsexercisetargetprograms in a special environment and, when abug occurs, the tools are able to replay those bugs.

eSD reproduces bugsdiscoveredinthe .eldbyend users,inwhich caserequiringtheprogramtoruninaspecialsettingisnotfeasible.


The StylisticFeatures serve to locate those features relevant to the style (like the ones given in Table 1).

each FrameletBuilder configured by RuleBaseEngine is expected to encapsulate a separate strategy for generating object-oriented models from the actual architectural configuration of components and connectors, based upon the characteristics given by StylisticsFeatures.


If captured, the knowledge acquired when debugging one bug can speed the debugging of similar bugs.

this knowledge is wasted and cannot be reused if we cannot search it.


Therefore, the total memory required to store the probability vector and to sample two candidate solutions is given by 17 µcGA =4 *f + f/4= ·f.

(5) 4 simple generation-wise GA implementations would require: (1) Parent population: n ·f/8bytes, (2) Parent .tness: 4n bytes, (3) Mating pool: 4n bytes, (4) O.spring population: n ·f/8 bytes, and (4) O.spring .tness: 4n bytes.


Relevant: FRP1 (navigate shop) is relevant to Q1 because it is included in all the scenarios specifying Q1.

it is more general than FRP3 since it is also included in scenarios not relating to Q1 at all.


Like our work, they attempt to capture recurring and reusable patterns of architecture evolution.

unlike our work, they do not explicitly characterize or reason about the space of architecture paths, or reason about how to select appropriate paths.


These are the fundamental di.erences between the two cipher technologies[5].

the comparison of these features is valid for a pair of point to point communication from the viewpoint of the strength of encryption.


Eachselected sample wouldbe a querymix thatis run to observeitsperformance.

random samplingisinef.cientfrom the modelingperspective.


This allows minimal idle time on the compute nodes allocated for the simulation, as the I/O nodes handle the rate-limiting disk writes and reads collectively and network bandwidth is an order of magnitude faster than disk bandwidth.

given the trend of ever-increasing simulation data sizes, combined with the need to checkpoint simulation state to minimize data loss in the face of node failure, the I/O o.oading approach alone cannot keep up with the computational throughput available.


The PCP is e.cient for entities which are only updated by a single process or a small group of processes(the latter, e.g., when in a replicated zone or travelling through a portal).

global objects have to be updated by all server processes, and all but one of them have a shadow copy of a global object, i.e., they have to send forward messages to update the global.


Hence, the advice do not have to be woven - they can be added, changed or removed at run-time.

aspectWerkz assumes that the pointcuts are defined before run-time.


The obfuscated program should be a virtual black box , that is, anything that can be computed from its code, can also be computed from its input-output behavior.

for the applications we consider in this paper, such ideal notion of obfuscation is not necessary.


Implementing a smart phone version might be ideal solution, which has been adopted by a lot of companies.

for cost and maintenance concern, some vendors would like to adapt original PC oriented web applications for smart phones.


Then M has bounded f-block size on C if and only if M has bounded f-degree on C. Informally, the preceding theorem asserts that nested tgds can achieve unbounded f-block size on a class of source instances only because some null value appears unboundedly often in the core of the universal solutions of such instances.

plain SO tgds can achieve unbounded f-block size in more complex ways, as evidenced by the next result.


Thus, as the rule of thumb, for current, Twitterscale streams, DS is the method of choice, particularly since it reaches the most accurate results as fewer tagsets are assigned to multiple nodes, thus, there are fewer Jaccard coe.cients reported multiple times.

we did see that some partitions in the DS algorithm have higher load than others, so if balancing load is crucial and network cost is not critical, SCL should be used instead of DS.


It is our intention to distribute NCL-Inspector with an interesting set of built-in rules, which we believe will be suitable for a large number of NCL coding issues and developing situations.

a developer may be interested in creating a coding standard to be used speci.cally by his development team.


The coding by repetitions, explained above, may seem ine.cient as shown by Shannon in his original paper [11].

in this particular framework, we will show (in Sec.


Since it gets six tries to pick servers within 75 ms, these errors have little impact.

it is quite possible for nodes with poor location information to get starved and never be picked by geolocation.


Summing up, the factories can be seen as a pragmatic extension to the transformation engine as they bypass the engine for the adaptation case when the abstraction between source and target models is too large.

the engine is used to synchronize changes performed by factories on the source model to target models.


On one hand, the WiMax technology offers an extensive support for QoS, full native IP support and high physical layer efficiency.

wiFi is a more mature technology and therefore may result in simpler portability to the space domain, on condition that the timing is adapted due to the higher propagation delays.


Part of this di.erence can be attributed to natural overheads involved with programming in Java such as class de.nitions, various initializations, need to create special objects for threads, exception handling and registering RMI objects.

a substantial amount of lines is devoted to spawning the tree of threads and accumulating the data in the vector of queues.


The three secure re.nement cases summarized in Table 1 are similar to those for Cascade pattern and are omitted here to save space.

it is important to note that some security properties are not preserved under feedback composition [13, 20, 12].


Unlike in our previous case, the switch between categories is done here by the same person in the same utterance.

as the talk progresses, we see Dale evaluating the categories given by Paul initially as well supposedly , which leads to Paul changing his stance to agreement with Dale before Dale himself reformulates to too harsh!


For example, given a set of two aperiodic tasks t1 (mint1=10) and t2 (mint2=11), the following is a valid chromosome in a time interval T=30: (t1,-1) (t1,19) (t1,29) (t2,-1) (t2,-1) (t2,10).

chromosome (t1,0) (t1,5) (t1,50) (t2,-1) (t2,-1) (t2,10) is not valid since the minimum interarrival time constraint for the first task is not satisfied by the two first genes, and the last arrival time for the first task is above the testing time interval T. 3.2.2 Initialization The initial population of chromosomes is randomly created, following the constraints above, provided that a value for T is given.


For the initial execution replicas, the bft fopen() call is identical to fopen().

for the additional replicas which are spawned after a fault, the bft fopen call is used to retrieve a .le from the disk snapshots and copy it to the replica s own disk on demand.


As for external validity, it is entirely possible that our method does not lead to signi.cant decreases in run-time for any speci.c grammar that we did not include in our experiment.

we did select representative grammars and the ambiguities we seeded are typical extensions or tryouts made by language engineers.


Because most of these features could be enabled or disabled, Spirit constituted a highly-con.gurable system.

like many highly-con.gurable systems, some features depended on or con.icted with others, so not every con.guration that is, not every choice of features was valid.


The associations between Controller and three hardware components indicate phenomena such as sending a command from software to hardware and receiving data from hardware.

stereotypes for these phenomena are not provided in our UML pro.le because they should be considered in system analysis not in context analysis.


The adoption of middleware frameworks designed for fixed, nomadic or semi ad hoc infrastructures have been a widespread approach [2].


Unused IP address space can be found in almost every organization, institution and public body due to underutilized or even totally empty subnets.

the deployment of honeypots requires both administrative expertise and dedicated resources that many organizations cannot a.ord.


In that case, the programmer could desire to disable the automatic cast between the statically typed and dynamically typed world and be warned at compile time.

the programmer does not have that choice in the gradual typing described by Siek and Taha.


Thus, we achieve arbitrary semi-algebraic sets, for instance, sets with (partially) open boundaries or with low-dimensional features as antennas and isolated vertices.

practical settings often desire shapes to be closed and free of low-dimensional features.


1: z=*p; 2: if (p == NULL) ...  Line 1 demonstrates a belief that p is not null.

in line 2, the programmer believes that p could be null since she checks its value.


One ad-hoc approach to implement a data partitioning mechanism for a Single Database Mul titenant application would be, .rst, to change the APIs of all these DAOs or make the resolved Tenant identi.er avail able to the DAOs implementations and, next, change all the methods to correctly build the necessary statements to in teract with the database.

even being restricted to the DAOs, this mechanism would still require extensive changes to an existing implementation and thus cannot be considered a nonintrusive approach.


These approaches allow for the speci.cation of far more expressive properties than is possible in our system.

they require significantly more manual effort in interacting with the prover.


In general, the time-critical path in a sender-to-receiver synchronization consists of four factors [24]: i) the time for message construction and sender s system overhead, ii) the time to access the transmit channel, iii) propagation delay, and iv) the time spent by the receiver 2tributedwithvariance sw to process the message.

a receiver-to-receiver synchronization is only impacted by iii) and iv) and hence has smaller variance.


[3] present a tool which uses genetic algorithms to identify potentially infeasible program paths during the test data generation.

only a small-scale experiment (40 infeasible paths) has been conducted to validate the correctness of the approach.


Regarding application-level vertical scope of reconfigurability most middleware platforms provide support to weave and un-weave aspects that are applied to an application at runtime.

with the exception of FAC [9], none of the AO-middleware platforms supports infrastructure-level evolution, but FAC is limited to local infrastructure-level only.


Hence, that input .le has to be opened in the parent region.

the child computation also needs to read from it, which newNaiveReg prohibits.


The sampling rate could havebeenincreased, orthe excitationdurationlengthenedto ensure that an unambiguous reading is recorded.

in ourcase wefoundtheproblemtobe abadcontactbetween the sensor andtheboard.This emphasizestheimportance of deployment time validation, since we were able to replace thefaulty sensorsinthe .eld and avoiddataloss.


We know that potholes can be detected from the 3-axis acceleration data from smartphones [7] carried by drivers.

certain processing on the raw time series data has to be performed to identify the location of potential potholes.


suite that contains only two test cases and executes in .ve time units.

reducing based on ratio or time produces test suites containing three test cases that execute in only three units of time.


Since the size of the used systems and the number of concerns may constrain our results, an area for future work is to replicate the experiments using larger software systems and additional crosscutting and non-crosscutting concerns.

our experimental setup can be easily reused to expand the data set and support additional analyses.


These tasks are usually carried out fairly quickly and it is difficult to grasp why such a change may have occurred, in particular, when tweaking the middleware scheduling knobs.

some phenomena may be too slow to observe in real-time, since continuous queries may span several hours or even days.


During replay, the code under test is executed as usual.

at each point that it would have interacted with the environment, no computation is performed; instead, the value that was observed during the capture stage (and was recorded in the transcript) is used.


On the other hand, because it searches exhaustively, its ability to synthesize big programs is hopeless.

having heuristics and not doing an exhaustive search do not always mean that an algorithm can synthesize big programs, unless the heuristics are designed adequately and work well.


In addition, as our work is related to both regression testing and mutation testing, we also ensure that the selected subjects have been used for regression testing or mutation testing research [6, 7, 10, 31, 42, 43, 57 59, 61, 63].

they still might be not representative for all the possible subject programs.


There is nothing fundamental in the Java language that prevents the utilization of these same techniques.

java does have some unique fea- tures that are detrimental to performance when compiled naively.


There is always the desire to increase processing power by having the latest, fastest processors.

such luxuries are usually not possible in avionics, due to the amount of time it takes to build and certify an aircraft plus the long operational lifetime.


n ); }, 2000) ; } ; easier for beginners to use, since it does not requires knowledge of tuples or structured data, and both functions can be tested independently.

in Clean s system, when an event is being handled, the computation for the new iostate can use the event information.


If a hello message is not received from a neighbor for too long a time then it is discarded from the neighbor set.

these approaches provide no formal guarantees and require sending messages periodically.


Optionally, the correspondence table may contain information about similarities between each corresponding pair of nodes.

from our point of view the similarity is just a numerical value between 0 and 1; its computation is concern of the di.erencing library.


As expected, .ve of the workloads show less than a 1% improvement with bias scheduling.

the remaining three show modest additional gains of 3% to 8% over the Linux scheduler.


For instance, the Ranger cluster normal queue times limits a maximum wall time of 24 hours, where as the long queue facilitates upto 48 hours.

some UltraScan jobs may need to run for up to four days on Ranger.


For the small benchmarks mentioned above, there was no measurable difference in checking times.

on an arti.cially generated C program of about 200,000 lines of code, running on a 2.6 GHz Intel Xeon core, Google s checker took 0.90 seconds and our checker took 0.24 seconds (averaging over one hundred runs).


As a consequence, some regional clusters had to readjust their strategic priorities.

in 2012 some of the joint effort projects, such as TechNets 3 or the systematically supported exchange of experiences among regional cluster managers on a country level showed a positive impact and are visible in ascending trends.


Therefore, it is possible that peer B will not send a packet to peer A even though A is missing it.

a node will never send a packet that is described in the Bloom .lter, i.e.


Dynamic signs are privileged in designer-to-user communication and convey most aspects of the whole message.

it seems that designers should explore other playability characteristics [8] in the game, such as varying the levels of difficulty.


(In the above example, note that the type variable R is used in the pointcut to quantify over execution join points of methods with a return type that is a subtype of Number.)

we explicitly support abstraction of pointcuts through typing based on type ranges.


The motivation for using a green thread model is that it allows very fast thread switching because the OS is not involved [2].

commercial Java VMs use a native threading model in which each Java thread is implemented as one OS (or native) thread.


Our set of ATL transformation rules generates design tests to verify some UML class diagram artifacts, such as classes, generalizations and associations.

due to lack of space, we show in this paper details about the design test generation only for simple classes.


Although the implementation problems, such as those mentioned above, can be considered quite simple, ESC/Java2 helps in finding such bugs, and we can accordingly improve the overall implementation.

at the same time, we faced problems when applying ESC/Java2 in situations where the resulting specification and corresponding implementation become considerably complex.


More importantly, the hardware changes are speci.c to the monitoring task, which means each monitoring task requires a different set of hardware changes.


In uniproces- sor environments, such a situation could potentially be caused by processor and DMA accesses.

in practice, it does not oc- cur: the operating system ensures mutual exclusion of processor and DMA accesses by locking memory pages as needed.


For a reusable artifact, the specification often contains three items: precondition, post condition, and invafiant, The inter- face to one artifact is independent of the specification of the other artifacts.

if that component is part of a reus- able domain, the question is "Does the domain interface have responsibility of exhibiting or checking on the pie and post- conditions?"


Note that in the original FLoD design, scene descriptions are provided by a P2P overlay as well.

as scene descriptions are often much smaller than the actual content, we assume that they have negligible contribution to bandwidth and may be performed in either a client-server or P2P fashion.


A compiler breaks down a program into components and data.ow relations to enable optimizations and low-level code generation.

the SmartSynth synthesizes the script structure from its building pieces, namely the components and their data.ow relations.


4.1 Problems using spinlocks within transactions Using conventional Linux spinlocks within transactions is possible and will maintain mutual exclusion.

this approach loses the concurrency of transactions and lacks fairness.


5.5 Author Issues We are facing the same author issues that the single-sourcing authorities are described in every one of their books.

some of the choices we made have resulted in at least one issue I have not seen discussed previously.


Other approaches address the problem of model merging by introducing speci.c model repositories [8].

the merge functions presented there are actually offering typical patch functionality.


As shown in the .gure, the average execution time reduction increases quickly from 14% to 24% when Tl is increased from 16 to 128.

increasing Tl to more than 128 only yields incremental performance improvements for SRM-buffer.


Indirect functoids can only represent monomorphic functions, however.

direct functoids can represent either monomorphic or polymorphic functions but they are not .rst-class entities.


In this context, policies need to provide .exible means to de.ne which parts of the policy a.ect what service components or enterprise levels.

policy languages that only support static policies for single end points, such as WS-Policy, do not sup port precisely scoping their e.ect to parts of the system.


[Negative Tuple Joining] This step is the same as the Negative Tuple Joining step in the simple case (Section 3.2.3 case 1) that joins the negative tuples in input R with the negative tuples in input S.  For equi-joins, there are some more special cases such as both join keys are pre-grouped, or the join keys are bound by check constraints, etc.

these cases rarely happen in practice and interested readers are referred to [6] for details.


2.4 Strawman solutions It is natural to ask whether our goals could be achieved by using some combination of an existing fault detection system, such as PeerReview [17], and/or an existing network provenance system, such as ExSPAN [51].

a simple combination of these two systems is insu.cient for the following reasons.


A traditional view of IT governance frameworks considers international standards such as the ISO 27000 series of standards for Information Security (the title is re-interpreted by Calder and Watkins to include Governance [4]) or COBIT, as being the key to developing and managing Information Governance and Security in an organisation.

in order to gain additional perspectives, this paper will expand the viewpoint to identify frameworks in a broader, less formal fashion, which students have found to be very valuable in guiding their research and provides a useful model for this paper.


The load of a peer can be adjusted by choosing a suitable ID in the namespace.

all such solutions requires IDs to be reassigned to maintain load balance as nodes dynamically join and leave the system, resulting in a high overhead because it involves transferring objects and updating overlay links.


Our message follows the tenets of the manifesto of Yang et al [13] in that an error message should never reveal anything internal to compiler.

the error messages provided by EJC and JAVACexplicitly refer to a captured wildcard.


Both heuristics are applied incrementally starting from an empty set of neighbor links, adding one link at a time, and maintaining a set S of topics that are not yet Kcovered.

the greedy coverage heuristic selects as neighbor the node that covers the maximal number of topics from S. the random coverage heuristic randomly selects a node whose addition as a neighbor would cover at least one topic from S. The exact values chosen for Kg and Kr express the tradeo.


One could argue whether the WSDL parser could have been replaced by a WSDL-to-UML conversor instead, since a UML parser was already in place.

there were two main reasons we did not make that choice: on the one hand, UML is not a widely used standard to represent web services, so the WSDL-to-UML transformation would not have much value in itself.


Traditional graph coloring approaches [3, 2] are a full success for load/store architectures with plenty of general purpose registers and an orthogonal instruction set.

it is very di.cult to adopt the graph coloring approach for irregular architectures since it assumes that a vertex can be colored with any color as long as the interference constraints hold.


Thus, our implementation had many false positives.

a more serious issue was that the extra instrumentation code caused a slow-down of up to 8x; Maple s existing information on allocated memory was not designed to be speed-ef.cient.


Ko et al[14] present an optimizedSIFTimplementation which uses .xedpointarithmeticand showmuchfasterprocessing speed.

their implementation is speci.c to the TI Black.n processor family.


Figure 2 presents the behavior of the Region QoI function, where we observe an increase in the accuracy for speci.c regions, due to the nature of the QoI function.

this accuracy improvement clearly depends on the speci.c regions, as there can be regions with fewer ADUs sampled or with varying speeds of mobile nodes.


Instant messaging protocols are today used for human to human interaction.

the concept could be extended for use in 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.


The interpretation of the JHotDraw case study is based on a subjective assessment of the relevance of each element generated by our technique.

the complete list of elements generated is made available, and the detailed justi.cation for the relevance assessment is included in the paper.


In pair programming, code reviews usually happen in a continuous manner.

for the sake of conducting controlled experiments, we plan to perform our experiments only for the code reviewing activities.


So, Le Fessant and we decided to merge the statement of the results (namely, the claim that optimal protocols have been designed) in a one-page brief announcement that appeared at PODC 03 [15].

as the protocols are based on distinct design principles, we decided not to merge the papers describing the protocols.


However, it implies run-time support for dynamic binding of operations; this imposes performance, area, and power overheads to the design that is known as the major drawback of OO hardware synthesis.

the technology trend in System-on-Chips is toward Network-on-Chip paradigm due to deep submicron effects [1].


Thus, for a single Class with n attributes, n Somethings would be created.

the rule processAllAttributes illustrates the binding of the variable A to all of the attributes of Class C (indicated by the use of {} decoration).


Hence, the obvious similarity between our constraints and his.

his constraints are interpreted over simple types while ours are interpreted over graphic types, that generalize System-F types.


For example, the IA has .ve CC .ags embedded in its EFlags register, and all direct branches test these CC .ags.

powerPC has 8 condition register, each with 4 .ags.


Hierarchical structure: The hierarchy has proven to be one of the most robust, feasible and practical structures [9].

the structure of the model cannot be lim- ited, because many-to-many relations are needed as well as additional arbitrary associations.


Rm(T) <:JLS Rm(U) if T is the type of a method argument y.

if T <:JLS U holds in the original program because y was directly assigned to another variable of type U, then rules MB-ASSIGNTOGENERIC-SAME and MB-ASSIGNTOGENERIC-BASE from Figure 11 guarantee Rm(T)  and Rm(U) = C, rule MB-ASSIGNTOGENERIC-SAME ensures v = w. Moreover, if an arbitrarily complex expression e of type T occurs where an expression of type U is expected, then the implication T <:JLS U =.


Expression and Enforcement of Con.dentiality Policy in Active Databases Julien A. Thomas Nora Cuppens-Boulahia Frédéric Cuppens .rstname.lastname@telecom-bretagne.eu Télécom Bretagne ; LUSSI Department Université Européenne de Bretagne Cesson Sévigné, France ABSTRACT Many research works focused on modeling relational database management systems (DBMS) that support multilevel security (MLS) policies.

most of these previous proposals only consider static aspects of relational databases and do not address dynamicity provided by mechanisms like triggers.


Arrive at Destination (Figure 2) is not enabled; the guard [stophere (c,cf,rl,cd)] evaluates to false because cf=1 and rl=[4] and stophere just checks if cf is member of rl.

move One Up (Figure 4) is enabled and its occurrence causes the floor entry in the CAGE token on Moving to change from 1 to 2.


This makes it impractical to have it turned on all the time in 1 Although a minor change in the operating system can make it easier for gaining control of applications (see Section 2) a production environment.

the overhead is not prohibitive and in many desktop applications that are not cpu-bound it is practical to run applications in full tracing mode all the time and get a rich repository of traces for dynamic analysis.


The graph representation is preserved by this transformation.

that is, we want a function that has the type signature: registerAllocation :: Graph (MateIR VReg) e x -> Graph (MateIR HardwareReg) e x it is not straight forward to apply a linear scan register allocation algorithm to a graph.


In order to make the hybrid main memory possible, [2] and [3] propose several hybrid hardware/software supports.

how to make full use of this hybrid main memory, especially on the application-speci.c embedded systems and DSP systems, has not yet been studied.


Similar to the Verisoft [10] model checker, CHESS is stateless and runs program executables directly.

verisoft was designed for message-passing software whereas CHESS is designed to verify shared-memory multithreaded software.


The SSA form is constructed using the method described by Cytron et al [9].

since the variables in the program are possibly arrays, it is important to optimize the insertion of f nodes.


Example properties are: The media player always uses less than 1 J/s (1a, i)  For every execution sequence, whenever a full song is completed, the energy consumed since the song was requested is less than 10 J (1a, ii)  For some execution sequence, the media player reaches astateafterplaying afullsongconsuming lessthan 10 J since the song was begun (2b, ii)  Standard temporal logic and model checking do not allow directly answering an optimization request of type (iii).

the nature of an unsuccessful model check that it provides a counterexample when the property does not hold for the model can be exploited.


This kind of approach leverages the practical knowledge that a consumer needs to know in order to access the context, simplifying the communication interfaces.

we need to define a context-query language descriptive enough for the consumers to define their context needs.


(nil,nil) y:ys.ify=newline ; letf(x,y)=MginC[x][y]ifp62FV(M,C)  then(nil,ys) Thelemmasaysthatitisalwaysspacesafetousepattern elseletp=split0 ysbindingsinsteadofprojections.Sowhataboutsplitand in(y:(fstp),sndp)split00?Convincedthat Notethatsplit0 ,incontrasttosplit,isstrict.this ;`letf(x,y)=splitxsginM defnitiondoesn'tsolvetheproblem.Thereasonistheuse f(x,y)=split00 xsginM £let oftheprojectionsfstpandsndp.Duetolazyevaluation, theprojectionsarenotevaluateduntilneededandthereforewespentconsiderableefort B tryingtoproveitonlytorealise holdontothereferencetop,whichinturnholdsonto boththeresultsoftherecursivecall.Asaresult,wehave combinednotonlythecomputationsbutalsothelifetimes ofthetworesults.


2.2.4 API-level compatibilities This is the method based on another emulation layer from the above three technologies which use the modified/unmodified kernel as GuestOS, so the applications on GuestOS are identical on the native OS.

aPI-level compatibilities emulate library API only.


For example, application sensitivity to port 0 or port 1 ranges from negligible to above 70%.

on average, contention in each dimension can cause signi.cant interference and thus all these dimensions need to be considered in our interference model.


Here we see that the ac-10% tual performance slowdown induced by the compiler algorithm is poorly regulated given that the maximum performance-slowdown 5% constraint was speci.ed as 5%.

the -adaptation algo 0% CINT2000 Slowdown Savings  rithm, which is the foundation of our power-aware run-time (PART) system, regulates the actual performance slowdown much better.


Such analysis helps manage space allocation between prefetching and demand paging, and allows perstream prefetching aggressiveness control [Gill 2005, Liang 2007].

existing approaches seldom explicitly consider the application request rates, in particular the relative access speed of multiple sequential streams, in their runtime decision making for dynamic prefetching.


Much research has focused on construction and maintenance of e.cient and scalable overlay multicast networks.

little attention has been given to improving the e.ciency of operating system support for group unicast.


In addition, it uses Erlang s standard external format for encoding/decoding terms, which is also used to communicate between Erlang nodes and C nodes.

it cannot transmit binaries by reference like port ommand/2and driver output term/3.


Figure 1 shows the running time as a function of the separation distance for .xed popularity.


The above systems are retainer-or consumer-based accounting systems: they do not care who created the data, just who is holding on to it.

our system is a producer-based accounting system: the individual who produced the data is held accountable for the data.


Adaptive architectural frameworks such as Rainbow [8] have much in common with the approach described here in that managment is exogenous to the services.

rainbow infrastructures have global adaptation strategies (rather than being modularised in a composite s organiser) and they cannot be recursively decomposed or distributed as can ROAD composites.


The similarity and recall obtained show a certain proportional relation which is a common observation in information retrieval, the more similar meta-models are, the more matches can be found.

there are two execeptions, BibTeX -DockBook and XSTL -Xquery.


Third, simple types are related to the .nal value of a computation.

privileges are related to the dynamic extent of an expression as it produces a .nal value.


Unfortunately, PERFECT-CLUB uses (outdated) small datasets, which, in the cases of flo52, arc2d, dyfesm, and ocean results in loop granularities in the range of tens of microseconds, which are simply too small to amortize the thread-spawning overhead.

extended datasets would likely enable scalable speedups on all four benchmarks; for example arti.cially increasing granularity by compiling under option O0 results in speedups: 2.6x, 2.1x, 2.2x and 1.6x, respectively.


Therefore, the following constraint should also be satis.ed: X i× .i = 32. i=1,2,4,8,16,32 The .i values determined from these constraints give us the .nal memory con.guration.

this does not solve the entire problem since we also need to explain how this .nal con.guration will be used by each loop nest in the application.


Source Program, its Guarded Actions and the Dependency Graph = true = true = true = true = true guarded actions, there is still more room for optimization: the paradigm of perfect synchrony demands that unique values have to be determined for all variables (in particular also for all local variables) in each step.

some of these values may not be needed to compute the .nal outputs.


This allows specialization to have an opportunistic nature: it injects specialized code, in the form of specialized class instantiations and specialized method calls (§2.3), but the injected entities are always compatible with the homogeneous translation (§2.4).

the interaction with separate compilation leads to certain limitations that miniboxing addresses (§2.5).


In the .gure, wi1, ..., wik are the k workers of Pi (1 = i = m), the solid lines represent the scheduling with the time-sharing scheme and the dashed lines represent the scheduling with the space-sharing scheme.

neither time-sharing nor space-sharing can e.ectively balance the performance of the co-running work-stealing programs.


Traits offer an alternative to multiple inheritance and promote the reuse of methods between unrelated classes [2].

the Squeak IDE did not properly support traits and a development process taking use of traits.


2.4 Service Discovery Service discovery allows services to be discovered and accessed when they become available, permitting the creation of robust ubiquitous and pervasive applications.

the e.ciency of the search mechanism is strongly connected to static network information such as network topology, as well as dynamic characteristics like network latency or centralized server availability and responsiveness.


Similar studies can be carried out for implementations (component sets) as well.

the central notion of implementability does not yet have a satisfactory de.nition and has a number of open issues (pointed out in the later part of this section).


Although the requiring aid/no aid division is rather abstract and not-fine grained, more detailed divisions have been discussed using Level of Automation (LoA) taxonomies (for an overview see [7]).

the self-directedness relates to the set of actions that are permitted or obligatory.


Introduction Programs written in high-level languages are frequently praised for expressiveness and independence from hardware details.

this comes at a price: hiding low-level details from the programmer means that language implementations are responsible for obtaining a good performance.


While collusion can hasten reaching a steady-state, it may also result in a non-optimal resource allocation.

collusion which involves bidding with non-truthful unit prices is risky if bidders can join or leave and bids can change.


SIMD parallelisation cannot be applied to this program due to a loop-carried data dependence in its loop body.

the sequential version for the ADSP-21160 can be improved by arrayi.cation, delinearisation and scalarisation and speeded up to a factor of 1.14.


Our experiments with a traditional layered approach [5] combined with a hybrid of the mediator and observer design patterns [15] yielded significant leverage.

main- taining a high level of integration and performance while maintaining a decoupling of services from modeled entities and from each other required additional architectural con- straints and mechanisms.


However, it can be transformed to topologies with these properties by removing and redirecting certain graph edges.

to transform this topology to a CS4 DAG without adding or removing nodes, we remove edge ad and add a directed edge from c to d. All messages passed from a to d directly in the original topology would then be routed via node c. if we are limited to using only SP-DAGs, besides removing ad and adding cd, we would also need to remove edge bd and route messages from b to d via node c, as Figure 5 shows.


Use of wildcard types may increase the precision our results, as they represent a closer and more appropriate least upper bound than a raw type in many situations.

the methods of Cell that reference a type variable from both their parameter and result types belong to neither wildcard type, because Cell(3T.


We cannot do a First X comparison for these subjects, since the sample necessarily includes both subjects with a correct first X followed by other errors, and subjects with an incorrect first X.

the data for the last test are shown in Table 4.


Integrating Tangaza s users and groups with a more feature-rich tool designed for advanced phones and networks might also be challenging.

we believe that the potential exists for economic bene.t from group communication, but only if this capability is widely available.


In this situation the improvement margin for IODC is slim.

we still see considerably high improvement in all cases and these improvements shall be attributed to the I/O aggregation by the .le caching.


Our statements regarding a semantical vs. a trAnzformational approach do not mean to damn program tran~forn~tion as a me~=m to enable or to support MCI.

a proper semantics of MCI provides the right level of abstraction to rea~u about MCI not just for programming, but also for transformation, e.g., if the cor-rectness of transformations needs to be ar~essed.


Figures 5 and 6 show that at loads lower than 90% the VM transfer bandwidth and virtualization penalty have little or no impact on the resource under-allocation, since their effect is negligible compared to the other virtualization parameters and can be easily hidden by the proactive (prediction-based) resource allocation.

at relative load values higher than 90%, the under-allocation exhibits irregular behaviour.


A possible explanation is that Bach is a much more challenging piece, for which expert players perform more accurately than less experienced players.

dun-combe is less challenging, which means that even less experi-enced players are able to play relatively accurately.


As in Vespucci, we referred to conceptual building blocks as ensembles.

the speci.cation of architectural constraints has been completely revised for Vespucci.


This shows that the association relationship is important in class diagrams.

we found this result not really accurate since the respondents only gave the answer within the examples given in the question.


Note that this programming pattern works well with respect to symmetric sum: if in all summed traits we have a method that we want to exclude, then this pattern will exclude simultaneously all upper method versions.

we do not exclude the method for real, we just make unavoidable the upper implementation by overriding it, therefore Java introspection can still detect the excluded method: C.class.getMethod( m ) still gets an answer.


The above techniques address bottleneck identi.cation and forecasting whether certain resource usage and/or application metrics would lead to SLA violations.

they do not address how much SLA violation would be incurred or how resources should be allocated to prevent future violation.


In objectoriented programming languages, one such adaptation is the use of threads to handle concurrency.

di.erent programming styles of threads would make the software more nondeterministic than deterministic [7].


Our technique can be re.ned with more precise models; after all, our formulas give us only estimates, not exact numbers.

we emphasize that our algorithms are very ecient.


When an activity does not have an entry point, its active collaboration starts execution from the initial state.


This is partly a result of lacking mechanisms and interfaces to carry out the interaction between different clients in real time and partly because it is just impossible.

desktop applications have multiple means for communication; they may share files or communicate directly via various messaging protocols, whose features vary considerably.


Alternatively, we could have overwritten the built-in functions to return proxies for new objects.

this alternative was rejected, because our implementation is a pure JavaScript library and makes itself use of the built-in types, so we would have to ensure that the original functions are still accessible to us.


Prior research has concentrated on stand-alone STM systems with a non-blocking design which imposes a significant overhead.

the McRT-STM avoids a non-blocking design but instead leverages the McRT cooperative scheduler to prevent an inactive transaction from blocking running transactions.


5.3 Ambiguous selector speci.cations The existence of exclusion operators and dependencies in the selector language leads to another problem: we prefer superimposition speci.cations and selectors to be declarative; their speci.cation should not imply any ordering of superimposition.

di.erent orders of evaluating the selectors and executing the superimposition of annotations do exist.


By using original pages for all data accesses, it makes sure data that are instrumented by mistake do not break the program.

bIRD uses extra memory region for instrumentation code only and does not clone the code pages.


With the introduction of generic address spaces the ability to up cast to generic address space is built into the type system by default.


Also, the completion-productivity model, discussed above, appears to align with this cultural model.

the above example also appears to expose an alternative con.icting model that is opposing the always-say-yes model.


such protocols are frequently useful in a large class of applications such as the coalition formation, the e-trading, etc.


The tool support offered by each approach may also in.uence the results.

by allowing the expert testers to use the best possible practices any tools that were available have been used.


When an overwritten pointer in the Barrier Register needs to be processed, it .ows through the DEMUX which routes it through MUX 1 if it is a local pointer.

if it is a foreign pointer, we enqueue it in the Foreign Barrier Queue.


This approach is applicable to achieving .ow control by coupling TCP and .xed-bu.ers without causing deadlocks.

current algorithms do not account for heterogeneous widearea networks.


RELATED WORK For the best of our knowledge, Carbon is the .rst attempt to build a server building framework that lets users build a custom server by choosing features from SOA and the .rst attempt to de.ne a kernel for the SOA platform.

there are many related works in the areas of J2EE, SOA, and component based Software Engineering.


On the one hand, the evaluator sheet was checked to confirm whether both participant and evaluator stated the UOS was correctly completed.

the user log was also analysed to check whether the participant accessed all the information required to complete the UOS.


introduce the CIT (combinatorial interaction testing) approach to select a subset of con.gurations of a highly con.gurable system [4].

both approaches do not describe how combinatorial testing may be applied to SPLs or a corresponding SPL representation such as feature models.


The design of the composite breakpoint in BPL is greatly inspired by Tracematch.


Modular structures are preferred because inter-dependency among components is minimized resulting in a num-ber of benefits such as improved quality, maintainability and modifiability.

modular designs can render those bene-fits when two conditions are met: a priori knowledge of all the requirements so design decisions can be allocated to modules and those modules interact through stable and well known interfaces.


Therefore, our technique is neither sound (spurious invariants may be reported) nor complete (we may miss invariants.)

forallthegivendata structures,we wereabletogetgood results.


ADL Code The use of XML in ADLs has the clear advantage of its widespread adoption for information interchange and tool support.

xML is not as precise in its description of properties and behaviors as other notations (e.g., Z), so have supplemented the XML based ADL with more formal notations.


Further, objects are of su.cient size that it becomes reasonable to attach sharing policies to individual objects.

ob jects alone are not enough to build a .lesystem.


For many applications, such asbatch applications, an increase in application pause times may notbe signi.cant, particularly if it results in a corresponding increasein performance, such as those described in the previous section.

minimizing application pauses is important for applications with hard or soft real-time constraints, as well as for interactive applications.


5.4 Social Engineering Attacks Split-trust browsing requires users to understand a simple principle: trust your personal device, not the PC.

attackers may conspire to make users doubt this principle causing them (say) to unwittingly confirm a security-sensitive operation via their trusted personal device.


The worst case time complexity of the algorithm is, thus, |C|O(n 2), where C is the set of changed types and n is the number of nodes in the IRG for P (i.e., the number of classes and interfaces in the program).

this complexity corresponds to the degenerate case of programs with n types and an inheritance tree of depth O(n).


Each partial query will be processed as a simple query without join.

there may be cases that one partial query matches the target schema pretty well while another partial query matches badly.


In ASDF 2 we extended defsystem with a :defsystem-depends-on argument so developers may declare dependencies required in order to process the system de.nition.

:defsystem-depends-on hasn t been widely adopted yet, and interacts poorly with previous conventions whereby symbols in extension packages were to be used in the defsystem form.


Furthermore, various tools [23, 8, 1, 14] attempt to augment developers knowledge of the project through visualizing or other ways of helping .nd the information developers might seek.

the understanding of how developers learn is in its infancy, therefore we will see a plethora of new ways to speed-up developers learning and further understanding of how humans learn.


The Android operating system basically protects its inner system memory area against the reckless access from the outside, so it prevents app from being copied and maintains the transparency of its inner system.

users can use Rooting [2], a method Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page.


In most real deployment of recommendation system, at most 3 products are presented.

table 2: Product Page Case: 310,106 possible hits Table 4: Checkout Page Case: 106,263 possible hits method top-1 top-3 top-6 Manual 34,657 46,795 46,795 Item 17,296 33,590 46,672 Feature 11,072 26,201 38,965 Item+Feature 21,490 40,706 58,202 Item+Feature+Manual 43,185 72,634 90,029 method top-1 top-3 top-6 Manual 6,895 9,696 10,026 Item 3,821 6,716 9,573 Feature 2,568 5,384 7,496 Item+Feature 3,727 6,941 10,434 Item+Feature+Manual 7,383 12,949 17,174 Table 3: Product Page Case on Test Baskets with New Products: 239,905 possible hits method top-1 top-3 top-6 Manual 28,846 39,288 39,288 Item 7,149 14,791 21,568 Feature 7,092 16,072 24,654 Item+Feature 11,342 22,552 33,465 Item+Feature+Manual 33,160 54,326 65,164 some of the recommended products might be out of stock and it might require more recommended products.


One of the themes to emerge in recent work (e.g., see [14, 7, 5]) is that maintaining just the right correlation required between analysis facts can be the key to ef.cient and precise veri.cation: maintaining no correlations (independent attribute analysis) can lead to imprecision, while maintaining all correlations (relational analysis) can lead to inef.ciency.

.nding this intermediate ground can be hard for heap analyses that, e.g., use graph-based representations of the heap.


Other methods calls are simply ignored and, thus, can occur in any order and interleaved with the method calls of interest.

method calls that appear in the behavioral pattern must occur exactly in the order speci.ed.


The NFR approach [8] (supported with the NFR-Assistant tool [17]) acknowledges the broad influence of non-functional requirements on the other requirements by providing positive or negative contributions.

this tool, and approach, assist neither with automation of concern identification nor with requirements structuring from arbitrary textual input.


The inclusion of a new meta-model element does not have impact on existing models.

the update or exclusion of a meta-model element breaks the consistency between meta-models, transformation specifications and all corresponding SPLP and product models.


Leon Sterling Department of Computer Science and Software Engineering, The University of Melbourne Victoria, 3010, Australia leon@cs.mu.oz.au organization as meta-models [2].

these attempts did not discuss nor address issues related to intelligent adaptive systems in open environments.


Although this 1/E factor is large enough to make it worthwhile designing solutions for value monitoring problems, the techniques and approaches that have been used for value monitoring and threshold monitoring are quite similar.

there are some other monitoring tasks which do not .t either the threshold monitoring or value monitoring paradigms, and instead require us to track the members of a set (set monitoring).


Having two different implementations for an abstraction is possible in ML, Ada, or Module-2.

the two different parts of the program cannot interoperate.


It seems that our results contradict those presented in [10].

note that the stability can be calculated only for those methods that change at least once in their lifetime.


Technically, this allows an in.nite number of ways to reach a Bus object from a BusRoute object; by going through one, two, three, or any other number of BusList objects, whereas previously there was only one way to do so.

(a) Bus Route with Many Buses (b) Smoothed Traversal Graph Figure 7: Bus Route with Many Buses we observe that a Person object remains accessible only in the context of either a Driver object or a Passengers object and that both Driver and Passengers objects are only accessible in the context of a BusRoute object.


Let us consider the application of update command U, which expresses an update to element E at model M1.

before the command is applied, another developer has moved E to another model M2.


It is easy to see that a bigger value of N increases likelihood of selection of abstract elements that minimize penalty, and hence may result in faster convergence.

a smaller value of N mayalso result infaster convergence in two ways: (a) by decreasing the time required to get out of local minima (if the algorithm ever gets stuck there), (b) by increasing the gradient of change.


Because no partial failure can occur when invoking insourced components, one can safely remove all the code that handles network-related exceptions.

to emulate the fault isolation provided by the execution in a separate address space can be non-trivial.


For example, saying the number of Patrons must equal 3 means that proactive modeling can automatically ensure the number of patrons is always 3 since 3 does not change.

saying that the number of patrons must equal the number of books means that proactive modeling needs modeler intervention because the number of patrons and books can be modi.ed.


Two XML parser creation API implementations.

figure 12(b) shows the Subversion counterpart svn xml make parser.


The FU utilization is very low, only 5% for list scheduling and 12.5% for modulo scheduling.

by exploiting DLP using the proposed mapping method, tions.


These diagnostic logs can be freely deleted without a.ecting the correctness of the system.

we try to keep these logs around as far as space permits.


MR(s), would suf.ce as a summary, and that this is the way in which traditional summarization-based decision procedures have de.ned summaries.

for branching-time reasoning, such a simple de.nition is not enough.


Forward Error Correction and Backward Error Correction are almost a form of redundancy, allowing either retransmission or correction of transmitted data.

these approaches are narrow and concern themselves primarily with data in motion they do not account for bad data derived from the source.


Both instructions rely on the TCG loadtime attestation property to guarantee that the SK or the VMM is uncompromised at start-up.

due to the vulnerability of the SHA-1 hash function, the TCG load-time attestation property is compromised as we describe in Section 1.


base-eval (lambda (e r) (write e) (newline) (old-eval e r))) 1-4: base-eval 1-5> After going back to the baselevel, a trace is displayed as expected.


being proven assuming an unfair daemon, its stabilization time in steps is .nite.

the step complexity of its stabilization time was, until now, left as an open question.


Fine affords maximum .exibility, since individual transactions can vary their behavior without branching.

it incurs TLS overhead to locate function pointers.


In our prototype implementation, we focused on the MySQL library because of its popularity.

if the target application uses a different database, our technique can be easily adapted to address a different set of primitives.


Figure 11(c) shows the code after all a and b are substituted with c and d, respectively.

if the recursive call uses the same parameters of the procedure as its arguments as in Figure 1, the binding assignments can be eliminated.


ContextL [3] is based on Common Lisp, which provides lexical closures.

in contrast to ContextJ*, an invocation of proceed2 is not the continuation of a search, due to the semantics of generic functions in the Common Lisp Object System (CLOS, [1]), on which ContextL is based.


An ontology can promote common understanding among developers, and can be used as a domain model.

one of the major drawbacks to a wider use of ontologies in Software Engineering is the lack of approaches to insert ontologies in a more conventional software development process.


In contrast, parallel programming using coarse-grained locking is straightforward.

it cannot match the concurrency and scalability of its .ne-grained counterpart.


Our new construct is similar to previously proposed constructs for dynamic type generation [21, 29, 22].

we do not require explicit term-level type coercions to witness the isomorphism between an abstract type name a and its representation t .


Indoor positioning using beacons such as WiFi, RFID, IR and ultrasound achieves higher accuracy, but typically requires additional infrastructure investments as well as maintenance efforts.

accuracy of GSM cell positioning depends on the density of GSM towers [24] and often additional hardware, e.g., a GSM modem, is required for obtaining higher accuracy.


The "gold" version with all faults corrected is taken as producing correct output.

the faulty versions of the Siemens suite programs were produced by hand, "by ten different people, mostly without knowledge of each other's work; their goal was to produce faults that were as realistic as possible" [14].


Thedifferenceis notmerelytheoretical: wehave compared thetwo in detailand whileGunawi sEDP .nds 97% of ourtrue unsaved bugs,italso produces 2.75 times morefalse positives.Furthermore, EDP.nds nooverwrites andjust oneof our true out-of-scopebugs.

eDP runsfaster, producing resultsina matterof seconds.it does not produce detailed diagnostic information; WPDS witness traces (Section 4) offer a level of diagnostic feedbacknot possible with EDP s whole-function-classi.cation approach.


For this reason, the result of line 10 is U.

in case of line 11, the result does not depend on x because the other value is T, therefore | , resp.


As can be seen in the graph, d depends only on c, only b depends on a, and b, c, x and y are mutually dependent upon (completely interconnected with) each other and, hence form a Mutual-Dependence Cluster (De.nition 2).

this (noncoherent) cluster includes statements that have different in.uences and are in.uenced by different statements.


For conditional branch and direct jump instructions, whose branch targets are fixed, code block chaining [7] technique can significantly eliminate the overhead of transferring between code blocks.

for Indirect Branch (IB) instructions, whose branch target cannot be determined until run-time, DBT system must perform an address translation from Source binary Program Counter (SPC) address to Translated Program Counter (TPC) address at every execution.


For this reason, privacy protection for continuous, long running queries is harder to provide adversaries can build up knowledge of a user s location over time.

adversaries monitoring continuous queries can also re.ne their knowledge of an individual s location by examining the spatial and temporal relationships embedded in information about movement over time.


Currently, the images are delivered in no particular order.

higher resolution images or more frequent acquisition would require a smarter scheme.


These principles work well for many cases as a large number of the allocated resources are set to form immutable containment tree that guarantees proper (albeit not timely) disposal.

the treatment of shared resources such as Color, Fonts, and Images, is more complicated and error prone.


In general, an important decision on software architecture is made at the design phase and a decision on the detailed program structure concerning API usages, variables, and methods is made at the coding phase.

this distinction is relative and vague in many cases.


In some of the runs of CLH2, BLENDER exhausted the available memory, and thus we do not report the state-space size.

in both those cases an (abstract) counter-example was found before BLENDER ran out of memory.


It is not known exactly what impact this initiative had or continues to have upon Microsoft s bottom line.

the following quote from Microsoft s director of security assurance at that time indicates the wide spread impact of the initiative upon Microsoft s operating approach We are going to get a lot of testing done.


Within the sessions, the participants developed one scenario using the character of Scrooge, that highlighted some possible functions that Scrooge might want when using a smartcard on public transport particularly, he wanted the system to indicate to him when he should get off in order to avoid traveling into a new charging zone.

at that point we found that the set of characters we had made available in the session was not well matched to the interests and knowledge of this group.


Those applications can also specify their own policies for other uses without con.icting with those set by the BFT library.

the application-implemented client is tied to the service that is using it.


A shape ful.lls the same task as a Java class of expressing the metadata of a storage object.

in contrast to the immutable class pointer, an object s shape .eld can change over time.


[36] introduced a dynamic-compilerdriven control for energy e.ciency.

any of the existing programming extensions have been developed in a cross-layer approach.


The small impact on performance (1,6% to 5%) can be understood as most of the performance requirements are in loops that are already nearly perfect using the aggressive -04 compilation option.

a 2% gain in performance on the EFR is signi.cant considering that, at 17,83 mips6, we are close to the theoretical limit of the mmdsp+ processor for this application (.


Trusted core in theorem provers: Theorem proving systems such as Coq [Bertot and Cast ´  1A security kernel differs from a microkernel in that the latter usually protects OS resources (such as memory or CPU), while the former is mainly concerned with information privacy.

the two terms are sometimes used interchangeably.


In order to explain the critical rationalism, Popper uses a number of examples, mainly from physics.

if human behavior is observed using empirical methods the idea of falsi.cation slightly differs.


Characters gradually become stronger and better equipped by gaining experience points and by accumulating loot from combat.

repeated combat is time-consuming and can become somewhat routine and boring; thus, some players seek to set up scripts (also known Figure 2: A screen shot of the DreamRO bot.


Previously, we showed how this restructuring could be done in the simpler case when the program is a perfectlynested loop nest in which iterations can be executed in any order [11].

many codes of interest such as the triangular solve in Figure 4 are not perfectly-nested and data dependences do not allow executing statements in arbitrary order.


Explicit product references (P10) were not seen as a major issue anymore in the discussed system.

it was found that such references were sometimes enforced due to explicit customer requests.


In this paper, we showed that this need not be the case, as the conceptual architecture remained rather stable.

axelsson focuses on the detailed software architecture, while we focus on a more abstract concept of architecture (conceptual architecture).


Fuzz can successfully verify many useful queries.

it fails when the sensitivity analysis depends on values that are not known statically.


3.1 Guarantee Strict Fairness Existing works of parallel job scheduling pay more attention to performance than fairness.

as mentioned in Section 2.2, HPC users might be more sensitive to fairness than performance [21].


Note that dead code is not a defect like array out of bounds or division by zero.

the maintainability is in.uenced in a negative way since there are redundant blocks used.


For instance, not all atomicity violations have a depth 2, and in fact, three of the bugs reported by prior work as atomicity violations [24] have a depth 1.

our notion of bug depth is more general and can capture concurrency bugs not classi.ed before.


The occurrence of a failure and the execution of one or more workarounds are invisible to the caller component.

in case all workarounds fail, the failure is reported up to the caller component.


We observe that application-level optimizations often have a much bigger impact on performance than on power consumption.

optimizing for performance does not necessarily lead to better power consumption, and vice versa.


In this case we may have several kinds of coefficient values of weight account under enterprise and system environment.

in many cases such as in the examples shown in this paper, our selection method can be used practically without adding a weight account to characteristic vectors.


There is relatively small performance variationbetweendi.erentprefetchingpoliciesfor the concurrent execution of cp, because with anticipatory scheduling,.lesare read without almost anydiskI/O switching even under concurrent execution.

for 2diff5 and 2diff50 with alternating sequential access patterns, competitive prefetching reduces the execution time by 31% and 34% respectively.


The messages passed along the edges in this algorithm are probabilities, or beliefs.

more precisely, the message passed from a codeword node v to a check node c is the probability that v has a certain value given the observed value of this codeword node, and all the values communicated to v in the prior round from check nodes incident to v other than c. the message passed from c to v is the probability that v has a certain value given all the messages passed to c in the previous round from message nodes other than v. Categories and Subject Descriptors E.4 [Coding and Information Theory]: Error control codes; F.2.3 [Theory of Computation]: Analysis of Algorithms and Problem Complexity Tradeo.s between Complexity Measures  General Terms Theory  Keywords error-correcting codes, LDPC codes, expander codes, decoding 1.


Along this line, we have proposed a dedicated notation for modeling such components [5].

a modeling notation is not su.cient to achieve modularity in the design of energy-aware software.


FST can suffer from occasional loss of utilization because of head-of-line blocking in the put queue.

this blocking can only be of duration x/rmin, where x is the maximal put size, so the loss of utilization is quite small.


Clearly this does not prevent the reads from executing concurrently.

the .rst write to v permanently removes readers lock from C(v).


A common feature of our work and the study of the traceroute technique [1, 21] is that both e.orts require an evaluation of sampling techniques without complete knowledge of the true nature of the underlying connectivity structure.

exploring the router topology and P2P topologies di.er in their basic operations for graphexploration.


Another successor to Fran, FranTk [16], provided functionality equivalent to that of Yampa s dpSwitch via what it referred to as Behavioral collections .

franTk depended crucially on an extended IO monad (the GUI monad) for adding or removing behaviors from behavioral collections.


a bug in that release slowed down the compilations quite a lot, so we re-measured the compilation times with the just released GNAT 5.01a.


Our approach is complementary to this one, as instead of writing a resolution strategy, one can implement a derivative feature to resolve the interaction.

the originiality of our approach is to consider that multiple resolution rules (in this case, derivatives) can simultaneously exist, with regard to the intention of the user.


7 where the vulnerable period of variable y[2] has been significantly increased.

the original code rel oads y[2], thus reducing the vulnerable period.


In a component-based system, it is desirable that all constitutional components only show their normal behaviors.

certain abnormal behaviors exist when some unexpected condition occurs.


issues are welldiscussedbeforeimplementation,informationneeds are quickly addressed, and developers are in sync with each others activities.

in the real world, communication amongst developers maybe sporadic,i.e., sometimes theytalkintenselybetween themselves; at others, seldom.


6.2 API examples All API commands are asynchronous, and return immediately if the NOWAIT option is given.

modules can use the API in a more straightforward fashion, by not using the NOWAIT option; in this case, they will not be able to show any progress report, and will not be able to suspend, resume and stop a running API command.


To hide its fraudulent behavior in time-sharing the CPU among multiple jobs, we assume the fraudulent resource provider will alter the operating system CPU usage utility system calls to prevent a submitted job from getting correct CPU usage statistics.

we assume that the host provides an accurate wall clock time facility, as spoo.ng the wall clock can be easily detected by comparing it with the submitter s wall clock.


In other words, the sum is ~dn=l (maxl<i<m Wd ] " Intuitively speaking, if the actions are quite similar, then they will have corresponding points that are close by on the hypersphere thus allowing the orthotope containing them to have small dimensions.

if the actions are quite different, then they will have corresponding points that are spread apart on the hypersphere thus forcing the ortho- tope dimensions to be large.


The advantage of embedding small .le data is to reduce random disk reads for lookup operations like getattr and read for small .les, (i.e., when the users working set cannot be fully cached in memory).

this brings additional overhead during LSM Tree s compaction since embedding small .les increases the data volume processed by each compaction.


That record will be removed only after processing the corresponding reply simulation events from all those cache servers, which is done for allowing an optimized execution .ow for those reply events.

the operation is unlocked (and a reply event is scheduled towards the corresponding client) upon the .rst copy of the data becomes available from whichever cache server, hence after processing the .rst simulation event associated with a read-reply.


ML modules can contain both types and values (including functions), and thus provide a direct representation for associated types [31].

an ML module is an entity by itself, distinct from a type; thus, types cannot be directly associated with other types.


ALIAS VERSIONING FOR JAVA Our compiler infrastructure (more specifically, the Toronto Portable Optimizer, as described in Section 5) employs context-sensitive in- terprocedural pointer analysis [11, 14, 25] for Fortran 90 and C to develop more precise alias information.

this interproce- dural analysis is not currently available for Java because of difficul- ties associated with handling the dynamic features of the language and ensuring binary compatibility of the generated code.


Therefore, there is a strong demand to formally verify the correctness of systems with some program veri.cation tools such as UP-PAAL and Maude [4, 5].

in manysystems, the components are physically distributed and interact asynchronously, due to the lack of a common clock.


Potential e-Health solutions may be focused on the alleviation of everyday life by means of remote monitoring and notification in case of emergency in order to enhance their safety sense and to promote their chances of independent living.

several issues have to be confronted in order to provide senior citizens greater support towards their independent living.


Representing an architecture as an arbitrary graph of generic components and connectors has the advantage of being extremely general and open ended.

in practice there are a number of benefits to constraining the design space for architectures by associating a style with the architecture.


The QThreadGroup class implements a simple admission control policy: the aggregate bandwidth allotment of all child threads of a QThreadGroup must not exceed the allotment to the QThreadGroup itself.

as we do not wish to impose any resource management policies on user applications, the use of this facility is optional.


designed a simulator based on Xen s migration algorithm to characterize the downtime and total migration time [7].

their simulation model relies on dynamic information like hotspot sizes collected in pre-copying iterations, it is hard to use for a prior migration decision before the migration begins.


The utilization criterion is not a necessary condition for schedulability.

if P is generated from a Giotto program without redundant (i.e., unreachable) modes, then the utilization criterion is both suf.cient and necessary for time-based schedulability [4].


With this choice ofpricefunction, U(c)is alinear combination ofconcavefunctions andisthus concave.

because Rm(cm)isthe minimum min-cutofthe overlaygraph Dm withlink ratesbeing cm, U(c)is notadifferentiablefunction[10].


Concurrent libraries help programmers exploit parallel hardware by providing scalable concurrent operations with the illusion that each operation is executed atomically.

client code often needs to compose atomic operations in such a way that the resulting composite operation is also atomic while preserving scalability.


The .rst system only uses performance counter outputs as a hint to start traditional race detection; the second system still relies on software instrumentation to collect synchronization information.

pBI completely relies on performance counters to collect all the needed programproperty information for failure diagnosis.


This requires knowledge of the internal structure of the program and is very time consuming.

we can automatically test or check the validity of the pages based on the context-free grammar obtained by our analyzer.


We .nd this approach more .exible and free-form.

if the code follows speci.c conventions, listed in the next section, an auxiliary visualization module can produce a diagram of it.


This leads to spilling variables a, c and e with a spill cost of 4.

if we choose c and f, at the next step the maximum weighted stable of the graph, shown in black nodes and edges in Figure 3(b), will be {b, d} of weight 7.


Speci.cally, they propose a multi-phase data reordering and a graph-based register allocation for array-based DSP codes.

they do not discuss how their data reordering technique could be implemented within an optimizing compiler.


MAT L A B programmers appreciate the high-level matrix operators, the fact that variables and types do not need to be declared, the large number of library and builtin functions available, and the interactive style of program development available through the IDE and the interpreter-style read-eval-print loop.

even though MAT L A B programmers appreciate all of the features that enable rapid prototyping, their computations are often quite compute intensive and could bene.t from a system more suited to high performance computing.


Most of the participants rated the tool as clearly structured and the functionality as self-explanatory.

they encountered problems when they attempted to start the composition process.


Although the organization explicitly chose to follow a codi.cation strategy, there is apparently an implicit undertone that personalization is very important as well.

vCC has never explicitly chosen to follow (or reject) a personalization strategy.


Q (mA-min) sys be safer to choose IF = 400mA and Bmax = 200mA-hr with very small size/weight penalty.

if the average load current is different, the best system con.guration is likely to be different.


Applications that can use simple analysable .xed-priority scheduling can be implemented at Level 1.

level 2 also targets .xed-priority scheduling, so this cannot be used to decide whether to use Level 1 or Level 2.


Even with this large number of users which compete for the available resources, CZF-SESAM shows some inherent fairness or at least reduces the unfairness compared to dynamic OFDMA: Almost all users are served and most of them get higher capacities than with static OFDMA.


For example, m »= return and m are different expressions.

we cannot observe this difference by viewing m »= return and m. Hence, the identity element is an identity element up to observation.


The CPU performance is relatively stable for both BH and BH-U (the di.erence in time per item for the two versions is due to the improved locality with BH), and not a.ected by increasing chunk size.

for BH-U on the GPU, Gr increases sharply from 512 to 1024 and is relatively stable for larger values.


As well as being closed under composition, Grimm s system is scannerless and supports non-declarative speci.cations for fringe cases such as the C typename/identi.er ambiguity.

pEGs come with drawbacks: (1) Packrat parsers are character-level backtracking LL(1) parsers, and while they run in linear time, like any LL(1) parser they are unable to parse any left-recursive grammar without special modi.cations; (2) a context-free grammar extension connects itself to the host by inserting new productions; analogically a PEG extension must connect itself by inserting new ordered choices.


Performing such a global optimization would be pos sible through a central node (such as the base station) col-n at time t, Ln(t), we compute ln , and dis = .t lecting load and charge rates from every node and computing the optimal assignment centrally, then informing all nodes of their states.

in large networks, this approach would induce large communication overheads, reducing energy e.ciency.


The work presented in [2,9] details several algorithms for selecting diverse recommendation alternatives based on the similarity of individual attributes.

this work is based on measures such as Euclidean distance or hamming distance calculated for pairs of attribute values.


For this reason, .gures for XP s virtual device drivers are not presented.

as with Linux, we expect these drivers to be small and simple due to the idealized hardware abstraction presented by Xen.


If an evaluation approach identi.es an accessibility problem in a webpage, however the webpage does not present any accessibility error in its implementation, then we count an incorrect assertion for that tool.

if an evaluation approach does not identi.es any accessibility error in the webpage, and the webpage does not contain any accessibility error in its implementation, then we count a correct assertion for the approach.


The reason for this is that authors that are in favor of dynamically typed languages often argue in the following way: type casts are constructs that are enforced by a static type system.

type casts are only necessary in order to satisfy the type system -in fact they to not contribute to the application s semantics and in that way they are only pieces of code which unnecessarily increase the software s complexity.


In current Java VMs, dynamic changes are known as hotswapping and they are restricted to swapping method bodies only.

in object-oriented languages, class member declarations and subtype relationships are important parts of a program s behavior.


Communities that discuss topics related to architecturalknowledgebut neverusethatphraseitself areperde.nition not included in our analysis.

given our goal to investigate current de.nitions of architectural knowledge we do not see the exclusion of communities that do not use the literal phrase let alone de.ne it as a shortcoming.


Since the latter is full, the sender thread will hang on a semaphore, waiting for an empty slot in broadcast.

the only way a slot in broadcast can be emptied is for the delay thread to move a packet to output, which is still full.


Translating Simulink models into formal language is possible for small models.

this becomes difficult and very costly, if the size of the models is increasing.


Different from the above stages, in Stage 4, hot data can be allocated to blocks in both the old and new pools.

blocks in the new pool are only used when there are no free blocks in the old pool.


Opinion polls in our sense encompass the aspect of continuous feedback in agile development approaches.

opinion polls are a systematic extension to agile reviews and retrospectives that can also help to prepare and follow-up on these meetings (e.g.


Although doubly-generic map is partial for sums, many doubly-generic operations are not.

most generic functions are partial for function types, so we do not include a code for them.


At the moment of 3bp2 1 being executed, the shadow variable in the current calling context, which is referred to as Sbp1(1), contains the depended predicate instance 11 .

our experience shows that in practice it is very hard to manipulate the stack pointers for certain functions, especially when those functions are from libraries that may be compiled using various compilers or even written by hands.


A traversal over the basic blocks using theSSAgraphissuf.cienttoexecutethe associated semantic rules in order to emit the code.

this approach [7] is not able to deal with complex instruction patterns that have multiple results, i.e.,patternsthat cannotbeexpressedin termsoftreeshapeproductions.


Following this algorithm UserA is allowed to perform TaskX since Manager has the highest priority.

if Novice had a higher priority than All-Roles , then UserA would have been denied access to TaskX hence disabling its CUI as indicated by the concrete operation.


This treatment provides generalizable tools that can be applied to many different modelling notations, and is particularly suited to early stages of development, when models may have loose or unde.ned semantics.

recent work on behavioural models has concentrated on establishing semantic relationships between models.


Switching back to an unmanaged language such as C++ appears to be a reasonable choice.

our experience with many Big Data applications (such as Hive, Pig, Jaql, Giraph, or Mahout) suggests that a Big Data application often exhibits clear distinction between a control path and a data path.


For this reason we included the sequential benchmark which shows more reasonable running times.

meta-repa still outperforms repa by almost a factor of four due to the use of Push arrays, as explained in section 4.1.


When block cleaning is invoked periodically, the benchmark execution time may be maintained at a minimum.

the problem with this approach is that periodic cleaning itself incurs overhead, and the issue becomes whether this overhead can be hidden from the user or not.


This immediate consequence operator captures the information concerning possible compositions obtained by the union of signatures and rules, and the corresponding semantics is directly compositional by construction with respect to the union operation of program modules.

in order to obtain the complementary property of compositionality, the so-called full abstraction property, the adequacyof this semantics must be established with respect to the deletion operation of a signature in a program module, used to delete a whole set of program rules de.ninga function.We de.nea compositional and fully abstract semantics for the reduced set of operations on program modules de.ned in Section 3, union and deletion, that are suf.cient to express the most extended ways of composing modules and their relationships.


We do not see the double-saturation curves as in the case of Sierra, because the compute nodes on Blue Gene/Q systems have a crossbar switch that connects all cores to all of memory, so there are no NUMA e.ects.

there are some interesting points where trends change signi.cantly.


All of these algorithms can obtain satisfactory results when certain conditions are met.

there exist side effects in test-suite reduction.


While this approach could be applied to a dynamically scheduled machine, it is more likely that a comparison instruction would be scheduled in parallel with other instructions, reducing the bene.ts that might be obtained.

this work is ideally suited for many statically scheduled embedded systems, as we are removing many comparison instructions from the critical path.


The former strategy will address the immediately perceived expansion opportunity at a relatively lower immediate cost.

the latter strategy implies a higher software-development cost for building a certain design .exibility in the software application, which can be exploited in the future to support further, as yet unforeseen, expansions.


4.2 Study Constraints The use of the GoF patterns could be pointed out as a constraint in our experimental evaluation.

we have focused first on this pattern catalogue for two main reasons.


Notice that for Speclnt2000 the reduction is minimal because they are mostly huge programs with very small loops.

for the BenchSuite, the binary size reduction is very significant; 30% on average and 67.5% for the best case.


tion with manual inspection, to categorize data transformation operations.

blended escape analysis is a combined static and dynamic analysis which extracts semantic data about object usage in a framework-based application to help explain performance dif.culties.


On the other hand, less work is done by distributed resources in the last case.

transaction is managed by the AP server.


The first step to further assist engineers in understanding code changes is to gain good knowledge of engineers current practice.

no systematic study has ever been conducted to this end, and little empirical knowledge has ever been provided.