CONCUR 2004 -- concurrency theory. 15th international conference, London, UK, August 31 -- September 3, 2004. Proceedings. (Q1769770)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | CONCUR 2004 -- concurrency theory. 15th international conference, London, UK, August 31 -- September 3, 2004. Proceedings. |
scientific article |
Statements
CONCUR 2004 -- concurrency theory. 15th international conference, London, UK, August 31 -- September 3, 2004. Proceedings. (English)
0 references
23 March 2005
0 references
The articles of this volume will be reviewed individually. For the preceding conference see [Zbl 1026.00029]. Indexed articles: \textit{Andrews, Tony; Qadeer, Shaz; Rajamani, Sriram K.; Rehof, Jakob; Xie, Yichen}, Zing: Exploiting program structure for model checking concurrent software, 1-15 [Zbl 1099.68583] \textit{Brookes, Stephen}, A semantics for concurrent separation logic, 16-34 [Zbl 1099.68650] \textit{Abdulla, Parosh Aziz; Jonsson, Bengt; Nilsson, Marcus; Saksena, Mayank}, A survey of regular model checking, 35-48 [Zbl 1099.68055] \textit{O'Hearn, Peter W.}, Resources, concurrency and local reasoning, 49-67 [Zbl 1099.68588] \textit{Amadio, Roberto M.; Dal Zilio, Silvano}, Resource control for synchronous cooperative threads, 68-82 [Zbl 1097.68535] \textit{Baldan, Paolo; Corradini, Andrea; König, Barbara}, Verifying finite-state graph grammars: An unfolding-based approach, 83-98 [Zbl 1099.68046] \textit{Baudru, Nicolas; Morin, Rémi}, The pros and cons of netcharts, 99-114 [Zbl 1099.68063] \textit{Berger, Martin}, Basic theory of reduction congruence for two timed asynchronous \(\pi\)-calculi, 115-130 [Zbl 1099.68064] \textit{Bojańczyk, Mikołaj; Walukiewicz, Igor}, Characterizing EF and EX tree logics, 131-145 [Zbl 1097.03504] \textit{Bollig, Benedikt; Leucker, Martin}, Message-passing automata are expressively equivalent to EMSO logic, 146-160 [Zbl 1097.68581] \textit{Borgström, Johannes; Briais, Sébastien; Nestmann, Uwe}, Symbolic bisimulation in the spi calculus, 161-176 [Zbl 1099.68665] \textit{Bozga, Liana; Ene, Cristian; Lakhnech, Yassine}, A symbolic decision procedure for cryptographic protocols with time stamps (extended abstract), 177-192 [Zbl 1099.94521] \textit{Brázdil, Tomáš; Kučera, Antonín; Stražovský, Oldřich}, Deciding probabilistic bisimilarity over infinite-state probabilistic systems, 193-208 [Zbl 1099.68065] \textit{Bruns, Glenn; Jagadeesan, Radha; Jeffrey, Alan; Riely, James}, \(\mu\)ABC: A minimal aspect calculus, 209-224 [Zbl 1099.68586] \textit{Bugliesi, Michele; Colazzo, Dario; Crafa, Silvia}, Type based discretionary access control, 225-239 [Zbl 1099.68666] \textit{Caires, Luís; Lozes, Étienne}, Elimination of quantifiers and undecidability in spatial logics for concurrency, 240-257 [Zbl 1097.68582] \textit{Cîrstea, Corina; Pattinson, Dirk}, Modular construction of modal logics, 258-275 [Zbl 1099.03018] \textit{Clarke, Edmund; Talupur, Muralidhar; Touili, Tayssir; Veith, Helmut}, Verification by network decomposition, 276-291 [Zbl 1099.68653] \textit{Danos, Vincent; Krivine, Jean}, Reversible communicating systems, 292-307 [Zbl 1099.68066] \textit{Groote, Jan Friso; Willemse, Tim}, Parameterised Boolean equation systems (extended abstract), 308-324 [Zbl 1099.68670] \textit{Hirschkoff, Daniel}, An extensional spatial logic for mobile processes, 325-339 [Zbl 1099.68067] \textit{Krčál, Pavel; Mokrushin, Leonid; Thiagarajan, P. S.; Yi, Wang}, Timed vs. time-triggered automata, 340-354 [Zbl 1099.68069] \textit{Křetínský, Mojmír; Řehák, Vojtěch; Strejček, Jan}, Extended process rewrite systems: Expressiveness and reachability, 355-370 [Zbl 1099.68068] \textit{Kučera, Antonín; Schnoebelen, Philippe}, A general approach to comparing infinite-state systems with their finite-state specifications, 371-386 [Zbl 1097.68577] \textit{Laroussinie, F.; Markey, N.; Schnoebelen, Ph.}, Model checking timed automata with one or two clocks, 387-401 [Zbl 1099.68057] \textit{Leroux, Jérôme; Sutre, Grégoire}, On flatness for 2-dimensional vector addition systems with states, 402-416 [Zbl 1099.68071] \textit{Ma, Qin; Maranget, Luc}, Compiling pattern matching in join-patterns, 417-431 [Zbl 1099.68671] \textit{Markey, Nicolas; Raskin, Jean-François}, Model checking restricted sets of timed paths, 432-447 [Zbl 1097.68578] \textit{Melliès, Paul-André}, Asynchronous games. II: The true concurrency of innocence, 448-465 [Zbl 1099.68672] \textit{Tabuada, Paulo}, Open maps, alternating simulations and control synthesis, 466-480 [Zbl 1099.68073] \textit{Varacca, Daniele; Völzer, Hagen; Winskel, Glynn}, Probabilistic event structures and domains, 481-496 [Zbl 1099.68676] \textit{Vasconcelos, Vasco; Ravara, António; Gay, Simon}, Session types for functional multithreading, 497-511 [Zbl 1099.68677] \textit{Viswanathan, Mahesh; Viswanathan, Ramesh}, A higher order modal fixed point logic, 512-528 [Zbl 1099.03022]
0 references