159 search results - page 27 / 32 » Verifying the Equivalence of Logic Programs in the Disjuncti... |
173
click to vote
POPL
2006
ACM
15 years 10 months ago
2006
ACM
Functional programmers often reason about programs as if they were written in a total language, expecting the results to carry over to non-total (partial) languages. We justify su...
VMCAI
2004
Springer
15 years 2 months ago
2004
Springer
Shape analysis is a promising technique for statically verifying and extracting properties of programs that manipulate complex data structures. We introduce a new characterization...
98
Voted
PPDP
2005
Springer
15 years 3 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....
FOSSACS
2008
Springer
14 years 11 months ago
2008
Springer
Local reasoning about programs exploits the natural local behaviour common in programs by focussing on the footprint - that part of the resource accessed by the program. We address...
105
click to vote
CADE
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. A method based on dependency pairs for showing termination of functional programs on data structures generated by constructors with relations is proposed. A functional pr...