Foundations of software science and computation structures. 2nd international conference, FOSSACS '99. Held as part of the joint European conferences on Theory and practice of software, ETAPS '99, Amsterdam, the Netherlands, March 22--28, 1999. Proceedings (Q1284359)

From MaRDI portal
scientific article; zbMATH DE number 1278180
Language Label Description Also known as
default for all languages
No label defined
    English
    Foundations of software science and computation structures. 2nd international conference, FOSSACS '99. Held as part of the joint European conferences on Theory and practice of software, ETAPS '99, Amsterdam, the Netherlands, March 22--28, 1999. Proceedings
    scientific article; zbMATH DE number 1278180

      Statements

      Foundations of software science and computation structures. 2nd international conference, FOSSACS '99. Held as part of the joint European conferences on Theory and practice of software, ETAPS '99, Amsterdam, the Netherlands, March 22--28, 1999. Proceedings (English)
      0 references
      21 April 1999
      0 references
      The articles of mathematical interest will be reviewed individually. The preceding conference (1998) has been announced (see Zbl 0889.00031). Indexed articles: \textit{Aceto, Luca; Ingólfsdóttir, Anna}, Testing Hennessy-Milner logic with recursion, 41-55 [Zbl 0932.03026] \textit{Arruabarrena, R.; Lucio, P.; Navarro, M.}, A strong logic programming view for static embedded implications, 56-72 [Zbl 0948.68031] \textit{Baldan, Paolo; Corradini, Andrea; Montanari, Ugo}, Unfolding and event structure semantics for graph grammars, 73-89 [Zbl 0946.68087] \textit{Barthe, Gilles}, Expanding the cube, 90-103 [Zbl 0932.03013] \textit{Benke, Marcin}, An algebraic characterization of typability in ML with subtyping, 104-119 [Zbl 0932.03027] \textit{Bogaert, Bruno; Seynhaeve, Franck; Tison, Sophie}, The recognizability problem for tree automata with comparisons between brothers, 150-164 [Zbl 0942.68067] \textit{Dantsin, Evgenyi; Voronkov, Andrei}, A nondeterministic polynomial-time unification algorithm for bags, sets and trees, 180-196 [Zbl 0942.68023] \textit{Ghani, Neil; de Paiva, Valeria; Ritter, Eike}, Categorical models of explicit substitutions, 197-211 [Zbl 0931.03022] \textit{Huhn, Michaela; Niebert, Peter; Wallner, Frank}, Model checking logics for communicating sequential agents, 227-242 [Zbl 0932.03028] \textit{Lenisa, Marina}, A complete coinductive logical system for bisimulation equivalence on circular objects, 243-257 [Zbl 0931.03047] \textit{Maneth, Sebastian}, String languages generated by total deterministic macro tree transducers, 258-272 [Zbl 0942.68068] \textit{Narasimha, Murali; Cleaveland, Rance; Iyer, Purush}, Probabilistic temporal logics via the modal mu-calculus, 288-305 [Zbl 0933.03029]
      0 references
      Amsterdam (Netherlands)
      0 references
      Proceedings
      0 references
      Conference
      0 references
      FOSSACS '99
      0 references
      Software science
      0 references
      Computation structures
      0 references

      Identifiers