Abstract is missing.
- Formal Verification of a Geometry Algorithm: A Quest for Abstract Views and Symmetry in Coq ProofsYves Bertot. 3-10 [doi]
- LTL Semantic Tableaux and Alternating \omega ω -automata via Linear FactorsMartin Sulzmann, Peter Thiemann. 11-34 [doi]
- Proof Nets and the Linear Substitution CalculusBeniamino Accattoli. 37-61 [doi]
- Modular Design of Domain-Specific Languages Using Splittings of CatamorphismsÉric Badouel, Rodrigue Aimé Djeumen Djatcha. 62-79 [doi]
- An Automata-Based View on Configurability and UncertaintyMartin Berglund, Ina Schaefer. 80-98 [doi]
- Formalising Boost POSIX Regular Expression MatchingMartin Berglund, Willem Bester, Brink van der Merwe. 99-115 [doi]
- Monoidal MultiplexingApiwat Chantawibul, Pawel Sobocinski. 116-131 [doi]
- Input/Output Stochastic Automata with Urgency: Confluence and Weak DeterminismPedro R. D'Argenio, Raúl E. Monti. 132-152 [doi]
- Layer by Layer - Combining MonadsFredrik Dahlqvist, Louis Parlant, Alexandra Silva 0001. 153-172 [doi]
- Layer Systems for Confluence - FormalizedBertram Felgenhauer, Franziska Rapp. 173-190 [doi]
- A Metalanguage for Guarded IterationSergey Goncharov 0001, Christoph Rauch, Lutz Schröder. 191-210 [doi]
- ALC ALC TBoxesHenriette Harmse, Katarina Britz, Aurona Gerber. 211-230 [doi]
- Spatio-Temporal Domains: An OverviewDavid Janin. 231-251 [doi]
- Checking Modal Contracts for Virtually Timed AmbientsEinar Broch Johnsen, Martin Steffen, Johanna Beate Stumpf, Lars Tveito. 252-272 [doi]
- Abstraction of Bit-Vector Operations for BDD-Based SMT SolversMartin Jonás, Jan Strejcek. 273-291 [doi]
- Weak Bisimulation Metrics in Models with Nondeterminism and Continuous State SpacesRuggero Lanotte, Simone Tini. 292-312 [doi]
- Symbolic Computation via Program TransformationHenrich Lauko, Petr Rockai, Jiri Barnat. 313-332 [doi]
- Double Applicative FunctorsHärmel Nestra. 333-353 [doi]
- Checking Sequence Generation for Symbolic Input/Output FSMs by Constraint SolvingOmer Nguena-Timo, Alexandre Petrenko, S. Ramesh. 354-375 [doi]
- Explicit AuditingWilmer Ricciotti, James Cheney. 376-395 [doi]
- Complexity and Expressivity of Branching- and Alternating-Time Temporal Logics with Finitely Many VariablesMikhail N. Rybakov, Dmitry Shkatov. 396-414 [doi]
- Complexity Results on Register Context-Free Grammars and Register Tree AutomataRyoma Senda, Yoshiaki Takata, Hiroyuki Seki. 415-434 [doi]
- Information Flow CertificatesManuel Töws, Heike Wehrheim. 435-454 [doi]
- The Smallest FSSP Partial Solutions for One-Dimensional Ring Cellular Automata: Symmetric and Asymmetric SynchronizersHiroshi Umeo, Naoki Kamikawa, Gen Fujita. 455-471 [doi]
- Convex Language Semantics for Nondeterministic Probabilistic AutomataGerco van Heerdt, Justin Hsu, Joël Ouaknine, Alexandra Silva 0001. 472-492 [doi]
- Fast Computations on Ordered Nominal SetsDavid Venhoek, Joshua Moerman, Jurriaan Rot. 493-512 [doi]
- Non-preemptive Semantics for Data-Race-Free ProgramsSiyang Xiao, Hanru Jiang, Hongjin Liang, Xinyu Feng. 513-531 [doi]