|
Conferences in DBLP
- Parosh Aziz Abdulla, Bengt Jonsson
Channel Representations in Protocol Verification. [Citation Graph (0, 0)][DBLP] CONCUR, 2001, pp:1-15 [Conf]
- Robin Milner
Bigraphical Reactive Systems. [Citation Graph (0, 0)][DBLP] CONCUR, 2001, pp:16-35 [Conf]
- Shankar Sastry
Control of Networks of Unmanned Vehicles. [Citation Graph (0, 0)][DBLP] CONCUR, 2001, pp:36- [Conf]
- Steve Schneider
Process Algebra and Security. [Citation Graph (0, 0)][DBLP] CONCUR, 2001, pp:37-38 [Conf]
- John Hatcliff, Matthew B. Dwyer
Using the Bandera Tool Set to Model-Check Properties of Concurrent Java Software. [Citation Graph (0, 0)][DBLP] CONCUR, 2001, pp:39-58 [Conf]
- Holger Hermanns, Joost-Pieter Katoen
Performance Evaluation : = (Process Algebra + Model Checking) × Markov Chains. [Citation Graph (0, 0)][DBLP] CONCUR, 2001, pp:59-81 [Conf]
- Giuseppe Castagna, Giorgio Ghelli, Francesco Zappa Nardelli
Typing Mobility in the Seal Calculus. [Citation Graph (0, 0)][DBLP] CONCUR, 2001, pp:82-101 [Conf]
- Michele Bugliesi, Giuseppe Castagna, Silvia Crafa
Reasoning about Security in Mobile Ambients. [Citation Graph (0, 0)][DBLP] CONCUR, 2001, pp:102-120 [Conf]
- Dan Hirsch, Ugo Montanari
Synchronized Hyperedge Replacement with Name Mobility. [Citation Graph (0, 0)][DBLP] CONCUR, 2001, pp:121-136 [Conf]
- Paul C. Attie, Nancy A. Lynch
Dynamic Input/Output Automata: A Formal Model for Dynamic Systems. [Citation Graph (0, 0)][DBLP] CONCUR, 2001, pp:137-151 [Conf]
- Alessandro Aldini
Probabilistic Information Flow in a Process Algebra. [Citation Graph (0, 0)][DBLP] CONCUR, 2001, pp:152-168 [Conf]
- Marta Z. Kwiatkowska, Gethin Norman, Jeremy Sproston
Symbolic Computation of Maximal Probabilistic Reachability. [Citation Graph (0, 0)][DBLP] CONCUR, 2001, pp:169-183 [Conf]
- Hagen Völzer
Randomized Non-sequential Processes. [Citation Graph (0, 0)][DBLP] CONCUR, 2001, pp:184-201 [Conf]
- Antti Puhakka, Antti Valmari
Liveness and Fairness in Process-Algebraic Verification. [Citation Graph (0, 0)][DBLP] CONCUR, 2001, pp:202-217 [Conf]
- Keijo Heljanko
Bounded Reachability Checking with Process Semantics. [Citation Graph (0, 0)][DBLP] CONCUR, 2001, pp:218-232 [Conf]
- Jaco Geldenhuys, Antti Valmari
Techniques for Smaller Intermediary BDDs. [Citation Graph (0, 0)][DBLP] CONCUR, 2001, pp:233-247 [Conf]
- Patricia Bouyer, Antoine Petit, Denis Thérien
An Algebraic Characterization of Data and Timed Languages. [Citation Graph (0, 0)][DBLP] CONCUR, 2001, pp:248-261 [Conf]
- Gerald Lüttgen, Walter Vogler
A Faster-than Relation for Asynchronous Processes. [Citation Graph (0, 0)][DBLP] CONCUR, 2001, pp:262-276 [Conf]
- Jirí Srba
On the Power of Labels in Transition Systems. [Citation Graph (0, 0)][DBLP] CONCUR, 2001, pp:277-291 [Conf]
- Davide Sangiorgi, David Walker
On Barbed Equivalences in pi-Calculus. [Citation Graph (0, 0)][DBLP] CONCUR, 2001, pp:292-304 [Conf]
- Iain Phillips
CCS with Priority Guards. [Citation Graph (0, 0)][DBLP] CONCUR, 2001, pp:305-320 [Conf]
- Natalia López, Manuel Núñez
A Testing Theory for Generally Distributed Stochastic Processes. [Citation Graph (0, 0)][DBLP] CONCUR, 2001, pp:321-335 [Conf]
- Franck van Breugel, James Worrell
An Algorithm for Quantitative Verification of Probabilistic Transition Systems. [Citation Graph (0, 0)][DBLP] CONCUR, 2001, pp:336-350 [Conf]
- Luca de Alfaro, Thomas A. Henzinger, Ranjit Jhala
Compositional Methods for Probabilistic Systems. [Citation Graph (0, 0)][DBLP] CONCUR, 2001, pp:351-365 [Conf]
- Victor Khomenko, Maciej Koutny
Towards an Efficient Algorithm for Unfolding Petri Nets. [Citation Graph (0, 0)][DBLP] CONCUR, 2001, pp:366-380 [Conf]
- Paolo Baldan, Andrea Corradini, Barbara König
A Static Analysis Technique for Graph Transformation Systems. [Citation Graph (0, 0)][DBLP] CONCUR, 2001, pp:381-395 [Conf]
- Peter Niebert, Michaela Huhn, Sarah Zennou, Denis Lugiez
Local First Search - A New Paradigm for Partial Order Reductions. [Citation Graph (0, 0)][DBLP] CONCUR, 2001, pp:396-410 [Conf]
- Marcelo Glusman, Shmuel Katz
Extending Memory Consistency of Finite Prefixes to Infinite Computations. [Citation Graph (0, 0)][DBLP] CONCUR, 2001, pp:411-425 [Conf]
- Patrice Godefroid, Michael Huth, Radha Jagadeesan
Abstraction-Based Model Checking Using Modal Transition Systems. [Citation Graph (0, 0)][DBLP] CONCUR, 2001, pp:426-440 [Conf]
- Marsha Chechik, Benet Devereux, Steve M. Easterbrook, Albert Y. C. Lai, Victor Petrovykh
Efficient Multiple-Valued Model-Checking Using Lattice Representations. [Citation Graph (0, 0)][DBLP] CONCUR, 2001, pp:441-455 [Conf]
- Chao Wang, Roderick Bloem, Gary D. Hachtel, Kavita Ravi, Fabio Somenzi
Divide and Compose: SCC Refinement for Language Emptiness. [Citation Graph (0, 0)][DBLP] CONCUR, 2001, pp:456-471 [Conf]
- Marie Duflot, Laurent Fribourg, Ulf Nilsson
Unavoidable Configurations of Parameterized Rings of Processes. [Citation Graph (0, 0)][DBLP] CONCUR, 2001, pp:472-486 [Conf]
- Yifeng Chen, Jeff W. Sanders
Logic of Global Synchrony. [Citation Graph (0, 0)][DBLP] CONCUR, 2001, pp:487-501 [Conf]
- Paolo Baldan, Andrea Corradini, Hartmut Ehrig, Reiko Heckel
Compositional Modeling of Reactive Systems Using Open Nets. [Citation Graph (0, 0)][DBLP] CONCUR, 2001, pp:502-518 [Conf]
- Orna Kupferman, Nir Piterman, Moshe Y. Vardi
Extended Temporal Logic Revisited. [Citation Graph (0, 0)][DBLP] CONCUR, 2001, pp:519-535 [Conf]
- Luca de Alfaro, Thomas A. Henzinger, Rupak Majumdar
Symbolic Algorithms for Infinite-State Games. [Citation Graph (0, 0)][DBLP] CONCUR, 2001, pp:536-550 [Conf]
- Steve Kremer, Jean-François Raskin
A Game-Based Verification of Non-repudiation and Fair Exchange Protocols. [Citation Graph (0, 0)][DBLP] CONCUR, 2001, pp:551-565 [Conf]
- Luca de Alfaro, Thomas A. Henzinger, Freddy Y. C. Mang
The Control of Synchronous Systems, Part II. [Citation Graph (0, 0)][DBLP] CONCUR, 2001, pp:566-582 [Conf]
|