407 search results - page 15 / 82 » Automatic Correctness Proofs for Logic Program Transformatio... |
ITICSE
2003
ACM
14 years 27 days ago
2003
ACM
Because the concept of program correctness is generally taught as an activity independent of the programming process, most introductory computer science (CS) students perceive it ...
LCTRTS
2000
Springer
13 years 11 months ago
2000
Springer
This paper presents a general approach to automatically validate code-improving transformations on low-level program representations. The approach ensures the correctness of compi...
AGP
2003
IEEE
14 years 28 days ago
2003
IEEE
Many NP-complete problems can be encoded in the answer set semantics of logic programs in a very concise way, where the encoding reflects the typical “guess and check” nature ...
APLAS
2005
ACM
14 years 1 months ago
2005
ACM
We describe a sound method for automatically proving Hoare triples for loop-free code in Separation Logic, for certain preconditions and postconditions (symbolic heaps). The method...
ASIAN
1999
Springer
13 years 12 months ago
1999
Springer
Unfold/fold transformation systems for logic programs have been extensively investigated. Existing unfold/fold transformation systems for normal logic programs allow only Tamaki-Sa...