A note on Coinduction and Weak Bisimilarity for While Programs
RAIRO-Theor. Inf. Appl., 33 4-5 (1999) 393-400
Published online: 2002-08-15
Articles citing this article
The Citing articles tool gives a list of articles citing the current article.
The citing articles come from EDP Sciences database, as well as other publishers participating in CrossRef Cited-by Linking Program. You can set up your personal account to receive an email alert each time this article is cited by a new article (see the menu on the right-hand side of the abstract page).
Cited article:
This article has been cited by the following article(s):
12094 155 (2020)
https://doi.org/10.1007/978-3-030-57201-3_9
Unguarded Recursion on Coinductive Resumptions
Sergey Goncharov, Christoph Rauch and Lutz SchröderElectronic Notes in Theoretical Computer Science 319 183 (2015)
https://doi.org/10.1016/j.entcs.2015.12.012
Advanced Information Systems Engineering
Tomasz BrengosLecture Notes in Computer Science, Advanced Information Systems Engineering 7908 75 (2014)
https://doi.org/10.1007/978-3-662-44124-4_5
Monads for Behaviour
Maciej Piróg and Jeremy GibbonsElectronic Notes in Theoretical Computer Science 298 309 (2013)
https://doi.org/10.1016/j.entcs.2013.09.019
Operational semantics using the partiality monad
Nils Anders DanielssonACM SIGPLAN Notices 47 (9) 127 (2012)
https://doi.org/10.1145/2398856.2364546
Theoretical Computer Science
Tomasz BrengosLecture Notes in Computer Science, Theoretical Computer Science 7604 87 (2012)
https://doi.org/10.1007/978-3-642-33475-7_7
127 (2012)
https://doi.org/10.1145/2364527.2364546
Resumption-based big-step and small-step interpreters for While with interactive I/O
Keiko NakataElectronic Proceedings in Theoretical Computer Science 66 226 (2011)
https://doi.org/10.4204/EPTCS.66.12
Programming Languages and Systems
Keiko Nakata and Tarmo UustaluLecture Notes in Computer Science, Programming Languages and Systems 6012 488 (2010)
https://doi.org/10.1007/978-3-642-11957-6_26
Theory and Applications of Models of Computation
Natalya Gribovskaya and Irina VirbitskaiteLecture Notes in Computer Science, Theory and Applications of Models of Computation 6108 443 (2010)
https://doi.org/10.1007/978-3-642-13562-0_40
Theorem Proving in Higher Order Logics
Keiko Nakata and Tarmo UustaluLecture Notes in Computer Science, Theorem Proving in Higher Order Logics 5674 375 (2009)
https://doi.org/10.1007/978-3-642-03359-9_26
Verification of the correctness of compiler optimization using co-induction
M. Thiyagarajan and N. SairamJournal of Discrete Mathematical Sciences and Cryptography 10 (3) 329 (2007)
https://doi.org/10.1080/09720529.2007.10698123
Weak Bisimulation for Action-Type Coalgebras
Ana Sokolova, Erik de Vink and Harald WoracekElectronic Notes in Theoretical Computer Science 122 211 (2005)
https://doi.org/10.1016/j.entcs.2004.06.050
A coalgebraic approach to Kleene algebra with tests
Hubie Chen and Riccardo PucellaTheoretical Computer Science 327 (1-2) 23 (2004)
https://doi.org/10.1016/j.tcs.2004.07.020
A Coalgebraic Approach to Kleene Algebra with Tests
Hubie Chen and Riccardo PucellaElectronic Notes in Theoretical Computer Science 82 (1) 94 (2003)
https://doi.org/10.1016/S1571-0661(04)80634-0
A Syntactical Approach to Weak (Bi-)Simulation for Coalgebras
Jan RotheElectronic Notes in Theoretical Computer Science 65 (1) 270 (2002)
https://doi.org/10.1016/S1571-0661(04)80368-2
Towards Weak Bisimulation For Coalgebras
Jan Rothe and Dragan MašulovićElectronic Notes in Theoretical Computer Science 68 (1) 32 (2002)
https://doi.org/10.1016/S1571-0661(04)80499-7