2003Unpublished venueRequires access

Bounded Property Checking with Symbolic Simulation.

Jürgen Ruf, Prakash Peranandam

Open publisher page 16 citations

Abstract

Steadily increasing design sizes, make the verification a bottleneck in modern design flows of digital hardware and embedded software systems. Up to 75 % of the overall design costs are due to the verification task. Formal methods have been proposed to accompany commonly used simulation approaches. In this paper we combine property checking and symbolic simulation to make these techniques applicable to larger designs and to seamlessly integrate formal verification and standard simulation. Our experimental results show a run time gain over standard symbolic model checking and SATbased bounded model checking for certain classes of circuits and properties.

About this research paper

What this paper is about

Steadily increasing design sizes, make the verification a bottleneck in modern design flows of digital hardware and embedded software systems. Up to 75 % of the overall design costs are due to the verification task. Formal methods have been proposed to accompany commonly used simulation approaches. In this paper we combine property checking and symbolic simulation to make these techniques applicable to larger designs and to seamlessly integrate formal verification and standard simulation. Our experimental results show a run time gain over standard symbolic model checking and SATbased bounded model checking for certain classes of circuits and properties.

Why it matters

OpenAlex reports 16 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Steadily increasing design sizes, make the verification a bottleneck in modern design flows of digital hardware and embedded software systems. Up to 75 % of the overall design costs are due to the verification task. Formal methods have been proposed to accompany commonly used simulation approaches. In this paper we combine property checking and symbolic simulation to make these techniques applicable to larger designs and to seamlessly integrate formal verification and standard simulation. Our experimental results show a run time gain over standard symbolic model checking and SATbased bounded model checking for certain classes of circuits and properties.

Key concepts: Symbolic trajectory evaluation, Model checking, Computer science, Formal verification, Bounded function, Bottleneck, Formal equivalence checking, Property (philosophy)

Related papers

Back to paper searchBrowse research topicsOriginal source
Bounded Property Checking with Symbolic Simulation. — Research Paper | ScholarLens