Satisfiability Modulo Theories: An Appetizer

DOI10.1007/978-3-642-10452-7_3zbMath1266.03047OpenAlexW1936354298MaRDI QIDQ3651277

Nikolaj Bjørner, Leonardo de Moura

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

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

Related Items (5)

A theory of formal synthesis via inductive learning ⋮ SMT-based verification of program changes through summary repair ⋮ Modular instantiation schemes ⋮ Verification conditions for source-level imperative programs ⋮ Combined task- and network-level scheduling for distributed time-triggered systems

This page was built for publication: Satisfiability Modulo Theories: An Appetizer