22 search results - page 5 / 5 » Formulas for which Contraction is Admissible |
SIGSOFT
2007
ACM
14 years 6 months ago
2007
ACM
We present an approach for checking code against rich specifications, based on existing work that consists of encoding the program in a relational logic and using a constraint sol...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
We consider an extension of bi-intuitionistic logic with the traditional modalities , , and from tense logic Kt. Proof theoretically, this extension is obtained simply by extendin...