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

Frank Pfenning (Herausgeber)

Buch | Softcover
XXIV, 451 Seiten
2013 | 2013
Springer Berlin (Verlag)
978-3-642-37074-8 (ISBN)
66,34 inkl. MwSt
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 2013The 28 papers presented in this volume were carefully reviewed and selected from 109 submissions. They are organized in topical sections named: models of computation; reasoning about processes; bisimulation; modal and higher-order logics; reasoning about programs; computational complexity; quantitative models; and categorical models.

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 pi-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.

Erscheint lt. Verlag 20.2.2013
Reihe/Serie Lecture Notes in Computer Science
Theoretical Computer Science and General Issues
Zusatzinfo XXIV, 451 p. 51 illus.
Verlagsort Berlin
Sprache englisch
Maße 155 x 235 mm
Gewicht 724 g
Themenwelt Mathematik / Informatik Informatik Software Entwicklung
Informatik Theorie / Studium Compilerbau
Schlagworte game semantics • Modal Logics • nominal sets • pattern graphs • Predicate logic
ISBN-10 3-642-37074-8 / 3642370748
ISBN-13 978-3-642-37074-8 / 9783642370748
Zustand Neuware
Haben Sie eine Frage zum Produkt?
Mehr entdecken
aus dem Bereich
Grundlagen und Anwendungen

von Hanspeter Mössenböck

Buch | Softcover (2024)
dpunkt (Verlag)
29,90
a beginner's guide to learning llvm compiler tools and core …

von Kai Nacke

Buch | Softcover (2024)
Packt Publishing Limited (Verlag)
49,85