| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Michele Bugliesi, Giuseppe Castagna, Silvia Crafa |
Reasoning about Security in Mobile Ambients.  |
CONCUR  |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Marie Duflot, Laurent Fribourg, Ulf Nilsson |
Unavoidable Configurations of Parameterized Rings of Processes. |
CONCUR |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Holger Hermanns, Joost-Pieter Katoen |
Performance Evaluation : = (Process Algebra + Model Checking) × Markov Chains. |
CONCUR |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Chao Wang 0001, Roderick Bloem, Gary D. Hachtel, Kavita Ravi, Fabio Somenzi |
Divide and Compose: SCC Refinement for Language Emptiness. |
CONCUR |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Patricia Bouyer, Antoine Petit 0001, Denis Thérien |
An Algebraic Characterization of Data and Timed Languages. |
CONCUR |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Parosh Aziz Abdulla, Bengt Jonsson 0001 |
Channel Representations in Protocol Verification. |
CONCUR |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Shankar Sastry 0001 |
Control of Networks of Unmanned Vehicles. |
CONCUR |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Steve A. Schneider |
Process Algebra and Security. |
CONCUR |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Patrice Godefroid, Michael Huth 0001, Radha Jagadeesan |
Abstraction-Based Model Checking Using Modal Transition Systems. |
CONCUR |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Iain Phillips 0001 |
CCS with Priority Guards. |
CONCUR |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Marcelo Glusman, Shmuel Katz |
Extending Memory Consistency of Finite Prefixes to Infinite Computations. |
CONCUR |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Davide Sangiorgi, David Walker 0008 |
On Barbed Equivalences in pi-Calculus. |
CONCUR |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Steve Kremer, Jean-François Raskin |
A Game-Based Verification of Non-repudiation and Fair Exchange Protocols. |
CONCUR |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Marta Z. Kwiatkowska, Gethin Norman, Jeremy Sproston |
Symbolic Computation of Maximal Probabilistic Reachability. |
CONCUR |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Luca de Alfaro, Thomas A. Henzinger, Freddy Y. C. Mang |
The Control of Synchronous Systems, Part II. |
CONCUR |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Luca de Alfaro, Thomas A. Henzinger, Ranjit Jhala |
Compositional Methods for Probabilistic Systems. |
CONCUR |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Dietrich Kuske |
Emptiness Is Decidable for Asynchronous Cellular Machines. |
CONCUR |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Ed Brinksma |
Verification Is Experimentation! |
CONCUR |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Arend Rensink |
Action Contraction. |
CONCUR |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Bernadette Charron-Bost, Sam Toueg, Anindya Basu |
Revisiting Safety and Liveness in the Context of Failures. |
CONCUR |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Radu Negulescu |
Process Spaces. |
CONCUR |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Orna Kupferman, P. Madhusudan, P. S. Thiagarajan, Moshe Y. Vardi |
Open Systems in Reactive Environments: Control and Synthesis. |
CONCUR |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Parosh Aziz Abdulla, Christel Baier, S. Purushothaman Iyer, Bengt Jonsson 0001 |
Reasoning about Probabilistic Lossy Channel Systems. |
CONCUR |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Oscar H. Ibarra, Tevfik Bultan, Jianwen Su |
Reachability Analysis for Some Models of Infinite-State Transition Systems. |
CONCUR |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Philippa Gardner |
From Process Calculi to Process Frameworks. |
CONCUR |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Dietrich Kuske, Rémi Morin |
Pomsets for Local Trace Languages - Recognizability, Logic & Petri Nets. |
CONCUR |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Marta Z. Kwiatkowska, Gethin Norman, Roberto Segala, Jeremy Sproston |
Verifying Quantitative Properties of Continuous Probabilistic Timed Automata. |
CONCUR |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Natarajan Shankar |
Combining Theorem Proving and Model Checking through Symbolic Analysis. |
CONCUR |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Paolo Baldan, Nadia Busi, Andrea Corradini 0001, G. Michele Pinna |
Functorial Concurrent Semantics for Petri Nets with Read and Inhibitor Arcs. |
CONCUR |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Ranko Lazic 0001, David Nowak |
A Unifying Approach to Data-Independence. |
CONCUR |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | C. R. Ramakrishnan 0001 |
Verification Using Tabled Logic Programming. |
CONCUR |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Luca de Alfaro, Thomas A. Henzinger, Freddy Y. C. Mang |
The Control of Synchronous Systems. |
CONCUR |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Erika Ábrahám-Mumm, Frank S. de Boer |
Proof-Outlines for Threads in Java. |
CONCUR |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Glenn Bruns, Patrice Godefroid |
Generalized Model Checking: Reasoning about Partial State Spaces. |
CONCUR |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Marco Bernardo 0001, Rance Cleaveland |
A Theory of Testing for Markovian Processes. |
CONCUR |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Michele Bugliesi, Giuseppe Castagna, Silvia Crafa |
Typed Mobile Objects. |
CONCUR |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Alberto L. Sangiovanni-Vincentelli, Marco Sgroi, Luciano Lavagno |
Formal Models for Communication-Based Design. |
CONCUR |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Victor Khomenko, Maciej Koutny |
LP Deadlock Checking Using Partial Order Dependencies. |
CONCUR |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Madhavan Mukund, K. Narayan Kumar, Milind A. Sohoni |
Synthesizing Distributed Finite-State Systems from MSCs. |
CONCUR |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Jan Jürjens |
Secure Information Flow for Concurrent Processes. |
CONCUR |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Anna Philippou, Insup Lee 0001, Oleg Sokolsky |
Weak Bisimulation for Probabilistic Systems. |
CONCUR |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Keijo Heljanko |
Model Checking with Finite Complete Prefixes Is PSPACE-Complete. |
CONCUR |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Roberto Bruni, David de Frutos-Escrig, Narciso Martí-Oliet, Ugo Montanari |
Bisimilarity Congruences for Open Terms and Term Graphs via Tile Logic. |
CONCUR |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Roberto M. Amadio, Denis Lugiez |
On the Reachability Problem in Cryptographic Protocols. |
CONCUR |
2000 |
DBLP DOI BibTeX RDF |
verification, cryptographic protocols, symbolic computation |
| 1 | Eugene W. Stark |
Compositional Performance Analysis Using Probabilistic I/O Automata. |
CONCUR |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Catuscia Palamidessi (eds.) |
CONCUR 2000 - Concurrency Theory, 11th International Conference, University Park, PA, USA, August 22-25, 2000, Proceedings |
CONCUR |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Rajeev Alur |
Exploiting Hierarchical Structure for Efficient Formal Verification. |
CONCUR |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Yuxi Fu, Zhenrong Yang |
Chi Calculus with Mismatch. |
CONCUR |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Alain Finkel, S. Purushothaman Iyer, Grégoire Sutre |
Well-Abstracted Transition Systems. |
CONCUR |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Kousha Etessami, Gerard J. Holzmann |
Optimizing Büchi Automata. |
CONCUR |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Naoki Kobayashi 0001, Shin Saito, Eijiro Sumii |
An Implicitly-Typed Deadlock-Free Process Calculus. |
CONCUR |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael W. Mislove |
Nondeterminism and Probabilistic Choice: Obeying the Laws. |
CONCUR |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Irek Ulidowski, Shoji Yuen |
Process Languages for Rooted Eager Bisimulation. |
CONCUR |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | António Ravara, Vasco Thudichum Vasconcelos |
Typing Non-uniform Concurrent Objects. |
CONCUR |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Franck Cassez, Kim Guldstrand Larsen |
The Impressive Power of Stopwatches. |
CONCUR |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Luca Cardelli, Giorgio Ghelli, Andrew D. Gordon 0001 |
Secrecy and Group Creation. |
CONCUR |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | 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. |
CONCUR |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | James J. Leifer, Robin Milner |
Deriving Bisimulation Congruences for Reactive Systems. |
CONCUR |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Rocco De Nicola, Gian-Luigi Ferrari 0002, Rosario Pugliese |
Programming Access Control: The KLAIM Experience. |
CONCUR |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Thomas Noll 0001 |
On Coherence Properties in Team Rewriting Models of Concurrency. |
CONCUR |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Petr Jancar, Faron Moller |
Techniques for Decidability and Undecidability of Bisimilarity. |
CONCUR |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | José Meseguer 0001, Carolyn L. Talcott |
A Partial Order Event Model for Concurrent Objects. |
CONCUR |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Rance Cleaveland |
Temporal Process Logic (Abstract). |
CONCUR |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Catuscia Palamidessi |
Expressiveness and Distributed Implementation of Conciurrent Calculi with Link Mobility. |
CONCUR |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Béatrice Bérard, Laurent Fribourg |
Reachability Analysis of (Timed) Petri Nets Using Real Arithmetic. |
CONCUR |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Antti Puhakka, Antti Valmari |
Weakest-Congruence Results for Livelock-Preserving Equivalences. |
CONCUR |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Marius Minea |
Partial Order Reduction for Model Checking of Timed Automata. |
CONCUR |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Gerald Lüttgen, Michael von der Beeck, Rance Cleaveland |
Statecharts Via Process Algebra. |
CONCUR |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Rajeev Alur, Mihalis Yannakakis |
Model Checking of Message Sequence Charts. |
CONCUR |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Luca de Alfaro |
Computing Minimum and Maximum Reachability Times in Probabilistic Systems. |
CONCUR |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Cormac Flanagan, Martín Abadi |
Object Types against Races. |
CONCUR |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Frank S. de Boer, Gianluigi Zavattaro |
Generic Process Algebras for Asynchronous Communication. |
CONCUR |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Eike Best, Alexander Lavrov |
Weak and Strong Composition of High-Level Petri-Nets. |
CONCUR |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Orna Kupferman, Moshe Y. Vardi |
Robust Satisfaction. |
CONCUR |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Rajeev Alur, Bow-Yaw Wang |
"Next" Heuristic for On-the-Fly Model Checking. |
CONCUR |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Albert Benveniste, Benoît Caillaud, Paul Le Guernic |
From Synchrony to Asynchrony. |
CONCUR |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Glynn Winskel |
Event Structures as Presheaves -Two Representation Theorems. |
CONCUR |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Christine Röckl, Javier Esparza |
Proof-Checking Protocols Using Bisimulations. |
CONCUR |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Arkadi Estrin, Michael Kaminski |
The Expressive Power of Temporal Logic of Actions (Extended Abstract). |
CONCUR |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Yuh-Jzer Joung |
Localizability of Fairness Constraints and Their Distributed Implementations. |
CONCUR |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Hubert Comon, Yan Jurski |
Timed Automata and the Theory of Real Numbers. |
CONCUR |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Flemming Nielson, Hanne Riis Nielson, René Rydhof Hansen, Jacob Grydholt Jensen |
Validating Firewalls in Mobile Ambients. |
CONCUR |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Thomas A. Henzinger, Benjamin Horowitz, Rupak Majumdar |
Rectangular Hybrid Games. |
CONCUR |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | David Nowak, Jean-Pierre Talpin, Paul Le Guernic |
Synchronous Structures. |
CONCUR |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Javier Esparza, Stefan Römer |
An Unfolding Algorithm for Synchronous Products of Transition Systems. |
CONCUR |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Rob J. van Glabbeek |
Petri Nets, Configuration Structures and Higher Dimensional Automata. |
CONCUR |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Jan Tretmans |
Testing Concurrent Systems: A Formal Approach. |
CONCUR |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul C. Attie |
Synthesis of Large Concurrent Programs via Pairwise Composition. |
CONCUR |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Burkhard Bieber, Hans Fleischhack |
Model Checking of Time Petri Nets Based on Partial Order Semantics. |
CONCUR |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Yuxi Fu |
Open Bisimulations on Chi Processes. |
CONCUR |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Rémi Morin, Brigitte Rozoy |
On the Semantics of Place/Transition Nets. |
CONCUR |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Josée Desharnais, Vineet Gupta 0001, Radha Jagadeesan, Prakash Panangaden |
Metrics for Labeled Markov Systems. |
CONCUR |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Christel Baier, Joost-Pieter Katoen, Holger Hermanns |
Approximate Symbolic Model Checking of Continuous-Time Markov Chains. |
CONCUR |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Jos C. M. Baeten, Sjouke Mauw (eds.) |
CONCUR '99: Concurrency Theory, 10th International Conference, Eindhoven, The Netherlands, August 24-27, 1999, Proceedings |
CONCUR |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Rajeev Alur, Luca de Alfaro, Thomas A. Henzinger, Freddy Y. C. Mang |
Automating Modular Verification. |
CONCUR |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Antonín Kucera 0001, Richard Mayr |
Weak Bisimilarity with Infinite-State Systems Can Be Decided in Polynomial Time. |
CONCUR |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Barbara König 0001 |
Generating Type Systems for Process Graphs. |
CONCUR |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Nobuko Yoshida, Matthew Hennessy |
Suptyping and Locality in Distributed Higher Order Processes (extended abstract). |
CONCUR |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Johan Bengtsson, Bengt Jonsson 0001, Johan Lilius, Wang Yi 0001 |
Partial Order Reductions for Timed Systems. |
CONCUR |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Perdita Stevens |
Abstract Games for Infinite State Processes. |
CONCUR |
1998 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")
data released under the ODC-BY 1.0 license