×

zbMATH — the first resource for mathematics

Foundations of software science and computation structures. 7th international conference, FOSSACS 2004, held as part of the joint European conferences on theory and practice of software, ETAPS 2004, Barcelona, Spain, March 29 – April 2, 2004. Procedings. (English) Zbl 1048.68010
Lecture Notes in Computer Science 2987. Berlin: Springer (ISBN 3-540-21298-1/pbk). xiii, 529 p. (2004).

Show indexed articles as search result.

The articles of this volume will be reviewed individually. The preceding conference has been reviewed (see Zbl 1017.00036).
Indexed articles:
Comon-Lundh, Hubert, Intruder theories (ongoing work), 1-4 [Zbl 1126.68390]
Milner, Robin, Theories for the global ubiquitous computer, 5-11 [Zbl 1126.68313]
Abadi, Martín; Gonthier, Georges; Werner, Benjamin, Choice in dynamic linking, 12-26 [Zbl 1126.03311]
Baillot, Patrick; Mogbil, Virgile, Soft lambda-calculus: A language for polynomial time computation, 27-41 [Zbl 1126.03306]
Bozga, Liana; Ene, Cristian; Lakhnech, Yassine, On the existence of an effective and complete inference system for cryptographic protocols (extended abstract), 42-57 [Zbl 1126.94322]
Bucciarelli, Antonio; Leperchey, Benjamin, Hypergraphs and degrees of parallelism: A completeness result, 58-71 [Zbl 1126.68334]
Caires, Luís, Behavioral and spatial observations in a logic for the \(\pi \)-calculus, 72-89 [Zbl 1126.68495]
Chalopin, Jérémie; Métivier, Yves, Election and local computations on edges (extended abstract), 90-104 [Zbl 1126.68496]
Conforti, Giovanni; Ghelli, Giorgio, Decidability of freshness, undecidability of revelation (extended abstract), 105-120 [Zbl 1126.03312]
Demri, Stéphane, LTL over integer periodicity constraints (extended abstract), 121-135 [Zbl 1126.68471]
Di Gianantonio, Pietro; Miculan, Marino, Unifying recursive and co-recursive definitions in sheaf categories, 136-150 [Zbl 1126.68491]
Ehrig, Hartmut; König, Barbara, Deriving bisimulation congruences in the DPO approach to graph rewriting, 151-166 [Zbl 1126.68446]
Filinski, Andrzej; Korsholm Rohde, Henning, A denotational account of untyped normalization by evaluation, 167-181 [Zbl 1126.68335]
Fokkink, Wan; Nain, Sumit, On finite alphabets and infinite bases: from ready pairs to possible worlds, 182-194 [Zbl 1126.68497]
Genest, Blaise; Minea, Marius; Muscholl, Anca; Peled, Doron, Specifying and verifying partial order properties using template MSCs, 195-210 [Zbl 1126.68498]
Ghica, Dan R.; Murawski, Andrzej S., Angelic semantics of fine-grained concurrency, 211-225 [Zbl 1126.68499]
Giambiagi, Pablo; Schneider, Gerardo; Valencia, Frank D., On the expressiveness of infinite behavior and name scoping in process calculi, 226-240 [Zbl 1126.68500]
Hennessy, Matthew; Rathke, Julian; Yoshida, Nobuko, SafeDpi: A language for controlling mobile code (extended abstract), 241-256 [Zbl 1126.68501]
Kirsten, Daniel, Distance desert automata and the star height one problem (extended abstract), 257-272 [Zbl 1126.68455]
Lack, Stephen; Sobociński, Paweł, Adhesive categories, 273-288 [Zbl 1126.68447]
Laird, James, A game semantics of local names and good variables, 289-303 [Zbl 1126.68350]
Leivant, Daniel, Partial correctness assertions provable in dynamic logics, 304-317 [Zbl 1126.03314]
Lucas, Salvador, Polynomials for proving termination of context-sensitive rewriting, 318-332 [Zbl 1126.68448]
Lüttgen, Gerald; Vogler, Walter, Bisimulation on speed: lower time bounds, 333-347 [Zbl 1126.68505]
Maler, Oded; Pnueli, Amir, On recognizable timed languages, 348-362 [Zbl 1126.68459]
Maneth, Sebastian; Busatto, Giorgio, Tree transducers and tree compressions, 363-377 [Zbl 1126.68449]
Meyer, Antoine, On term rewriting systems having a rational derivation, 378-392 [Zbl 1126.68451]
Mislove, Michael; Ouaknine, Joël; Pavlovic, Dusko; Worrell, James, Duality for labelled Markov processes, 393-407 [Zbl 1126.68460]
Phillips, Iain; Vigliotti, Maria Grazia, Electoral systems in ambient calculi, 408-422 [Zbl 1126.68508]
Polonovski, Emmanuel, Strong normalization of \({\overline{\lambda}}\mu\widetilde\mu\)-calculus with explicit substitutions, 423-437 [Zbl 1126.03307]
Power, John, Canonical models for computational effects, 438-452 [Zbl 1126.68336]
Pucella, Riccardo; Weissman, Vicky, Reasoning about dynamic policies, 453-467 [Zbl 1126.03317]
Ramanathan, Ajith; Mitchell, John; Scedrov, Andre; Teague, Vanessa, Probabilistic bisimulation and equivalence for security analysis of network protocols, 468-483 [Zbl 1126.68510]
Wischik, Lucian; Gardner, Philippa, Strong bisimulation for the explicit fusion calculus, 484-498 [Zbl 1126.68512]
Zielonka, Wiesław, Perfect-information stochastic parity games, 499-513 [Zbl 1126.68489]
Zunino, Roberto; Degano, Pierpaolo, A note on the perfect encryption assumption in a process calculus, 514-528 [Zbl 1126.68423]

MSC:
68-06 Proceedings, conferences, collections, etc. pertaining to computer science
00B25 Proceedings of conferences of miscellaneous specific interest
68Qxx Theory of computing
PDF BibTeX XML Cite
Full Text: DOI