Some Complexity Results for SystemVerilog Assertions
From MaRDI portal
Publication:5756748
DOI10.1007/11817963_21zbMath1188.68184OpenAlexW2168579189MaRDI QIDQ5756748
John W. Havlicek, Doron Bustan
Publication date: 5 September 2007
Published in: Computer Aided Verification (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11817963_21
Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (4)
Functional Specification of Hardware via Temporal Logic ⋮ Safety and Liveness, Weakness and Strength, and the Underlying Topological Relations ⋮ On regular temporal logics with past ⋮ Specification Languages for Stutter-Invariant Regular Properties
This page was built for publication: Some Complexity Results for SystemVerilog Assertions
