An Algorithm for Strengthening State Invariants Generated from Requirements Specifications

Authors:
Ralph D. Jeffords;Constance L. Heitmeyer
Affiliations:
-;-
Venue:
RE '01 Proceedings of the Fifth IEEE International Symposium on Requirements Engineering
Year:
2001

Citing 0
Cited 8

Model exploration with temporal logic query checking

Proceedings of the 10th ACM SIGSOFT symposium on Foundations of software engineering
Model exploration with temporal logic query checking

ACM SIGSOFT Software Engineering Notes
Program Synthesis from Formal Requirements Specifications Using APTS

Higher-Order and Symbolic Computation
A strategy for efficiently verifying requirements

Proceedings of the 9th European software engineering conference held jointly with 11th ACM SIGSOFT international symposium on Foundations of software engineering
Generating optimized code from SCR specifications

Proceedings of the 2006 ACM SIGPLAN/SIGBED conference on Language, compilers, and tool support for embedded systems
Weakest Invariant Generation for Automated Addition of Fault-Tolerance

Electronic Notes in Theoretical Computer Science (ENTCS)
Managing Complexity in Software Development with Formally Based Tools

Electronic Notes in Theoretical Computer Science (ENTCS)
Incremental verification with mode variable invariants in state machines

NFM'12 Proceedings of the 4th international conference on NASA Formal Methods

Quantified Score

Hi-index	0.00

Visualization

Abstract

Abstract: In earlier work, we developed a fix point algorithm for automatically generating state invariants, properties that hold in each reachable state of a state machine model, from state-base d requirements specifications. Such invariants are useful both in validating requirements specifications and as auxiliary lemmas in proofs that a requirements specification satisfies other invariant properties. This paper describes a new related algorithm that strengthens state invariants generated by our in itial algorithm and demonstrates the new algorithm on a simplified version of an automobile cruise control system. The paper concludes by describing how the two algorithms were used to generate state invariants from a requirements specification of acryptographic device and how the invariants in conjunction with a theorem prover were used to prove formally that the device satisfies a set of critical security properties.