Reasoning about VHDL using operational and observational semantics

We define a Plotkin-style structural operational semantics for a subset of vhdl that includes delta time, zero-delay scheduling and waits, arbitrary wait statements, and (commutative) resolution functions. While most of these features have been dealt with in separation, their combination is intricate. We follow closely the “careful prose” definition of vhdl as given in [9].

[1]  Rocco De Nicola,et al.  Testing Equivalences for Processes , 1984, Theor. Comput. Sci..

[2]  David Park,et al.  Concurrency and Automata on Infinite Sequences , 1981, Theoretical Computer Science.

[3]  E. L. Harder,et al.  The Institute of Electrical and Electronics Engineers, Inc. , 2019, 2019 IEEE International Conference on Software Architecture Companion (ICSA-C).

[4]  Carlos Delgado Kloos,et al.  A simple denotational semantics, proof theory and a validation condition generator for unit-delay VHDL , 1995, Formal Methods Syst. Des..

[5]  Laurence Pierre,et al.  PREVAIL: a proof environment for VHDL descriptions , 1992 .

[6]  Carlos Delgado Kloos,et al.  Formal Semantics for VHDL , 1995 .

[7]  Ashraf Salem,et al.  Formal semantics of VHDL timing constructs , 1992 .

[8]  Philip A. Wilsey,et al.  Developing a Formal Semantic Definition of VHDL , 1992 .

[9]  Gabriele Umbreit.  Providing a VHDL-interface for proof systems , 1992, Proceedings EURO-DAC '92: European Design Automation Conference.

[10]  Robin Milner,et al.  Communication and concurrency , 1989, PHI Series in computer science.

[11]  Jean P. Mermet.  VHDL for Simulation, Synthesis, and Formal Proofs of Hardware , 1992 .

[12]  Carlos Delgado Kloos,et al.  Clean formal semantics for VHDL , 1994, Proceedings of European Design and Test Conference EDAC-ETC-EUROASIC.