Sciweavers

52 search results - page 1 / 11
» Compositional State Space Generation from Lotos Programs
Sort
View
TACAS
1997
Springer
146views Algorithms» more  TACAS 1997»
15 years 1 months ago
Compositional State Space Generation from Lotos Programs
This paper describes a compositional approach to generate the labeled transition system representing the behavior of a Lotos program by repeatedly alternating composition and reduc...
Jean-Pierre Krimm, Laurent Mounier
78
Voted
CAV
1993
Springer
127views Hardware» more  CAV 1993»
15 years 1 months ago
Symbolic Equivalence Checking
Abstract. We describe the implementation, within ALDEBARAN of an algorithmic method allowing the generation of a minimal labeled transition rom an abstract model ; this minimality ...
Jean-Claude Fernandez, Alain Kerbrat, Laurent Moun...
71
Voted
SIGSOFT
2007
ACM
15 years 10 months ago
State space exploration using feedback constraint generation and Monte-Carlo sampling
The systematic exploration of the space of all the behaviours of a software system forms the basis of numerous approaches to verification. However, existing approaches face many c...
Sriram Sankaranarayanan, Richard M. Chang, Guofei ...
66
Voted
ICDCSW
2000
IEEE
15 years 1 months ago
Compositional Verification of a Third Generation Mobile Communication Protocol
Model-checking has turned out to be an efficient and relatively easy-to-use technique in the verification of formally described programs. However, there is one major drawback in u...
Sari Leppänen, Matti Luukkainen
UPP
2004
Springer
15 years 2 months ago
From Prescriptive Programming of Solid-State Devices to Orchestrated Self-organisation of Informed Matter
Abstract. Achieving real-time response to complex, ambiguous, highbandwidth data is impractical with conventional programming. Only the narrow class of compressible input-output ma...
Klaus-Peter Zauner