On the Complexity of Symbolic Verification and Decision Problems in Bit-Vector Logic-Reference-Cited by-同舟云学术

On the Complexity of Symbolic Verification and Decision Problems in Bit-Vector Logic

Published:2014 Issue: Volume: Page:481-492
ISSN:0302-9743
Container-title:Mathematical Foundations of Computer Science 2014
language:
Short-container-title:

Author:

Kovásznai Gergely,Veith Helmut,Fröhlich Andreas,Biere Armin

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-662-44465-8_41

Reference39 articles.

1. Balcázar, J.L., Lozano, A., Torán, J.: The complexity of algorithmic problems on succinct instances. Computer Science, 351–377 (1992)

2. Borchert, B., Lozano, A.: Succinct circuit representations and leaf language classes are basically the same concept. Inf. Process. Lett. 59(4), 211–215 (1996)

3. Lecture Notes in Computer Science;B. Das,2014

4. Feigenbaum, J., Kannan, S., Vardi, M.Y., Viswanathan, M.: Complexity of problems on graphs represented as OBDDs. Chicago Journal of Theoretical Computer Science 5(5) (1999)

5. Galperin, H., Wigderson, A.: Succinct representations of graphs. Information and Control 56(3), 183–198 (1983)

Cited by 5 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Polynomial Formal Verification of Sequential Circuits;2024 Design, Automation & Test in Europe Conference & Exhibition (DATE);2024-03-25

2. Edge Verification: Ensuring Correctness under Resource Constraints;2021 34th SBC/SBMicro/IEEE/ACM Symposium on Integrated Circuits and Systems Design (SBCCI);2021-08-23

3. Systematic comparison of symbolic execution systems;Proceedings of the 35th Annual Computer Security Applications Conference;2019-12-09

4. A Benders Decomposition Approach to Deciding Modular Linear Integer Arithmetic;Theory and Applications of Satisfiability Testing – SAT 2017;2017

5. Deciding Bit-Vector Formulas with mcSAT;Theory and Applications of Satisfiability Testing – SAT 2016;2016