default search action
4th CALCO 2011: Winchester, UK
- Andrea Corradini, Bartek Klin, Corina Cîrstea:
Algebra and Coalgebra in Computer Science - 4th International Conference, CALCO 2011, Winchester, UK, August 30 - September 2, 2011. Proceedings. Lecture Notes in Computer Science 6859, Springer 2011, ISBN 978-3-642-22943-5
Invited Talks
- Giorgio Bacci, Vincent Danos, Ohad Kammar:
On the Statistical Thermodynamics of Reversible Communicating Processes. 1-18 - Javier Esparza, Michael Luttenberger:
Solving Fixed-Point Equations by Derivation Tree Analysis. 19-35 - Thomas Dinsdale-Young, Philippa Gardner, Mark J. Wheelhouse:
Abstract Local Reasoning for Program Modules. 36-39 - Gopal Gupta, Neda Saeedloei, Brian W. DeVries, Richard Min, Kyle Marple, Feliks Kluzniak:
Infinite Computation, Co-induction and Computational Logic. 40-54
Contributed Papers
- Jirí Adámek, Mahdieh Haddadi, Stefan Milius:
From Corecursive Algebras to Corecursive Monads. 55-69 - Thorsten Altenkirch, Peter Morris, Fredrik Nordvall Forsberg, Anton Setzer:
A Categorical Semantics for Inductive-Inductive Definitions. 70-84 - Adriana Balan, Alexander Kurz:
Finitary Functors: From Set to Preord and Poset. 85-99 - Jort Bergfeld, Yde Venema:
Model Constructions for Moss' Coalgebraic Logic. 100-114 - Marta Bílková, Alexander Kurz, Daniela Petrisan, Jirí Velebil:
Relation Liftings on Preorders and Posets. 115-129 - Corina Cîrstea:
Model Checking Linear Coalgebraic Temporal Logics: An Automata-Theoretic Approach. 130-144 - Mihai Codescu, Till Mossakowski:
Refinement Trees: Calculi, Tools, and Applications. 145-160 - Fredrik Dahlqvist, Dirk Pattinson:
On the Fusion of Coalgebraic Logics. 161-175 - Clément Fumex, Neil Ghani, Patricia Johann:
Indexed Induction and Coinduction, Fibrationally. 176-191 - Murdoch James Gabbay, Tadeusz Litak, Daniela Petrisan:
Stone Duality for Nominal Boolean Algebras with И. 192-207 - Sergey Goncharov, Lutz Schröder:
A Counterexample to Tensorability of Effects. 208-221 - Ichiro Hasuo:
The Microcosm Principle and Compositionality of GSOS-Based Component Calculi. 222-236 - Bart Jacobs:
Bases as Coalgebras. 237-252 - Jun Kohjina, Toshimitsu Ushio, Yoshiki Kinoshita:
A Coalgebraic Approach to Supervisory Control of Partially Observed Mealy Automata. 253-267 - Ekaterina Komendantskaya, John Power:
Coalgebraic Semantics for Derivations in Logic Programming. 268-282 - Manuel A. Martins, Alexandre Madeira, Razvan Diaconescu, Luís Soares Barbosa:
Hybridization of Institutions. 283-297 - Rasmus Ejlers Møgelberg, Sam Staton:
Linearly-Used State in Models of Call-by-Value. 298-313 - Camilo Rocha, José Meseguer:
Proving Safety Properties of Rewrite Theories. 314-328 - Katsuhiko Sano:
Generalized Product of Coalgebraic Hybrid Logics. 329-343 - Baltasar Trancón y Widemann, Michael Hauhs:
Distributive-Law Semantics for Cellular Automata and Agent-Based Models. 344-358 - Joost Winter, Marcello M. Bonsangue, Jan J. M. M. Rutten:
Context-Free Languages, Coalgebraically. 359-376
CALCO Tools Workshop
- Dorel Lucanu:
Preface to CALCO-Tools. 377 - Luca Aceto, Georgiana Caltais, Eugen-Ioan Goriac, Anna Ingólfsdóttir:
PREG Axiomatizer - A Ground Bisimilarity Checker for GSOS with Predicates. 378-385 - Musab AlTurki, José Meseguer:
PVeStA: A Parallel Statistical Model Checking and Quantitative Analysis Tool. 386-392 - Ulrich Berger, Kenji Miyamoto, Helmut Schwichtenberg, Monika Seisenberger:
Minlog - A Tool for Program Extraction Supporting Algebras and Coalgebras. 393-399 - Francisco Durán, Camilo Rocha, José María Álvarez:
Tool Interoperability in the Maude Formal Environment. 400-406 - Jennifer Lantair, Pawel Sobocinski:
WiCcA : LTS Generation Tool for Wire Calculus. 407-412 - André Martins, Luís Soares Barbosa, Nuno F. Rodrigues:
Shacc: A Functional Prototyper for a Component Calculus. 413-419
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.