The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

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

URL (DBLP): http://dblp.uni-trier.de/db/conf/concur

Publication years (Num. hits)
1990 (37) 1991 (38) 1992 (40) 1993 (38) 1994 (38) 1995 (41) 1996 (45) 1997 (29) 1998 (42) 1999 (39) 2000 (43) 2001 (39) 2002 (40) 2003 (34) 2004 (34) 2005 (43) 2006 (35) 2007 (34) 2008 (40) 2009 (42) 2010 (41) 2011 (37) 2012 (40)
Publication types (Num. hits)
inproceedings(866) proceedings(23)
Venues (Conferences, Journals, ...)
CONCUR(889)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 101 occurrences of 66 keywords

Results
Found 889 publication records. Showing 889 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
1Maciej Koutny, Irek Ulidowski (eds.) CONCUR 2012 - Concurrency Theory - 23rd International Conference, CONCUR 2012, Newcastle upon Tyne, UK, September 4-7, 2012. Proceedings Search on Bibsonomy CONCUR The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Mohsen Lesani, Victor Luchangco, Mark Moir A Framework for Formally Verifying Software Transactional Memory Algorithms. Search on Bibsonomy CONCUR The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Fides Aarts, Faranak Heidarian, Frits W. Vaandrager A Theory of History Dependent Abstractions for Learning Interface Automata. Search on Bibsonomy CONCUR The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Arnaud Da Costa Lopes, François Laroussinie, Nicolas Markey Quantified CTL: Expressiveness and Model Checking - (Extended Abstract). Search on Bibsonomy CONCUR The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Henning Kerstan, Barbara König Coalgebraic Trace Semantics for Probabilistic Transition Systems Based on Measure Theory. Search on Bibsonomy CONCUR The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Wojciech Czerwinski, Piotr Hofman, Slawomir Lasota Reachability Problem for Weak Multi-Pushdown Automata. Search on Bibsonomy CONCUR The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Max Tschaikowski, Mirco Tribastone Exact Fluid Lumpability for Markovian Process Algebra. Search on Bibsonomy CONCUR The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Luca Fossati, Kohei Honda, Nobuko Yoshida Intensional and Extensional Characterisation of Global Progress in the π-Calculus. Search on Bibsonomy CONCUR The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Luca Bortolussi, Jane Hillston Fluid Model Checking. Search on Bibsonomy CONCUR The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Guy Avni, Orna Kupferman Making Weighted Containment Feasible: A Heuristic Based on Simulation and Abstraction. Search on Bibsonomy CONCUR The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Roland Meyer, Victor Khomenko, Reiner Hüchting A Polynomial Translation of π-Calculus (FCP) to Safe Petri Nets. Search on Bibsonomy CONCUR The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Daniel Hirschkoff, Jean-Marie Madiot, Davide Sangiorgi Duality and i/o-Types in the π-Calculus. Search on Bibsonomy CONCUR The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Alexander Kaiser 0001, Daniel Kroening, Thomas Wahl Efficient Coverability Analysis by Proof Minimization. Search on Bibsonomy CONCUR The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Béatrice Bérard, Serge Haddad, Mathieu Sassolas, Nathalie Sznajder Concurrent Games on VASS with Inhibition. Search on Bibsonomy CONCUR The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Mark Timmer, Joost-Pieter Katoen, Jaco van de Pol, Mariëlle Stoelinga Efficient Modelling and Generation of Markov Automata. Search on Bibsonomy CONCUR The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Tzu-Chun Chen, Kohei Honda Specifying Stateful Asynchronous Properties for Distributed Programs. Search on Bibsonomy CONCUR The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Gordon D. Plotkin Concurrency and the Algebraic Theory of Effects - (Abstract). Search on Bibsonomy CONCUR The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Julien Lange, Emilio Tuosto Synthesising Choreographies from Local Session Types. Search on Bibsonomy CONCUR The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Krishnendu Chatterjee, Mickael Randour, Jean-François Raskin Strategy Synthesis for Multi-Dimensional Quantitative Objectives. Search on Bibsonomy CONCUR The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1César Rodríguez, Stefan Schwoon Verification of Petri Nets with Read Arcs. Search on Bibsonomy CONCUR The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Jos C. M. Baeten, Bas Luttik, Paul van Tilburg Turing Meets Milner. Search on Bibsonomy CONCUR The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Romain Brenguier, Stefan Göller, Ocan Sankur A Comparison of Succinctly Represented Finite-State Systems. Search on Bibsonomy CONCUR The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Roy Mennicke Propositional Dynamic Logic with Converse and Repeat for Message-Passing Systems. Search on Bibsonomy CONCUR The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Aiswarya Cyriac, Paul Gastin, K. Narayan Kumar MSO Decidability of Multi-Pushdown Systems via Split-Width. Search on Bibsonomy CONCUR The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Sophia Knight, Catuscia Palamidessi, Prakash Panangaden, Frank D. Valencia Spatial and Epistemic Modalities in Constraint-Based Process Calculi. Search on Bibsonomy CONCUR The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Daniel Gebler, Wan Fokkink Compositionality of Probabilistic Hennessy-Milner Logic through Structural Operational Semantics. Search on Bibsonomy CONCUR The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Sandie Balaguer, Thomas Chatain Avoiding Shared Clocks in Networks of Timed Automata. Search on Bibsonomy CONCUR The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Matthias Függer, Josef Widder Efficient Checking of Link-Reversal-Based Concurrent Systems. Search on Bibsonomy CONCUR The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Lukasz Mikulski Algebraic Structure of Combined Traces. Search on Bibsonomy CONCUR The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Romain Demangeon, Kohei Honda Nested Protocols in Session Types. Search on Bibsonomy CONCUR The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Brian Randell A Turing Enigma. Search on Bibsonomy CONCUR The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Nengkun Yu, Mingsheng Ying Reachability and Termination Analysis of Concurrent Quantum Programs. Search on Bibsonomy CONCUR The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Peter Sewell False Concurrency and Strange-but-True Machines - (Abstract). Search on Bibsonomy CONCUR The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Fabio Mogavero, Aniello Murano, Giuseppe Perelli, Moshe Y. Vardi What Makes Atl* Decidable? A Decidable Fragment of Strategy Logic. Search on Bibsonomy CONCUR The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Emmanuel Filiot, Raffaella Gentilini, Jean-François Raskin Quantitative Languages Defined by Functional Automata. Search on Bibsonomy CONCUR The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Frank S. de Boer, Mohammad Mahdi Jaghoori, Cosimo Laneve, Gianluigi Zavattaro Decidability Problems for Actor Systems. Search on Bibsonomy CONCUR The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Alexey Gotsman, Hongseok Yang Linearizability with Ownership Transfer. Search on Bibsonomy CONCUR The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Ryszard Janicki, Xiang Yin, Nadezhda Zubkova Modeling Interval Order Structures with Partially Commutative Monoids. Search on Bibsonomy CONCUR The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Taolue Chen, Vojtech Forejt, Marta Z. Kwiatkowska, Aistis Simaitis, Ashutosh Trivedi, Michael Ummels Playing Stochastic Games Precisely. Search on Bibsonomy CONCUR The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Antti Valmari All Linear-Time Congruences for Familiar Operators Part 2: Infinite LTSs. Search on Bibsonomy CONCUR The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Farn Wang, Chung-Hao Huang, Fang Yu A Temporal Logic for the Interaction of Strategies. Search on Bibsonomy CONCUR The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Wil M. P. van der Aalst, Arya Adriansyah, Boudewijn F. van Dongen Causal Nets: A Modeling Language Tailored towards Process Discovery. Search on Bibsonomy CONCUR The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Jonathan Hayman Granularity and Concurrent Separation Logic. Search on Bibsonomy CONCUR The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Tomás Brázdil, Jan Krcál, Jan Kretínský, Vojtech Rehák Fixed-Delay Events in Generalized Semi-Markov Processes Revisited. Search on Bibsonomy CONCUR The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Joël Ouaknine, Hristina Palikareva, A. W. Roscoe, James Worrell Static Livelock Analysis in CSP. Search on Bibsonomy CONCUR The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Stefan Göller, Anthony Widjaja Lin Refining the Process Rewrite Systems Hierarchy via Ground Tree Rewrite Systems. Search on Bibsonomy CONCUR The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Ruggero Lanotte, Massimo Merro Semantic Analysis of Gossip Protocols for Wireless Sensor Networks. Search on Bibsonomy CONCUR The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Michael Benedikt, Rastislav Lenhardt, James Worrell Two Variable vs. Linear Temporal Logic in Model Checking and Games. Search on Bibsonomy CONCUR The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Lei Song, Lijun Zhang 0001, Jens Chr. Godskesen Bisimulations Meet PCTL Equivalences for Probabilistic Automata. Search on Bibsonomy CONCUR The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Vineet Kahlon Reasoning about Threads with Bounded Lock Chains. Search on Bibsonomy CONCUR The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Romain Demangeon, Kohei Honda Full Abstraction in a Subtyped pi-Calculus with Linear Types. Search on Bibsonomy CONCUR The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Ivan Lanese, Claudio Antares Mezzina, Alan Schmitt, Jean-Bernard Stefani Controlling Reversibility in Higher-Order Pi. Search on Bibsonomy CONCUR The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Jérôme Leroux Vector Addition System Reversible Reachability Problem. Search on Bibsonomy CONCUR The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Christel Baier, Joachim Klein, Sascha Klüppelholz A Compositional Framework for Controller Synthesis. Search on Bibsonomy CONCUR The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Benedikt Bollig An Automaton over Data Words That Captures EMSO Logic. Search on Bibsonomy CONCUR The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Paritosh K. Pandya, Simoni S. Shah On Expressive Powers of Timed Logics: Comparing Boundedness, Non-punctuality, and Deterministic Freezing. Search on Bibsonomy CONCUR The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Joost-Pieter Katoen, Barbara König (eds.) CONCUR 2011 - Concurrency Theory - 22nd International Conference, CONCUR 2011, Aachen, Germany, September 6-9, 2011. Proceedings Search on Bibsonomy CONCUR The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Patricia Bouyer, Kim G. Larsen, Nicolas Markey, Ocan Sankur, Claus R. Thrane Timed Automata Can Always Be Made Implementable. Search on Bibsonomy CONCUR The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Chaodong He The Decidability of the Reachability Problem for CCS! Search on Bibsonomy CONCUR The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Parosh Aziz Abdulla Carrying Probabilities to the Infinite World. Search on Bibsonomy CONCUR The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Rob J. van Glabbeek, Ursula Goltz, Jens-Wolfhard Schicke On Causal Semantics of Petri Nets. Search on Bibsonomy CONCUR The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Parosh Aziz Abdulla, Yu-Fang Chen, Lorenzo Clemente, Lukás Holík, Chih-Duo Hong, Richard Mayr, Tomás Vojnar Advanced Ramsey-Based Büchi Automata Inclusion Testing. Search on Bibsonomy CONCUR The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Jasmin Fisher, Thomas A. Henzinger, Dejan Nickovic, Nir Piterman, Anmol V. Singh, Moshe Y. Vardi Dynamic Reactive Modules. Search on Bibsonomy CONCUR The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Hans Hüttel Typed ψ-calculi. Search on Bibsonomy CONCUR The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1César Rodríguez, Stefan Schwoon, Paolo Baldan Efficient Contextual Unfolding. Search on Bibsonomy CONCUR The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Silvia Crafa, Francesco Ranzato A Spectrum of Behavioral Relations over LTSs on Probability Distributions. Search on Bibsonomy CONCUR The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Wojciech Czerwinski, Piotr Hofman, Slawomir Lasota Decidability of Branching Bisimulation on Normed Commutative Context-Free Processes. Search on Bibsonomy CONCUR The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Roberto Bruni, Hernán C. Melgratti, Ugo Montanari A Connector Algebra for P/T Nets Interactions. Search on Bibsonomy CONCUR The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1M. Praveen, Kamal Lodaya Parameterized Complexity Results for 1-safe Petri Nets. Search on Bibsonomy CONCUR The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Byron Cook, Christoph Haase, Joël Ouaknine, Matthew J. Parkinson, James Worrell Tractable Reasoning in a Fragment of Separation Logic. Search on Bibsonomy CONCUR The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Michael Ummels, Dominik Wojtczak The Complexity of Nash Equilibria in Limit-Average Games. Search on Bibsonomy CONCUR The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Eli Gafni, Rachid Guerraoui Generalized Universality. Search on Bibsonomy CONCUR The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Lars Kuhtz, Bernd Finkbeiner Weak Kripke Structures and LTL. Search on Bibsonomy CONCUR The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Fu Song, Tayssir Touili Efficient CTL Model-Checking for Pushdown Systems. Search on Bibsonomy CONCUR The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1C. A. R. Hoare, Akbar Hussain, Bernhard Möller, Peter W. O'Hearn, Rasmus Lerchedahl Petersen, Georg Struth On Locality and the Exchange Law for Concurrent Processes. Search on Bibsonomy CONCUR The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Salvatore La Torre, Margherita Napoli Reachability of Multistack Pushdown Systems with Scope-Bounded Matching Relations. Search on Bibsonomy CONCUR The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Frédéric Herbreteau, B. Srivathsan Coarse Abstractions Make Zeno Behaviours Difficult to Detect. Search on Bibsonomy CONCUR The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Krishnendu Chatterjee, Florian Horn, Christof Löding Obliging Games. Search on Bibsonomy CONCUR The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Parosh Aziz Abdulla, Yu-Fang Chen, Giorgio Delzanno, Frédéric Haziza, Chih-Duo Hong, Ahmed Rezine Constrained Monotonic Abstraction: A CEGAR for Parameterized Verification. Search on Bibsonomy CONCUR The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Ramaswamy Ramanujam, Sunil Easaw Simon A Communication Based Model for Games of Imperfect Information. Search on Bibsonomy CONCUR The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Tim A. C. Willemse Consistent Correlations for Parameterised Boolean Equation Systems with Applications in Correctness Proofs for Manipulations. Search on Bibsonomy CONCUR The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Ming Fu, Yong Li, Xinyu Feng, Zhong Shao, Yu Zhang Reasoning about Optimistic Concurrency Using a Program Logic for History. Search on Bibsonomy CONCUR The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Laura Bocchi, Kohei Honda, Emilio Tuosto, Nobuko Yoshida A Theory of Design-by-Contract for Distributed Multiparty Interactions. Search on Bibsonomy CONCUR The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Pawel Sobocinski Representations of Petri Net Interactions. Search on Bibsonomy CONCUR The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Luís Caires, Frank Pfenning Session Types as Intuitionistic Linear Propositions. Search on Bibsonomy CONCUR The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Roberto Segala, Andrea Turrini Conditional Automata: A Tool for Safe Removal of Negligible Events. Search on Bibsonomy CONCUR The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Vladimiro Sassone, Sardaouna Hamadou, Mu Yang Trust in Anonymity Networks. Search on Bibsonomy CONCUR The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Stanislav Böhm, Stefan Göller, Petr Jancar Bisimilarity of One-Counter Processes Is PSPACE-Complete. Search on Bibsonomy CONCUR The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Pierre-Malo Deniélou, Nobuko Yoshida Buffered Communication Analysis in Distributed Multiparty Sessions. Search on Bibsonomy CONCUR The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Dan R. Ghica, Mohamed N. Menaa On the Compositionality of Round Abstraction. Search on Bibsonomy CONCUR The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Paul Gastin, François Laroussinie (eds.) CONCUR 2010 - Concurrency Theory, 21th International Conference, CONCUR 2010, Paris, France, August 31-September 3, 2010. Proceedings Search on Bibsonomy CONCUR The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Christian Eisentraut, Holger Hermanns, Lijun Zhang 0001 Concurrency and Composition in a Stochastic World. Search on Bibsonomy CONCUR The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Paolo Baldan, Silvia Crafa A Logic for True Concurrency. Search on Bibsonomy CONCUR The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Sara Capecchi, Ilaria Castellani, Mariangiola Dezani-Ciancaglini, Tamara Rezk Session Types for Access and Information Flow Control. Search on Bibsonomy CONCUR The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Antoine Durand-Gasselin, Peter Habermehl On the Use of Non-deterministic Automata for Presburger Arithmetic. Search on Bibsonomy CONCUR The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Thibaut Balabonski, Emmanuel Haucourt A Geometric Approach to the Problem of Unique Decomposition of Processes. Search on Bibsonomy CONCUR The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Romain Demangeon, Daniel Hirschkoff, Davide Sangiorgi Termination in Impure Concurrent Languages. Search on Bibsonomy CONCUR The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Krishnendu Chatterjee, Laurent Doyen, Herbert Edelsbrunner, Thomas A. Henzinger, Philippe Rannou Mean-Payoff Automaton Expressions. Search on Bibsonomy CONCUR The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Marco Giunti, Vasco Thudichum Vasconcelos A Linear Account of Session Types in the Pi Calculus. Search on Bibsonomy CONCUR The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Anca Muscholl Taming Distributed Asynchronous Systems. Search on Bibsonomy CONCUR The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #100 of 889 (100 per page; Change: )
Pages: [1][2][3][4][5][6][7][8][9][>>]
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.