Abstract
We develop a process algebraic framework PAFSV for the formal specification and analysis of IEEE 1800™ SystemVerilog designs. The formal semantics of PAFSV is defined by means of deduction rules that associate a time transition system with a PAFSV process. A set of properties of PAFSV is presented for a notion of bisimilarity. PAFSV may be regarded as the formal language of a significant subset of IEEE 1800™ SystemVerilog. To show that PAFSV is useful for the formal specification and analysis of IEEE 1800™ SystemVerilog designs, we illustrate the use of PAFSV with a multiplexer, a synchronous reset D flip-flop and an arbiter.
| Original language | English |
|---|---|
| Pages (from-to) | 143-176 |
| Number of pages | 34 |
| Journal | Computing and Informatics |
| Volume | 35 |
| Issue number | 1 |
| Publication status | Published - 2016 |
Keywords
- Circuit verification
- Formal semantics
- Formal specification and analysis
- PAFSV
- Process algebras
- SystemVerilog