Foundations of software science and computation structures : 4th International Conference, FOSSACS 2001, held as part of the Joint European Conference on Theory and Practice of Software, ETAPS 2001, Genova, Italy, April 2-6, 2001 : proceedings
ETAPS 2001 was the fourth instance of the European Joint Conferences on Theory and Practice of Software. ETAPS is an annual federated conference that was established in 1998 by combining a number of existing and new conferences. This year it comprised ve conferences (FOSSACS, FASE, ESOP, CC, TACAS),...
Zapisane w:
| organizacja autorów: | , |
|---|---|
| Kolejni autorzy: | , |
| Format: | Livre numérique |
| Język: | Anglais |
| Wydane: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Seria: | Lecture notes in computer science
2030 |
| Hasła przedmiotowe: | |
| Dostęp online: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Komentarz: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Foundations of software science and computation structures, 4th International Conference, FOSSACS 2001, held as part of the Joint European Conference on Theory and Practice of Software, ETAPS 2001, Genova, Italy, April 2-6, 2001, proceedings, Furio Honsell, Marino Miculan (Eds.), 2001, New York, Springer, 1 vol. (XII-412 p.), Lecture notes in computer science, 3-540-41864-4 • Foundations of Software Science and Computation Structures, Texte imprimé, 9783662165591 |
Spis treści:
- Invited Paper
- Adequacy for Algebraic Effects
- Contributed Papers
- Secrecy Types for Asymmetric Communication
- Axiomatizing Tropical Semirings
- Type Isomorphisms and Proof Reuse in Dependent Type Theory
- On the Duality between Observability and Reachability
- The Finite Graph Problem for Two-Way Alternating Automata
- High-Level Petri Nets as Type Theories in the Join Calculus
- Temporary Data in Shared Dataspace Coordination Languages
- On Garbage and Program Logic
- The Complexity of Model Checking Mobile Ambients
- The Rho Cube
- Type Inference with Recursive Type Equations
- On the Modularity of Deciding Call-by-Need
- Synchronized Tree Languages Revisited and New Applications
- Computational Completeness of Programming Languages Based on Graph Transformation
- Axioms for Recursion in Call-by-Value
- Class Analysis of Object-Oriented Programs through Abstract Interpretation
- On the Complexity of Parity Word Automata
- Foundations for a Graph-Based Approach to the Specification of Access Control Policies
- Categories of Processes Enriched in Final Coalgebras
- Model Checking CTL+ and FCTL Is Hard
- On Regular Message Sequence Chart Languages and Relationships to Mazurkiewicz Trace Theory
- Verified Bytecode Verifiers
- Higher-Order Abstract Syntax with Induction in Isabelle/HOL: Formalizing the ?-Calculus and Mechanizing the Theory of Contexts
- Decidability of Weak Bisimilarity for a Subset of Basic Parallel Processes
- An Axiomatic Semantics for the Synchronous Language Gentzen
- Tool Presentation
- Marrella and the Verification of an Embedded System.