330 search results - page 1 / 66 » On Modular Termination Proofs of General Logic Programs |
CORR
2000
Springer
13 years 4 months ago
2000
Springer
ICFP
2005
ACM
14 years 4 months ago
2005
ACM
Proof-carrying code (PCC) is a general framework that can, in principle, verify safety properties of arbitrary machine-language programs. Existing PCC systems and typed assembly l...
POPL
2008
ACM
14 years 5 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...
CADE
2004
Springer
13 years 10 months ago
2004
Springer
The dependency pair approach is one of the most powerful techniques for automated (innermost) termination proofs of term rewrite systems (TRSs). For any TRS, it generates inequalit...
RTA
2011
Springer
12 years 7 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...