Author:
Möller Bernhard,Hoare Tony
Publisher
Springer International Publishing
Reference32 articles.
1. Graduate Texts in Computer Science;R Back,1998
2. de Bakker, J., Meertens, L.: On the completeness of the inductive assertion method. J. Comput. Syst. Sci. 11(3), 323–357 (1975)
3. Lecture Notes in Computer Science;A Blikle,1977
4. Brink, C., Rewitzky, I.: A Paradigm for Program Semantics: Power Structures and Duality. CSLI Publications, Stanford (2001)
5. Conway, J.: Regular Algebra and Finite Machines. Chapman and Hall, London (1971)
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Trimming the Hedges: An Algebra to Tame Concurrency;Theories of Programming;2021-10-02
2. Generating Posets Beyond N;Relational and Algebraic Methods in Computer Science;2020
3. Non-associative Kleene Algebra and Temporal Logics;Relational and Algebraic Methods in Computer Science;2017
4. Developments in concurrent Kleene algebra;Journal of Logical and Algebraic Methods in Programming;2016-06