Formal verification of a microprocessor control

The complexity of the instruction set of modern processors often leads to faults in the microinstruction sequencing, and timing errors, which are difficult to detect with conventional simulation methods. Formal verification offers a powerful alternative for dealing with these problems. In this paper we present a mathematical model of the microcode of a transputer-like microprocessor, and demonstrate how to test for the satisfaction of desired properties and the absence of improper microinstruction sequencing. The verification is based on a recently introduced technique using the inductively defined notion of series parallel posets, which offers low time and space complexity.

[1]  Ganesh Gopalakrishnan,et al.  A new partial order reduction algorithm for concurrent system verification , 1997 .

[2]  R. Nunna,et al.  Modeling and verification of iterated systems and protocols , 2001, Proceedings of the 44th IEEE 2001 Midwest Symposium on Circuits and Systems. MWSCAS 2001 (Cat. No.01CH37257).

[3]  L. Ivanov,et al.  Formal verification: a new partial order approach , 1999, Twelfth Annual IEEE International ASIC/SOC Conference (Cat. No.99TH8454).

[4]  L. Ivanov,et al.  Formal Verification of Globally-Iterated/Locally-Non-Iterated Systems , 1999 .

[5]  Doron A. Peled,et al.  Combining partial order reductions with on-the-fly model-checking , 1994, Formal Methods Syst. Des..

[6]  L. Ivanov,et al.  Modeling and analysis of noniterated systems: an approach based upon series-parallel posets , 1999, ISCAS'99. Proceedings of the 1999 IEEE International Symposium on Circuits and Systems VLSI (Cat. No.99CH36349).

[7]  Patrice Godefroid,et al.  Partial-Order Methods for the Verification of Concurrent Systems , 1996, Lecture Notes in Computer Science.

[8]  Zoltán Ésik,et al.  Free Shuffle Algebras in Language Varieties , 1996, Theor. Comput. Sci..

[9]  Kenneth L. McMillan,et al.  Symbolic model checking , 1992 .

[10]  Glynn Winskel,et al.  Petri Nets, Event Structures and Domains , 1979, Semantics of Concurrent Computation.

[11]  Glynn Winskel,et al.  Petri Nets, Event Structures and Domains, Part I , 1981, Theor. Comput. Sci..

[12]  L. Ivanov,et al.  Modeling and verification of cache coherence protocols , 2001, ISCAS 2001. The 2001 IEEE International Symposium on Circuits and Systems (Cat. No.01CH37196).

[13]  Robert P. Kurshan,et al.  Computer-Aided Verification of Coordinating Processes: The Automata-Theoretic Approach , 2014 .