Sciweavers

ENTCS
2007
158views more  ENTCS 2007»
13 years 4 months ago
Abstraction and Completeness for Real-Time Maude
ion and Completeness for Real-Time Maude Peter Csaba ¨Olveczky a,b and Jos´e Meseguer b a Department of Informatics, University of Oslo b Department of Computer Science, Universi...
Peter Csaba Ölveczky, José Meseguer
ENTCS
2007
128views more  ENTCS 2007»
13 years 4 months ago
Optimisation Validation
We introduce the idea of optimisation validation, which is to formally establish that an instance of an optimising transformation indeed improves with respect to some resource mea...
David Aspinall, Lennart Beringer, Alberto Momiglia...
ENTCS
2007
111views more  ENTCS 2007»
13 years 4 months ago
Compositional State Space Reduction Using Untangled Actions
We propose a compositional technique for efficient verification of networks of parallel processes. It is based on an automatic analysis of LTSs of individual processes (using a f...
Xu Wang, Marta Z. Kwiatkowska
ENTCS
2007
108views more  ENTCS 2007»
13 years 4 months ago
Termination Criteria for DPO Transformations with Injective Matches
Reasoning about graph and model transformation systems is an important means to underpin model-driven software engineering, such as Model-Driven Architecture (MDA) and Model Integ...
Tihamer Levendovszky, Ulrike Prange, Hartmut Ehrig
ENTCS
2007
114views more  ENTCS 2007»
13 years 4 months ago
A Graph Abstract Machine Describing Event Structure Composition
Abstract Machine Describing Event Structure Composition Claudia Faggian and Mauro Piccolo 1 ,2 ,3 Dipartimento di Matematica Pura e Applicata – PPS Universit´a di Padova – Par...
Claudia Faggian, Mauro Piccolo
ENTCS
2007
96views more  ENTCS 2007»
13 years 4 months ago
Synchrony vs Asynchrony in Communication Primitives
We study, from the expressiveness point of view, the impact of synchrony in the communication primitives that arise when combining together some common and useful programming feat...
Daniele Gorla
ENTCS
2007
94views more  ENTCS 2007»
13 years 4 months ago
Matching of Bigraphs
We analyze the matching problem for bigraphs. In particular, we present a sound and complete inductive characterization of matching of binding bigraphs. Our results pave the way f...
Lars Birkedal, Troels Christoffer Damgaard, Arne J...
ENTCS
2007
109views more  ENTCS 2007»
13 years 4 months ago
Symbolic Model Checking for Channel-based Component Connectors
The paper reports on the foundations and experimental results with a model checker for component connectors modelled by networks of channels in the calculus Reo. The specificatio...
Sascha Klüppelholz, Christel Baier
ENTCS
2007
100views more  ENTCS 2007»
13 years 4 months ago
Extensionality of Spatial Observations in Distributed Systems
We discuss the tensions between intensionality and extensionality of spatial observations in distributed systems, showing that there are natural models where extensional observati...
Luís Caires, Hugo Torres Vieira