%0 Conference Proceedings
%T Hardware Verification, Boolean Logic Programming, Boolean Functional Programming
%A Tronci, Enrico
%S Tenth Annual IEEE Symposium on Logic in Computer Science (LICS)
%D 1995
%I IEEE Computer Society
%C San Diego, California
%F Tronci1995
%O exported from refbase (http://mclab.di.uniroma1.it/publications/show.php?record=56), last updated on Sat, 24 Nov 2012 14:34:24 +0100
%X One of the main obstacles to automatic verification of finite state systems (FSSs) is state explosion. In this respect automatic verification of an FSS M using model checking and binary decision diagrams (BDDs) has an intrinsic limitation: no automatic global optimization of the verification task is possible until a BDD representation for M is generated. This is because systems and specifications are defined using different languages. To perform global optimization before generating a BDD representation for M we propose to use the same language to define systems and specifications. We show that first order logic on a Boolean domain yields an efficient functional programming language that can be used to represent, specify and automatically verify FSSs, e.g. on a SUN Sparc Station 2 we were able to automatically verify a 64 bit commercial multiplier.
%R 10.1109/LICS.1995.523275
%U http://mclab.di.uniroma1.it/publications/papers/papers/Tronci1995.pdf
%U https://doi.org/10.1109/LICS.1995.523275
%P 408-418