3 search results - page 1 / 1 » Extending Separation Logic with Fixpoints and Postponed Subs... |
AMAST
2004
Springer
13 years 10 months ago
2004
Springer
ENTCS
2007
13 years 4 months ago
2007
We present a syntactic scheme for translating future-time LTL bounded model checking problems into propositional satisfiability problems. The scheme is similar in principle to th...
MPC
2010
Springer
13 years 6 months ago
2010
Springer
ion of Object Graphs in Program Verification Yifeng Chen1 and J.W. Sanders2 1 HCST Key Lab at School of EECS, Peking University, China. 2 UNU-IIST, Macao. A set-theoretic formalism...