590 search results - page 66 / 118 » Non-Failure Analysis for Logic Programs |
CSL
2007
Springer
14 years 3 months ago
2007
Springer
Abstract. Probably the most significant result concerning cut-free sequent calculus proofs in linear logic is the completeness of focused proofs. This completeness theorem has a n...
POPL
2007
ACM
14 years 9 months ago
2007
ACM
An invariance assertion for a program location is a statement that always holds at during execution of the program. Program invariance analyses infer invariance assertions that ca...
PLDI
2009
ACM
14 years 3 months ago
2009
ACM
Symbolic analysis shows promise as a foundation for bug-finding, specification inference, verification, and test generation. This paper addresses demand-driven symbolic analysi...
CAV
2006
Springer
14 years 17 days 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...
AGP
1999
IEEE
14 years 1 months ago
1999
IEEE
We study the problem of an efficient and precise sharing analysis of (constraint) logic programs. After recognizing that neither aring nor its non-redundant (but equivalent) abstra...