Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
  • Beame P and Liew V. (2019). Toward Verifying Nonlinear Integer Arithmetic. Journal of the ACM. 66:3. (1-30). Online publication date: 30-Jun-2019.

    https://doi.org/10.1145/3319396

  • Kafle B, Gange G, Schachte P, Søndergaard H and Stuckey P. (2017). A Benders Decomposition Approach to Deciding Modular Linear Integer Arithmetic. Theory and Applications of Satisfiability Testing – SAT 2017. 10.1007/978-3-319-66263-3_24. (380-397).

    http://link.springer.com/10.1007/978-3-319-66263-3_24

  • Beame P and Liew V. (2017). Towards Verifying Nonlinear Integer Arithmetic. Computer Aided Verification. 10.1007/978-3-319-63390-9_13. (238-258).

    http://link.springer.com/10.1007/978-3-319-63390-9_13

  • Chihani Z, Marre B, Bobot F and Bardin S. (2017). Sharpening Constraint Programming Approaches for Bit-Vector Theory. Integration of AI and OR Techniques in Constraint Programming. 10.1007/978-3-319-59776-8_1. (3-20).

    http://link.springer.com/10.1007/978-3-319-59776-8_1

  • Achterberg T. (2009). SCIP: solving constraint integer programs. Mathematical Programming Computation. 10.1007/s12532-008-0001-1. 1:1. (1-41). Online publication date: 1-Jul-2009.

    http://link.springer.com/10.1007/s12532-008-0001-1

  • Bryant R, Kroening D, Ouaknine J, Seshia S, Strichman O and Brady B. (2009). An abstraction-based decision procedure for bit-vector arithmetic. International Journal on Software Tools for Technology Transfer (STTT). 11:2. (95-104). Online publication date: 1-Apr-2009.

    /doi/10.5555/3220882.3220984

  • Bryant R, Kroening D, Ouaknine J, Seshia S, Strichman O and Brady B. (2009). An abstraction-based decision procedure for bit-vector arithmetic. International Journal on Software Tools for Technology Transfer. 10.1007/s10009-009-0101-x. 11:2. (95-104). Online publication date: 1-Apr-2009.

    http://link.springer.com/10.1007/s10009-009-0101-x

  • Mirzaeian S, Feijun Zheng and Cheng K. (2008). RTL Error Diagnosis Using a Word-Level SAT-Solver 2008 IEEE International Test Conference. 10.1109/TEST.2008.4700568. 978-1-4244-2402-3. (1-8).

    http://ieeexplore.ieee.org/document/4700568/

  • Kroening D and Seshia S. Formal verification at higher levels of abstraction. Proceedings of the 2007 IEEE/ACM international conference on Computer-aided design. (572-578).

    /doi/10.5555/1326073.1326192

  • Deng S, Bian J, Wu W, Yang X and Zhao Y. EHSAT. Proceedings of the 44th annual Design Automation Conference. (588-593).

    https://doi.org/10.1145/1278480.1278629

  • Bryant R, Kroening D, Ouaknine J, Seshia S, Strichman O and Brady B. Deciding bit-vector arithmetic with abstraction. Proceedings of the 13th international conference on Tools and algorithms for the construction and analysis of systems. (358-372).

    /doi/10.5555/1763507.1763544

  • Deng S, Wu W and Bian J. Bounded Model Checking Combining Symbolic Trajectory Evaluation Abstraction with Hybrid Three-Valued SAT Solving. Computer Supported Cooperative Work in Design III. 10.1007/978-3-540-72863-4_31. (297-307).

    http://link.springer.com/10.1007/978-3-540-72863-4_31

  • Bryant R, Kroening D, Ouaknine J, Seshia S, Strichman O and Brady B. Deciding Bit-Vector Arithmetic with Abstraction. Tools and Algorithms for the Construction and Analysis of Systems. 10.1007/978-3-540-71209-1_28. (358-372).

    http://link.springer.com/10.1007/978-3-540-71209-1_28

  • Deng S, Wu W and Bian J. Bounded model checking combining symbolic trajectory evaluation abstraction with hybrid three-valued SAT solving. Proceedings of the 10th international conference on Computer supported cooperative work in design III. (297-307).

    /doi/10.5555/1761628.1761663

  • Ganai M, Talupur M and Gupta A. SDSAT. Proceedings of the 12th international conference on Tools and Algorithms for the Construction and Analysis of Systems. (135-150).

    https://doi.org/10.1007/11691372_9

  • Kroening D and Sharygina N. Approximating predicate images for bit-vector logic. Proceedings of the 12th international conference on Tools and Algorithms for the Construction and Analysis of Systems. (242-256).

    https://doi.org/10.1007/11691372_16

  • Bozzano M, Bruttomesso R, Cimatti A, Junttila T, Rossum P, Schulz S and Sebastiani R. (2005). MathSAT. Journal of Automated Reasoning. 35:1-3. (265-293). Online publication date: 1-Oct-2005.

    https://doi.org/10.1007/s10817-005-9004-z

  • Parthasarathy G, Iyer M, Cheng K and Brewer F. Structural search for RTL with predicate learning. Proceedings of the 42nd annual Design Automation Conference. (451-456).

    https://doi.org/10.1145/1065579.1065698

  • Parthasarathy G, Iyer M, Cheng K and Brewer F. RTL SAT simplification by Boolean and interval arithmetic reasoning. Proceedings of the 2005 IEEE/ACM International conference on Computer-aided design. (297-302).

    /doi/10.5555/1129601.1129645

  • Iyer M, Parthasarathy G and Cheng K. Efficient Conflict-Based Learning in an RTL Circuit Constraint Solver. Proceedings of the conference on Design, Automation and Test in Europe - Volume 2. (666-671).

    https://doi.org/10.1109/DATE.2005.127

  • Bozzano M, Bruttomesso R, Cimatti A, Junttila T, van Rossum P, Schulz S and Sebastiani R. (2005). MathSAT: Tight Integration of SAT and Mathematical Decision Procedures. SAT 2005. 10.1007/978-1-4020-5571-3_12. (265-293).

    http://link.springer.com/10.1007/978-1-4020-5571-3_12