Fast bit-vector satisfiability-Reference-Cited by-同舟云学术

Fast bit-vector satisfiability

Published:2020-07-13 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 29th ACM SIGSOFT International Symposium on Software Testing and Analysis
language:
Short-container-title:

Author:

Yao Peisen¹,Shi Qingkai¹,Huang Heqing¹,Zhang Charles¹

Affiliation:

1. Hong Kong University of Science and Technology, China

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/3395363.3397378

Reference63 articles.

1. Clark Barrett Aaron Stump and Cesare Tinelli. 2010. The satisfiability modulo theories library (SMT-LIB). www. SMT-LIB. org 15 ( 2010 ) 18-52. Clark Barrett Aaron Stump and Cesare Tinelli. 2010. The satisfiability modulo theories library (SMT-LIB). www. SMT-LIB. org 15 ( 2010 ) 18-52.

2. A decision procedure for bit-vector arithmetic

3. Precise Hausdorff distance computation between polygonal meshes

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

1. SMT Theory Arbitrage: Approximating Unbounded Constraints using Bounded Theories;Proceedings of the ACM on Programming Languages;2024-06-20

2. Concrete Constraint Guided Symbolic Execution;Proceedings of the IEEE/ACM 46th International Conference on Software Engineering;2024-04-12

3. Regular Abstractions for Array Systems;Proceedings of the ACM on Programming Languages;2024-01-05

4. Improving Bit-Blasting for Nonlinear Integer Constraints;Proceedings of the 32nd ACM SIGSOFT International Symposium on Software Testing and Analysis;2023-07-12

5. Anchor : Fast and Precise Value-flow Analysis for Containers via Memory Orientation;ACM Transactions on Software Engineering and Methodology;2023-04-26