Logic and computation: interactive proof with Cambridge LCF
Logic and computation: interactive proof with Cambridge LCF
Information and Computation - Semantics of Data Types
Deforestation: transforming programs to eliminate trees
Proceedings of the Second European Symposium on Programming
Infinite objects in type theory
TYPES '93 Proceedings of the international workshop on Types for proofs and programs
A Calculus of Communicating Systems
A Calculus of Communicating Systems
Co-inductive Axiomatization of a Synchronous Language
Proceedings of the 11th International Conference on Theorem Proving in Higher Order Logics
Codifying Guarded Definitions with Recursive Schemes
TYPES '94 Selected papers from the International Workshop on Types for Proofs and Programs
Analysis of a Guard Condition in Type Theory (Extended Abstract)
FoSSaCS '98 Proceedings of the First International Conference on Foundations of Software Science and Computation Structure
PVS: A Prototype Verification System
CADE-11 Proceedings of the 11th International Conference on Automated Deduction: Automated Deduction
Verification of an optimized fault-tolerant clock synchronization circuit
DCC'96 Proceedings of the 3rd international conference on Designing Correct Circuits
A generic operator over discrete time intervals
Proceedings of the 4th ACM SIGPLAN international conference on Principles and practice of declarative programming
Flush: a system development tool based on scade/lustre
Proceedings of the 10th international workshop on Formal methods for industrial critical systems
| Hi-index | 0.00 |
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.