FoSSaCS B

28 papers

YearTitle / Authors
2001Adequacy for Algebraic Effects.
Gordon D. Plotkin, John Power
2001An Axiomatic Semantics for the Synchronous Language Gentzen.
Simone Tini
2001Axiomatizing Tropical Semirings.
Luca Aceto, Zoltán Ésik, Anna Ingólfsdóttir
2001Axioms for Recursion in Call-by-Value.
Masahito Hasegawa, Yoshihiko Kakutani
2001Categories of Processes Enriched in Final Coalgebras.
Sava Krstic, John Launchbury, Dusko Pavlovic
2001Class Analysis of Object-Oriented Programs through Abstract Interpretation.
Thomas P. Jensen, Fausto Spoto
2001Computational Completeness of Programming Languages Based on Graph Transformation.
Annegret Habel, Detlef Plump
2001Decidability of Weak Bisimilarity for a Subset of Basic Parallel Processes.
Colin Stirling
2001Foundations for a Graph-Based Approach to the Specification of Access Control Policies.
Manuel Koch, Luigi V. Mancini, Francesco Parisi-Presicce
2001Foundations 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
Furio Honsell, Marino Miculan
2001High-Level Petri Nets as Type Theories in the Join Calculus.
Maria Grazia Buscemi, Vladimiro Sassone
2001Higher-Order Abstract Syntax with Induction in Isabelle/HOL: Formalizing the pi-Calculus and Mechanizing the Theory of Contexts.
Christine Röckl, Daniel Hirschkoff, Stefan Berghofer
2001MARRELLA and the Verification of an Embedded System.
Dominique Ambroise, Patrick Augé, Kamel Bouchefra, Brigitte Rozoy
2001Model Checking CTL
François Laroussinie, Nicolas Markey, Philippe Schnoebelen
2001On Garbage and Program Logic.
Cristiano Calcagno, Peter W. O'Hearn
2001On Regular Message Sequence Chart Languages and Relationships to Mazurkiewicz Trace Theory.
Rémi Morin
2001On the Complexity of Parity Word Automata.
Valerie King, Orna Kupferman, Moshe Y. Vardi
2001On the Duality between Observability and Reachability.
Michel Bidoit, Rolf Hennicker, Alexander Kurz
2001On the Modularity of Deciding Call-by-Need.
Irène Durand, Aart Middeldorp
2001Secrecy Types for Asymmetric Communication.
Martín Abadi, Bruno Blanchet
2001Synchronized Tree Languages Revisited and New Applications.
Valérie Gouranton, Pierre Réty, Helmut Seidl
2001Temporary Data in Shared Dataspace Coordination Languages.
Nadia Busi, Roberto Gorrieri, Gianluigi Zavattaro
2001The Complexity of Model Checking Mobile Ambients.
Witold Charatonik, Silvano Dal-Zilio, Andrew D. Gordon, Supratik Mukhopadhyay, Jean-Marc Talbot
2001The Finite Graph Problem for Two-Way Alternating Automata.
Mikolaj Bojanczyk
2001The Rho Cube.
Horatiu Cirstea, Claude Kirchner, Luigi Liquori
2001Type Inference with Recursive Type Equations.
Mario Coppo
2001Type Isomorphisms and Proof Reuse in Dependent Type Theory.
Gilles Barthe, Olivier Pons
2001Verified Bytecode Verifiers.
Tobias Nipkow