|
|
Conferences in DBLP
- Natarajan Shankar
Combining Theorem Proving and Model Checking through Symbolic Analysis. [Citation Graph (0, 0)][DBLP]
CONCUR, 2000, pp:1-16 [Conf]
- Ed Brinksma
Verification Is Experimentation! [Citation Graph (0, 0)][DBLP]
CONCUR, 2000, pp:17-24 [Conf]
- Eugene W. Stark
Compositional Performance Analysis Using Probabilistic I/O Automata. [Citation Graph (0, 0)][DBLP]
CONCUR, 2000, pp:25-28 [Conf]
- Alberto L. Sangiovanni-Vincentelli, Marco Sgroi, Luciano Lavagno
Formal Models for Communication-Based Design. [Citation Graph (0, 0)][DBLP]
CONCUR, 2000, pp:29-47 [Conf]
- Rocco De Nicola, Gian Luigi Ferrari, Rosario Pugliese
Programming Access Control: The KLAIM Experience. [Citation Graph (0, 0)][DBLP]
CONCUR, 2000, pp:48-65 [Conf]
- Rajeev Alur
Exploiting Hierarchical Structure for Efficient Formal Verification. [Citation Graph (0, 0)][DBLP]
CONCUR, 2000, pp:66-68 [Conf]
- Philippa Gardner
From Process Calculi to Process Frameworks. [Citation Graph (0, 0)][DBLP]
CONCUR, 2000, pp:69-88 [Conf]
- C. R. Ramakrishnan
Verification Using Tabled Logic Programming. [Citation Graph (0, 0)][DBLP]
CONCUR, 2000, pp:89-91 [Conf]
- Orna Kupferman, P. Madhusudan, P. S. Thiagarajan, Moshe Y. Vardi
Open Systems in Reactive Environments: Control and Synthesis. [Citation Graph (0, 0)][DBLP]
CONCUR, 2000, pp:92-107 [Conf]
- Keijo Heljanko
Model Checking with Finite Complete Prefixes Is PSPACE-Complete. [Citation Graph (0, 0)][DBLP]
CONCUR, 2000, pp:108-122 [Conf]
- Marta Z. Kwiatkowska, Gethin Norman, Roberto Segala, Jeremy Sproston
Verifying Quantitative Properties of Continuous Probabilistic Timed Automata. [Citation Graph (0, 0)][DBLP]
CONCUR, 2000, pp:123-137 [Conf]
- Franck Cassez, Kim Guldstrand Larsen
The Impressive Power of Stopwatches. [Citation Graph (0, 0)][DBLP]
CONCUR, 2000, pp:138-152 [Conf]
- Kousha Etessami, Gerard J. Holzmann
Optimizing Büchi Automata. [Citation Graph (0, 0)][DBLP]
CONCUR, 2000, pp:153-167 [Conf]
- Glenn Bruns, Patrice Godefroid
Generalized Model Checking: Reasoning about Partial State Spaces. [Citation Graph (0, 0)][DBLP]
CONCUR, 2000, pp:168-182 [Conf]
- Oscar H. Ibarra, Tevfik Bultan, Jianwen Su
Reachability Analysis for Some Models of Infinite-State Transition Systems. [Citation Graph (0, 0)][DBLP]
CONCUR, 2000, pp:183-198 [Conf]
- Radu Negulescu
Process Spaces. [Citation Graph (0, 0)][DBLP]
CONCUR, 2000, pp:199-213 [Conf]
- Frank S. de Boer, Rogier M. van Eijk, Wiebe van der Hoek, John-Jules Ch. Meyer
Failure Semantics for the Exchange of Information in Multi-Agent Systems. [Citation Graph (0, 0)][DBLP]
CONCUR, 2000, pp:214-228 [Conf]
- Erika Ábrahám-Mumm, Frank S. de Boer
Proof-Outlines for Threads in Java. [Citation Graph (0, 0)][DBLP]
CONCUR, 2000, pp:229-242 [Conf]
- James J. Leifer, Robin Milner
Deriving Bisimulation Congruences for Reactive Systems. [Citation Graph (0, 0)][DBLP]
CONCUR, 2000, pp:243-258 [Conf]
- Roberto Bruni, David de Frutos-Escrig, Narciso Martí-Oliet, Ugo Montanari
Bisimilarity Congruences for Open Terms and Term Graphs via Tile Logic. [Citation Graph (0, 0)][DBLP]
CONCUR, 2000, pp:259-274 [Conf]
- Irek Ulidowski, Shoji Yuen
Process Languages for Rooted Eager Bisimulation. [Citation Graph (0, 0)][DBLP]
CONCUR, 2000, pp:275-289 [Conf]
- Arend Rensink
Action Contraction. [Citation Graph (0, 0)][DBLP]
CONCUR, 2000, pp:290-304 [Conf]
- Marco Bernardo, Rance Cleaveland
A Theory of Testing for Markovian Processes. [Citation Graph (0, 0)][DBLP]
CONCUR, 2000, pp:305-319 [Conf]
- Parosh Aziz Abdulla, Christel Baier, S. Purushothaman Iyer, Bengt Jonsson
Reasoning about Probabilistic Lossy Channel Systems. [Citation Graph (0, 0)][DBLP]
CONCUR, 2000, pp:320-333 [Conf]
- Anna Philippou, Insup Lee, Oleg Sokolsky
Weak Bisimulation for Probabilistic Systems. [Citation Graph (0, 0)][DBLP]
CONCUR, 2000, pp:334-349 [Conf]
- Michael W. Mislove
Nondeterminism and Probabilistic Choice: Obeying the Laws. [Citation Graph (0, 0)][DBLP]
CONCUR, 2000, pp:350-364 [Conf]
- Luca Cardelli, Giorgio Ghelli, Andrew D. Gordon
Secrecy and Group Creation. [Citation Graph (0, 0)][DBLP]
CONCUR, 2000, pp:365-379 [Conf]
- Roberto M. Amadio, Denis Lugiez
On the Reachability Problem in Cryptographic Protocols. [Citation Graph (0, 0)][DBLP]
CONCUR, 2000, pp:380-394 [Conf]
- Jan Jürjens
Secure Information Flow for Concurrent Processes. [Citation Graph (0, 0)][DBLP]
CONCUR, 2000, pp:395-409 [Conf]
- Victor Khomenko, Maciej Koutny
LP Deadlock Checking Using Partial Order Dependencies. [Citation Graph (0, 0)][DBLP]
CONCUR, 2000, pp:410-425 [Conf]
- Dietrich Kuske, Rémi Morin
Pomsets for Local Trace Languages - Recognizability, Logic & Petri Nets. [Citation Graph (0, 0)][DBLP]
CONCUR, 2000, pp:426-441 [Conf]
- Paolo Baldan, Nadia Busi, Andrea Corradini, G. Michele Pinna
Functorial Concurrent Semantics for Petri Nets with Read and Inhibitor Arcs. [Citation Graph (0, 0)][DBLP]
CONCUR, 2000, pp:442-457 [Conf]
- Luca de Alfaro, Thomas A. Henzinger, Freddy Y. C. Mang
The Control of Synchronous Systems. [Citation Graph (0, 0)][DBLP]
CONCUR, 2000, pp:458-473 [Conf]
- António Ravara, Vasco Thudichum Vasconcelos
Typing Non-uniform Concurrent Objects. [Citation Graph (0, 0)][DBLP]
CONCUR, 2000, pp:474-488 [Conf]
- Naoki Kobayashi, Shin Saito, Eijiro Sumii
An Implicitly-Typed Deadlock-Free Process Calculus. [Citation Graph (0, 0)][DBLP]
CONCUR, 2000, pp:489-503 [Conf]
- Michele Bugliesi, Giuseppe Castagna, Silvia Crafa
Typed Mobile Objects. [Citation Graph (0, 0)][DBLP]
CONCUR, 2000, pp:504-520 [Conf]
- Madhavan Mukund, K. Narayan Kumar, Milind A. Sohoni
Synthesizing Distributed Finite-State Systems from MSCs. [Citation Graph (0, 0)][DBLP]
CONCUR, 2000, pp:521-535 [Conf]
- Dietrich Kuske
Emptiness Is Decidable for Asynchronous Cellular Machines. [Citation Graph (0, 0)][DBLP]
CONCUR, 2000, pp:536-551 [Conf]
- Bernadette Charron-Bost, Sam Toueg, Anindya Basu
Revisiting Safety and Liveness in the Context of Failures. [Citation Graph (0, 0)][DBLP]
CONCUR, 2000, pp:552-565 [Conf]
- Alain Finkel, S. Purushothaman Iyer, Grégoire Sutre
Well-Abstracted Transition Systems. [Citation Graph (0, 0)][DBLP]
CONCUR, 2000, pp:566-580 [Conf]
- Ranko Lazic, David Nowak
A Unifying Approach to Data-Independence. [Citation Graph (0, 0)][DBLP]
CONCUR, 2000, pp:581-595 [Conf]
- Yuxi Fu, Zhenrong Yang
Chi Calculus with Mismatch. [Citation Graph (0, 0)][DBLP]
CONCUR, 2000, pp:596-610 [Conf]
|
