scientific article; zbMATH DE number 1798183
From MaRDI portal
Publication:4553256
zbMATH Open0996.68559MaRDI QIDQ4553256FDOQ4553256
Authors: Jean-Christophe Filliâtre, Sam Owre, Harald Rueß, Natarajan Shankar 
Publication date: 4 November 2002
Title of this publication is not available (Why is that?)
Computing methodologies and applications (68U99) Specification and verification (program logics, model checking, etc.) (68Q60)
Cited In (20)
- Preface to the special issue ``SI: satisfiability modulo theories
- Generalizing DPLL and satisfiability for equalities
- Efficient theory combination via Boolean search
- A survey on temporal logics for specifying and verifying real-time systems
- Verifying a signature architecture: a comparative case study
- \textsf{CC(X)}: semantic combination of congruence closure with solvable theories
- An integrated approach to high integrity software verification
- Design and results of the first satisfiability modulo theories competition (SMT-COMP 2005)
- Strategies for combining decision procedures
- A framework for satisfiability modulo theories
- A randomized satisfiability procedure for arithmetic and uninterpreted function symbols
- Building small equality graphs for deciding equality logic with uninterpreted functions
- Equality detection for linear arithmetic constraints
- ICS
- Delayed theory combination vs. Nelson-Oppen for satisfiability modulo theories: a comparative analysis
- Embedded software verification using symbolic execution and uninterpreted functions
- M\textbf{ath}SAT: Tight integration of SAT and mathematical decision procedures
- Variant-Based Satisfiability in Initial Algebras
- Translation and run-time validation of loop transformations
- Bounded model checking for timed automata
Uses Software
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4553256)
