A PVS proof obligation generator for Lustre programs

DOI10.1007/3-540-44404-1_12MaRDI QIDQ2767016zbMATH OpenFDO

Authors Cécile Canovas-Dumas, Paul Caspi

Publication date 22 July 2002

Published in Lecture Notes in Artificial Intelligence (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-44404-1_12

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Recommendations

• Using satisfiability modulo theories for inductive verification of Lustre programs
• An experience in proving regular networks of processes by modular model checking
• Verifying temporal properties without temporal logic
• PVS strategies for proving abstraction properties of automata
• Formal Methods in Computer-Aided Design

Cited in

(2)

• Timed term rewrite systems
• Using satisfiability modulo theories for inductive verification of Lustre programs

Describes a project that uses

Uses Software

• PVS

This page was built for publication: A PVS proof obligation generator for Lustre programs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2767016)