Nantilus
Foundations of Software Science and Computation Structures : 16th International Conference, FOSSACS 2013, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2013, Rome, Italy, March 16-24, 2013. Proceedings
This book constitutes the proceedings of the 16th International Conference on Foundations of Software Science and Computational Structures, FOSSACS 2013, held as part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2013, which took place in Rome, Italy, in March 2013 The...
Enregistré dans:
| Auteur principal : | |
|---|---|
| Format : | Livre |
| Langue : | anglais |
| Titre complet : | Foundations of Software Science and Computation Structures : 16th International Conference, FOSSACS 2013, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2013, Rome, Italy, March 16-24, 2013. Proceedings / edited by Frank Pfenning. |
| Publié : |
Berlin, Heidelberg :
Springer Berlin Heidelberg
, 2013 Cham : Springer Nature |
| Collection : | Theoretical computer science and general issues (Online) ; 7794 |
| Accès en ligne : |
Accès Nantes Université
Accès direct soit depuis les campus via le réseau ou le wifi eduroam soit à distance avec un compte @etu.univ-nantes.fr ou @univ-nantes.fr |
| Note sur l'URL : | Accès sur la plateforme de l'éditeur Accès sur la plateforme de l'éditeur (Springer) Accès sur la plateforme Istex |
| Condition d'utilisation et de reproduction : | Conditions particulières de réutilisation pour les bénéficiaires des licences nationales : chttps://www.licencesnationales.fr/springer-nature-ebooks-contrat-licence-ln-2017 |
| Sujets : | |
| Documents associés : | Autre format:
Foundations of Software Science and Computation Structures Autre format: Foundations of Software Science and Computation Structures |
- Pattern Graphs and Rule-Based Models: The Semantics of Kappa
- History-Register Automata
- Fatal Attractors in Parity Games
- On Unique Decomposition of Processes in the Applied p-Calculus
- Bounded Context-Switching and Reentrant Locking
- Reachability of Communicating Timed Processes
- Modular Bisimulation Theory for Computations and Values
- Checking Bisimilarity for Attributed Graph Transformation
- Comodels and Effects in Mathematical Operational Semantics
- Preorders on Monads and Coalgebraic Simulations
- A Proof System for Compositional Verification of Probabilistic Concurrent Processes
- Partiality and Recursion in Higher-Order Logic
- Some Sahlqvist Completeness Results for Coalgebraic Logics
- Cut Elimination in Nested Sequents for Intuitionistic Modal Logics
- On Monadic Parametricity of Second-Order Functionals
- Deconstructing General References via Game Semantics
- Separation Logic for Non-local Control Flow and Block Scope Variables
- The Parametric Ordinal-Recursive Complexity of Post Embedding Problems
- Deciding Definability by Deterministic Regular Expressions
- Type-Based Complexity Analysis for Fork Processes
- Pure Pointer Programs and Tree Isomorphism
- A Language for Differentiable Functions
- Computing Quantiles in Markov Reward Models
- Parameterized Weighted Containment
- Weighted Specifications over Nested Words
- An Algebraic Presentation of Predicate Logic
- Strategies as Profunctors
- Generalised Name Abstraction for Nominal Sets.