Back to Results
First PageMeta Content
Mathematics / Logic in computer science / Electronic design automation / Formal methods / NP-complete problems / Satisfiability Modulo Theories / Boolean satisfiability problem / Constraint satisfaction problem / Solver / Theoretical computer science / Constraint programming / Applied mathematics


Don’t care in SMT—Building flexible yet efficient abstraction/refinement solvers1 Andreas Bauer∗ , Martin Leucker∗∗, Christian Schallhart∗∗, Michael Tautschnig∗∗ ∗ ∗∗
Add to Reading List

Document Date: 2007-11-26 20:10:39


Open Document

File Size: 138,07 KB

Share Result on Facebook

Company

ABsolverDC (a) AB / LG / Computer Sciences Laboratory / ABsolverDC (b) AB / Intel / /

Facility

COIN-OR library / /

IndustryTerm

electronic car steering control system / minimisation algorithm / iterative minimisation algorithm / negated abstract solution / arbitrary complete solution / concrete solution / search process / generalised solution / generalisation algorithm / minimal solution / then search / visited search space / particular tool / minimal solutions / integrated algorithms / online solving approach / stand-alone tool / abstract complete solution / hybrid control systems / given solution / obtained minimal solution / possible solutions / incomplete solutions / Abstract solutions / search space / constraint-handling systems / /

Organization

Technische Universität München / Satisfiability Modulo Theories / U.S. Securities and Exchange Commission / Australian National University / /

Person

Michael Tautschnig / Christian Schallhart / Martin Leucker / Andreas Bauer / /

Position

representative / /

ProgrammingLanguage

MATLAB / DC / Simulink / C++ / /

Technology

solving algorithm / corresponding algorithm / RAM / 2 Iterative minimisation algorithm / iterative minimisation algorithm / minimisation algorithm / 3 Solving algorithm / separate generalisation algorithm / /

URL

http /

SocialTag