Martin Hofmann 0001
Proceedings of the 14th International Conference on Foundations of Software Science and Computation Structures
FOSSACS, 2011.

@proceedings{FoSSaCS-2011,
	address       = "Saarbrücken, Germany",
	doi           = "10.1007/978-3-642-19805-2",
	editor        = "Martin Hofmann 0001",
	isbn          = "978-3-642-19804-5",
	publisher     = "{Springer International Publishing}",
	series        = "{Lecture Notes in Computer Science}",
	title         = "{Proceedings of the 14th International Conference on Foundations of Software Science and Computation Structures}",
	volume        = 6604,
	year          = 2011,
}

Contents (31 items)

6 ×#automaton
3 ×#game studies
3 ×#similarity
2 ×#algebra
2 ×#calculus
2 ×#higher-order
2 ×#linear
2 ×#quantum
2 ×#question
2 ×#recursion

FoSSaCS-2011-Panangaden #quantum

The Search for Structure in Quantum Computation (PP), pp. 1–11.

FoSSaCS-2011-Jacobs #algebra #quantum

Coalgebraic Walks, in Quantum and Turing Computation (BJ0), pp. 12–26.

FoSSaCS-2011-Levy #algebra #similarity

Similarity Quotients as Final Coalgebras (PBL), pp. 27–41.

FoSSaCS-2011-AxelsenG #question #source code #what

What Do Reversible Programs Compute? (HBA, RG), pp. 42–56.

FoSSaCS-2011-Abel #similarity #type system

Irrelevance in Type Theory with a Heterogeneous Equality Judgement (AA0), pp. 57–71.

FoSSaCS-2011-AtkeyJG #induction #question #refinement

When Is a Type Refinement an Inductive Type? (RA, PJ, NG), pp. 72–87.

FoSSaCS-2011-BernadetL #complexity #normalisation

Complexity of Strongly Normalising λ-Terms via Non-idempotent Intersection Types (AB, SL), pp. 88–107.

FoSSaCS-2011-BernardyL #parametricity #type system

Realizability and Parametricity in Pure Type Systems (JPB, ML), pp. 108–122.

FoSSaCS-2011-PierardS #bisimulation #calculus #distributed #higher-order #process

Sound Bisimulations for Higher-Order Distributed Process Calculus (AP, ES), pp. 123–137.

FoSSaCS-2011-AristizabalBPPV #concurrent #constraints #programming #similarity

Deriving Labels and Bisimilarity for Concurrent Constraint Programming (AA, FB, CP, LFP, FDV), pp. 138–152.

FoSSaCS-2011-BonnetFHR

Ordinal Theory for Expressiveness of Well Structured Transition Systems (RB, AF, SH, FRV), pp. 153–167.

FoSSaCS-2011-DaxK #automaton #word

Alternation Elimination for Automata over Nested Words (CD, FK), pp. 168–183.

FoSSaCS-2011-BokerK #automaton

Co-Büching Them All (UB, OK), pp. 184–198.

FoSSaCS-2011-HalamishK #automaton

Minimizing Deterministic Lattice Automata (SH, OK), pp. 199–213.

FoSSaCS-2011-CaucalH #term rewriting #word

Regularity and Context-Freeness over Word Rewriting Systems (DC, DTH), pp. 214–228.

FoSSaCS-2011-JaubertR #analysis #automaton #robust

Quantitative Robustness Analysis of Flat Timed Automata (RJ, PAR), pp. 229–244.

FoSSaCS-2011-BertrandSJK #approach #automaton #game studies

A Game Approach to Determinize Timed Automata (NB, AS, TJ, MK), pp. 245–259.

FoSSaCS-2011-Kobayashi #algorithm #automaton #higher-order #linear #model checking #recursion

A Practical Linear Time Algorithm for Trivial Automata Model Checking of Higher-Order Recursion Schemes (NK0), pp. 260–274.

FoSSaCS-2011-VelnerR #problem #synthesis

Church Synthesis Problem for Noisy Input (YV, AR), pp. 275–289.

FoSSaCS-2011-Mio #calculus #independence #probability #μ-calculus

Probabilistic Modal μ-Calculus with Independent Product (MM), pp. 290–304.

FoSSaCS-2011-SchwinghammerBS #metric #recursion

A Step-Indexed Kripke Model of Hidden State via Recursive Properties on Recursively Defined Metric Spaces (JS, LB, KS), pp. 305–319.

FoSSaCS-2011-Hoshino #functional #linear #programming language

A Modified GoI Interpretation for a Linear Functional Programming Language and Its Adequacy (NH), pp. 320–334.

FoSSaCS-2011-Clairambault #estimation #game studies #interactive #semantics

Estimation of the Length of Interactions in Arena Game Semantics (PC), pp. 335–349.

FoSSaCS-2011-GhicaM #abstraction #game studies #semantics

Synchronous Game Semantics via Round Abstraction (DRG, MNM), pp. 350–364.

FoSSaCS-2011-GabbayC #set #strict

Freshness and Name-Restriction in Sets of Traces with Names (MJG, VC), pp. 365–380.

FoSSaCS-2011-Hamana #polymorphism #syntax

Polymorphic Abstract Syntax via Grothendieck Construction (MH), pp. 381–395.

FoSSaCS-2011-BorealePP #information management

Asymptotic Information Leakage under One-Try Attacks (MB, FP, MP), pp. 396–410.

FoSSaCS-2011-StahlV #guidelines

A Trace-Based View on Operating Guidelines (CS, WV), pp. 411–425.

FoSSaCS-2011-MollerS #context-free grammar #html #validation

HTML Validation of Context-Free Languages (AM, MS), pp. 426–440.

FoSSaCS-2011-DelzannoSZ #ad hoc #clique #network #on the #power of #verification

On the Power of Cliques in the Parameterized Verification of Ad Hoc Networks (GD, AS, GZ), pp. 441–455.

FoSSaCS-2011-CousotCM #abstract domain

The Reduced Product of Abstract Domains and the Combination of Decision Procedures (PC, RC, LM), pp. 456–472.