Anca Muscholl
Proceedings of the 17th International Conference on Foundations of Software Science and Computation Structures
FoSSaCS, 2014.
@proceedings{FoSSaCS-2014, address = "Grenoble, France", doi = "10.1007/978-3-642-54830-7", editor = "Anca Muscholl", isbn = "978-3-642-54829-1", publisher = "{Springer International Publishing}", series = "{Lecture Notes in Computer Science}", title = "{Proceedings of the 17th International Conference on Foundations of Software Science and Computation Structures}", volume = 8412, year = 2014, }
Contents (29 items)
- FoSSaCS-2014-Jancar #automaton
- Equivalences of Pushdown Systems Are Hard (PJ), pp. 1–28.
- FoSSaCS-2014-BertrandFHHH #probability
- Active Diagnosis for Probabilistic Systems (NB, EF, SH, SH, LH), pp. 29–42.
- FoSSaCS-2014-BonnetKL #analysis #parallel #probability #process
- Analysis of Probabilistic Basic Parallel Processes (RB, SK, AWL), pp. 43–57.
- FoSSaCS-2014-0001MS #markov #process
- Limit Synchronization in Markov Decision Processes (LD, TM, MS), pp. 58–72.
- FoSSaCS-2014-Fu #bound #markov #probability #process #reachability
- Maximal Cost-Bounded Reachability Probability on Continuous-Time Markov Decision Processes (HF), pp. 73–87.
- FoSSaCS-2014-Padovani #linear #re-engineering #recursion #π-calculus
- Type Reconstruction for the Linear π-Calculus with Composite and Equi-Recursive Types (LP), pp. 88–102.
- FoSSaCS-2014-CarraroG #call-by #semantics
- A Semantical and Operational Account of Call-by-Value Solvability (AC, GG), pp. 103–118.
- FoSSaCS-2014-AvniKT #game studies
- Network-Formation Games with Regular Objectives (GA, OK, TT), pp. 119–133.
- FoSSaCS-2014-BertrandFS #configuration management #game studies #network
- Playing with Probabilities in Reconfigurable Broadcast Networks (NB, PF, AS), pp. 134–148.
- FoSSaCS-2014-KobayashiIT #higher-order
- Unsafe Order-2 Tree Languages Are Context-Sensitive (NK, KI, TT), pp. 149–163.
- FoSSaCS-2014-MurawskiT #exception #game studies #semantics
- Game Semantics for Nominal Exceptions (ASM, NT), pp. 164–179.
- FoSSaCS-2014-Tsukada0 #call-by #complexity #model checking #source code
- Complexity of Model-Checking Call-by-Value Programs (TT, NK), pp. 180–194.
- FoSSaCS-2014-Lang #automaton #game studies #graph #reachability
- Resource Reachability Games on Pushdown Graphs (ML0), pp. 195–209.
- FoSSaCS-2014-Chatterjee0GO #game studies #probability
- Perfect-Information Stochastic Mean-Payoff Parity Games (KC, LD, HG, YO), pp. 210–225.
- FoSSaCS-2014-AlmagorK #synthesis
- Latticed-LTL Synthesis in the Presence of Noisy Inputs (SA, OK), pp. 226–241.
- FoSSaCS-2014-Chatterjee0NV #complexity #game studies #probability
- The Complexity of Partial-Observation Stochastic Parity Games with Finite-Memory Strategies (KC, LD, SN, MYV), pp. 242–257.
- FoSSaCS-2014-EsparzaD #concurrent #on the
- On Negotiation as Concurrency Primitive II: Deterministic Cyclic Negotiations (JE, JD), pp. 258–273.
- FoSSaCS-2014-ErbaturKMMNR #on the #problem #symmetry #unification
- On Asymmetric Unification and the Combination Problem in Disjoint Theories (SE, DK, AMM, CM, PN, CR), pp. 274–288.
- FoSSaCS-2014-DArgenioGL #axiom #bisimulation #metric #probability
- Axiomatizing Bisimulation Equivalences and Metrics from Probabilistic SOS Rules (PRD, DG, MDL), pp. 289–303.
- FoSSaCS-2014-FerlezCM
- Generalized Synchronization Trees (JF, RC, SM), pp. 304–319.
- FoSSaCS-2014-KoutavasSH #bisimulation #communication #transaction
- Bisimulations for Communicating Transactions — (VK, CS, MH), pp. 320–334.
- FoSSaCS-2014-Mio #calculus #similarity #μ-calculus
- Upper-Expectation Bisimilarity and Łukasiewicz μ-Calculus (MM), pp. 335–350.
- FoSSaCS-2014-BonchiSZ #algebra
- Interacting Bialgebras Are Frobenius (FB, PS, FZ), pp. 351–365.
- FoSSaCS-2014-AdamekMMU #theorem
- Generalized Eilenberg Theorem I: Local Varieties of Languages (JA, SM, RSRM, HU), pp. 366–380.
- FoSSaCS-2014-RotB #algebra #equation #semantics
- Combining Bialgebraic Semantics and Equations (JR, MMB), pp. 381–395.
- FoSSaCS-2014-Munch-Maccagnoni #composition #modelling
- Models of a Non-associative Composition (GMM), pp. 396–410.
- FoSSaCS-2014-AntonopoulosGHKO #induction #logic #problem
- Foundations for Decision Problems in Separation Logic with General Inductive Predicates (TA, NG, CH, MIK, JO), pp. 411–425.
- FoSSaCS-2014-Cirstea #algebra #approach #linear #logic
- A Coalgebraic Approach to Linear-Time Logics (CC), pp. 426–440.
- FoSSaCS-2014-MossakowskiT #calculus #specification
- A Relatively Complete Calculus for Structured Heterogeneous Specifications (TM, AT), pp. 441–456.
6 ×#game studies
6 ×#probability
3 ×#algebra
3 ×#process
3 ×#semantics
2 ×#automaton
2 ×#bisimulation
2 ×#calculus
2 ×#call-by
2 ×#complexity
6 ×#probability
3 ×#algebra
3 ×#process
3 ×#semantics
2 ×#automaton
2 ×#bisimulation
2 ×#calculus
2 ×#call-by
2 ×#complexity