Abstract

The goal of automated verification is the definition of a logical framework where hardware or software systems can be formally specified and formal proofs about their properties can be given in a fully automatic way. This involves defining formalisms for encoding systems and the properties of interest. During the last years many logic-based techniques have been developed for automatically verifying properties of systems, the most successful of them being model checking [3]. The success of model checking is mostly due to the use of a particular data structure, Binary Decision Diagrams, which provide a very compact symbolic representation of a possibly very large, but finite, set of states. In order to overcome this finiteness restriction, some effort is now being put into the integration of abstraction and deduction techniques with model checking [15]. Recent papers also demonstrate the usefulness of (constraint) logic programming as a basis for the verification of finite...

Citations