Formal verification of LabVIEW programs using the ACL2 Theorem Prover

Authors:
Matt Kaufmann;Jacob Kornerup;Mark Reitblatt
Affiliations:
University of Texas at Austin;National Instruments, Inc.;University of Texas at Austin National Instruments, Inc.
Venue:
Proceedings of the Eighth International Workshop on the ACL2 Theorem Prover and its Applications
Year:
2009

Citing 3
Cited 1

Functional instantiation in first-order logic

Artificial intelligence and mathematical theory of computation
Structured Theory Development for a Mechanized Logic

Journal of Automated Reasoning
Partial Functions in ACL2

Journal of Automated Reasoning

Model-Based static code analysis for MATLAB models

ISoLA'12 Proceedings of the 5th international conference on Leveraging Applications of Formal Methods, Verification and Validation: technologies for mastering change - Volume Part I

Quantified Score

Hi-index	0.00

Visualization

Abstract

The LabVIEW™ system is based on a graphical dataflow language, and is widely used for data acquisition, instrument control and industrial automation. This paper presents a methodology for annotating LabVIEW programs with their specifications, translating those annotated programs into ACL2, and proving the translated specifications with ACL2. Our system supports verification of inductive invariants of bounded loops as well as assertions about straight-line code. Our verification methodology supports the user by generating a highly structured set of proof obligations, many or all of which are discharged automatically. This methodology makes extensive use of hints to support scalability, including careful theory control as well as functional instantiation that avoids explicit use of induction. We describe the design, applicability and limitations of the framework. We also present several examples demonstrating our approach.