44 search results - page 8 / 9 » Verifying liveness for asynchronous programs |
ESOP
2012
Springer
12 years 1 months ago
2012
Springer
Communicating finite state machines (CFSMs) represent processes which communicate by asynchronous exchanges of messages via FIFO channels. Their major impact has been in character...
POPL
2005
ACM
14 years 6 months ago
2005
ACM
on Predicate Abstraction and Fair Termination Andreas Podelski Andrey Rybalchenko Max-Planck-Institut f?ur Informatik Saarbr?ucken, Germany Predicate abstraction is the basis of m...
ICLP
2005
Springer
13 years 11 months ago
2005
Springer
We present a methodology for the modeling of complex program behavior in CLP. In the first part we present an informal description about how to represent a system in CLP. At its ...
LPAR
2001
Springer
13 years 10 months ago
2001
Springer
When it comes to building robot controllers, highlevel programming arises as a feasible alternative to planning. The task then is to verify a high-level program by finding a lega...
EMSOFT
2011
Springer
12 years 5 months ago
2011
Springer
System specifications are often structured as collections of scenarios and use-cases that describe desired and forbidden sequences of events. A recently proposed behavioral progr...