( en | de | ru )

 

Disambiguation of "Moller, Faron"

Author of the publication

copydeleteadd this publication to your clipboard
Rooting Formal Methods Within Higher Education Curricula for Computer Science and Software Engineering - A White Paper -.

, , , , , , , , , , , , and . FMFun, volume 1301 of Communications in Computer and Information Science, page 1-26. Springer, (2019)

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.

Renata Faron-Bartels

Renata Faron-Bartels

Renata Faron-Bartels

Renata Faron-Bartels

Michael Nimsch-Faron

 

Other publications of authors with the same name

A Polynomial-Time Algorithm for Deciding Bisimulation Equivalence of Normed Basic Parallel Processes., , and . Math. Struct. Comput. Sci., 6 (3): 251-259 (1996)A Polynomial Algorithm for Deciding Bisimilarity of Normed Context-Free Processes., , and . Theor. Comput. Sci., 158 (1&2): 143-159 (1996)The Edinburgh Concurrency Workbench User Manual, and . (1999)Technocamps: Advancing Computer Science Education in Wales., and . WiPSCE, page 121-126. ACM, (2015)The Importance of the Left Merge Operator in Process Algebras.. ICALP, volume 443 of Lecture Notes in Computer Science, page 752-764. Springer, (1990)Formal Methods in Computation.. Comput. J., 45 (1): 1 (2002)Weak Bisimulation Approximants., , and . CSL, volume 4207 of Lecture Notes in Computer Science, page 365-379. Springer, (2006)Verification of Parallel Systems via Decomposition., and . CONCUR, volume 630 of Lecture Notes in Computer Science, page 62-76. Springer, (1992)Teaching Them Early: Formal Methods in School., , , and . FMFun, volume 1301 of Communications in Computer and Information Science, page 173-190. Springer, (2019)On the Computational Complexity of Bisimulation, Redux., and . PCK50, page 55-59. ACM, (2003)