Sciweavers

101 search results - page 2 / 21
» Cyclic proofs of program termination in separation logic
Sort
View
TPHOL
2007
IEEE
15 years 3 months ago
Proof Pearl: The Termination Analysis of Terminator
Terminator is a static analysis tool developed by Microsoft Research for proving termination of Windows device drivers written in C. This proof pearl describes a formalization in h...
Joe Hurd
LISP
2008
165views more  LISP 2008»
14 years 9 months ago
Adapting functional programs to higher order logic
Higher-order logic proof systems combine functional programming with logic, providing functional programmers with a comfortable setting for the formalization of programs, specifica...
Scott Owens, Konrad Slind
CORR
2008
Springer
92views Education» more  CORR 2008»
14 years 9 months ago
Automated Termination Proofs for Logic Programs by Term Rewriting
Peter Schneider-Kamp, Jürgen Giesl, Alexander...
CORR
2000
Springer
82views Education» more  CORR 2000»
14 years 9 months ago
On Modular Termination Proofs of General Logic Programs
Annalisa Bossi, Nicoletta Cocco, Sandro Etalle, Sa...
RTA
2011
Springer
14 years 13 days ago
Modular Termination Proofs of Recursive Java Bytecode Programs by Term Rewriting
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...
Marc Brockschmidt, Carsten Otto, Jürgen Giesl