188 search results - page 8 / 38 » Logic of Proofs for Bounded Arithmetic |
99
Voted
CADE
2010
Springer
15 years 24 days ago
2010
Springer
Craig interpolation has become a versatile tool in formal verification, for instance to generate intermediate assertions for safety analysis of programs. Interpolants are typically...
109
click to vote
ASM
2010
ASM
15 years 2 months ago
2010
ASM
Abstract. Software development in B and Event-B generates proof obligations that have to be discharged using theorem provers. The cost of such developments therefore depends direct...
104
Voted
LICS
1998
IEEE
15 years 3 months ago
1998
IEEE
Hierarchies (Extended Abstract) Jan Johannsen Chris Pollett Department of Mathematics Department of Computer Science University of California, San Diego Boston University La Jolla,...
133
Voted
AMAST
2010
Springer
14 years 6 months ago
2010
Springer
Abstract. This paper introduces matching logic, a novel framework for defining axiomatic semantics for programming languages, inspired from operational semantics. Matching logic sp...
85
Voted
AML
2007
14 years 11 months ago
2007
In this paper we naturally define when a theory has bounded quantifier elimination, or is bounded model complete. We give several equivalent conditions for a theory to have each...