175 search results - page 9 / 35 » Symbolic Model Checking for Asynchronous Boolean Programs |
APLAS
2005
ACM
14 years 1 months ago
2005
ACM
We describe a sound method for automatically proving Hoare triples for loop-free code in Separation Logic, for certain preconditions and postconditions (symbolic heaps). The method...
LPNMR
2001
Springer
13 years 12 months ago
2001
Springer
In this paper bounded model checking of asynchronous concurrent systems is introduced as a promising application area for answer set programming. As the model of asynchronous syst...
KBSE
2007
IEEE
14 years 1 months ago
2007
IEEE
We describe EUREKA, a symbolic model checker for Linear Programs with arrays, i.e. programs where variables and array elements range over a numeric domain and expressions involve ...
EMSOFT
2008
Springer
13 years 9 months ago
2008
Springer
Runtime property checking (as implemented in tools like Purify or Valgrind) checks whether a program execution satisfies a property. Active property checking extends runtime check...
ICFEM
2004
Springer
14 years 26 days ago
2004
Springer
Iterative abstraction refinement has emerged in the last few years as the leading approach to software model checking. In this context Boolean programs are commonly employed as si...