Reasoning about vectors using an SMT theory of sequences

DOI10.1007/978-3-031-10769-6_9OpenAlexW4280549737MaRDI QIDQ2104504FDOQ2104504

Authors: Ying Sheng, Andres Nötzli, Andrew Reynolds, Yoni Zohar, David L. Dill, Wolfgang Grieskamp, Junkil Park, Shaz Qadeer, Clark Barrett, Cesare Tinelli 

Publication date: 7 December 2022

Full work available at URL: https://arxiv.org/abs/2205.08095

Mathematics Subject Classification ID

Theorem proving (automated and interactive theorem provers, deduction, resolution, etc.) (68V15)

Cites Work

• A mathematical introduction to logic.
• Simplification by Cooperating Decision Procedures
• Solving SAT and SAT modulo theories, from an abstract Davis-Putnam-Logemann-Loveland procedure to \(\operatorname{DPLL}(T)\)
• Splitting on Demand in SAT Modulo Theories
• Satisfiability modulo theories
• Path Feasibility Analysis for String-Manipulating Programs
• Frontiers of Combining Systems
• Polite theories revisited
• Weakly equivalent arrays
• Cardinality constraints for arrays (decidability results and applications)
• Scaling up DPLL(T) string solvers using context-dependent simplification

Cited In (3)

• Reasoning about vectors: satisfiability modulo a theory of sequences
• A Theory of Cartesian Arrays (with Applications in Quantum Circuit Verification)
• Rely-guarantee reasoning for causally consistent shared memory

Uses Software

• SMT-LIB
• z3
• CVC4
• Z3str3

This page was built for publication: Reasoning about vectors using an SMT theory of sequences

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2104504)