PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "Teige, Tino"

Author of the publication

copydeleteadd this publication to your clipboard
Proof certificates and non-linear arithmetic constraints.

, , , and . DDECS, page 429-434. IEEE Computer Society, (2011)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Dr. Tino Buchholz University of Stuttgart

 

Other publications of authors with the same name

Engineering constraint solvers for automatic analysis of probabilistic hybrid automata., , and . J. Log. Algebr. Program., 79 (7): 436-466 (2010)Incremental Bounded Model Checking for Embedded Software (extended version)., , , , , and . CoRR, (2014)Proofs of Unsatisfiability for mixed Boolean and Non-linear Arithmetic Constraint Formulae., , , and . MBMV, page 27-36. Universitätsbibliothek Berlin, Germany, (2009)Efficient Solving of Large Non-linear Arithmetic Constraint Systems with Complex Boolean Structure., , , , and . JSAT, 1 (3-4): 209-236 (2007)Stochastic Satisfiability Modulo Theories for Non-linear Arithmetic., and . CPAIOR, volume 5015 of Lecture Notes in Computer Science, page 248-262. Springer, (2008)Resolution for Stochastic Boolean Satisfiability., and . LPAR (Yogyakarta), volume 6397 of Lecture Notes in Computer Science, page 625-639. Springer, (2010)Generalized Craig Interpolation for Stochastic Boolean Satisfiability Problems with Applications to Probabilistic State Reachability and Region Stability., and . Logical Methods in Computer Science, (2012)Generalized Craig Interpolation for Stochastic Boolean Satisfiability Problems., and . TACAS, volume 6605 of Lecture Notes in Computer Science, page 158-172. Springer, (2011)Superposition Modulo Non-linear Arithmetic., , , , , and . FroCoS, volume 6989 of Lecture Notes in Computer Science, page 119-134. Springer, (2011)Stochastic satisfiability modulo theories: a symbolic technique for the analysis of probabilistic hybrid systems.. Carl von Ossietzky University of Oldenburg, (2012)