Foundations of software science and computation structures. 5th international conference, FOSSACS 2002, held as part of the joint European conferences on theory and practice of software, ETAPS 2002, Grenoble, France, April 8--12, 2002. Proceedings (Q1604125)

The articles of this volume will be reviewed individually. The preceding conference (4th, 2001) has been reviewed (see Zbl 0960.00057). Indexed articles: \textit{Courcelle, Bruno}, Semantical evaluations as monadic second-order compatible structure transformations, 1-4 [Zbl 1077.68673] \textit{Ábrahám-Mumm, Erika; de Boer, Frank S.; de Roever, Willem-Paul; Steffen, Martin}, Verification for Java's reentrant multithreading concept, 5-20 [Zbl 1077.68552] \textit{Bidoit, Michel; Hennicker, Rolf}, On the integration of observability and reachability concepts, 21-36 [Zbl 1077.68709] \textit{de Boer, Frank S.; Gabbrielli, Maurizio; Meo, Maria Chiara}, Proving correctness of timed concurrent constraint programs, 37-51 [Zbl 1077.68706] \textit{Bollig, Benedikt; Leucker, Martin; Noll, Thomas}, Generalised regular MSC languages, 52-66 [Zbl 1077.68666] \textit{Boreale, Michele; Gorla, Daniele}, On compositional reasoning in the spi-calculus, 67-81 [Zbl 1077.68713] \textit{Cîrstea, Corina}, On specification logics for algebra-coalgebra structures: Reconciling reachability and observability, 82-97 [Zbl 1077.68710] \textit{Danvy, Olivier; Nielsen, Lasse R.}, A first-order one-pass CPS transformation, 98-113 [Zbl 1077.68566] \textit{Doberkat, Ernst-Erich}, The demonic product of probabilistic relations, 114-128 [Zbl 1077.68715] \textit{Ferrari, Gianluigi; Montanari, Ugo; Pistore, Marco}, Minimizing transition systems for name passing calculi: A co-algebraic formulation, 129-143 [Zbl 1077.68716] \textit{Führmann, Carsten}, Varieties of effects, 144-158 [Zbl 1077.68554] \textit{Godard, Emmanuel; Métivier, Yves}, A characterization of families of graphs in which election is possible, 159-171 [Zbl 1077.68535] \textit{Jančar, Petr; Kučera, Antonín; Moller, Faron; Sawa, Zdeněk}, Equivalence-checking with one-counter automata: A generic method for proving lower bounds, 172-186 [Zbl 1077.68653] \textit{Jha, Somesh; Palsberg, Jens; Zhao, Tian}, Efficient type matching, 187-204 [Zbl 1077.68608] \textit{Knapik, Teodor; Niwinski, Damian; Urzyczyn, Paweł}, Higher-order pushdown trees are easy, 205-222 [Zbl 1077.03508] \textit{Koch, Manuel; Mancini, Luigi V.; Parisi-Presicce, Francesco}, Conflict detection and resolution in access control policy specifications, 223-237 [Zbl 1077.68688] \textit{Kurz, Alexander}, Logics admitting final semantics, 238-249 [Zbl 1077.03510] \textit{Lange, Martin; Stirling, Colin}, Model checking fixed point logic with chop, 250-263 [Zbl 1077.68690] \textit{Laroussinie, François; Markey, Nicolas; Schnoebelen, Philippe}, On model checking durational Kripke structures, 264-279 [Zbl 1077.68691] \textit{Löding, Christof}, Model-checking infinite systems generated by ground tree rewriting, 280-294 [Zbl 1077.68694] \textit{Lohrey, Markus; Muscholl, Anca}, Bounded MSC communication, 295-309 [Zbl 1077.68695] \textit{Martin, Keye}, The informatic derivative at a compact element, 310-325 [Zbl 1077.68675] \textit{Mossakowski, Till}, Heterogeneous development graphs and heterogeneous borrowing, 326-341 [Zbl 1077.68609] \textit{Plotkin, Gordon; Power, John}, Notions of computation determine monads, 342-356 [Zbl 1077.68676] \textit{Santocanale, Luigi}, A calculus of circular proofs and its categorical semantics, 357-371 [Zbl 1077.03515] \textit{Schöpp, Ulrich; Simpson, Alex}, Verifying temporal properties using explicit approximants: Completeness for context-free processes, 372-386 [Zbl 1077.68717] \textit{Srba, Jiří}, Note on the tableau technique for commutative transition systems, 387-401 [Zbl 1077.68718] \textit{Yang, Hongseok; O'Hearn, Peter}, A semantic basis for local reasoning, 402-416 [Zbl 1077.68705] \textit{Yoshida, Nobuko; Honda, Kohei; Berger, Martin}, Linearity and bisimulation, 417-433 [Zbl 1077.68719]