Reasoning about vectors: satisfiability modulo a theory of sequences
From MaRDI portal
Recommendations
- Reasoning about vectors using an SMT theory of sequences
- Satisfiability modulo theories and assignments
- A Tutorial on Satisfiability Modulo Theories
- Modalities in vector logic
- Satisfiability modulo theories: an appetizer
- Satisfiability modulo theories
- A survey of satisfiability modulo theory
- Foundations of satisfiability modulo theories
- A framework for satisfiability modulo theories
- From Propositional Satisfiability to Satisfiability Modulo Theories
Cites work
- A mathematical introduction to logic.
- An abstract decision procedure for a theory of inductive data types.
- Cardinality constraints for arrays (decidability results and applications)
- Frontiers of Combining Systems
- Interpolation and amalgamation for arrays with MaxDiff
- Path Feasibility Analysis for String-Manipulating Programs
- Polite theories revisited
- Proving termination with multiset orderings
- Reasoning about vectors using an SMT theory of sequences
- Satisfiability modulo theories
- Scaling up DPLL(T) string solvers using context-dependent simplification
- 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
- Weakly equivalent arrays
This page was built for publication: Reasoning about vectors: satisfiability modulo a theory of sequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6053845)
