491 search results - page 60 / 99 » An Interpolating Theorem Prover |
161
Voted
SBMF
2010
Springer
14 years 10 months ago
2010
Springer
A notion of generalized regular expressions for a large class of systems modeled as coalgebras, and an analogue of Kleene's theorem and Kleene algebra, were recently proposed ...
132
Voted
ESOP
2011
Springer
14 years 7 months ago
2011
Springer
Abstract. Nominal Isabelle is a definitional extension of the Isabelle/HOL theorem prover. It provides a proving infrastructure for reasoning about programming language calculi in...
131
Voted
CADE
2011
Springer
14 years 3 months ago
2011
Springer
Abstract. Sledgehammer is a component of Isabelle/HOL that employs firstorder automatic theorem provers (ATPs) to discharge goals arising in interactive proofs. It heuristically s...
150
Voted
PLDI
2003
ACM
15 years 9 months ago
2003
ACM
We describe a technique for automatically proving compiler optimizations sound, meaning that their transformations are always semantics-preserving. We first present a domainspeci...
146
Voted
LPAR
2004
Springer
15 years 9 months ago
2004
Springer
Resolution-based calculi are among the most widely used calculi for theorem proving in first-order logic. Numerous refinements of resolution are nowadays available, such as e.g. ...