Author of the publication

Efficient deductive methods for program analysis.

. POPL, page 102-103. ACM, (2001)ACM SIGPLAN Notices 36(3), March 2001.

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.

 

Other publications of authors with the same name

A note on termination in combinatiosn of heterogeneous term rewriting systems., and . Bulletin of the EATCS, (1987)Efficient Implementation of the Graphical Input/Output for Smalltalk-80., and . GI Jahrestagung (1), volume 126 of Informatik-Fachberichte, page 151-164. Springer, (1986)Rigid Reachability, The Non-Symmetric Form of Rigid E-Unification., , and . Int. J. Found. Comput. Sci., 11 (1): 3-27 (2000)Chaining techniques for automated theorem proving in finitely-valued logics, and . Proceedings of the 30th Intl Symp. Multi-valued Logics, page 337--344. Portland, Oregon, IEEE Computer Society Press, (May 2000)Strukturelle Zusammenhänge zwischen Funktionalen Sprachbeschreibungen und Übersetzerbeschreibungen. GI Fachgespräch ``Compiler-Compiler'', Fachbereich Informatik, Tech. Hochschule Darmstadt, Berlin, (1978)Deriving Proof Rules for Programming Language Constructs from Static and Dynamic Attribute Structures. ??unknown reference??, (August 1977)DPLL( T): Fast Decision Procedures., , , , and . CAV, volume 3114 of Lecture Notes in Computer Science, page 175-188. Springer, (2004)Strict Basic Superposition., and . CADE, volume 1421 of Lecture Notes in Computer Science, page 160-174. Springer, (1998)Shostak Light.. CADE, volume 2392 of Lecture Notes in Computer Science, page 332-346. Springer, (2002)Ordered Chaining for Total Orderings., and . CADE, volume 814 of Lecture Notes in Computer Science, page 435-450. Springer, (1994)