Sciweavers

52 search results - page 7 / 11
» Abstract State Machine Models for Basic Service-Oriented Arc...
Sort
View
ASM
2004
ASM
14 years 25 days ago
Observations on the Decidability of Transitions
Consider a multiple-agent transition system such that, for some basic types T1, . . . , Tn, the state of any agent can be represented as an element of the Cartesian product T1 ×·...
Yuri Gurevich, Rostislav Yavorskiy
POPL
2000
ACM
13 years 11 months ago
Modular Refinement of Hierarchic Reactive Machines
with existing analysis tools. Modular reasoning principles such as abstraction, compositional refinement, and assume-guarantee reasoning are well understood for architectural hiera...
Rajeev Alur, Radu Grosu
DAC
1997
ACM
13 years 11 months ago
Automatic Generation of Synchronous Test Patterns for Asynchronous Circuits
This paper presents a novel approach for automatic test pattern generation of asynchronous circuits. The techniques used for this purpose assume that the circuit can only be exerc...
Oriol Roig, Jordi Cortadella, Marco A. Peña...
ENTCS
2007
174views more  ENTCS 2007»
13 years 7 months ago
Quantum Patterns and Types for Entanglement and Separability
As a first step toward a notion of quantum data structures, we introduce a typing system for reflecting entanglement and separability. This is presented in the context of classi...
Simon Perdrix
ENTCS
2007
88views more  ENTCS 2007»
13 years 7 months ago
Mothers of Pipelines
We present a method for pipeline verification using SMT solvers. It is based on a non-deterministic “mother pipeline” machine (MOP) that abstracts the instruction set archite...
Sava Krstic, Robert B. Jones, John O'Leary