Author of the publication

Specifying and Verifying Secrecy in Workflows with Arbitrarily Many Agents.

, , and . ATVA, volume 9938 of Lecture Notes in Computer Science, page 157-173. (2016)

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

Parameter-Reduction of Higher Level Grammars (Extended Abstract).. CAAP, volume 299 of Lecture Notes in Computer Science, page 52-71. Springer, (1988)Equivalence of Finite-Valued Bottom-up Finite State Tree Transducers Is Decidable.. CAAP, volume 431 of Lecture Notes in Computer Science, page 269-284. Springer, (1990)Games through Nested Fixpoints., and . CAV, volume 5643 of Lecture Notes in Computer Science, page 291-305. Springer, (2009)Haskell Overloading is DEXPTIME-Complete.. Inf. Process. Lett., 52 (2): 57-60 (1994)Earliest Normal Form and Minimization for Bottom-up Tree Transducers., , and . Int. J. Found. Comput. Sci., 22 (7): 1607-1623 (2011)Model-Checking for L2. Universität Trier, Mathematik/Informatik, Forschungsbericht, (1997)Interprocedural Invariants, , and . Universität Trier, Mathematik/Informatik, Forschungsbericht, (2002)On the Balancedness of Tree-to-Word Transducers., , and . DLT, volume 12086 of Lecture Notes in Computer Science, page 222-236. Springer, (2020)A Note on Karr's algorithm, and . Proc. Intl. Conference on Automata, Languages and Programming (ICALP), volume 3142 of LNCS, page 1016--1028. (2004)Transparent teleteaching., and . ASCILITE, page 749-758. UNITEC Institute of Technology, Auckland, New Zealand, (2002)