59 search results - page 3 / 12 » Proving Pointer Programs in Hoare Logic |
164
click to vote
POPL
2006
ACM
15 years 10 months ago
2006
ACM
Embedded code pointers (ECPs) are stored handles of functions and continuations commonly seen in low-level binaries as well as functional or higher-order programs. ECPs are known ...
CADE
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. Hoare logic is widely used for software specification and verification. Frequently we need to prove the total correctness of a program: to prove that the program not only...
JFP
2008
14 years 9 months ago
2008
We consider the problem of reconciling a dependently typed functional language with imperative features such as mutable higher-order state, pointer aliasing, and non-termination. ...
CSL
2009
Springer
15 years 4 months ago
2009
Springer
Separation logic is a Hoare-style logic for reasoning about programs with heap-allocated mutable data structures. As a step toward extending separation logic to high-level language...
ICTAC
2010
Springer
14 years 7 months ago
2010
Springer
We consider software verification of imperative programs by theorem proving in higher-order separation logic. Of particular interest are the difficulties of encoding and reasoning ...