PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "Waldmann, Uwe"

Author of the publication

copydeleteadd this publication to your clipboard
Exact and fully symbolic verification of linear hybrid automata with large discrete state spaces.

, , , , , , , and . Sci. Comput. Program., 77 (10-11): 1122-1150 (2012)

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.

Andreas Waldmann University of Stuttgart

Dr. rer. nat. Clara Waldmann University of Stuttgart

Dr. Uwe Gaisbauer University of Stuttgart

Hon. -Prof. Dr. Uwe Pfenning University of Stuttgart

Prof. Uni. Reg. de Blumenau Uwe Menzel University of Stuttgart

 

Other publications of authors with the same name

Exact and fully symbolic verification of linear hybrid automata with large discrete state spaces., , , , , , , and . Sci. Comput. Program., 77 (10-11): 1122-1150 (2012)A Combined Superposition and Model Evolution Calculus., and . J. Autom. Reasoning, 47 (2): 191-227 (2011)Theorem Proving in Cancellative Abelian Monoids (Extended Abstract)., and . CADE, volume 1104 of Lecture Notes in Computer Science, page 388-402. Springer, (1996)Modular Proof Systems for Partial Functions with Weak Equality., , and . IJCAR, volume 3097 of Lecture Notes in Computer Science, page 168-182. Springer, (2004)Cancellative Abelian Monoids and Related Structures in Refutational Theorem Proving (Part II).. J. Symb. Comput., 33 (6): 831-861 (2002)Comparing Instance Generation Methods for Automated Reasoning., and . J. Autom. Reasoning, 38 (1-3): 57-78 (2007)Semantics of Order-Sorted Specifications.. Theor. Comput. Sci., 94 (1): 1-35 (1992)Hierarchic Superposition Revisited.. PAAR@IJCAR, volume 31 of EPiC Series in Computing, page 1. EasyChair, (2014)Superposition with Simplification as a Desision Procedure for the Monadic Class with Equality., , and . Kurt Gödel Colloquium, volume 713 of Lecture Notes in Computer Science, page 83-96. Springer, (1993)Formalization of Recursive Path Orders for Lambda-Free Higher-Order Terms., , and . Archive of Formal Proofs, (2016)