Sciweavers

756 search results - page 144 / 152
» Can Abstract State Machines Be Useful in Language Theory
Sort
View
SPAA
2009
ACM
14 years 8 months ago
A lightweight in-place implementation for software thread-level speculation
Thread-level speculation (TLS) is a technique that allows parts of a sequential program to be executed in parallel. TLS ensures the parallel program's behaviour remains true ...
Cosmin E. Oancea, Alan Mycroft, Tim Harris
CORR
2004
Springer
100views Education» more  CORR 2004»
13 years 8 months ago
On Spatial Conjunction as Second-Order Logic
Abstract. Spatial conjunction is a powerful construct for reasoning about dynamically allocated data structures, as well as concurrent, distributed and mobile computation. While re...
Viktor Kuncak, Martin C. Rinard
SIGSOFT
2007
ACM
14 years 9 months ago
The symmetry of the past and of the future: bi-infinite time in the verification of temporal properties
Model checking techniques have traditionally dealt with temporal logic languages and automata interpreted over -words, i.e., infinite in the future but finite in the past. However...
Matteo Pradella, Angelo Morzenti, Pierluigi San Pi...
CORR
2010
Springer
116views Education» more  CORR 2010»
13 years 8 months ago
Dist-Orc: A Rewriting-based Distributed Implementation of Orc with Formal Analysis
Abstract. Orc is a theory of orchestration of services that allows structured programming of distributed and timed computations. Several formal semantics have been proposed for Orc...
Musab AlTurki, José Meseguer
HYBRID
2005
Springer
14 years 1 months ago
Mode-Automata Based Methodology for Scade
In this paper, we present a new design methodology for synchronous reactive systems, based on a clear separation between control and data flow parts. This methodology allows to fa...
Ouassila Labbani, Jean-Luc Dekeyser, Pierre Boulet