PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "Tautschnig, Michael"

Author of the publication

copydeleteadd this publication to your clipboard
Don't care in SMT: building flexible yet efficient abstraction/refinement solvers.

, , , and . STTT, 12 (1): 23-37 (2010)

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.

Michael Böhm

Michael Funk

Hon. -Prof. Dr. -Ing. Michael Bauer University of Stuttgart

Dr. Michael Wachowsky University of Stuttgart

Dr. phil. Michael Nerurkar University of Stuttgart

 

Other publications of authors with the same name

Compatibility and reuse in component-based systems via type and unit inference., , and . EUROMICRO-SEAA, page 101-108. IEEE Computer Society, (2007)CBMC - C Bounded Model Checker - (Competition Contribution)., and . TACAS, volume 8413 of Lecture Notes in Computer Science, page 389-391. Springer, (2014)Partial Orders for Efficient BMC of Concurrent Software, , and . CoRR, (2013)Partial Orders for Efficient Bounded Model Checking of Concurrent Software., , and . CAV, volume 8044 of Lecture Notes in Computer Science, page 141-157. Springer, (2013)Automatic generation of systemc models from component-based designs for early design validation and performance analysis., , , and . WOSP, page 139-144. ACM, (2008)Don't care in SMT: building flexible yet efficient abstraction/refinement solvers., , , and . STTT, 12 (1): 23-37 (2010)Timely Time Estimates., , , and . ISoLA (1), volume 6415 of Lecture Notes in Computer Science, page 33-46. Springer, (2010)Proving Reachability Using FShell - (Competition Contribution)., , , , and . TACAS, volume 7214 of Lecture Notes in Computer Science, page 538-541. Springer, (2012)Tests from Witnesses - Execution-Based Validation of Verification Results., , , and . TAP, volume 10889 of Lecture Notes in Computer Science, page 3-23. Springer, (2018)On the Structure and Complexity of Rational Sets of Regular Languages., , , and . FSTTCS, volume 24 of LIPIcs, page 377-388. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, (2013)