330 search results - page 57 / 66 » On Modular Termination Proofs of General Logic Programs |
104
click to vote
IPL
2008
14 years 11 months ago
2008
Undefined terms involving the application of partial functions and operators are common in program specifications and in discharging proof obligations that arise in design. One wa...
110
click to vote
PPDP
2005
Springer
15 years 4 months ago
2005
Springer
When addressing the formal validation of generated software, two main alternatives consist either to prove the correctness of compilers or to directly validate the generated code....
182
click to vote
POPL
2009
ACM
16 years 1 days ago
2009
ACM
This paper describes a compositional shape analysis, where each procedure is analyzed independently of its callers. The analysis uses an abstract domain based on a restricted frag...
108
click to vote
PLDI
2003
ACM
15 years 4 months ago
2003
ACM
We describe a technique for automatically proving compiler optimizations sound, meaning that their transformations are always semantics-preserving. We first present a domainspeci...
100
click to vote
PLDI
2003
ACM
15 years 4 months ago
2003
ACM
Typed assembly languages provide a way to generate machinecheckable safety proofs for machine-language programs. But the soundness proofs of most existing typed assembly languages...