288 search results - page 2 / 58 » Interactive Termination Proofs Using Termination Cores |
ICFP
2005
ACM
14 years 5 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...
RTA
2011
Springer
12 years 8 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...
LISP
2008
13 years 5 months ago
2008
Higher-order logic proof systems combine functional programming with logic, providing functional programmers with a comfortable setting for the formalization of programs, specifica...
CAV
2006
Springer
13 years 9 months ago
2006
Springer
We describe a new program termination analysis designed to handle imperative programs whose termination depends on the mutation rogram's heap. We first describe how an abstrac...
HCI
2009
13 years 3 months ago
2009
In factory automation (FA) industry, it is essential for the working environment using industrial robots to be provided with measures that assure operator's safety and good us...