797 search results - page 23 / 160 » Eliminating Proofs from Programs |
177
Voted
RTA
2011
Springer
14 years 3 months ago
2011
Springer
In [5, 15] we presented an approach to prove termination of non-recursive Java Bytecode (JBC) programs automatically. Here, JBC programs are first transformed to finite terminat...
202
click to vote
ICFP
2009
ACM
16 years 1 months ago
2009
ACM
We present a new approach for constructing and verifying higherorder, imperative programs using the Coq proof assistant. We build on the past work on the Ynot system, which is bas...
207
Voted
POPL
2008
ACM
16 years 1 months ago
2008
ACM
We propose a novel approach to proving the termination of heapmanipulating programs, which combines separation logic with cyclic proof within a Hoare-style proof system. Judgement...
113
click to vote
ICS
2010
Tsinghua U.
15 years 10 months ago
2010
Tsinghua U.
: Design of secure systems can often be expressed as ensuring that some property is maintained at every step of a distributed computation among mutually-untrusting parties. Special...
150
click to vote
CSL
2007
Springer
15 years 7 months ago
2007
Springer
Programs and Abstract Complexity A. Beckmann University of Wales Swansea Swansea, UK Axiom systems are ubiquitous in mathematical logic, one famous and well studied example being ...