


default search action
17th FoSSaCS 2014: Grenoble, France (Part of ETAPS 2014)
- Anca Muscholl:

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. Lecture Notes in Computer Science 8412, Springer 2014, ISBN 978-3-642-54829-1
Probabilistic Systems
- Petr Jancar

:
Equivalences of Pushdown Systems Are Hard. 1-28 - Nathalie Bertrand

, Eric Fabre, Stefan Haar, Serge Haddad, Loïc Hélouët:
Active Diagnosis for Probabilistic Systems. 29-42 - Rémi Bonnet, Stefan Kiefer, Anthony Widjaja Lin

:
Analysis of Probabilistic Basic Parallel Processes. 43-57 - Laurent Doyen, Thierry Massart, Mahsa Shirmohammadi:

Limit Synchronization in Markov Decision Processes. 58-72 - Hongfei Fu

:
Maximal Cost-Bounded Reachability Probability on Continuous-Time Markov Decision Processes. 73-87
Semantics of Programming Languages
- Luca Padovani

:
Type Reconstruction for the Linear π-Calculus with Composite and Equi-Recursive Types. 88-102 - Alberto Carraro

, Giulio Guerrieri
:
A Semantical and Operational Account of Call-by-Value Solvability. 103-118
Networks
- Guy Avni, Orna Kupferman, Tami Tamir:

Network-Formation Games with Regular Objectives. 119-133 - Nathalie Bertrand

, Paulin Fournier, Arnaud Sangnier
:
Playing with Probabilities in Reconfigurable Broadcast Networks. 134-148
Program Analysis
- Naoki Kobayashi

, Kazuhiro Inaba, Takeshi Tsukada:
Unsafe Order-2 Tree Languages Are Context-Sensitive. 149-163 - Andrzej S. Murawski

, Nikos Tzevelekos:
Game Semantics for Nominal Exceptions. 164-179 - Takeshi Tsukada, Naoki Kobayashi

:
Complexity of Model-Checking Call-by-Value Programs. 180-194
Games and Synthesis
- Martin Lang:

Resource Reachability Games on Pushdown Graphs. 195-209 - Krishnendu Chatterjee, Laurent Doyen, Hugo Gimbert, Youssouf Oualhadj

:
Perfect-Information Stochastic Mean-Payoff Parity Games. 210-225 - Shaull Almagor

, Orna Kupferman:
Latticed-LTL Synthesis in the Presence of Noisy Inputs. 226-241 - Krishnendu Chatterjee, Laurent Doyen, Sumit Nain, Moshe Y. Vardi:

The Complexity of Partial-Observation Stochastic Parity Games with Finite-Memory Strategies. 242-257
Compositional Reasoning
- Javier Esparza

, Jörg Desel:
On Negotiation as Concurrency Primitive II: Deterministic Cyclic Negotiations. 258-273 - Serdar Erbatur, Deepak Kapur, Andrew M. Marshall, Catherine Meadows, Paliath Narendran, Christophe Ringeissen:

On Asymmetric Unification and the Combination Problem in Disjoint Theories. 274-288
Bisimulation
- Pedro R. D'Argenio

, Daniel Gebler, Matias David Lee:
Axiomatizing Bisimulation Equivalences and Metrics from Probabilistic SOS Rules. 289-303 - James Ferlez

, Rance Cleaveland, Steven I. Marcus:
Generalized Synchronization Trees. 304-319 - Vasileios Koutavas, Carlo Spaccasassi, Matthew Hennessy:

Bisimulations for Communicating Transactions - (Extended Abstract). 320-334 - Matteo Mio

:
Upper-Expectation Bisimilarity and Łukasiewicz μ-Calculus. 335-350
Categorical and Algebraic Models
- Filippo Bonchi

, Pawel Sobocinski
, Fabio Zanasi
:
Interacting Bialgebras Are Frobenius. 351-365 - Jirí Adámek, Stefan Milius, Robert S. R. Myers, Henning Urbat:

Generalized Eilenberg Theorem I: Local Varieties of Languages. 366-380 - Jurriaan Rot, Marcello M. Bonsangue

:
Combining Bialgebraic Semantics and Equations. 381-395 - Guillaume Munch-Maccagnoni:

Models of a Non-associative Composition. 396-410
Logics of Programming
- Timos Antonopoulos, Nikos Gorogiannis, Christoph Haase

, Max I. Kanovich, Joël Ouaknine
:
Foundations for Decision Problems in Separation Logic with General Inductive Predicates. 411-425 - Corina Cîrstea

:
A Coalgebraic Approach to Linear-Time Logics. 426-440 - Till Mossakowski

, Andrzej Tarlecki
:
A Relatively Complete Calculus for Structured Heterogeneous Specifications. 441-456

manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.


Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID














