More on the Complexity of Quantifier-Free Fixed-Size Bit-Vector Logics with Binary Encoding-Reference-Cited by-同舟云学术

More on the Complexity of Quantifier-Free Fixed-Size Bit-Vector Logics with Binary Encoding

Published:2013 Issue: Volume: Page:378-390
ISSN:0302-9743
Container-title:Computer Science – Theory and Applications
language:
Short-container-title:

Author:

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

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-38536-0_33

Reference25 articles.

1. Kovásznai, G., Fröhlich, A., Biere, A.: On the complexity of fixed-size bit-vector logics with binary encoded bit-width. In: Proc. SMT 2012, pp. 44–55 (2012)

2. Cyrluk, D., Möller, O., Rueß, H.: An efficient decision procedure for the theory of fixed-sized bit-vectors. In: Grumberg, O. (ed.) CAV 1997. LNCS, vol. 1254, pp. 60–71. Springer, Heidelberg (1997)

3. Barrett, C.W., Dill, D.L., Levitt, J.R.: A decision procedure for bit-vector arithmetic. In: Proc. DAC 1998, pp. 522–527 (1998)

4. Lecture Notes in Computer Science;N. Bjørner,1998

5. Bruttomesso, R., Sharygina, N.: A scalable decision procedure for fixed-width bit-vectors. In: Proc. ICCAD 2009, pp. 13–20. IEEE (2009)

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

1. On the complexity of the quantified bit-vector arithmetic with binary encoding;Information Processing Letters;2018-07

2. Satisfiability Modulo Theories;Handbook of Model Checking;2018

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

4. Colors Make Theories Hard;Automated Reasoning;2016

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