Satisfiability modulo theories: an appetizer

DOI10.1007/978-3-642-10452-7_3MaRDI QIDQ3651277zbMATH OpenOpenAlexFDO

Authors Leonardo de Moura, Nikolaj Bjørner

Publication date 9 December 2009

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-10452-7_3

Mathematics Subject Classification ID

Logic in computer science (03B70) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Foundations of satisfiability modulo theories
• Satisfiability modulo theories
• A Tutorial on Satisfiability Modulo Theories
• A survey of satisfiability modulo theory
• Satisfiability checking: theory and applications

Cited in

(16)

• A framework for satisfiability modulo theories
• A theory of formal synthesis via inductive learning
• Modular instantiation schemes
• Combined task- and network-level scheduling for distributed time-triggered systems
• Building bridges between symbolic computation and satisfiability checking
• E-matching for fun and profit
• An experiment with satisfiability modulo SAT
• Satisfiability: where Theory meets Practice (Invited Talk).
• Verification conditions for source-level imperative programs
• Foundations of satisfiability modulo theories
• Satisfiability checking and symbolic computation
• A Progressive Simplifier for Satisfiability Modulo Theories
• Reasoning about vectors: satisfiability modulo a theory of sequences
• SMT-based verification of program changes through summary repair
• Reasoning and inference for (maximum) satisfiability: new insights
• Satisfiability modulo theories for verifying MILP certificates

This page was built for publication: Satisfiability modulo theories: an appetizer

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