Skip to content

Foundations of Software Science and Computational Structures

FOSSACS

B

CORE rank

CORE rank (raw)

B

Fields of research

Theory of Computation · Software Engineering

Papers indexed

818

1998–2026

Papers per year

199836 peak2026

FOSSACS papers

818 records sourced from DBLP. Search titles, filter by year, sort by recency.

YearTitleAuthors
2000Verifying Performance Equivalence for Timed Basic Parallel Processes.Batrice Brard, Anne Labroue, Philippe Schnoebelen
2000Constructor Subtyping in the Calculus of Inductive Constructions.Gilles Barthe, Femke van Raamsdonk
2000Norm Functions for Probabilistic Bisimulations with Delays.Christel Baier, Marille Stoelinga
1999Reasoning About Concurrent Systems Using Types.Davide Sangiorgi
1999A pi-calculus Process Semantics of Concurrent Idealised ALGOL.Christine Rckl, Davide Sangiorgi
1999Probabilistic Temporal Logics via the Modal Mu-Calculus.Murali Narasimha, Rance Cleaveland, S. Purushothaman Iyer
1999Matching Specifications for Message Sequence Charts.Anca Muscholl
1999String Languages Generated by Total Deterministic Macro Tree Transducers.Sebastian Maneth
1999A Complete Coinductive Logical System for Bisimulation Equivalence on Circular Objects.Marina Lenisa
1999Model Checking Logics for Communicating Sequential Agents.Michaela Huhn, Peter Niebert, Frank Wallner
1999Equational Properties of Mobile Ambients.Andrew D. Gordon, Luca Cardelli
1999Categorical Models of Explicit Substitutions.Neil Ghani, Valeria de Paiva, Eike Ritter
1999An Automata-Theoretic Approach to Interprocedural Data-Flow Analysis.Javier Esparza, Jens Knoop
1999A Nondeterministic Polynomial-Time Unification Algorithm for Bags, Sets and Trees.Evgeny Dantsin, Andrei Voronkov
1999A Theory of "May" Testing for Asynchronous Languages.Michele Boreale, Rocco De Nicola, Rosario Pugliese
1999The Recognizability Problem for Tree Automata with Comparisons between Brothers.Bruno Bogaert, Franck Seynhaeve, Sophie Tison
1999A WP-calculus for OO.Frank S. de Boer
1999Static Analysis of Processes for No and Read-Up nad No Write-Down.Chiara Bodei, Pierpaolo Degano, Flemming Nielson, Hanne Riis Nielson
1999An Algebraic Characterization of Typability in ML with Subtyping.Marcin Benke
1999Expanding the Cube.Gilles Barthe
1999Unfolding and Event Structure Semantics for Graph Grammars.Paolo Baldan, Andrea Corradini, Ugo Montanari
1999A Strong Logic Programming View for Static Embedded Implications.Rosa Arruabarrena, Paqui Lucio, Marisa Navarro
1999Testing Hennessy-Milner Logic with Recursion.Luca Aceto, Anna Inglfsdttir
1999Security Protocols and Specifications.Martn Abadi
1998Resource Based Models for Asynchrony.Julian Rathke
776800 of 818← PreviousNext →

Comparable venues

Other A*/A conferences filed under the same field of research.