Search results for "CONCUR"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
1	Peter W. O'Hearn	Resources, Concurrency and Local Reasoning.	CONCUR	2004	DBLP DOI BibTeX RDF
1	Parosh Aziz Abdulla, Bengt Jonsson 0001, Marcus Nilsson, Mayank Saksena	A Survey of Regular Model Checking.	CONCUR	2004	DBLP DOI BibTeX RDF
1	Tomás Brázdil, Antonín Kucera 0001, Oldrich Strazovský	Deciding Probabilistic Bisimilarity Over Infinite-State Probabilistic Systems.	CONCUR	2004	DBLP DOI BibTeX RDF
1	Bartek Klin, Pawel Sobocinski 0001	Syntactic Formats for Free.	CONCUR	2003	DBLP DOI BibTeX RDF
1	Barry Norton, Gerald Lüttgen, Michael Mendler	A Compositional Semantic Theory for Synchronous Component-based Design.	CONCUR	2003	DBLP DOI BibTeX RDF
1	Philippa Gardner, Cosimo Laneve, Lucian Wischik	Linear Forwarders.	CONCUR	2003	DBLP DOI BibTeX RDF
1	Eugene W. Stark, Rance Cleaveland, Scott A. Smolka	A Process-Algebraic Language for Probabilistic I/O Automata.	CONCUR	2003	DBLP DOI BibTeX RDF
1	Paulo Mateus, John C. Mitchell, Andre Scedrov	Composition of Cryptographic Protocols in a Probabilistic Polynomial-Time Process Calculus.	CONCUR	2003	DBLP DOI BibTeX RDF
1	Ahmed Bouajjani, Peter Habermehl, Tomás Vojnar	Verification of Parametric Concurrent Systems with Prioritized FIFO Resource Management.	CONCUR	2003	DBLP DOI BibTeX RDF
1	Uwe Nestmann, Rachele Fuzzati, Massimo Merro	Modeling Consensus in a Process Calculus.	CONCUR	2003	DBLP DOI BibTeX RDF
1	Rohit Chadha, John C. Mitchell, Andre Scedrov, Vitaly Shmatikov	Contract Signing, Optimism, and Advantage.	CONCUR	2003	DBLP DOI BibTeX RDF
1	Blaise Genest, Loïc Hélouët, Anca Muscholl	High-Level Message Sequence Charts and Projections.	CONCUR	2003	DBLP DOI BibTeX RDF
1	Rob J. van Glabbeek, Frits W. Vaandrager	Bundle Event Structures and CCSP.	CONCUR	2003	DBLP DOI BibTeX RDF
1	Paul Gastin, Dietrich Kuske	Satisfiability and Model Checking for MSO-definable Temporal Logics are in PSPACE.	CONCUR	2003	DBLP DOI BibTeX RDF
1	Nina Amla, E. Allen Emerson, Kedar S. Namjoshi, Richard J. Trefler	Abstract Patterns of Compositional Reasoning.	CONCUR	2003	DBLP DOI BibTeX RDF
1	Nancy A. Lynch	Input/Output Automata: Basic, Timed, Hybrid, Probabilistic, Dynamic, ...	CONCUR	2003	DBLP DOI BibTeX RDF
1	Naoya Nitta, Hiroyuki Seki	An Extension of Pushdown System and Its Model Checking Method.	CONCUR	2003	DBLP DOI BibTeX RDF
1	Arie Gurfinkel, Marsha Chechik	Multi-Valued Model Checking via Classical Model Checking.	CONCUR	2003	DBLP DOI BibTeX RDF
1	Mikkel Nygaard, Glynn Winskel	Full Abstraction for HOPLA.	CONCUR	2003	DBLP DOI BibTeX RDF
1	Christel Baier, Holger Hermanns, Joost-Pieter Katoen, Verena Wolf	Comparative Branching-Time Semantics.	CONCUR	2003	DBLP DOI BibTeX RDF
1	Madhavan Mukund, K. Narayan Kumar, P. S. Thiagarajan	Netcharts: Bridging the gap between HMSCs and executable specifications.	CONCUR	2003	DBLP DOI BibTeX RDF
1	Luca de Alfaro, Marco Faella, Thomas A. Henzinger, Rupak Majumdar, Mariëlle Stoelinga	The Element of Surprise in Timed Games.	CONCUR	2003	DBLP DOI BibTeX RDF
1	Alessandra Di Pierro, Chris Hankin, Herbert Wiklicky	Quantitative Relations and Approximate Process Equivalences.	CONCUR	2003	DBLP DOI BibTeX RDF
1	Nancy A. Lynch, Roberto Segala, Frits W. Vaandrager	Compositionality for Probabilistic Automata.	CONCUR	2003	DBLP DOI BibTeX RDF
1	Roberto M. Amadio, Denis Lugiez (eds.)	CONCUR 2003 - Concurrency Theory, 14th International Conference, Marseille, France, September 3-5, 2003, Proceedings	CONCUR	2003	DBLP DOI BibTeX RDF
1	Luca de Alfaro	Quantitative Verification and Control via the Mu-Calculus.	CONCUR	2003	DBLP DOI BibTeX RDF
1	Vincent Danos, Josée Desharnais, Prakash Panangaden	Conditional Expectation and the Approximation of Labelled Markov Processes.	CONCUR	2003	DBLP DOI BibTeX RDF
1	Nicolas Markey, Philippe Schnoebelen	Model Checking a Path.	CONCUR	2003	DBLP DOI BibTeX RDF
1	Michael Backes 0001	Unifying Simulatability Definitions in Cryptographic Systems under Different Timing Assumptions.	CONCUR	2003	DBLP DOI BibTeX RDF
1	Rajeev Alur, Salvatore La Torre, P. Madhusudan	Playing Games with Boxes and Diamonds.	CONCUR	2003	DBLP DOI BibTeX RDF
1	Petr Jancar, Antonín Kucera 0001, Faron Moller	Deciding Bisimilarity between BPA and BPP Processes.	CONCUR	2003	DBLP DOI BibTeX RDF
1	Alin Stefanescu, Javier Esparza, Anca Muscholl	Synthesis of Distributed Algorithms Using Asynchronous Automata.	CONCUR	2003	DBLP DOI BibTeX RDF
1	Rajeev Alur, Swarat Chaudhuri, Kousha Etessami, Sudipto Guha, Mihalis Yannakakis	Compression of Partially Ordered Strings.	CONCUR	2003	DBLP DOI BibTeX RDF
1	Flavio Corradini, Maria Rita Di Berardini, Walter Vogler	Relating Fairness and Timing in Process Algebras.	CONCUR	2003	DBLP DOI BibTeX RDF
1	Zdenek Sawa	Equivalence Checking of Non-Flat Systems Is EXPTIME-hard.	CONCUR	2003	DBLP DOI BibTeX RDF
1	Albert Benveniste, Stefan Haar, Eric Fabre, Claude Jard	Distributed Monitoring of Concurrent and Asynchronous Systems.	CONCUR	2003	DBLP DOI BibTeX RDF
1	Irek Ulidowski	Priority Rewrite Systems for OSOS Process Languages.	CONCUR	2003	DBLP DOI BibTeX RDF
1	Beata Konikowska, Wojciech Penczek	Reducing Model Checking from Multi-valued {\rm CTL}^{\ast} to {\rm CTL}^{\ast}.	CONCUR	2002	DBLP DOI BibTeX RDF
1	Hagen Völzer	Refinement-Robust Fairness.	CONCUR	2002	DBLP DOI BibTeX RDF
1	Jirí Srba	Undecidability of Weak Bisimilarity for Pushdown Processes.	CONCUR	2002	DBLP DOI BibTeX RDF
1	Christel Baier, Joost-Pieter Katoen, Holger Hermanns, Boudewijn R. Haverkort	Simulation for Continuous-Time Markov Chains.	CONCUR	2002	DBLP DOI BibTeX RDF
1	Antonín Kucera 0001, Richard Mayr	Why Is Simulation Harder than Bisimulation?	CONCUR	2002	DBLP DOI BibTeX RDF
1	Vaughan R. Pratt	Event-State Duality: The Enriched Case.	CONCUR	2002	DBLP DOI BibTeX RDF
1	Alexander Moshe Rabinovich	Expressive Power of Temporal Logics.	CONCUR	2002	DBLP DOI BibTeX RDF
1	P. Madhusudan, P. S. Thiagarajan	A Decidable Class of Asynchronous Distributed Controllers.	CONCUR	2002	DBLP DOI BibTeX RDF
1	Philippa Gardner, Cosimo Laneve, Lucian Wischik	The Fusion Machine.	CONCUR	2002	DBLP DOI BibTeX RDF
1	Maria Grazia Buscemi, Ugo Montanari	A First Order Coalgebraic Model of pi-Calculus Early Observational Equivalence.	CONCUR	2002	DBLP DOI BibTeX RDF
1	Antti Valmari, Antti Kervinen	Alphabet-Based Synchronisation is Exponentially Cheaper.	CONCUR	2002	DBLP DOI BibTeX RDF
1	Gerald Lüttgen, Michael Mendler	Axiomatizing an Algebra of Step Reactions for Synchronous Languages.	CONCUR	2002	DBLP DOI BibTeX RDF
1	Roberto Bruni, Cosimo Laneve, Ugo Montanari	Orchestrating Transactions in Join Calculus.	CONCUR	2002	DBLP DOI BibTeX RDF
1	Amir Pnueli, Yonit Kesten	A Deductive Proof System for CTL.	CONCUR	2002	DBLP DOI BibTeX RDF
1	Stephen D. Brookes	Traces, Pomsets, Fairness and Full Abstraction for Communicating Processes.	CONCUR	2002	DBLP DOI BibTeX RDF
1	H. C. M. Kleijn, Maciej Koutny	Causality Semantics of Petri Nets with Weighted Inhibitor Arcs.	CONCUR	2002	DBLP DOI BibTeX RDF	theory of concurrency, weighted inhibitor arcs, causality semantics, occurrence nets, Petri nets, step sequences
1	Yonit Kesten, Amir Pnueli, Elad Shahar, Lenore D. Zuck	Network Invariants in Action.	CONCUR	2002	DBLP DOI BibTeX RDF
1	Julian C. Bradfield	Introduction to Modal and Temporal Mu-Calculi (Abstract).	CONCUR	2002	DBLP DOI BibTeX RDF
1	Michele Boreale, Maria Grazia Buscemi	A Framework for the Analysis of Security Protocols.	CONCUR	2002	DBLP DOI BibTeX RDF
1	Jens Chr. Godskesen, Thomas T. Hildebrandt, Vladimiro Sassone	A Calculus of Mobile Resources.	CONCUR	2002	DBLP DOI BibTeX RDF
1	Kousha Etessami	A Hierarchy of Polynomial-Time Computable Simulations for Automata.	CONCUR	2002	DBLP DOI BibTeX RDF
1	Eugene Asarin, Gerardo Schneider	Widening the Boundary between Decidable and Undecidable Hybrid Systems.	CONCUR	2002	DBLP DOI BibTeX RDF
1	Parosh Aziz Abdulla, Bengt Jonsson 0001, Marcus Nilsson, Julien d'Orso	Regular Model Checking Made Simple and Efficient.	CONCUR	2002	DBLP DOI BibTeX RDF
1	Martin Lange	Local Model Checking Games for Fixed Point Logic with Chop.	CONCUR	2002	DBLP DOI BibTeX RDF
1	Wan J. Fokkink, Natalia Ioustinova, Ernst Kesseler, Jaco van de Pol, Yaroslav S. Usenko, Yuri A. Yushtein	Refinement and Verification Applied to an In-Flight Data Acquisition Unit.	CONCUR	2002	DBLP DOI BibTeX RDF	&#55CRL, model checking, verification, refinement, B-method
1	Slawomir Lasota 0001	Decidability of Strong Bisimilarity for Timed BPP.	CONCUR	2002	DBLP DOI BibTeX RDF
1	Markus Lohrey	Safe Realizability of High-Level Message Sequence Charts.	CONCUR	2002	DBLP DOI BibTeX RDF
1	Mikkel Nygaard, Glynn Winskel	HOPLA-A Higher-Order Process Language.	CONCUR	2002	DBLP DOI BibTeX RDF
1	Davide Sangiorgi	Types, or: Where's the Difference Between CCS and pi?	CONCUR	2002	DBLP DOI BibTeX RDF
1	Andrew D. Gordon 0001	Types for Cryptographic Protocols.	CONCUR	2002	DBLP DOI BibTeX RDF
1	Ralf Küsters	On the Decidability of Cryptographic Protocols with Open-Ended Data Structures.	CONCUR	2002	DBLP DOI BibTeX RDF
1	Maria Sorea	A Decidable Fixpoint Logic for Time-Outs.	CONCUR	2002	DBLP DOI BibTeX RDF
1	Lubos Brim, Petr Jancar, Mojmír Kretínský, Antonín Kucera 0001 (eds.)	CONCUR 2002 - Concurrency Theory, 13th International Conference, Brno, Czech Republic, August 20-23, 2002, Proceedings	CONCUR	2002	DBLP DOI BibTeX RDF
1	Josée Desharnais, Vineet Gupta 0001, Radha Jagadeesan, Prakash Panangaden	Weak Bisimulation is Sound and Complete for PCTL*.	CONCUR	2002	DBLP DOI BibTeX RDF
1	Luís Caires, Luca Cardelli	A Spatial Logic for Concurrency (Part II).	CONCUR	2002	DBLP DOI BibTeX RDF
1	Stefano Cattani, Roberto Segala	Decision Algorithms for Probabilistic Bisimulation.	CONCUR	2002	DBLP DOI BibTeX RDF
1	Jean Fanchon, Rémi Morin	Regular Sets of Pomsets with Autoconcurrency.	CONCUR	2002	DBLP DOI BibTeX RDF
1	David Teller, Pascal Zimmer, Daniel Hirschkoff	Using Ambients to Control Resources.	CONCUR	2002	DBLP DOI BibTeX RDF
1	Massimo Merro, Vladimiro Sassone	Typing and Subtyping Mobility in Boxed Ambients.	CONCUR	2002	DBLP DOI BibTeX RDF
1	Roberto M. Amadio, Witold Charatonik	On Name Generation and Set-Based Analysis in the Dolev-Yao Model.	CONCUR	2002	DBLP DOI BibTeX RDF	name generation, verification, cryptographic protocols, set constraints
1	Jaco Geldenhuys, Antti Valmari	Techniques for Smaller Intermediary BDDs.	CONCUR	2001	DBLP DOI BibTeX RDF
1	Luca de Alfaro, Thomas A. Henzinger, Rupak Majumdar	Symbolic Algorithms for Infinite-State Games.	CONCUR	2001	DBLP DOI BibTeX RDF
1	Keijo Heljanko	Bounded Reachability Checking with Process Semantics.	CONCUR	2001	DBLP DOI BibTeX RDF
1	Alessandro Aldini	Probabilistic Information Flow in a Process Algebra.	CONCUR	2001	DBLP DOI BibTeX RDF
1	Peter Niebert, Michaela Huhn, Sarah Zennou, Denis Lugiez	Local First Search - A New Paradigm for Partial Order Reductions.	CONCUR	2001	DBLP DOI BibTeX RDF
1	Jirí Srba	On the Power of Labels in Transition Systems.	CONCUR	2001	DBLP DOI BibTeX RDF
1	Victor Khomenko, Maciej Koutny	Towards an Efficient Algorithm for Unfolding Petri Nets.	CONCUR	2001	DBLP DOI BibTeX RDF	Model checking, Petri nets, concurrency, unfolding
1	Kim Guldstrand Larsen, Mogens Nielsen (eds.)	CONCUR 2001 - Concurrency Theory, 12th International Conference, Aalborg, Denmark, August 20-25, 2001, Proceedings	CONCUR	2001	DBLP DOI BibTeX RDF
1	Orna Kupferman, Nir Piterman, Moshe Y. Vardi	Extended Temporal Logic Revisited.	CONCUR	2001	DBLP DOI BibTeX RDF
1	Antti Puhakka, Antti Valmari	Liveness and Fairness in Process-Algebraic Verification.	CONCUR	2001	DBLP DOI BibTeX RDF
1	Yifeng Chen, Jeff W. Sanders	Logic of Global Synchrony.	CONCUR	2001	DBLP DOI BibTeX RDF
1	Natalia López, Manuel Núñez 0001	A Testing Theory for Generally Distributed Stochastic Processes.	CONCUR	2001	DBLP DOI BibTeX RDF
1	Hagen Völzer	Randomized Non-sequential Processes.	CONCUR	2001	DBLP DOI BibTeX RDF
1	Paul C. Attie, Nancy A. Lynch	Dynamic Input/Output Automata: A Formal Model for Dynamic Systems.	CONCUR	2001	DBLP DOI BibTeX RDF
1	Paolo Baldan, Andrea Corradini 0001, Barbara König 0001	A Static Analysis Technique for Graph Transformation Systems.	CONCUR	2001	DBLP DOI BibTeX RDF
1	Franck van Breugel, James Worrell 0001	An Algorithm for Quantitative Verification of Probabilistic Transition Systems.	CONCUR	2001	DBLP DOI BibTeX RDF
1	Paolo Baldan, Andrea Corradini 0001, Hartmut Ehrig, Reiko Heckel	Compositional Modeling of Reactive Systems Using Open Nets.	CONCUR	2001	DBLP DOI BibTeX RDF
1	Gerald Lüttgen, Walter Vogler	A Faster-than Relation for Asynchronous Processes.	CONCUR	2001	DBLP DOI BibTeX RDF
1	Dan Hirsch, Ugo Montanari	Synchronized Hyperedge Replacement with Name Mobility.	CONCUR	2001	DBLP DOI BibTeX RDF
1	John Hatcliff, Matthew B. Dwyer	Using the Bandera Tool Set to Model-Check Properties of Concurrent Java Software.	CONCUR	2001	DBLP DOI BibTeX RDF
1	Marsha Chechik, Benet Devereux, Steve M. Easterbrook, Albert Y. C. Lai, Victor Petrovykh	Efficient Multiple-Valued Model-Checking Using Lattice Representations.	CONCUR	2001	DBLP DOI BibTeX RDF
1	Giuseppe Castagna, Giorgio Ghelli, Francesco Zappa Nardelli	Typing Mobility in the Seal Calculus.	CONCUR	2001	DBLP DOI BibTeX RDF
1	Robin Milner	Bigraphical Reactive Systems.	CONCUR	2001	DBLP DOI BibTeX RDF

Publications at "CONCUR"( http://dblp.L3S.de/Venues/CONCUR )