Foundations of Software Science and Computation Structures

17th International Conference, FOSSACS 2014, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2014, Grenoble, France, April 5-13, 2014, Proceedings

Anca Muscholl (Herausgeber)

Buch | Softcover
XVI, 457 Seiten
2014 | 2014
Springer Berlin (Verlag)
978-3-642-54829-1 (ISBN)

Lese- und Medienproben

Foundations of Software Science and Computation Structures -
53,49 inkl. MwSt
This book constitutes the proceedings of the 17th International Conference on Foundations of Software Science and Computation Structures, FOSSACS 2014, held as part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2014, which took place in Grenoble, France, in April 2014. The 28 papers included in this book, together with one invited talk, were selected from 106 full-paper submissions. The following topical areas are covered: probabilistic systems, semantics of programming languages, networks, program analysis, games and synthesis, compositional reasoning, bisimulation, categorical and algebraic models and logics of programming.

Equivalences of Pushdown Systems Are Hard.- Active Diagnosis for Probabilistic Systems.- Analysis of Probabilistic Basic Parallel Processes.- Limit Synchronization in Markov Decision Processes.- Maximal Cost-Bounded Reachability Probability on Continuous-Time.- Markov Decision Processes.- Type Reconstruction for the Linear pi-Calculus with Composite and Equi-Recursive Types.- A Semantical and Operational Account of Call-by-Value Solvability.- Network-Formation Games with Regular Objectives.- Playing with Probabilities in Reconfigurable Broadcast Networks.- Unsafe Order-2 Tree Languages Are Context-Sensitive.- Game Semantics for Nominal Exceptions.- Complexity of Model-Checking Call-by-Value Programs.- Resource Reachability Games on Pushdown Graphs.- Perfect-Information Stochastic Mean-Payoff Parity Games.- Latticed-LTL Synthesis in the Presence of Noisy Inputs.- The Complexity of Partial-Observation Stochastic Parity Games with Finite-Memory Strategies.- On Negotiation as Concurrency Primitive II: Deterministic Cyclic Negotiations.- On Asymmetric Unification and the Combination Problem in Disjoint Theories.- Axiomatizing Bisimulation Equivalences and Metrics from Probabilistic SOS Rules.- Generalized Synchronization Trees.- Bisimulations for Communicating Transactions.- Upper-Expectation Bisimilarity and Lukasiewicz mi-Calculus.- Interacting Bialgebras Are Frobenius.- Generalized Eilenberg Theorem I: Local Varieties of Languages.- Combining Bialgebraic Semantics and Equations.- Models of a Non-associative Composition.- Foundations for Decision Problems in Separation Logic with General Inductive Predicates.- A Coalgebraic Approach to Linear-Time Logics.- A Relatively Complete Calculus for Structured Heterogeneous Specifications.

Erscheint lt. Verlag 18.3.2014
Reihe/Serie Lecture Notes in Computer Science
Theoretical Computer Science and General Issues
Zusatzinfo XVI, 457 p. 48 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 algebraic semantics • bisimulation • categorical semantics • formal methods • Game Theory • logics of programming • Markov Decision Processes • Networks • Probabilistic Systems • probability and statistics • program analysis • Program Semantics • Program verification • semantics and reasoning • Software Analysis • Software engineering • Software systems • Software Verification • Theory of Computation
ISBN-10 3-642-54829-6 / 3642548296
ISBN-13 978-3-642-54829-1 / 9783642548291
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