Algebraic Verification Method for SEREs Properties via Groebner Bases Approaches

  title={Algebraic Verification Method for SEREs Properties via Groebner Bases Approaches},
  author={Ning Zhou and Jinzhao Wu and Xinyan Gao},
  journal={J. Appl. Math.},
This work presents an efficient solution using computer algebra system to perform linear temporal properties verification for synchronous digital systems. The method is essentially based on both Groebner bases approaches and symbolic simulation. A mechanism for constructing canonical polynomial set based symbolic representations for both circuit descriptions and assertions is studied. We then present a complete checking algorithm framework based on these algebraic representations by using… 

Figures and Tables from this paper

Groebner Bases Based Verification Solution for SystemVerilog Concurrent Assertions

An approach exploiting the power of polynomial ring algebra to perform SystemVerilog assertion verification over digital circuit systems and an algorithm framework based on the algebraic representations using Groebner bases for concurrent SVAs checking is presented.

Slicing Reduction for Algebraic Verification of SEREs Properties

This paper presents an algorithm which applies the slicing reduction technique to an algebraic verification method for SEREs properties, which can significantly improve the efficiency of the verification algorithm.



Symbolic Model Checking Using Algebraic Geometry

In this paper, I show that methods from computational algebraic geometry can be used to carry out symbolic model checking using an encoding of Boolean sets as the common zeros of sets of polynomials.

Multi-Valued Model Checking via Groebner Basis Approach

  • Jinzhao WuLin Zhao
  • Computer Science
    First Joint IEEE/IFIP Symposium on Theoretical Aspects of Software Engineering (TASE '07)
  • 2007
It is shown that Groebner bases can provide canonical symbolic representations for multi-valued logics, and therefore, can be applied to symbolicMulti-valued model checking, and a modified model checking algorithm is presented based on the algebraic representations ofmv-Kripke structures as well as mv-CTL formulas.

Application of Wu's method to symbolic model checking

A new approach to model checking is carried out by using Wu's method to calculate the characteristic sets of polynomials that represent Kripke structures as well as CTL formulas, which is a new successful application ofwu's method.

Formal verification by symbolic evaluation of partially-ordered trajectories

The general theory underlying symbolic trajectory evaluation is presented and the application of the theory to the taks of verifying switch-level circuits as well as more abstract implementations are illustrated.

PSL Model Checking and Run-Time Verification Via Testers

Besides providing the construction of testers for PSL, it is indicated how the symbolic representation of the testers can be directly utilized for efficient model checking and run-time monitoring.

Model Checking PSL Using HOL and SMV

A model checking infrastructure for a significant subset of PSL that works by translating model checking problems to equivalent checks for the existence of fair paths through a Kripke structure specified in higher order logic is described.

Polynomial methods for component matching and verification

  • James SmithG. Micheli
  • Computer Science
    1998 IEEE/ACM International Conference on Computer-Aided Design. Digest of Technical Papers (IEEE Cat. No.98CB36287)
  • 1998
A mechanism is presented for compactly specifying circuit functionality as polynomials at the word level, so that differences in precision between potential implementations can be detected and quantified.

Efficient Model Checking of PSL Safety Properties

The presented technique is inspired by the temporal testers approach of Pnueli and co-authors but is aimed at finite words instead of infinite words and has been implemented on top of the open source NuSMV 2model checker.

The application of program verification techniques to hardware verification

This paper examines one such program verification technique, based on the notion of symbolic execution, and then explores its application to the problem of establishing the correct behavior of a piece of hardware.

The Application of Program Verification to Hardware Verification

  • J. Darringer
  • Computer Science
    16th Design Automation Conference
  • 1979
This paper examines one such program verification technique, based on the notion of symbolic execution, and then explores its application to the problem of establishing the correct behavior of a piece of hardware.