By Topic

Symbolic verification of Boolean constraints over partially specified functions

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
S. Sriram ; Dept. of Comput. Sci. & Eng., Indian Inst. of Technol., Kharagpur, India ; R. Tandon ; P. Dasgupta ; P. P. Chakrabarti

Incomplete or partial specifications arise out of mistakes in design or purposefully to avoid loss of generality in application. When designing a system with several partially specified functions, we often impose constraints on the global behavior of the system. In this paper we study the problem of verifying whether a set of partially specified functions meets such constraints. We show that the problem is Π2 P complete. While symbolic BDD-based algorithms have been widely used for propositional satifiability (Σ1 P complete) and validity (Π1P complete) problems, the structure of BDDs is not natural for solving Π2P complete problems. We present a two-step BDD-based method for solving the above Π2P complete problem and show that the method is effective when the number of functions is small

Published in:

Circuits and Systems, 2001. ISCAS 2001. The 2001 IEEE International Symposium on  (Volume:5 )

Date of Conference: