Algebra and Coalgebra in Computer Science

[1]  Alexandra Silva,et al.  Enhanced coalgebraic bisimulation , 2015, Mathematical Structures in Computer Science.

[2]  Peter Csaba Ölveczky,et al.  Sound and complete timed CTL model checking of timed Kripke structures and real-time rewrite theories , 2015, Sci. Comput. Program..

[3]  Kokichi Futatsugi,et al.  Initial semantics in logics with constructors , 2015, J. Log. Comput..

[4]  Samson Abramsky,et al.  Coalgebraic Analysis of Subgame-perfect Equilibria in Infinite Games without Discounting , 2017, Math. Struct. Comput. Sci..

[5]  Andrej Bauer,et al.  Programming with algebraic effects and handlers , 2012, J. Log. Algebraic Methods Program..

[6]  Razvan Diaconescu,et al.  Encoding hybridized institutions into first-order logic , 2016, Math. Struct. Comput. Sci..

[7]  Simon Plouffe.  Approximations de Séries Génératrices et Quelques Conjectures , 2014 .

[8]  Bruce Bueno de Mesquita,et al.  An Introduction to Game Theory , 2014 .

[9]  Kazuhiro Ogata,et al.  On Automation of OTS/CafeOBJ Method , 2014, Specification, Algebra, and Software.

[10]  Ohad Kammar,et al.  Handlers in action , 2013, ICFP.

[11]  Pawel Sobocinski,et al.  Penrose: Putting Compositionality to Work for Petri Net Reachability , 2013, CALCO.

[12]  Alexandra Silva,et al.  A Coalgebraic View of ε-Transitions , 2013, CALCO.

[13]  Sebastian Enqvist.  Homomorphisms of Coalgebras from Predicate Liftings , 2013, CALCO.

[14]  Alexander Kurz,et al.  Enriched Logical Connections , 2011, Applied Categorical Structures.

[15]  Tom Hirschowitz,et al.  Cartesian closed 2-categories and permutation equivalence in higher-order rewriting , 2013, Log. Methods Comput. Sci..

[16]  Alexander Kurz,et al.  Relation lifting, with an application to the many-valued cover modality , 2013, Log. Methods Comput. Sci..

[17]  Roberto Bruni,et al.  Connector algebras for C/E and P/T nets' interactions , 2013, Log. Methods Comput. Sci..

[18]  Bart Jacobs,et al.  Measurable Spaces and Their Effect Logic , 2013, 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science.

[19]  Tom Hirschowitz.  Full Abstraction for Fair Testing in CCS , 2013, CALCO.

[20]  Julian Rathke,et al.  Decomposing Petri nets , 2013, ArXiv.

[21]  Daniel Gorín,et al.  Simulations and Bisimulations for Coalgebraic Modal Logics , 2013, CALCO.

[22]  Robert W. J. Furber,et al.  From Kleisli Categories to Commutative C*-algebras: Probabilistic Gelfand Duality , 2013, Log. Methods Comput. Sci..

[23]  Marcelo P. Fiore,et al.  The Algebra of Directed Acyclic Graphs , 2013, Computation, Logic, Games, and Quantum Foundations.

[24]  Alexandra Silva,et al.  Generalizing determinization from automata to coalgebras , 2013, Log. Methods Comput. Sci..

[25]  Jurriaan Rot,et al.  Coalgebraic Bisimulation-Up-To , 2013, SOFSEM.

[26]  D. Pous,et al.  Checking NFA equivalence with bisimulations up to congruence , 2013, POPL.

[27]  Alexandra Silva,et al.  Sound and Complete Axiomatizations of Coalgebraic Language Equivalence , 2011, TOCL.

[28]  Jos C. M. Baeten,et al.  Reactive Turing machines , 2011, Inf. Comput..

[29]  Andrei Popescu,et al.  Noninterfering Schedulers - When Possibilistic Noninterference Implies Probabilistic Noninterference , 2013, CALCO.

[30]  Daniel Gâinâ.  Interpolation in logics with constructors , 2013, Theor. Comput. Sci..

[31]  T. Nipkow,et al.  Proving Concurrent Noninterference , 2012, CPP.

[32]  Kazuhiro Ogata,et al.  Constructor-based Logics , 2012, J. Univers. Comput. Sci..

[33]  Tomasz Brengos.  Weak Bisimulations for Coalgebras over Ordered Functors , 2012, IFIP TCS.

[34]  Jacques Sakarovitch,et al.  The Removal of Weighted ε-Transitions , 2012, CIAA.

[35]  Barbara König,et al.  Coalgebraic Trace Semantics for Probabilistic Transition Systems Based on Measure Theory , 2012, CONCUR.

[36]  Paul-André Melliès,et al.  Game Semantics in String Diagrams , 2012, 2012 27th Annual IEEE Symposium on Logic in Computer Science.

[37]  Yde Venema,et al.  Completeness for the coalgebraic cover modality , 2012, Log. Methods Comput. Sci..

[38]  Benedikt Ahrens.  Initiality for Typed Syntax and Semantics , 2012, WoLLIC.

[39]  Pierre Lescanne,et al.  “Backward” coinduction, Nash equilibrium and the rationality of escalation , 2012, Acta Informatica.

[40]  Alexander Kurz,et al.  Modalities in the Stone age: A comparison of coalgebraic logics , 2012, Theor. Comput. Sci..

[41]  Alexandra Silva,et al.  Trace semantics via determinization , 2012, J. Comput. Syst. Sci..

[42]  Yde Venema,et al.  Lax Extensions of Coalgebra Functors , 2012, CMCS.

[43]  Marcello M. Bonsangue,et al.  Defining Context-Free Power Series Coalgebraically , 2012, CMCS.

[44]  Peter Csaba Ölveczky,et al.  The SynchAADL2Maude Tool , 2012, FASE.

[45]  Peter Csaba Ölveczky,et al.  Formal Modeling and Analysis of Human Body Exposure to Extreme Heat in HI-Maude , 2012, WRLA.

[46]  Peter Csaba Ölveczky,et al.  Timed CTL Model Checking in Real-Time Maude , 2012, WRLA.

[47]  Yoshihiro Maruyama,et al.  Natural duality, modality, and coalgebra , 2012 .

[48]  T. Heinosaari,et al.  The Mathematical Language of Quantum Theory: From Uncertainty to Entanglement , 2012 .

[49]  Aleks Kissinger,et al.  Synthesising Graphical Theories , 2012, ATx/WInG@IJCAR.

[50]  Ohad Kammar,et al.  Algebraic foundations for effect-dependent optimisations , 2012, POPL '12.

[51]  Bart Jacobs,et al.  Relating Operator Spaces via Adjunctions , 2012, ArXiv.

[52]  Donald Sannella,et al.  Foundations of Algebraic Specification and Formal Software Development , 2012, Monographs in Theoretical Computer Science. An EATCS Series.

[53]  Alexandra Silva,et al.  Brzozowski's Algorithm (Co)Algebraically , 2011, Logic and Program Semantics.

[54]  Tom Hirschowitz,et al.  Innocent Strategies as Presheaves and Interactive Equivalences for CCS , 2011, Sci. Ann. Comput. Sci..

[55]  Alexandra Silva,et al.  A coalgebraic perspective on linear weighted automata , 2011, Inf. Comput..

[56]  José Luiz Fiadeiro,et al.  A model for dynamic reconfiguration in service-oriented architectures , 2012, Software & Systems Modeling.

[57]  Samson Abramsky,et al.  Big toy models - Representing physical systems as Chu spaces , 2012, Synth..

[58]  D. Sangiorgi.  Introduction to Bisimulation and Coinduction , 2011 .

[59]  Manuel A. Martins,et al.  Hybrid Specification of Reactive Systems: An Institutional Approach , 2011, SEFM.

[60]  Peter Csaba Ölveczky,et al.  Object-Oriented Formal Modeling and Analysis of Interacting Hybrid Systems in HI-Maude , 2011, SEFM.

[61]  Roberto Bruni,et al.  A Connector Algebra for P/T Nets Interactions , 2011, CONCUR.

[62]  Bartek Klin,et al.  Bialgebras for structural operational semantics: An introduction , 2011, Theor. Comput. Sci..

[63]  Ana Sokolova,et al.  Probabilistic systems coalgebraically: A survey , 2011, Theor. Comput. Sci..

[64]  A. Sokolova,et al.  Sound and Complete Axiomatization of Trace Semantics for Probabilistic Systems , 2011, MFPS.

[65]  Alexander Kurz,et al.  Finitary Functors: From Set to Preord and Poset , 2011, CALCO.

[66]  Manuel A. Martins,et al.  Hybridization of Institutions , 2011, CALCO.

[67]  Alexander Kurz,et al.  Relation Liftings on Preorders and Posets , 2011, CALCO.

[68]  Till Mossakowski,et al.  A Modular Consistency Proof for DOLCE , 2011, AAAI.

[69]  Vincenzo Ciancia.  Interaction and observation, categorically , 2011, ICE.

[70]  Nicolas Ollinger,et al.  Bulking I: An abstract theory of bulking , 2011, Theor. Comput. Sci..

[71]  David Sands,et al.  Assumptions and Guarantees for Compositional Noninterference , 2011, 2011 IEEE 24th Computer Security Foundations Symposium.

[72]  Muhammad Fadlisyah,et al.  Formal modeling and analysis of hybrid systems in rewriting logic using higher-order numerical methods and discrete-event detection , 2011, 2011 CSI International Symposium on Computer Science and Software Engineering (CSSE).

[73]  Pierre Lescanne,et al.  Rationality and Escalation in Infinite Extensive Games , 2011, ArXiv.

[74]  Sergey Goncharov,et al.  A Coinductive Calculus for Asynchronous Side-Effecting Processes , 2011, FCT.

[75]  Jean-Yves Girard,et al.  Geometry of Interaction V: Logic in the hyperfinite factor , 2011, Theor. Comput. Sci..

[76]  José Luiz Fiadeiro,et al.  An interface theory for service-oriented design , 2011, Theor. Comput. Sci..

[77]  Paul Blain Levy,et al.  Similarity Quotients as Final Coalgebras , 2011, FoSSaCS.

[78]  Alexander Kurz,et al.  Equational presentations of functors and monads , 2011, Mathematical Structures in Computer Science.

[79]  Helle Hvid Hansen,et al.  Pointwise extensions of GSOS-defined operations , 2011, Math. Struct. Comput. Sci..

[80]  Marcello M. Bonsangue,et al.  Context-Free Languages, Coalgebraically , 2011, CALCO.

[81]  Sergey Goncharov,et al.  Powermonads and Tensors of Unranked Effects , 2011, 2011 IEEE 26th Annual Symposium on Logic in Computer Science.

[82]  Lluis Godo,et al.  On the Minimum Many-Valued Modal Logic over a Finite Residuated Lattice , 2008, J. Log. Comput..

[83]  Jirí Rosický,et al.  Notions of Lawvere Theory , 2008, Appl. Categorical Struct..

[84]  Manuel A. Martins,et al.  Models as arrows: the role of dialgebras , 2011 .

[85]  Peter Csaba Ölveczky.  Semantics, Simulation, and Formal Analysis of Modeling Languages for Embedded Systems in Real-Time Maude , 2011, Formal Modeling: Actors, Open Systems, Biological Systems.

[86]  Laura Bocchi,et al.  An abstract model of service discovery and binding , 2010, Formal Aspects of Computing.

[87]  Ralf Hinze,et al.  Concrete stream calculus: An extended study , 2010, Journal of Functional Programming.

[88]  Alexandra Silva,et al.  Generalizing the powerset construction, coalgebraically , 2010, FSTTCS.

[89]  Jirí Adámek,et al.  Presentation of Set Functors: A Coalgebraic Perspective , 2010, J. Log. Comput..

[90]  Heiko Mantel,et al.  Flexible Scheduler-Independent Security , 2010, ESORICS.

[91]  Yoshihiro Maruyama,et al.  Fundamental results for pointfree convex geometry , 2010, Ann. Pure Appl. Log..

[92]  Pawel Sobocinski,et al.  Representations of Petri Net Interactions , 2010, CONCUR.

[93]  Bart Jacobs,et al.  From Coalgebraic to Monoidal Traces , 2010, CMCS@ETAPS.

[94]  Stefan Milius.  A Sound and Complete Calculus for Finite Stream Circuits , 2010, 2010 25th Annual IEEE Symposium on Logic in Computer Science.

[95]  Bart Jacobs,et al.  Involutive Categories and Monoids, with a GNS-Correspondence , 2010, ArXiv.

[96]  Dirk Pattinson,et al.  Coalgebraic Correspondence Theory , 2010, FoSSaCS.

[97]  Roman Fric,et al.  A Categorical Approach to Probability Theory , 2010, Stud Logica.

[98]  Samson Abramsky,et al.  Coalgebras, Chu Spaces, and Representations of Physical Systems , 2009, 2010 25th Annual IEEE Symposium on Logic in Computer Science.

[99]  P. Selinger.  A Survey of Graphical Languages for Monoidal Categories , 2009, 0908.3347.

[100]  H. Maassen,et al.  Quantum Probability and Quantum Information Theory , 2010 .

[101]  Gianluca Amato,et al.  On the algebraic structure of declarative programming languages , 2009, Theor. Comput. Sci..

[102]  M. Droste,et al.  Handbook of Weighted Automata , 2009 .

[103]  Grigore Rosu,et al.  CIRC: A Behavioral Verification Tool Based on Circular Coinduction , 2009, CALCO.

[104]  Dirk Pattinson,et al.  EXPTIME Tableaux for the Coalgebraic µ-Calculus , 2009, CSL.

[105]  Roberto Bruni,et al.  A Graph Syntax for Processes and Services , 2009, WS-FM.

[106]  Pierre Lescanne,et al.  Feasibility/Desirability Games for Normal Form Games, Choice Models and Evolutionary Games , 2009, ArXiv.

[107]  Catuscia Palamidessi,et al.  Explicit fairness in testing semantics , 2009, Log. Methods Comput. Sci..

[108]  B. Coecke,et al.  Classical and quantum structuralism , 2009, 0904.1997.

[109]  Gordon D. Plotkin,et al.  Handlers of Algebraic Effects , 2009, ESOP.

[110]  Alexandra Silva,et al.  A Kleene Theorem for Polynomial Coalgebras , 2009, FoSSaCS.

[111]  Carlos Areces,et al.  HTab: a Terminating Tableaux System for Hybrid Logic , 2007, M4M.

[112]  Erik P. de Vink,et al.  Coalgebraic Weak Bisimulation for Action-Type Systems , 2009, Sci. Ann. Comput. Sci..

[113]  J. Bouchaud.  Economics needs a scientific revolution , 2008, Nature.

[114]  Samson Abramsky,et al.  Categorical quantum mechanics , 2008, 0808.1023.

[115]  Jan J. M. M. Rutten.  Rational Streams Coalgebraically , 2008, Log. Methods Comput. Sci..

[116]  Joachim Kock,et al.  Polynomial Functors and Trees , 2008, 0807.2874.

[117]  Tarmo Uustalu,et al.  Comonadic Notions of Computation , 2008, CMCS.

[118]  Peter Csaba Ölveczky,et al.  The Real-Time Maude Tool , 2008, TACAS.

[119]  Michael Ummels,et al.  The Complexity of Nash Equilibria in Infinite Multiplayer Games , 2008, FoSSaCS.

[120]  Raheel Ahmad,et al.  The π-Calculus: A theory of mobile processes , 2008, Scalable Comput. Pract. Exp..

[121]  José Meseguer,et al.  Decision Procedures for Equationally Based Reasoning , 2008 .

[122]  Ana Sokolova,et al.  Generic Trace Semantics via Coinduction , 2007, Log. Methods Comput. Sci..

[123]  Isar Stubbe,et al.  Propositional systems, Hilbert lattices and generalized hilbert spaces , 2007 .

[124]  Xiang Fu,et al.  Towards a Theory of Web Service Choreographies , 2007, WS-FM.

[125]  José Luiz Fiadeiro,et al.  Structured Co-spans: An Algebra of Interaction Protocols , 2007, CALCO.

[126]  Russell Harmer,et al.  Categorical Combinatorics for Innocent Strategies , 2007, 22nd Annual IEEE Symposium on Logic in Computer Science (LICS 2007).

[127]  Bartek Klin,et al.  Coalgebraic Modal Logic Beyond Sets , 2007, MFPS.

[128]  Till Mossakowski,et al.  The Heterogeneous Tool Set (Hets) , 2007, VERIFY.

[129]  Peter Selinger,et al.  Dagger Compact Closed Categories and Completely Positive Maps: (Extended Abstract) , 2007, QPL.

[130]  S. Maclane,et al.  Categorical Algebra , 2007 .

[131]  Philip S. Mulry,et al.  MONAD COMPOSITIONS I: GENERAL CONSTRUCTIONS AND RECURSIVE DISTRIBUTIVE LAWS , 2007 .

[132]  Venanzio Capretta,et al.  Common Knowledge as a Coinductive Modality , 2007 .

[133]  Mehryar Mohri,et al.  Generic -removal Algorithm for Weighted Automata , 2007 .

[134]  Alejandro Russo,et al.  Closing Internal Timing Channels by Transformation , 2006, ASIAN.

[135]  Roberto Bruni,et al.  A basic algebra of stateless connectors , 2006, Theor. Comput. Sci..

[136]  C. A. R. Hoare,et al.  Intelligent Systems and Formal Methods in Software Engineering , 2006, IEEE Intelligent Systems.

[137]  Geoffrey Smith,et al.  Improved typings for probabilistic noninterference in a multi-threaded language , 2006, J. Comput. Secur..

[138]  Ana Sokolova,et al.  Generic Trace Theory , 2006, CMCS.

[139]  Fabio Casati,et al.  Representing, analysing and managing Web service protocols , 2006, Data Knowl. Eng..

[140]  Ichiro Hasuo,et al.  Generic Forward and Backward Simulations , 2006, CONCUR.

[141]  Thomas A. Henzinger,et al.  Antichains: A New Algorithm for Checking Universality of Finite Automata , 2006, CAV.

[142]  Dirk Pattinson,et al.  PSPACE Bounds for Rank-1 Modal Logics , 2006, 21st Annual IEEE Symposium on Logic in Computer Science (LICS'06).

[143]  Jan J. M. M. Rutten,et al.  Algebraic Specification and Coalgebraic Synthesis of Mealy Automata , 2006, FACS.

[144]  James Worrell,et al.  Testing Semantics: Connecting Processes and Process Logics , 2006, AMAST.

[145]  Alejandro Russo,et al.  Securing interaction between threads and the scheduler , 2006, 19th IEEE Computer Security Foundations Workshop (CSFW'06).

[146]  Alejandro Russo,et al.  Security for Multithreaded Programs Under Cooperative Scheduling , 2006, Ershov Memorial Conference.

[147]  Alexander Kurz,et al.  Coalgebras and their logics , 2006, SIGA.

[148]  Laura Bocchi,et al.  Algebraic Semantics of Service Component Modules , 2006, WADT.

[149]  Dieter Hutter,et al.  Development graphs - Proof management for structured specifications , 2006, J. Log. Algebraic Methods Program..

[150]  Bart Jacobs,et al.  Distributive laws for the coinductive solution of recursive equations , 2006, Inf. Comput..

[151]  Michel Bidoit,et al.  Constructor-based observational logic , 2006, J. Log. Algebraic Methods Program..

[152]  Marcello M. Bonsangue,et al.  Presenting Functors by Operations and Equations , 2006, FoSSaCS.

[153]  René Vestergaard,et al.  A constructive approach to sequential Nash equilibria , 2006, Inf. Process. Lett..

[154]  Bart Jacobs,et al.  A Bialgebraic Review of Deterministic Automata, Regular Expressions and Languages , 2006, Essays Dedicated to Joseph A. Goguen.

[155]  G. M. Kelly,et al.  BASIC CONCEPTS OF ENRICHED CATEGORY THEORY , 2022, Elements of ∞-Category Theory.

[156]  Samson Abramsky,et al.  A Cook's Tour of the Finitary Non-Well-Founded Sets , 2011, We Will Show Them!.

[157]  Lutz Schröder,et al.  Expressivity of coalgebraic modal logic: The limits and beyond , 2008, Theor. Comput. Sci..

[158]  David C. Colander,et al.  The future of economics: the appropriately educated in pursuit of the knowable , 2005 .

[159]  Ivan Lanese,et al.  Synchronised Hyperedge Replacement as a Model for Service Oriented Computing , 2005, FMCO.

[160]  H. Peter Gumm.  From T-Coalgebras to Filter Structures and Transition Systems , 2005, CALCO.

[161]  Jan J. M. M. Rutten,et al.  A coinductive calculus of streams , 2005, Mathematical Structures in Computer Science.

[162]  Paul-André Melliès,et al.  Asynchronous games 2: The true concurrency of innocence , 2006, Theor. Comput. Sci..

[163]  Bart Jacobs.  Trace Semantics for Coalgebras , 2004, CMCS.

[164]  Helle Hvid Hansen,et al.  A Coalgebraic Perspective on Monotone Modal Logic , 2004, CMCS.

[165]  John Power,et al.  From Comodels to Coalgebras: State and Arrays , 2004, CMCS.

[166]  Nicoletta Sabadini,et al.  Compositional Minimization in Span(Graph): Some Examples , 2004, Electron. Notes Theor. Comput. Sci..

[167]  John Power,et al.  Category theory for operational semantics , 2004, Theor. Comput. Sci..

[168]  Alessandra Palmigiano,et al.  A coalgebraic view on positive modal logic , 2004, Theor. Comput. Sci..

[169]  Philippe Schnoebelen,et al.  TSMV: a symbolic model checker for quantitative analysis of systems , 2004, First International Conference on the Quantitative Evaluation of Systems, 2004. QEST 2004. Proceedings..

[170]  Kim G. Larsen,et al.  A Tutorial on Uppaal , 2004, SFM.

[171]  Bartek Klin.  Adding recursive constructs to bialgebraic semantics , 2004, J. Log. Algebraic Methods Program..

[172]  Farhad Arbab,et al.  Reo: A Channel-based Coordination Model for Component Composition , 2005 .

[173]  Pierre Castéran,et al.  Interactive Theorem Proving and Program Development , 2004, Texts in Theoretical Computer Science An EATCS Series.

[174]  Razvan Diaconescu,et al.  Herbrand theorems in arbitrary institutions , 2004, Inf. Process. Lett..

[175]  Joël Ouaknine,et al.  Duality for Labelled Markov Processes , 2004, FoSSaCS.

[176]  Markus Roggenbach,et al.  CCC - The Casl Consistency Checker , 2004, WADT.

[177]  Samson Abramsky,et al.  A categorical semantics of quantum protocols , 2004, Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science, 2004..

[178]  D. Pattinson.  Expressive Logics for Coalgebras via Terminal Sequence Induction , 2004, Notre Dame J. Formal Log..

[179]  Ian Foster,et al.  The Grid 2 - Blueprint for a New Computing Infrastructure, Second Edition , 1998, The Grid 2, 2nd Edition.

[180]  F. Bartels,et al.  On Generalised Coinduction and Probabilistic Specification Formats , 2004 .

[181]  Gordon D. Plotkin,et al.  A structural approach to operational semantics , 2004, J. Log. Algebraic Methods Program..

[182]  Yde Venema,et al.  Stone Coalgebras , 2004, CMCS.

[183]  Farn Wang,et al.  Efficient verification of timed automata with BDD-like data structures , 2004, International Journal on Software Tools for Technology Transfer.

[184]  Dirk Pattinson,et al.  Coalgebraic modal logic: soundness, completeness and decidability of local consequence , 2003, Theor. Comput. Sci..

[185]  Jan J. M. M. Rutten,et al.  Behavioural differential equations: a coinductive calculus of streams, automata, and power series , 2003, Theor. Comput. Sci..

[186]  Andrew C. Myers,et al.  Observational determinism for concurrent program security , 2003, 16th IEEE Computer Security Foundations Workshop, 2003. Proceedings..

[187]  Geoffrey Smith,et al.  Probabilistic noninterference through weak probabilistic bisimulation , 2003, 16th IEEE Computer Security Foundations Workshop, 2003. Proceedings..

[188]  Andrei Sabelfeld,et al.  Confidentiality for Multithreaded Programs via Bisimulation , 2003, Ershov Memorial Conference.

[189]  Bart Jacobs,et al.  Simulations in Coalgebra , 2003, CMCS.

[190]  Vladimiro Sassone,et al.  Deriving Bisimulation Congruences using 2-categories , 2003, Nord. J. Comput..

[191]  Thomas T. Hildebrandt.  Towards categorical models for fairness: fully abstract presheaf semantics of SCCS with finite delay , 2003, Theor. Comput. Sci..

[192]  Gordon D. Plotkin,et al.  Algebraic Operations and Generic Effects , 2003, Appl. Categorical Struct..

[193]  Andrew C. Myers,et al.  Language-based information-flow security , 2003, IEEE J. Sel. Areas Commun..

[194]  Bart Jacobs,et al.  Coalgebras and monads in the semantics of Java , 2003, Theor. Comput. Sci..

[195]  Luís Soares Barbosa.  Towards a Calculus of State-based Software Components , 2003, J. Univers. Comput. Sci..

[196]  Anne Elisabeth Haxthausen,et al.  Casl - The Common Algebraic Specification Language: Semantics and Proof Theory , 2003, Comput. Artif. Intell..

[197]  Ismailcem Budak Arpinar,et al.  Automatic Composition of Semantic Web Services , 2003, ICWS.

[198]  Stefan Milius.  On Iteratable Endofunctors , 2002, CTCS.

[199]  Jan Rutten.  Coinductive Counting: Bisimulation in Enumerative Combinatorics , 2002, CMCS.

[200]  Hiroshi Watanabe,et al.  Well-behaved Translations between Structural Operational Semantics , 2002, CMCS.

[201]  Dirk Pattinson.  Translating Logics for Coalgebras , 2002, WADT.

[202]  Gordon D. Plotkin,et al.  Combining Computational Effects: commutativity & sum , 2002, IFIP TCS.

[203]  Carlos Areces,et al.  HyLoRes 1.0: Direct Resolution for Hybrid Logics , 2002, CADE.

[204]  Ilaria Castellani,et al.  Noninterference for concurrent programs and thread systems , 2002, Theor. Comput. Sci..

[205]  Gordon D. Plotkin,et al.  Notions of Computation Determine Monads , 2002, FoSSaCS.

[206]  Peter Sewell,et al.  From rewrite rules to bisimulation congruences , 2002, Theor. Comput. Sci..

[207]  Donald Sannella,et al.  Architectural Specifications in CASL , 2002, Formal Aspects of Computing.

[208]  Ilaria Castellani,et al.  Noninterference for Concurrent Programs , 2001, ICALP.

[209]  Daniele Turi,et al.  Semantics of name and value passing , 2001, Proceedings 16th Annual IEEE Symposium on Logic in Computer Science.

[210]  Heiko Mantel,et al.  A generic approach to the security of multi-threaded programs , 2001, Proceedings. 14th IEEE Computer Security Foundations Workshop, 2001..

[211]  Jean-Yves Girard,et al.  Locus Solum: From the rules of logic to the logic of rules , 2001, Mathematical Structures in Computer Science.

[212]  Bart Jacobs,et al.  Categorical Logic and Type Theory , 2001, Studies in logic and the foundations of mathematics.

[213]  H. Peter Gumm,et al.  Monoid-labeled transition systems , 2001, CMCS.

[214]  Erik Poll,et al.  From Algebras and Coalgebras to Dialgebras , 2001, CMCS.

[215]  Gordon D. Plotkin,et al.  Adequacy for Algebraic Effects , 2001, FoSSaCS.

[216]  M. Douglas McIlroy,et al.  The music of streams , 2001, Inf. Process. Lett..

[217]  Luca Aceto,et al.  Structural Operational Semantics , 1999, Handbook of Process Algebra.

[218]  F. Shultz,et al.  State Spaces of Operator Algebras , 2001 .

[219]  Herbert Gintis,et al.  Game Theory Evolving: A Problem-Centered Introduction to Modeling Strategic Interaction - Second Edition , 2009 .

[220]  Coalgebras and modal logic for parameterised endofunctors , 2000 .

[221]  C.-H. Luke Ong,et al.  On Full Abstraction for PCF: I, II, and III , 2000, Inf. Comput..

[222]  Jan J. M. M. Rutten,et al.  Universal coalgebra: a theory of systems , 2000, Theor. Comput. Sci..

[223]  J. Bouchaud,et al.  Theory Of Financial Risk And Derivative Pricing , 2000 .

[224]  Robin Milner,et al.  Deriving Bisimulation Congruences for Reactive Systems , 2000, CONCUR.

[225]  Fabio Gadducci,et al.  The tile model , 2000, Proof, Language, and Interaction.

[226]  David Sands,et al.  Probabilistic noninterference for multi-threaded programs , 2000, Proceedings 13th IEEE Computer Security Foundations Workshop. CSFW-13.

[227]  Patrick Blackburn,et al.  Representation, Reasoning, and Relational Structures: a Hybrid Logic Manifesto , 2000, Log. J. IGPL.

[228]  Johan Agat,et al.  Transforming out timing leaks , 2000, POPL '00.

[229]  Dirk Pattinson,et al.  Notes on Coalgebras, Cofibrations and Concurrency , 2000, CMCS.

[230]  Alexandru Baltag,et al.  A Logic for Coalgebraic Simulation , 2000, CMCS.

[231]  Marc Pauly,et al.  Logic for social software , 2000 .

[232]  I. Chuang,et al.  Quantum Teleportation is a Universal Computational Primitive , 1999, quant-ph/9908010.

[233]  Roberto Bruni,et al.  Cartesian closed double categories, their lambda-notation, and the pi-calculus , 1999, Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158).

[234]  Russell Harmer,et al.  A fully abstract game semantics for finite nondeterminism , 1999, Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158).

[235]  D. Moore,et al.  On State Spaces and Property Lattices , 1999 .

[236]  Glynn Winskel,et al.  Weak bisimulation and open maps , 1999, Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158).

[237]  Marco Grandis,et al.  Limits in double categories , 1999 .

[238]  Lawrence S. Moss,et al.  Coalgebraic Logic , 1999, Ann. Pure Appl. Log..

[239]  Davide Sangiorgi,et al.  On the bisimulation proof method , 1998, Mathematical Structures in Computer Science.

[240]  Philip Wadler,et al.  The marriage of effects and monads , 1998, ICFP '98.

[241]  Jan J. M. M. Rutten,et al.  Automata and Coinduction (An Exercise in Coalgebra) , 1998, CONCUR.

[242]  Geoffrey Smith,et al.  Probabilistic noninterference in a concurrent language , 1998, Proceedings. 11th IEEE Computer Security Foundations Workshop (Cat. No.98TB100238).

[243]  Geoffrey Smith,et al.  Secure information flow in a multi-threaded imperative language , 1998, POPL '98.

[244]  James Allen Fill,et al.  The Number of m-ary Search Trees on n Keys , 1997, Combinatorics, Probability and Computing.

[245]  Sergio Yovine,et al.  KRONOS: a verification tool for real-time systems , 1997, International Journal on Software Tools for Technology Transfer.

[246]  Erik P. de Vink,et al.  Bisimulation for Probabilistic Transition Systems: A Coalgebraic Approach , 1997, Theor. Comput. Sci..

[247]  Gordon D. Plotkin,et al.  Towards a mathematical operational semantics , 1997, Proceedings of Twelfth Annual IEEE Symposium on Logic in Computer Science.

[248]  Christel Baier,et al.  Weak Bisimulation for Fully Probabilistic Processes , 1997, FBT.

[249]  T. S. E. Maibaum,et al.  Conservative Extensions, Interpretations Between Theories and All That! , 1997, TAPSOFT.

[250]  Masahiro Fujita,et al.  Multi-Terminal Binary Decision Diagrams: An Efficient Data Structure for Matrix Representation , 1997, Formal Methods Syst. Des..

[251]  H. Andersen.  An Introduction to Binary Decision Diagrams , 1997 .

[252]  Beate Bollig,et al.  Improving the Variable Ordering of OBDDs Is NP-Complete , 1996, IEEE Trans. Computers.

[253]  Glynn Winskel,et al.  Presheaf Models for Concurrency , 1996, CSL.

[254]  M. Horodecki,et al.  Separability of mixed states: necessary and sufficient conditions , 1996, quant-ph/9605038.

[255]  Geoffrey Smith,et al.  A Sound Type System for Secure Flow Analysis , 1996, J. Comput. Secur..

[256]  Bart Jacobs,et al.  Duality Beyond Sober Spaces: Topological Spaces and Observation Frames , 1995, Theor. Comput. Sci..

[257]  Jirí Adámek,et al.  On the Greatest Fixed Point of a Set Functor , 1995, Theor. Comput. Sci..

[258]  A. Colman.  Game Theory and its Applications: In the Social and Biological Sciences , 1995 .

[259]  Arend Rensink,et al.  Fair testing , 1995, Inf. Comput..

[260]  Rance Cleaveland,et al.  Divergence and Fair Testing , 1995, ICALP.

[261]  Vaughan R. Pratt,et al.  The Stone gamut: a coordinatization of mathematics , 1995, Proceedings of Tenth Annual IEEE Symposium on Logic in Computer Science.

[262]  J. Michael Dunn,et al.  Positive modal logic , 1995, Stud Logica.

[263]  R. Aumann.  Backward induction and common knowledge of rationality , 1995 .

[264]  Kenneth L. McMillan,et al.  A technique of state space search based on unfolding , 1995, Formal Methods Syst. Des..

[265]  D. Foulis,et al.  Effect algebras and unsharp quantum logics , 1994 .

[266]  Ekert,et al.  "Event-ready-detectors" Bell experiment via entanglement swapping. , 1993, Physical review letters.

[267]  Michael Barr,et al.  Terminal Coalgebras in Well-Founded Set Theory , 1993, Theor. Comput. Sci..

[268]  Glynn Winskel,et al.  Bisimulation and open maps , 1993, [1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science.

[269]  Rajeev Alur,et al.  Model-Checking in Dense Real-time , 1993, Inf. Comput..

[270]  Stephen Lack,et al.  Finite-product-preserving functors, Kan extensions, and strongly-finitary 2-monads , 1993, Appl. Categorical Struct..

[271]  Glynn Winskel,et al.  The formal semantics of programming languages - an introduction , 1993, Foundation of computing series.

[272]  Melvin Fitting,et al.  Many-valued modal logics II , 1992 .

[273]  Frits W. Vaandrager,et al.  Turning SOS rules into equations , 1992, [1992] Proceedings of the Seventh Annual IEEE Symposium on Logic in Computer Science.

[274]  Joseph A. Goguen,et al.  Institutions: abstract model theory for specification and programming , 1992, JACM.

[275]  I. Moerdijk,et al.  Sheaves in geometry and logic: a first introduction to topos theory , 1992 .

[276]  Pierre Jouvelot,et al.  Polymorphic type, region and effect inference , 1992, Journal of Functional Programming.

[277]  Melvin Fitting,et al.  Many-valued modal logics , 1991, Fundam. Informaticae.

[278]  Eugenio Moggi.  A Modular Approach to Denotational Semantics , 1991, Category Theory and Computer Science.

[279]  Kim G. Larsen,et al.  Bisimulation through Probabilistic Testing , 1991, Inf. Comput..

[280]  Ekert,et al.  Quantum cryptography based on Bell's theorem. , 1991, Physical review letters.

[281]  P. H. Starke,et al.  Reachability analysis of Petri nets using symmetries , 1991 .

[282]  Tobias Nipkow,et al.  Higher-order critical pairs , 1991, [1991] Proceedings Sixth Annual IEEE Symposium on Logic in Computer Science.

[283]  Eugenio Moggi,et al.  Notions of Computation and Monads , 1991, Inf. Comput..

[284]  A. Joyal,et al.  The geometry of tensor calculus, I , 1991 .

[285]  Nagisa Ishiura,et al.  Shared binary decision diagram with attributed edges for efficient Boolean function manipulation , 1990, 27th ACM/IEEE Design Automation Conference.

[286]  Horst Herrlich,et al.  Abstract and concrete categories , 1990 .

[287]  Edmund M. Clarke,et al.  Compositional model checking , 1989, [1989] Proceedings. Fourth Annual Symposium on Logic in Computer Science.

[288]  G. M. Kelly.  Elementary observations on 2-categorical limits , 1989, Bulletin of the Australian Mathematical Society.

[289]  Robin Milner,et al.  Communication and concurrency , 1989, PHI Series in computer science.

[290]  D. Walker,et al.  A Calculus of Mobile Processes, Part I , 1989 .

[291]  David K. Gifford,et al.  Polymorphic effect systems , 1988, POPL '88.

[292]  Tatsuya Hagino,et al.  A categorical programming language , 2020, ArXiv.

[293]  A. Carboni,et al.  Cartesian bicategories I , 1987 .

[294]  Andrzej Tarlecki,et al.  Quasi-varieties in Abstract Algebraic Institutions , 1986, J. Comput. Syst. Sci..

[295]  Ross Street,et al.  Order ideals in categories , 1986 .

[296]  B. O'Neill.  International Escalation and the Dollar Auction , 1986 .

[297]  Pierre Wolper,et al.  An Automata-Theoretic Approach to Automatic Program Verification (Preliminary Report) , 1986, LICS.

[298]  Edmund Robinson,et al.  Power-domains, modalities and the Vietoris monad , 1986 .

[299]  Rocco De Nicola,et al.  Testing Equivalences for Processes , 1984, Theor. Comput. Sci..

[300]  Daniel Brand,et al.  On Communicating Finite-State Machines , 1983, JACM.

[301]  J. Meseguer,et al.  Security Policies and Security Models , 1982, 1982 IEEE Symposium on Security and Privacy.

[302]  G. M. Kelly,et al.  Structures defined by finite limits in the enriched context, I , 1982 .

[303]  G. M. Kelly,et al.  Coherence for compact closed categories , 1980 .

[304]  Robin Milner,et al.  On Observing Nondeterminism and Concurrency , 1980, ICALP.

[305]  P. E. Wellstead,et al.  Introduction to physical system modelling , 1979 .

[306]  Jiří Adámek.  Limits and colimits in generalized algebraic categories , 1976 .

[307]  P. T. Johnstone,et al.  Adjoint Lifting Theorems for Categories of Algebras , 1975 .

[308]  T. Willmore.  Algebraic Geometry , 1973, Nature.

[309]  A. Kock.  Strong functors and monoidal monads , 1972 .

[310]  J. Hopcroft,et al.  A Linear Algorithm for Testing Equivalence of Finite Automata. , 1971 .

[311]  M. Shubik.  The Dollar Auction game: a paradox in noncooperative behavior and escalation , 1971 .

[312]  Anders Kock,et al.  On Double Dualization Monads. , 1970 .

[313]  Věra Trnková,et al.  On products in generalized algebraic categories , 1969 .

[314]  J. Kemeny,et al.  Denumerable Markov chains , 1969 .

[315]  J. Brzozowski.  Canonical regular expressions and minimal state graphs for definite events , 1962 .

[316]  A. Tarski.  A LATTICE-THEORETICAL FIXPOINT THEOREM AND ITS APPLICATIONS , 1955 .

[317]  H. W. Kuhn,et al.  11. Extensive Games and the Problem of Information , 1953 .

[318]  L. Dickson.  Finiteness of the Odd Perfect and Primitive Abundant Numbers with n Distinct Prime Factors , 1913 .