1454 search results - page 18 / 291 » Stateful traits and their formalization |
209
click to vote
ICFEM
2003
Springer
15 years 11 months ago
2003
Springer
Interacting State Machines (ISMs) are used to model reactive systems and to express and verify their properties. They can be seen both as automata exchanging messages simultaneousl...
205
click to vote
FORTE
1994
15 years 7 months ago
1994
Critical safety and liveness properties of a concurrent system can often be proven with the help of a reachability analysis of a finite state model. This type of analysis is usual...
163
click to vote
ACL2
2006
ACM
16 years 18 hour ago
2006
ACM
We describe a new procedure for verifying ACL2 properties about finite state machines (FSMs) using satisfiability (SAT) solving. We present an algorithm for converting ACL2 conj...
148
click to vote
COLING
1992
15 years 7 months ago
1992
A language-independent framework for syntactic finlte-state parsing is discussed. The article presents a framework, a formalism, a compiler and a parser for grammars written in th...
218
click to vote
DAC
1994
ACM
15 years 9 months ago
1994
ACM
Regarding nite state machines as Markov chains facilitates the application of probabilistic methods to very large logic synthesis and formal veri cation problems. Recently, we ha...