48 search results - page 7 / 10 » Automated Generation of Analytic Calculi for Logics with Lin... |
TPHOL
2005
IEEE
14 years 28 days ago
2005
IEEE
Using the HOL theorem prover, we proved the correctness of a translation from a subset of Accellera’s property specification language PSL to linear temporal logic LTL. Moreover,...
CADE
2002
Springer
14 years 7 months ago
2002
Springer
Abstract. We investigate the combination of propositional SAT checkers with domain-specific theorem provers as a foundation for bounded model checking over infinite domains. Given ...
DAC
2003
ACM
14 years 8 months ago
2003
ACM
Verification of system designs continues to be a major challenge today. Simulation remains the primary tool for making sure that implementations perform as they should. We present...
ICLP
2005
Springer
14 years 26 days ago
2005
Springer
Our goal is to study the feasibility of porting termination analysis techniques developed for one programming paradigm to another paradigm. In this paper, we show how to adapt ter...
ICLP
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. The many approaches which have been proposed in the literature for proving the correctness of unfold/fold program transformations, consist in associating suitable well-fo...