Conferences in DBLP
Samson Abramsky Retracing Some Paths in Process Algebra. [Citation Graph (0, 0)][DBLP ] Conf ] Andrew M. Pitts , Joshua R. X. Ross Process Calculus Based upon Evaluation to Committed Form. [Citation Graph (0, 0)][DBLP ] Conf ] Rance Cleaveland , Gerald Lüttgen , V. Natarajan A Process Algebra with Distributed Priorities. [Citation Graph (0, 0)][DBLP ] Conf ] Huimin Lin Symbolic Transition Graph with Assignment. [Citation Graph (0, 0)][DBLP ] Conf ] Vineet Gupta , Radha Jagadeesan , Vijay A. Saraswat Models for Concurrent Constraint Programming. [Citation Graph (0, 0)][DBLP ] Conf ] Thomas T. Hildebrandt , Vladimiro Sassone Comparing Transition Systems with Independence and Asynchronous Transition Systems. [Citation Graph (0, 0)][DBLP ] Conf ] Glynn Winskel A Presheaf Semantics of Value-Passing Processes. [Citation Graph (0, 0)][DBLP ] Conf ] John Power Elementary Control Structures. [Citation Graph (0, 0)][DBLP ] Conf ] Anna Philippou , David Walker On Transformations of Concurrent Object Programs. [Citation Graph (0, 0)][DBLP ] Conf ] Roberto M. Amadio , Ilaria Castellani , Davide Sangiorgi On Bisimulations for the Asynchronous pi-Calculus. [Citation Graph (0, 0)][DBLP ] Conf ] Michele Boreale On the Expressiveness of Internal Mobility in Name-Passing Calculi. [Citation Graph (0, 0)][DBLP ] Conf ] Uwe Nestmann , Benjamin C. Pierce Decoding Choice Encodings. [Citation Graph (0, 0)][DBLP ] Conf ] Faron Moller Infinite Results. [Citation Graph (0, 0)][DBLP ] Conf ] Colin Stirling Decidability of Bisimulation Equivalence for Normed Pushdown Processes. [Citation Graph (0, 0)][DBLP ] Conf ] Julian C. Bradfield The Modal mu-calculus Alternation Hierarchy is Strict. [Citation Graph (0, 0)][DBLP ] Conf ] Olaf Burkart , Didier Caucal , Bernhard Steffen Bisimulation Collapse and the Process Taxonomy. [Citation Graph (0, 0)][DBLP ] Conf ] David Janin , Igor Walukiewicz On the Expressive Completeness of the Propositional mu-Calculus with Respect to Monadic Second Order Logic. [Citation Graph (0, 0)][DBLP ] Conf ] Bent Thomsen , Lone Leth , Tsung-Min Kuo A Facile Tutorial. [Citation Graph (0, 0)][DBLP ] Conf ] Roberto Segala Testing Probabilistic Automata. [Citation Graph (0, 0)][DBLP ] Conf ] Marco Bernardo , Roberto Gorrieri Extended Markovian Process Algebra. [Citation Graph (0, 0)][DBLP ] Conf ] José Meseguer Rewriting Logic as a Semantic Framework for Concurrency: a Progress Report. [Citation Graph (0, 0)][DBLP ] Conf ] Vineet Gupta , Radha Jagadeesan , Vijay A. Saraswat Truly Concurrent Constraint Programming. [Citation Graph (0, 0)][DBLP ] Conf ] Björn Victor , Joachim Parrow Constraints as Processes. [Citation Graph (0, 0)][DBLP ] Conf ] Cédric Fournet , Georges Gonthier , Jean-Jacques Lévy , Luc Maranget , Didier Rémy A Calculus of Mobile Agents. [Citation Graph (0, 0)][DBLP ] Conf ] Carolina Lavatelli Algebraic Interpretation of Lambda Calculus with Resources. [Citation Graph (0, 0)][DBLP ] Conf ] Andrea Corradini Concurrent Graph and Term Graph Rewriting. [Citation Graph (0, 0)][DBLP ] Conf ] Raymond R. Devillers Petri Boxes and Finite Precedence. [Citation Graph (0, 0)][DBLP ] Conf ] Ahmed Bouajjani , Peter Habermehl Constrained Properties, Semilinear Systems, and Petri Nets. [Citation Graph (0, 0)][DBLP ] Conf ] Eike Best , Catuscia Palamidessi Linear Constraint Systems as High-Level Nets. [Citation Graph (0, 0)][DBLP ] Conf ] Thomas A. Henzinger , Orna Kupferman , Moshe Y. Vardi A Space-Efficient On-the-fly Algorithm for Real-Time Model Checking. [Citation Graph (0, 0)][DBLP ] Conf ] Thomas A. Henzinger , Peter W. Kopke State Equivalences for Rectangular Hybrid Automata. [Citation Graph (0, 0)][DBLP ] Conf ] Serdar Tasiran , Rajeev Alur , Robert P. Kurshan , Robert K. Brayton Verifying Abstractions of Timed Systems. [Citation Graph (0, 0)][DBLP ] Conf ] Alessandro Fantechi , Stefania Gnesi , Diego Latella Towards Automatic Temporal Logic Verification of Value Passing Process Algebra Using Abstract Interpretation. [Citation Graph (0, 0)][DBLP ] Conf ] Wolfgang Reisig Modelling and Verification of Distributed Algorithms. [Citation Graph (0, 0)][DBLP ] Conf ] Doron Peled , Thomas Wilke , Pierre Wolper An Algorithmic Approach for Checking Closure Properties of omega-Regular Languages. [Citation Graph (0, 0)][DBLP ] Conf ] Michaela Huhn , Peter Niebert Towards Automata for Branching Time and Partial Order. [Citation Graph (0, 0)][DBLP ] Conf ] Manfred Droste , Paul Gastin Asynchronous Cellular Automata for Pomsets Without Auto-concurrency. [Citation Graph (0, 0)][DBLP ] Conf ] Michaela Huhn Action Refinement and Property Inheritance in Systems of Sequential Agents. [Citation Graph (0, 0)][DBLP ] Conf ] Paolo Di Blasio , Kathleen Fisher A Calculus for Concurrent Objects. [Citation Graph (0, 0)][DBLP ] Conf ] Sjouke Mauw , Michel A. Reniers Refinement in Interworkings. [Citation Graph (0, 0)][DBLP ] Conf ] Andrea Maggiolo-Schettini , Adriano Peron , Simone Tini Equivalences of Statecharts. [Citation Graph (0, 0)][DBLP ] Conf ] Jürgen Dingel Modular Verification for Shared-Variable Concurrent Programs. [Citation Graph (0, 0)][DBLP ] Conf ] Jerry James , Ambuj K. Singh The Impact of Hardware Models on Shared Memory Consistency Conditions. [Citation Graph (0, 0)][DBLP ] Conf ] Clemens Fischer , Wil Janssen Synchronous Development of Asynchonous Systems. [Citation Graph (0, 0)][DBLP ] Conf ] 