hh.sePublications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Static Consistency Checking for Verilog Wire Interconnects: Using dependent types to check the sanity of verilog descriptions
Rice University, Houston, TX, USA.
Rice University, Houston, TX, USA.
Rice University, Houston, TX, USA.
Intel Strategic CAD Labs, Portland, OR, USA.
Show others and affiliations
2009 (English)In: PEPM '09: Proceedings of the 2009 ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation, New York, NY: ACM Press, 2009, 121-130 p.Conference paper, Published paper (Refereed)
Abstract [en]

The Verilog hardware description language has padding semantics that allow designers to write descriptions where wires of different bit widths can be interconnected. However, many of these connections are nothing more than bugs inadvertently introduced by the designer and often result in circuits that behave incorrectly or use more resources than required. A similar problem occurs when wires are incorrectly indexed by values (or ranges) that exceed their bounds. These two problems are exacerbated by generate blocks. While desirable for reusability and conciseness, the use of generate blocks to describe circuit families only makes the situation worse as it hides such inconsistencies making them harder to detect. Inconsistencies in the generated code are only exposed after elaboration when the code is fully-expanded.

In this paper we show that these inconsistencies can be pinned down prior to elaboration using static analysis. We combine dependent types and constraint generation to reduce the problem of detecting the aforementioned inconsistencies to a satisfiability problem. Once reduced, the problem can easily be solved with a standard satisfiability modulo theories (SMT) solver. In addition, this technique allows us to detect unreachable code when it resides in a block guarded by an unsatisfiable set of constraints. To illustrate these ideas, we develop a type system for Featherweight Verilog (FV), a core calculus of structural Verilog with generative constructs and previously defined elaboration semantics. We prove that a well-typed FV description will always elaborate into an inconsistency-free description. We also provide a freely-available implementation demonstrating our approach. © 2009 ACM, Inc.

Place, publisher, year, edition, pages
New York, NY: ACM Press, 2009. 121-130 p.
Keyword [en]
Verilog Elaboration, Static Array Bounds Checking, Verilog Wire Width Consistency, Dead Code Elimination, Dependent Types
National Category
Computer and Information Science
Identifiers
URN: urn:nbn:se:hh:diva-29088DOI: 10.1145/1480945.1480963Scopus ID: 2-s2.0-67650680019Libris ID: 12440293ISBN: 978-1-60558-327-3 OAI: oai:DiVA.org:hh-29088DiVA: diva2:844399
Conference
PEPM '09 – Partial Evaluation and Program Manipulation (co-located with POPL 2009), Savannah, GA, USA, January 19-20, 2009
Note

This work was supported by the National Science Foundation (NSF) SoD award 0439017, and the Semiconductor Research Consortium (SRC) TaskID: 1403.001 (Intel custom project).

Available from: 2015-08-05 Created: 2015-08-05 Last updated: 2015-08-05Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full textScopus

Search in DiVA

By author/editor
Taha, Walid
Computer and Information Science

Search outside of DiVA

GoogleGoogle Scholar

Altmetric score

Total: 48 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf