Back to Results
First PageMeta Content
Model theory / Logic in computer science / Constraint programming / Electronic design automation / Formal methods / Satisfiability Modulo Theories / Boolean satisfiability problem / First-order logic / Interpretation / Mathematical logic / Theoretical computer science / Mathematics


Software Synthesis Procedures ∗ Viktor Kuncak Mikaël Mayer LARA, I&C
Add to Reading List

Document Date: 2011-12-03 07:53:01

Open Document

File Size: 378,74 KB

Share Result on Facebook

Company

Prentice-Hall Inc. / Artima Press / /

Country

United States / /

Currency

USD / /

/

Facility

C Swiss Federal Institute of Technology / /

IndustryTerm

parametric solution / quantifier elimination algorithms / verification systems / mixed interpretation-compilation solutions / trivial solution / overall compile-time processing / constraint solving algorithms / synthesis algorithms / cardinality operator / candidate solutions / important practical applications / software synthesis algorithms / /

Organization

Swiss Federal Institute of Technology / FV(pre) / /

Person

K. Zee / V / Viktor Kuncak Mikaël Mayer / Philippe Suter / Ruzica Piskac / /

/

Position

interpreter / /

ProgrammingLanguage

Haskell / J / K / Scala / /

Technology

alpha / outlining synthesis algorithms / constraint solving algorithms / synthesis algorithms / Java / software synthesis algorithms / quantifier elimination algorithms / extending quantifier elimination algorithms / /

URL

http /

SocialTag