245 search results - page 12 / 49 » Efficient Symbolic Model Checking for Process Algebras |
PAMI
2002
14 years 9 months ago
2002
We describe a robust and efficient system for recognizing typeset and handwritten mathematical notation. From a list of symbols with bounding boxes the system analyzes an expressio...
EUROCAST
2007
Springer
15 years 1 months ago
2007
Springer
Most non-trivial applications use some form of input/output (I/O), such as network communication. When model checking such an application, a simple state space exploration scheme i...
CHARME
2001
Springer
15 years 1 months ago
2001
Springer
We consider the formal verification of the cache coherence protocol of the Stanford FLASH multiprocessor for N processors. The proof uses the SMV proof assistant, a proof system ba...
FORMATS
2003
Springer
15 years 2 months ago
2003
Springer
We present a process algebra suitable to the modelling of timed concurrent systems and to their efficient verification through model checking. The algebra is provided with two con...
ENTCS
2008
14 years 9 months ago
2008
Constraint automata have been used as an operational model for component connectors described in the coordination language Reo which specifies the cooperation and communication of...