A theorem prover for verifying iterative programs over integers

An implementation of a rule-based theorem prover for verifying iterative programs over integers is presented. The authors emphasize the overall proof construction strategy of the prover which has been able to construct the correctness proofs of all iterative programs taken from the literature. Two p...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	IEEE transactions on software engineering 1989-12, Vol.15 (12), p.1550-1566
Hauptverfasser:	Sarkar, D., De Sarkar, S.C.
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms Applied sciences Automation Computer programming Computer science Computer science control theory systems Exact sciences and technology Humans Integers Programmable logic arrays Programs Software Software engineering Sorting Theory
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Beschreibung
Zusammenfassung:	An implementation of a rule-based theorem prover for verifying iterative programs over integers is presented. The authors emphasize the overall proof construction strategy of the prover which has been able to construct the correctness proofs of all iterative programs taken from the literature. Two performance measures for the prover are proposed, and its proof construction for an array-sorting program is evaluated using these measures.< >
ISSN:	0098-5589 1939-3520
DOI:	10.1109/32.58767