18 search results - page 2 / 4 » jar 2008 |
JAR
2008
13 years 5 months ago
2008
Abstract. We propose to combine interactive proof construction with proof automation for a fragment of first-order logic called Coherent Logic (CL). CL allows enough existential qu...
JAR
2008
13 years 5 months ago
2008
We introduce a specification language, Promela-Lite, which captures the essential features of Promela but which, unlike Promela, has a formally defined semantics. We show how we ca...
JAR
2008
13 years 5 months ago
2008
Interactive provers typically use higher-order logic, while automatic provers typically use first-order logic. In order to integrate interactive provers with automatic ones, it is ...
JAR
2008
13 years 5 months ago
2008
This article presents detailed implementations of quantifier elimination for both integer and real linear arithmetic for theorem provers. The underlying algorithms are those by Coo...
JAR
2008
13 years 5 months ago
2008
We analyze three proof strategies commonly used in deductive verification of deterministic sequential programs formalized with operational semantics. The strategies are: (i) stepw...