Author of the publication

Equational approximations for tree automata completion.

, and . J. Symb. Comput., 45 (5): 574-597 (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.

 

Other publications of authors with the same name

Proving partial-correctness and invariance properties of transition-system models., , and . Sci. Comput. Program., (2020)Uniformity for the Decidability of Hybrid Automata., and . SAS, volume 1145 of Lecture Notes in Computer Science, page 301-316. Springer, (1996)Verifying Periodic Task-Control Systems.. HART, volume 1201 of Lecture Notes in Computer Science, page 63-68. Springer, (1997)Embedding domain-specific modelling languages in maude specifications.. ACM SIGSOFT Softw. Eng. Notes, 36 (1): 1-8 (2011)Ensuring the conformance of reactive discrete-event systems using supervisory control., , , and . CDC, page 2692-2697. IEEE, (2003)Symbolic Determinisation of Extended Automata., , and . IFIP TCS, volume 209 of IFIP, page 197-212. Springer, (2006)Symbolic execution based on language transformation., , and . Comput. Lang. Syst. Struct., (2015)Defining and Reasoning About Recursive Functions: A Practical Tool for the Coq Proof Assistant., , , and . FLOPS, volume 3945 of Lecture Notes in Computer Science, page 114-129. Springer, (2006)Task-System Analysis Using Slope-Parametric Hybrid Automata., and . Euro-Par, volume 1300 of Lecture Notes in Computer Science, page 1262-1273. Springer, (1997)On Proving Safety Properties by Integrating Static Analysis, Theorem Proving and Abstraction., and . TACAS, volume 1579 of Lecture Notes in Computer Science, page 178-192. Springer, (1999)