8 search results - page 1 / 2 » lmcs 2006 |
LMCS
2006
13 years 10 months ago
2006
LMCS
2006
13 years 10 months ago
2006
LMCS
2006
13 years 10 months ago
2006
We show how to give a coherent semantics to programs that are well-specified in a version of separation logic for a language with higher types: idealized algol extended with heaps ...
LMCS
2006
13 years 10 months ago
2006
It is well known that the resolution method (for propositional logic) is complete. However, completeness proofs found in the literature use an argument by contradiction showing tha...
LMCS
2006
13 years 10 months ago
2006
This article establishes that the split decomposition of graphs introduced by Cunnigham, is definable in Monadic Second-Order Logic.This result is actually an instance of a more ge...