Skip to main content
Conference Proceedings

A PVS proof obligation generator for lustre programs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2000) 1955 179-188
DOI: 10.1007/3-540-44404-1_12
12Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This paper presents a tool for proving safety properties of Lustre programs in PVS, based on continuous induction. The tool applies off-line a repeated induction strategy and generates proof obligations left to PVS. We show on examples how it avoids some drawbacks of co-induction which needs to consider “absent elements” in the case of clocked streams.

Cite

CITATION STYLE

APA

Canovas-Dumas, C., & Caspi, P. (2000). A PVS proof obligation generator for lustre programs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1955, pp. 179–188). Springer Verlag. https://doi.org/10.1007/3-540-44404-1_12

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free