An abstraction algorithm for the verification of level-sensitive latch-based netlists

DOI10.1023/A:1024485130001zbMath1065.68068OpenAlexW1596418796MaRDI QIDQ1425001

Tamir Heyman, Vigyan Singhal, Adnan Aziz, Jason Baumgartner

Publication date: 15 March 2004

Published in: Formal Methods in System Design (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1024485130001

zbMATH Keywords

model reductionbisimulationCTL model checkingautomatic abstractionlevel-sensitive latchphase abstraction

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Related Items (1)

Interpolation with guided refinement: revisiting incrementality in SAT-based unbounded model checking

This page was built for publication: An abstraction algorithm for the verification of level-sensitive latch-based netlists