632 search results - page 40 / 127 » Combining programming with theorem proving |
ALC
1997
13 years 9 months ago
1997
A predicative semantics is a mapping of programs to predicates. These predicates characterize sets of acceptable observations. The presence of time in the observations makes the o...
ICFP
2003
ACM
14 years 7 months ago
2003
ACM
I describe the mechanisation in HOL of some basic -calculus theory, using the axioms proposed by Gordon and Melham [4]. Using these as a foundation, I mechanised the proofs from C...
ESOP
1992
Springer
13 years 12 months ago
1992
Springer
Dynamic typing is a program analysis targeted at removing runtime tagging and untagging operations from programs written in dynamically typed languages. This paper compares dynami...
DAC
2007
ACM
14 years 8 months ago
2007
ACM
Modern combinational equivalence checking (CEC) engines are complicated programs which are difficult to verify. In this paper we show how a modern CEC engine can be modified to pr...
POPL
2006
ACM
14 years 8 months ago
2006
ACM
This paper reports on the development and formal certification (proof of semantic preservation) of a compiler from Cminor (a Clike imperative language) to PowerPC assembly code, u...