loading...
Circuit Based Quantification: Back to State Set Manipulation within Unbounded Model Checking
Munich, Germany March 07-March 11
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/DATE.2005.93Design, Automation and Test in Europe ...
 This Article 
 
PURCHASE ARTICLE: $0
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Gianpiero Cabodi, Politecnico di Torino, Italy
Marco Crivellari, Politecnico di Torino, Italy
Sergio Nocco, Politecnico di Torino, Italy
Stefano Quer, Politecnico di Torino, Italy
In this paper a non-canonical circuit-based state set representation is used to efficiently perform quantifier elimination. The novelty of this approach lies in adapting equivalence checking and logic synthesis techniques, to the goal of compacting circuit based state set representations resulting from existential quantification. The method can be efficiently combined with other verification approaches such as inductive and SAT-based pre-image verifications.
Citation:
Gianpiero Cabodi, Marco Crivellari, Sergio Nocco, Stefano Quer, "Circuit Based Quantification: Back to State Set Manipulation within Unbounded Model Checking," date, vol. 2, pp.688-689, Design, Automation and Test in Europe (DATE'05) Volume 2, 2005
Usage of this product signifies your acceptance of the Terms of Use.