Foundations of software science and computation structures. 4th international conference, FOSSACS 2001, held as part of the joint European conferences on theory and practice of software, ETAPS 2001, Genova, Italy, April 2--6, 2001. Proceedings (Q5930758)

The articles of mathematical interest will be reviewed individually. The preceding conference (3rd, 2000) has been reviewed (see Zbl 0935.00045). Indexed articles: \textit{Plotkin, Gordon; Power, John}, Adequacy for algebraic effects, 1-24 [Zbl 0986.68055] \textit{Abadi, Martín; Blanchet, Bruno}, Secrecy types for asymmetric communication, 25-41 [Zbl 0978.68059] \textit{Aceto, Luca; Ésik, Zoltán; Ingólfsdóttir, Anna}, Axiomatizing tropical semirings, 42-56 [Zbl 0978.16045] \textit{Barthe, Gilles; Pons, Olivier}, Type isomorphisms and proof reuse in dependent type theory, 57-71 [Zbl 0978.68044] \textit{Bidoit, Michel; Hennicker, Rolf; Kurz, Alexander}, On the duality between observability and reachability, 72-87 [Zbl 0986.68018] \textit{Bojańczyk, Mikołaj}, The finite graph problem for two-way alternating automata, 88-103 [Zbl 0978.03011] \textit{Buscemi, Maria Grazia; Sassone, Vladimiro}, High-level Petri nets as type theories in the join calculus, 104-120 [Zbl 0978.68104] \textit{Busi, Nadia; Gorrieri, Roberto; Zavattaro, Gianluigi}, Temporary data in shared dataspace coordination languages, 121-136 [Zbl 0986.68098] \textit{Calcagno, Cristiano; O'Hearn, Peter W.}, On garbage and program logic, 137-151 [Zbl 0978.68043] \textit{Charatonik, Witold; Dal Zilio, Silvano; Gordon, Andrew D.; Mukhopadhyay, Supratik; Talbot, Jean-Marc}, The complexity of model checking mobile ambients, 152-167 [Zbl 0978.68096] \textit{Cirstea, Horatiu; Kirchner, Claude; Liquori, Luigi}, The rho cube, 168-183 [Zbl 0978.68072] \textit{Coppo, Mario}, Type inference with recursive type equations, 184-198 [Zbl 0983.03011] \textit{Durand, Irène; Middeldorp, Aart}, On the modularity of deciding call-by-need, 199-213 [Zbl 0978.68071] \textit{Gouranton, Valérie; Réty, Pierre; Seidl, Helmut}, Synchronized tree languages revisited and new applications, 214-229 [Zbl 0986.68052] \textit{Habel, Annegret; Plump, Detlef}, Computational completeness of programming languages based on graph transformation, 230-245 [Zbl 0978.68028] \textit{Hasegawa, Masahito; Kakutani, Yoshihiko}, Axioms for recursion in call-by-value (extended abstract), 246-260 [Zbl 0978.68504] \textit{Jensen, Thomas; Spoto, Fausto}, Class analysis of object-oriented programs through abstract interpretation, 261-275 [Zbl 0978.68037] \textit{King, Valerie; Kupferman, Orna; Vardi, Moshe Y.}, On the complexity of parity word automata, 276-286 [Zbl 0978.68077] \textit{Koch, Manuel; Mancini, Luigi V.; Parisi-Presicce, Francesco}, Foundations for a graph-based approach to the specification of access control policies, 287-302 [Zbl 0978.68060] \textit{Krstić, Sava; Launchbury, John; Pavlović, Duško}, Categories of processes enriched in final coalgebras, 303-317 [Zbl 0978.68101] \textit{Laroussinie, François; Markey, Nicolas; Schnoebelen, Philippe}, Model checking \(\text{CTL}^+\) and FCTL is hard, 318-331 [Zbl 0986.68067] \textit{Morin, Rémi}, On regular message sequence chart languages and relationships to Mazurkiewicz trace theory, 332-346 [Zbl 0978.68078] \textit{Nipkow, Tobias}, Verified bytecode verifiers, 347-363 [Zbl 0978.68512] \textit{Röckl, Christine; Hirschkoff, Daniel; Berghofer, Stefan}, Higher-order abstract syntax with induction in Isabelle/HOL: formalizing the \(\pi\)-calculus and mechanizing the theory of contexts, 364-378 [Zbl 0978.68045] \textit{Stirling, Colin}, Decidability of weak bisimilarity for a subset of basic parallel processes, 379-393 [Zbl 0978.68102] \textit{Tini, Simone}, An axiomatic semantics for the synchronous language Gentzen, 394-408 [Zbl 0978.68506] \textit{Ambroise, Dominique; Augé, Patrick; Bouchefra, Kamel; Rozoy, Brigitte}, MARRELLA and the verification of an embedded system, 409-412 [Zbl 0978.68662]