378 search results - page 52 / 76 » Proof interpretations with truth |
133
Voted
POPL
2010
ACM
15 years 3 months ago
2010
ACM
In this paper, we explore the potential of the theory of nested words for partial correctness proofs of recursive programs. Our conceptual contribution is a simple framework that ...
141
Voted
CORR
2011
Springer
14 years 10 months ago
2011
Springer
A sequence is nonrepetitive if it does not contain two adjacent identical blocks. The remarkable construction of Thue asserts that 3 symbols are enough to build an arbitrarily long...
154
Voted
VMCAI
2004
Springer
15 years 9 months ago
2004
Springer
Typed Assembly Languages (TALs) can be used to validate the safety of assembly-language programs. However, typing rules are usually trusted as axioms. In this paper, we show how to...
147
Voted
OSDI
1996
ACM
15 years 5 months ago
1996
ACM
This paper describes a mechanism by which an operating system kernel can determine with certainty that it is safe to execute a binary supplied by an untrusted source. The kernel r...
236
Voted
POPL
2007
ACM
16 years 4 months ago
2007
ACM
This work presents a framework for fusing flow analysis and theorem proving called logic-flow analysis (LFA). The framework itthe reduced product of two abstract interpretations: ...