( en | de | ru )

 

Disambiguation of "Dillig, Thomas"

Author of the publication

copydeleteadd this publication to your clipboard
Consolidation of queries with user-defined functions.

, , , , and . PLDI, page 554-564. ACM, (2014)

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 Dillig

Peter Dillig

Rudolf Dillig

Manfred Dillig

Thomas Thomas

 

Other publications of authors with the same name

Minimum Satisfying Assignments for SMT., , , and . CAV, volume 7358 of Lecture Notes in Computer Science, page 394-409. Springer, (2012)Cuts from Proofs: A Complete and Practical Technique for Solving Linear Inequalities over Integers., , and . CAV, volume 5643 of Lecture Notes in Computer Science, page 233-247. Springer, (2009)Cuts from proofs: a complete and practical technique for solving linear inequalities over integers., , and . Formal Methods Syst. Des., 39 (3): 246-260 (2011)Precise and compact modular procedure summaries for heap manipulating programs., , , and . PLDI, page 567-577. ACM, (2011)Automated Inference of Library Specifications for Source-Sink Property Verification., , and . APLAS, volume 8301 of Lecture Notes in Computer Science, page 290-306. Springer, (2013)Reasoning about the unknown in static analysis., , and . Commun. ACM, 53 (8): 115-123 (2010)Bottom-Up Context-Sensitive Pointer Analysis for Java., , , and . APLAS, volume 9458 of Lecture Notes in Computer Science, page 465-484. Springer, (2015)Optimal Guard Synthesis for Memory Safety., , and . CAV, volume 8559 of Lecture Notes in Computer Science, page 491-507. Springer, (2014)A modular and symbolic approach to static program analysis.. Stanford University, USA, (2011)Consolidation of queries with user-defined functions., , , , and . PLDI, page 554-564. ACM, (2014)