A program verifier
On the mechanical derivation of loop invariants
Journal of Symbolic Computation - Special issue on automatic programming
Invariant Discovery via Failed Proof Attempts
LOPSTR '98 Proceedings of the 8th International Workshop on Logic Programming Synthesis and Transformation
Towards automatic debugging of programs
Proceedings of the international conference on Reliable software
Hi-index | 0.00 |
Additive AND/OR graphs are defined as AND/ OR graphs without circuits, which can be considered as folded AND/OR trees; i. e. the cost of a common subproblem is added to the cost as many times as the subproblem occurs, but it is computed only once. Additive ...