Back to Results
First PageMeta Content
Constraint programming / Logic in computer science / Automated theorem proving / Electronic design automation / NP-complete problems / Satisfiability Modulo Theories / Boolean satisfiability problem / Uninterpreted function / Decision problem / Theoretical computer science / Mathematics / Applied mathematics


Document Date: 2012-05-29 03:59:19

Open Document

File Size: 267,13 KB

Share Result on Facebook

Company

Ford / Microsoft / /

Event

Product Recall / Product Issues / /

IndustryTerm

verification tools / function applications / propositional search / congruence closure algorithm / shortest path network algorithms / search using conflict / polynomial saturation algorithm / dynamic symbolic execution tools / ad-hoc solutions / search methods / resolution systems / be solved using efficient shortest path network algorithms / /

Person

Nikolaj Bjørner / Robert Mateescu / Lucas Bordeaux / Youssef Hamadi / /

Product

connections / complexity of solving conjunctions / /

Technology

simulation / Downey-Tarjan-Sethi congruence closure algorithm / Fulkerson algorithm / shortest path network algorithms / polynomial saturation algorithm / /

SocialTag