|
" Foundations of software science and computation structures : "
FOSSACS 2013 held as part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2013, Rome, Italy, March 16-24, 2013 ; Frank Pfenning (ed.).
| Document Type
|
:
|
BL
|
| Record Number
|
:
|
747902
|
| Doc. No
|
:
|
b567853
|
| Main Entry
|
:
|
FOSSACS 2013 held as part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2013, Rome, Italy, March 16-24, 2013 ; Frank Pfenning (ed.).
|
| Title & Author
|
:
|
Foundations of software science and computation structures : : 16th international conference : proceedings\ FOSSACS 2013 held as part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2013, Rome, Italy, March 16-24, 2013 ; Frank Pfenning (ed.).
|
| Publication Statement
|
:
|
Berlin : Springer, 2013
|
| Series Statement
|
:
|
Lecture notes in computer science, 7794 : Advanced research in computing and software science.
|
| Page. NO
|
:
|
449 Seiten : Illustrationen.
|
| ISBN
|
:
|
3642370748
|
|
|
:
|
: 3642370756
|
|
|
:
|
: 9783642370748
|
|
|
:
|
: 9783642370755
|
| Contents
|
:
|
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 -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.
|
| Subject
|
:
|
Logics and Meanings of Programs.
|
| Subject
|
:
|
Programming Languages, Compilers, Interpreters.
|
| Subject
|
:
|
Software engineering.
|
| Added Entry
|
:
|
Frank Pfenning
|
| |