163 search results - page 30 / 33 » Higher-Order Logic and Theorem Proving for Structured Specif... |
TPCD
1994
13 years 8 months ago
1994
Theorem proving techniques are particularly well suited for reasoning about arithmetic above the bit level and for relating di erent f abstraction. In this paper we show how a non-...
CADE
2007
Springer
14 years 7 months ago
2007
Springer
Boolean Algebra with Presburger Arithmetic (BAPA) is a decidable logic that combines 1) Boolean algebra of sets of uninterpreted elements (BA) and 2) Presburger arithmetic (PA). BA...
ICFP
2010
ACM
13 years 8 months ago
2010
ACM
A wide range of computer programs, including compilers and theorem provers, manipulate data structures that involve names and binding. However, the design of programming idioms wh...
ICFP
2009
ACM
14 years 8 months ago
2009
ACM
We define logical relations between the denotational semantics of a simply typed functional language with recursion and the operational behaviour of low-level programs in a varian...
PEPM
2010
ACM
13 years 9 months ago
2010
ACM
Software engineering, automated reasoning, rule-based programming or specifications often use rewriting systems for which termination, among other properties, may have to be ensur...