Foundations of software science and computation structures. 8th international conference, FOSSACS 2005, held as part of the joint European conferences on theory and practice of software, ETAPS 2005, Edinburgh, UK, April 4--8, 2005. Proceedings. (Q2388069)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Foundations of software science and computation structures. 8th international conference, FOSSACS 2005, held as part of the joint European conferences on theory and practice of software, ETAPS 2005, Edinburgh, UK, April 4--8, 2005. Proceedings. |
scientific article |
Statements
Foundations of software science and computation structures. 8th international conference, FOSSACS 2005, held as part of the joint European conferences on theory and practice of software, ETAPS 2005, Edinburgh, UK, April 4--8, 2005. Proceedings. (English)
0 references
6 September 2005
0 references
The articles of this volume will be reviewed individually. The preceding conference has been reviewed (see Zbl 1048.68010). Indexed articles: \textit{Ferrari, Gian Luigi; Montanari, Ugo; Tuosto, Emilio}, Model checking for nominal calculi, 1-24 [Zbl 1119.68115] \textit{Fiore, Marcelo P.}, Mathematical models of computational and combinatorial structures, 25-46 [Zbl 1119.68082] \textit{Mousavi, Mohammad Reza; Reniers, Michel A.}, Congruence for structural congruences, 47-62 [Zbl 1118.68534] \textit{Lanotte, Ruggero; Tini, Simone}, Probabilistic congruence for semistochastic generative processes, 63-78 [Zbl 1118.68572] \textit{Lüttgen, Gerald; Vogler, Walter}, Bisimulation on speed: A unified approach, 79-94 [Zbl 1097.68585] \textit{Abbes, Samy; Benveniste, Albert}, Branching cells as local states for event structures and nets: Probabilistic applications, 95-109 [Zbl 1119.68123] \textit{Deng, Yuxin; Palamidessi, Catuscia}, Axiomatizations for probabilistic finite-state behaviors, 110-124 [Zbl 1119.68125] \textit{Cattani, Stefano; Segala, Roberto; Kwiatkowska, Marta; Norman, Gethin}, Stochastic transition systems for continuous state spaces and non-determinism, 125-139 [Zbl 1118.68568] \textit{Laroussinie, François; Sproston, Jeremy}, Model checking durational probabilistic systems, 140-154 [Zbl 1118.68548] \textit{Stark, Ian}, Free-algebra models for the \(\pi\)-calculus, 155-169 [Zbl 1119.68130] \textit{Miculan, Marino; Yemane, Kidane}, A unifying model of variables and names, 170-186 [Zbl 1119.68117] \textit{Fahrenberg, Ulrich}, A category of higher-dimensional automata, 187-201 [Zbl 1119.68126] \textit{Murawski, Andrzej S.; Walukiewicz, Igor}, Third-order Idealized Algol with iteration is decidable, 202-218 [Zbl 1118.68398] \textit{Bouyer, Patricia; Chevalier, Fabrice; D'Souza, Deepak}, Fault diagnosis using timed automata, 219-233 [Zbl 1118.68374] \textit{Larsen, Kim Guldstrand; Rasmussen, Jacob Illum}, Optimal conditional reachability for multi-priced timed automata, 234-249 [Zbl 1118.68527] \textit{Lasota, Sławomir; Walukiewicz, Igor}, Alternating timed automata, 250-265 [Zbl 1119.68109] \textit{Jeffrey, Alan; Rathke, Julian}, Full abstraction for polymorphic pi-calculus, 266-281 [Zbl 1119.68128] \textit{Laneve, Cosimo; Zavattaro, Gianluigi}, Foundations of web transactions, 282-298 [Zbl 1118.68335] \textit{Focardi, Riccardo; Rossi, Sabina; Sabelfeld, Andrei}, Bridging language-based and process calculi security, 299-315 [Zbl 1118.68569] \textit{Bartoletti, Massimo; Degano, Pierpaolo; Ferrari, Gian Luigi}, History-based access control with local policies, 316-332 [Zbl 1118.68404] \textit{Fröschle, Sibylle}, Composition and decomposition in true-concurrency, 333-347 [Zbl 1118.68570] \textit{Schaefer, Mark; Vogler, Walter}, Component refinement and CSC solving for STG decomposition, 348-363 [Zbl 1118.68576] \textit{Bontemps, Yves; Schobbens, Pierre-Yves}, The complexity of live sequence charts, 364-378 [Zbl 1118.68539] \textit{Cheney, James}, A simpler proof theory for nominal logic, 379-394 [Zbl 1119.03023] \textit{Calcagno, Cristiano; Gardner, Philippa; Hague, Matthew}, From separation logic to first-order logic, 395-409 [Zbl 1119.03022] \textit{Goguen, Healfdene}, Justifying algorithms for \(\beta \eta\)-conversion, 410-424 [Zbl 1119.03024] \textit{Bozga, Marius; Iosif, Radu}, On decidability within the arithmetic of addition and divisibility, 425-439 [Zbl 1119.03060] \textit{Schröder, Lutz}, Expressivity of coalgebraic modal logic: The limits and beyond, 440-454 [Zbl 1119.03015] \textit{Bonsangue, Marcello M.; Kurz, Alexander}, Duality for logics of transition systems, 455-469 [Zbl 1119.03021] \textit{Kaiser, Lukasz}, Confluence of right ground term rewriting systems is decidable, 470-489 [Zbl 1119.68099] \textit{Aehlig, K.; de Miranda, J. G.; Ong, C.-H. L.}, Safety is not a restriction at level 2 for string languages, 490-504 [Zbl 1119.68102] \textit{Edalat, A.; Lieutier, A.; Pattinson, D.}, A computational model for multi-variable differential calculus, 505-519 [Zbl 1119.03062]
0 references