Description |
1 online resource (xiii, 419 pages) : illustrations |
Series |
Lecture notes in computer science, 0302-9743 ; 6859 |
|
LNCS sublibrary. SL 1, Theoretical computer science and general issues |
|
Lecture notes in computer science ; 6859. 0302-9743
|
|
LNCS sublibrary. SL 1, Theoretical computer science and general issues.
|
Contents |
Intro; Titlepage; Preface; Organization; Table of Contents; Invited Talks; On the Statistical Thermodynamics of Reversible Communicating Processes; Introduction; Energy Landscaping; Related Work; Outline; Probabilistic Reminders; Timers and Chains; Equilibrium; Potentials; Qualitative Semantics; Memories and Transitions; Near Acyclicity and Simplicity; An Aside on Degenerate Sums; Which Potential to Look for?; Concurrent Potentials; Total Stack Size Potential; Total Synch Potential; V1 vs. V0; Explosive Growth; Main Statement; Lower Bound on the Potential; Upper Bound on the Number of Traces |
|
ConvergenceDiscussion; Conclusion; References; Solving Fixed-Point Equations by Derivation Tree Analysis; Introduction; Polynomial Equations Over Semirings; From Equations to Grammars; Newton's Approximation; Convergence of Newton's Method in Commutative Semirings; Derivation Tree Analysis for Idempotent Semirings; 1-bounded Semirings; Star-distributive Semirings; Conclusions; References; Abstract Local Reasoning for Program Modules; References; Infinite Computation, Co-induction and Computational Logic; Introduction; Coinduction and Logic Programming; Model Checking with Co-LP |
|
Examples of Inductive-Inductive DefinitionsPreliminaries and Notation; Inductive-Inductive Definitions as Dialgebras; A Category for Inductive-Inductive Definitions; How to Exploit Initiality: An Example; Relationship to Induction-Induction as Axiomatised in nordvallforsbergSetzer2010indind; The Elimination Principle; Warm-Up: A Generic Eliminator for an Inductive Definition; The Generic Eliminator for an Inductive-Inductive Definition; The Equivalence between Having an Eliminator and Being Initial; Conclusions and Future Work; References; Finitary Functors: From Set to Preord and Poset |
|
IntroductionPreliminaries; From Set to Preord; Extension and Lifting; First Construction: Order on the Variables; Second Construction: Order on the Operations; Lifting T to T̂ Using Relators; Preorder on the Final Coalgebra; Third Construction: Order the Variables and Operations; From Preord to Poset; Conclusion; References; Model Constructions for Moss' Coalgebraic Logic; Introduction; Preliminaries; Moss' Logic and Its Axiomatization; Moss' Logic; The Derivation System M; One-Step Soundness and Completeness; A Finite Model Construction; Strong Completeness; References |
Summary |
Annotation This volume constitutes the refereed proceedings of the 4th International Conference on Algebra and Coalgebra in Computer Science, CALCO 2011, held in Winchester, UK, in August/September 2011. The 21 full papers presented together with 4 invited talks were carefully reviewed and selected from 41 submissions |
Bibliography |
Includes bibliographical references and index |
Notes |
Print version record |
Subject |
Computer science -- Mathematics -- Congresses
|
|
Algebra -- Congresses
|
|
Informatique.
|
|
Algebra
|
|
Computer science -- Mathematics
|
Genre/Form |
proceedings (reports)
|
|
Conference papers and proceedings
|
|
Conference papers and proceedings.
|
|
Actes de congrès.
|
Form |
Electronic book
|
Author |
Corradini, Andrea, 1960-
|
|
Klin, Bartek.
|
|
Cîrstea, Corina.
|
ISBN |
9783642229442 |
|
3642229441 |
|