198 search results - page 8 / 40 » Modal Proofs as Distributed Programs (Extended Abstract) |
AMAST
2006
Springer
14 years 9 days ago
2006
Springer
Abstract. When designing an open system, there might be no implementation available for certain components at verification time. For such systems, verification has to be based on a...
POPL
2005
ACM
14 years 8 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...
ICS
2010
Tsinghua U.
14 years 20 days ago
2010
Tsinghua U.
: Perhaps the two most significant theoretical questions about the programming of self-assembling agents are: (1) necessary and sufficient conditions to produce a unique terminal a...
SPIN
2001
Springer
14 years 1 months ago
2001
Springer
Abstract. This paper describes three program transformations that extend the scope of model checkers for Java programs to include distributed programs, i.e., multi-process programs...
LOPSTR
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. Termination of binary CLP programs has recently become an important question in the termination analysis community. The reason for this is due to that a number of approac...