446 search results - page 31 / 90 » A Theorem Prover for a Computational Logic |
97
Voted
CADE
2012
Springer
13 years 2 days ago
2012
Springer
We propose a word level, bounded model checking (BMC) algorithm based on translation into the effectively propositional fragment (EPR) of firstorder logic. This approach to BMC al...
62
Voted
MFCS
2001
Springer
15 years 2 months ago
2001
Springer
We study different computable versions of Baire’s Category Theorem in computable analysis. Similarly, as in constructive analysis, different logical forms of this theorem lead ...
116
click to vote
LICS
2012
IEEE
13 years 2 days ago
2012
IEEE
—We study the logic of dynamical systems, that is, logics and proof principles for properties of dynamical systems. Dynamical systems are mathematical models describing how the s...
TPHOL
2009
IEEE
15 years 4 months ago
2009
IEEE
A new logic is posited for the widely used HOL theorem prover, as an extension of the existing higher order logic of the HOL4 system. The logic is extended to three levels, adding ...
CADE
2005
Springer
15 years 10 months ago
2005
Springer
We introduce XOR constraints, and show how they enable a theorem prover to reason effectively about security critical subsystems which employ bitwise XOR. Our primary case study is...