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

Not in Library

My Reading Lists:

Create a new list

Check-In

×Close
Add an optional check-in date. Check-in dates are used to track yearly reading goals.
Today


Buy this book

Last edited by ImportBot
February 26, 2022 | History

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

Publish Date
Language
English
Pages
451

Buy this book

Previews available in: English

Book Details


Table of 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.

Edition Notes

Published in
Berlin, Heidelberg
Series
Lecture Notes in Computer Science -- 7794

Classifications

Dewey Decimal Class
005.131
Library of Congress
QA8.9-QA10.3, QA267-268.5

The Physical Object

Format
[electronic resource] :
Pagination
XXIII, 451 p. 51 illus.
Number of pages
451

ID Numbers

Open Library
OL27039661M
Internet Archive
foundationssoftw00haym
ISBN 13
9783642370755

Community Reviews (0)

Feedback?
No community reviews have been submitted for this work.

Lists

This work does not appear on any lists.

History

Download catalog record: RDF / JSON
February 26, 2022 Edited by ImportBot import existing book
June 30, 2019 Created by MARC Bot import new book