FEEDBACK Smiley face
Normal view MARC view ISBD view

Foundations of Software Science and Computation Structures [electronic resource] :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 /

Contributor(s): Muscholl, Anca [editor.] | SpringerLink (Online service).
Material type: materialTypeLabelBookSeries: Lecture Notes in Computer Science: 8412Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2014.Description: XVI, 457 p. 48 illus. online resource.Content type: text Media type: computer Carrier type: online resourceISBN: 9783642548307.Subject(s): Computer science | Software engineering | Programming languages (Electronic computers) | Computers | Computer logic | Mathematical logic | Computer Science | Logics and Meanings of Programs | Mathematical Logic and Formal Languages | Programming Languages, Compilers, Interpreters | Software Engineering | Computation by Abstract DevicesOnline resources: Click here to access online
Contents:
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 π-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 μ-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.
In: Springer eBooksSummary: 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.
Tags from this library: No tags from this library for this title. Add tag(s)
Log in to add tags.
    average rating: 0.0 (0 votes)
No physical items for this record

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

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.

There are no comments for this item.

Log in to your account to post a comment.

© IIIT-Delhi, 2013 | Phone: +91-11-26907510| FAX +91-11-26907405 | E-mail: library@iiitd.ac.in