Abstract
This paper presents the algorithm we have developed for proving that a finite state machine holds some properties expressed in temporal logic. This algorithm does not require the building of the state-transition graph nor the transition relation of the machine, so it overcomes the limits of the methods that have been proposed in the past. The verification algorithm presented here is based on Boolean function manipulations, which are represented by typed decision graphs. Thanks to this canonical representation, all the operations used in the algorithm have a polynomial complexity, expect for one called the computation of the “critical term”. The paper proposes techniques that reduce the computational cost of this operation.
Chapter PDF
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
J. P. Billon, “Perfect Normal Forms for Discrete Functions”, BULL Research Report N o87019, 1987.
J. P. Billon, J. C. Madre, “Original Concepts of PRIAM, an Industrial Tool for Efficient Formal Verification of Combinational Circuits”, in The Fusion of Hardware Design and Verification, G. J. Milne Ed., North Holland, 1988.
S. Bose, A. Fisher, “Automatic Verification of Synchronous Circuits Using Symbolic Logic Simulation and Temporal Logic”, in Proc. of the IFIP Int. Workshop, Applied Formal Methods for Correct VLSI Design, Leuven, Nov. 1989.
A. Bouajjani, J. C. Fernandez, N. Halbwachs, “An Executable Temporal Logic for Expressing Safety Properties”, July 1990.
R.E. Bryant, “Graph-based Algorithms for Boolean Functions Manipulation”, IEEE Transaction on Computers, Vol C35 No8, 1986.
S. Burch, E. M. Clarke, K. L. McMillan, “Sequential Circuit Verification Using Symbolic Model Checking”, in Proc. of Design Automation Conference (DAC), Orlando FL, USA, July 1990.
E. M. Clarke, O. Grumbreg, “Research on Automatic Verification of Finite-State Concurrent Systems”, Annual Revue Computing Science, vol. 2, pp 269–290, 1987.
O. Coudert, C. Berthet, J. C. Madre, “Verification of Synchronous Sequential Machines Based on Symbolic Execution”, in Lecture Notes in Computer Science: Automatic Verification Methods for Finite State Systems, Volume 407, J. Sifakis Editor, Springer-Verlag, pp 365–373, June 1989.
O. Coudert, C. Berthet, J. C. Madre, “Verification of Sequential Machines Using Boolean Functional Vectors”, in Proc. of the IFIP Int. Workshop, Applied Formal Methods for Correct VLSI Design, Leuven, November 1989.
O. Coudert, C. Berthet, J. C. Madre, “Formal Boolean Manipulations for the Verification of Sequential Machines”, in Proc. of the First European Design Automation Conference (EDAC), Glasgow, March 1990.
G. J. Holtzman, “Algorithms for Automated Protocol Validation”, in Lecture Notes in Computer Science: Automatic Verification Methods for Finite State Systems, Volume 407, J. Sifakis Editor, Springer-Verlag, June 1989.
Z. Kovahi, Switching and Finite Automata Theory, McGraw-Hill Book Edition, 1978.
J. P. Queille, J. Sifakis, “Fairness and Related Properties in Transition Systems”, Acta Informatica, pp 195–220, 1983.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Coudert, O., Madre, J.C., Berthet, C. (1991). Verifying temporal properties of sequential machines without building their state diagrams. In: Clarke, E.M., Kurshan, R.P. (eds) Computer-Aided Verification. CAV 1990. Lecture Notes in Computer Science, vol 531. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0023716
Download citation
DOI: https://doi.org/10.1007/BFb0023716
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-54477-7
Online ISBN: 978-3-540-38394-9
eBook Packages: Springer Book Archive