Showing papers in "Science of Computer Programming in 2006"

TL;DR: This paper covers the foundations for building tools to address concerns such as the automated construction of the automaton for a given component connector, equivalence checking or containment checking of the behavior of two given connectors, and verification of coordination mechanisms.

TL;DR: This paper proposes the use of Versioned Boxes, which keep a history of values, as the basis for language-level memory transactions, which may improve significantly the concurrency on applications which have longer transactions and a high read/write ratio.

TL;DR: A reference model for nested transactions at the level of memory accesses is offered, and possible hardware architecture designs that implement that model are sketched, both closed and open.

TL;DR: This paper describes GXL and shows how GXL is used to provide interoperability of graph-based tools and how it can be used to exchange instance graphs together with their corresponding schema information in a uniform format.

TL;DR: The subtleties of pointcuts and advice for higher-order languages, particularly Scheme are described and resolved by alluding to traditional notions of scope, and programmers can now define both dynamic aspects traditional to AOP and static aspects that can capture common security-control paradigms.

TL;DR: An efficient algorithm for detecting resource anomalies in event streams with either Poisson or long tailed arrival processes is considered and a form of distributed, lazy evaluation is presented which uses a model for human-computer interaction based on two-dimensional time and a geometrically declining memory to yield orders of magnitude improvements in memory requirements.

TL;DR: An operational semantics, type system, and proof of soundness for MiniMAO1 is given, a core aspect-oriented language designed to serve as a core language for studying modular specification and verification in the aspect- oriented paradigm.

TL;DR: It is shown how JCilk's linguistic mechanisms can be used to program the "queens" puzzle and a parallel alpha-beta search and the compiler implements continuations in a novel fashion by introducing goto statements into Java.

TL;DR: It is found that statically-scoped regions and tracked pointers can be combined to build alternative memory-management abstractions, such as reference counted objects and arenas with dynamic lifetimes, and thus provide a flexible basis.

TL;DR: This work believes its work is the first source-level typing scheme for an aspect-based extension of a parametric object-oriented language with aspects and proves progress and preservation properties.

TL;DR: In this paper, the authors explore in-between solutions, neither fully automatic nor fully manual ways to adapt a computationally intensive application to the target architecture, by mimicking complex sequences of transformations useful to optimize real code.

TL;DR: It is shown that breadth-first traversal exploits the difference between the static delimited-control operator shift (ailias S) and the dynamic delimited -control operator control (alias F) which has been repeatedly mentioned in the literature but only illustrated with one-line toy examples.

TL;DR: The theory presented here includes theorems concerning composition of instruction, decomposition of instructions, and the existence of instructions with specified regions.

TL;DR: This article defines the semantics of MinAML, an idealized aspect-oriented programming language, by giving a type-directed translation from a user-friendly external language to a compact, well-defined core language, and proves Preservation and Progress lemmas for the core language and shows that the translation from Min AML source into core is type-preserving.

TL;DR: In this paper, the authors propose a memory architecture that supports objects and garbage collection (GC) with a JavaTM Virtual Machine (JVMTM) to improve the functionality and efficiency of heap memory management.

TL;DR: This paper presents work conducted to date on the development of a voice activated command and control framework specifically for the control of remote devices in a ubiquitous computing environment, and discusses the implementation challenges encountered and their corresponding solutions.

TL;DR: This paper proposes an aspect language, Larissa, and a weaving mechanism, in a core language based on parallel communicating Mealy machines, and explores some cross-cutting concerns tbr parallel programs of reactive systems.

TL;DR: It is suggested that dynamic coupling metrics might be better interpreted in the context of coverage measures, rather than as stand-alone software metrics.

TL;DR: Using MetaOCaml's staging facilities, it is shown how to produce a natural and type-safe implementation of Gaussian Elimination which exposes its design choices at code-generation time, so that these choices can effectively be specialized away, and where the resulting code is quite efficient.

TL;DR: The results show that transactions can be used to support all aspects of Java multithreaded programs, and once Java virtual machine issues have been addressed, the conversion of a lock-based application into transactions is largely straightforward.

TL;DR: This work presents here a formal methodology for the soft adaptation of components presenting mismatching interaction behaviour and the notions of access rights and subservicing are exploited to feature a secure and flexible adaptation of third-party components.

TL;DR: An adaptation methodology relying on extending component interfaces with protocol information which describes their interaction behaviour, and using a high-level notation to express the intended connection between component interfaces is presented.

TL;DR: A performance ontology is proposed together with the system performance analysis technique as an example of framework building for intelligent applications based on semantic web and the construction of performance rules through OWL to automatically infer new performance constraints and QoS knowledge about the system on execution is shown.

TL;DR: The architecture and run-time feedback optimizations performed by the UQDBT system are described, and results obtained in the x86 and SPARC® platforms are provided.

TL;DR: This paper presents a methodology for mapping the generic features of any typical ADL to executable code, and shows how the core concepts of ACME can be mapped to equivalent executable code written in the coordination language Manifold.

TL;DR: It is shown how the existence of a managed enterprise architecture description enables an important set of analyses: risk analyses, architecture analyses, and change management analyses.

TL;DR: A formal proof of the same program in the system Coq, using the recent tactic of the system developed to establish the total correctness of imperative programs, demonstrates the adequacy of theSystem Coq in the process of certifying imperative programs.

TL;DR: In this article, the authors discuss the current resurgence of interest in the Linda coordination language for parallel and distributed programming, and discuss the advantages of using Linda for programming concurrent systems, as well as some problems with the basic Linda approach.

TL;DR: A Cost of Ownership (COO) model is proposed for a CRM system which takes into account not only the initial cost, but also the operation cost, and the opportunity cost due to customer mismanagement over a life-cycle.

TL;DR: In this paper, the composition of invariance specifications in a context of concurrent and reactive systems is explored and two new invariants are defined and shown to have useful compositional properties that the more classic forms do not enjoy.