A Toolbox For Property Checking From Simulation Using Incremental SAT (Extended Abstract)

10/10/2018
by   Rob Sumners, et al.
0

We present a tool that primarily supports the ability to check bounded properties starting from a sequence of states in a run. The target design is compiled into an AIGNET which is then selectively and iteratively translated into an incremental SAT instance in which clauses are added for new terms and simplified by the assignment of existing literals. Additional applications of the tool can be derived by the user providing alternative attachments of constrained functions which guide the iterations and SAT checks performed. Some Verilog RTL examples are included for reference.

READ FULL TEXT
research
10/10/2018

Incremental SAT Library Integration Using Abstract Stobjs

We describe an effort to soundly use off-the-shelf incremental SAT solve...
research
09/29/2020

Computing and Proving Well-founded Orderings through Finite Abstractions

A common technique for checking properties of complex state machines is ...
research
02/12/2018

Unbounded Software Model Checking with Incremental SAT-Solving

This paper describes a novel unbounded software model checking approach ...
research
05/07/2014

Transalg: a Tool for Translating Procedural Descriptions of Discrete Functions to SAT

In this paper we present the Transalg system, designed to produce SAT en...
research
08/23/2023

Incremental Property Directed Reachability

Property Directed Reachability (PDR) is a widely used technique for form...
research
10/10/2018

Hint Orchestration Using ACL2's Simplifier

This paper describes a strategy for providing hints during an ACL2 proof...
research
09/07/2020

Collaborative Management of Benchmark Instances and their Attributes

Experimental evaluation is an integral part in the design process of alg...

Please sign up or login with your details

Forgot password? Click here to reset