Temporal reasoning and termination of programs

Authors:
Luis Farinas-del-Cerro
Affiliations:
Laboratoire des Langages et Systemes Informatiques, Universite Paul Sabatier, Toulouse, France
Venue:
IJCAI'83 Proceedings of the Eighth international joint conference on Artificial intelligence - Volume 2
Year:
1983

Citing 6
Cited 0

A Machine-Oriented Logic Based on the Resolution Principle

Journal of the ACM (JACM)
Properties of Programs and the First-Order Predicate Calculus

Journal of the ACM (JACM)
Is “sometime” sometimes better than “always”?: intermittent assertions in proving program correctness

Communications of the ACM
An axiomatic basis for computer programming

Communications of the ACM
Semantical consideration on floyo-hoare logic

SFCS '76 Proceedings of the 17th Annual Symposium on Foundations of Computer Science
Process logic: Expressiveness, decidability, completeness

SFCS '80 Proceedings of the 21st Annual Symposium on Foundations of Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper deals with the relationship between the termination of programs and the validity of certain modal formulas. We give a complete proof procedure for theses formulas, which will allow to bring the correctness of these programs back to a problem of automated deduction in modal logic.