Skip to main content
SpringerLink
Log in

Formal verification with functional indeterminacy on the basis of satisfiability testing of the conjunctive normal form

  • Published:
Automatic Control and Computer Sciences Aims and scope Submit manuscript

Abstract

The verification problem for the case of the description of a functional indeterminacy set by a system of partially specified Boolean functions is considered. The formal approach based on the reduction of the verification problem to a satisfiability test of the conjunctive normal form is suggested. Three approaches to the solution of the verification problem based on sequential, simultaneous, and group testing of multi-output intervals of the system of partially specified Boolean functions are investigated.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Advanced Formal Verification, Drechsler, R., Ed., Netherlands: Kluwer Academic, 2005.

    Google Scholar 

  2. Kuehlmann, A. and van Eijk, C.A.J., Combinational and Sequential Equivalence Checking, Logic Synthesis and Verification, Hassoun, S., Sasao, T., and Brayton, R.K., Eds., Netherlands: Kluwer Academic, 2002, pp. 343–372.

    Google Scholar 

  3. Kunz, W., Marques-Silva, J., and Malik, S., SAT and ATPG: Algorithms for Boolean Decision Problems, Logic Synthesis and Verification, Hassoun, S., Sasao, T., and Brayton, R.K., Eds., Netherlands: Kluwer Academic, 2002, pp. 309–341.

    Google Scholar 

  4. Ganai, M.K., Zhang, L., Ashar, P., Gupta, A., and Malik, S., Combining Strengths of Circuit-Based and CNF-Based Algorithms for a High-Performance SAT Solver, Proc. ACM/IEEE Design Automation Conf., 2002, pp. 747–750.

  5. Goldberg, E. and Novikov, Y., BerkMin: A Fast and Robust SAT-Solver, Proc. European Design and Test Conf., 2002, pp. 142–149.

  6. Een, N. and Sorensson, N., An Extensible SAT-Solver, Theory and Applications of Satisfiability Testing, 2004, pp. 502–518.

  7. The MiniSat Page: http://minisat.se/MiniSat.html

  8. Mishchenko, A., Chatterjee, S., Brayton, R., and Een, N., Improvements to Combinational Equivalence Checking, Proc. ICCAD’06, pp. San Jose, CA, 2006, pp. 836–843.

  9. Novikov, Ya. and Brinkmann, R., Foundations of Hierarchical SAT-Solving, ZIB-Report 05-38, 2005, http://www.zib.de/Publications/Reports/ZR-05-38.pdf

  10. Cheremisinova, L. and Novikov, D., SAT-Based Approach to Verification of Logical Descriptions with Functional Indeterminacy, 8th International Workshop on Boolean Problems, Freiberg, 2008, pp. 59–66.

Download references

Author information

Authors and Affiliations

  1. United Institute of Informatics Problems, National Academy of Sciences of Belarus, ul. Surganova 6, Minsk, 220012, Belarus

    L. D. Cheremisinova & D. Ya. Novikov

Authors
  1. L. D. Cheremisinova
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. D. Ya. Novikov
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to L. D. Cheremisinova.

Additional information

Original Russian Text © L.D. Cheremisinova, D.Ya. Novikov, 2010, published in Avtomatika i Vychislitel’naya Tekhnika, 2010, No. 1, pp. 5–16.

About this article

Cite this article

Cheremisinova, L.D., Novikov, D.Y. Formal verification with functional indeterminacy on the basis of satisfiability testing of the conjunctive normal form. Aut. Conrol Comp. Sci. 44, 1–10 (2010). https://doi.org/10.3103/S0146411610010013

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.3103/S0146411610010013

Key words

Search

Navigation