default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID15th ICTAC 2018: Stellenbosch, South Africa
- Bernd Fischer, Tarmo Uustalu
:
Theoretical Aspects of Computing - ICTAC 2018 - 15th International Colloquium, Stellenbosch, South Africa, October 16-19, 2018, Proceedings. Lecture Notes in Computer Science 11187, Springer 2018, ISBN 978-3-030-02507-6
Invited Talks (Papers)
- Yves Bertot:
Formal Verification of a Geometry Algorithm: A Quest for Abstract Views and Symmetry in Coq Proofs. 3-10 - Martin Sulzmann, Peter Thiemann:
LTL Semantic Tableaux and Alternating \omega ω -automata via Linear Factors. 11-34
Contributed Talks
- Beniamino Accattoli:
Proof Nets and the Linear Substitution Calculus. 37-61 - Éric Badouel, Rodrigue Aimé Djeumen Djatcha:
Modular Design of Domain-Specific Languages Using Splittings of Catamorphisms. 62-79 - Martin Berglund, Ina Schaefer:
An Automata-Based View on Configurability and Uncertainty. 80-98 - Martin Berglund, Willem Bester, Brink van der Merwe:
Formalising Boost POSIX Regular Expression Matching. 99-115 - Apiwat Chantawibul, Pawel Sobocinski:
Monoidal Multiplexing. 116-131 - Pedro R. D'Argenio, Raúl E. Monti:
Input/Output Stochastic Automata with Urgency: Confluence and Weak Determinism. 132-152 - Fredrik Dahlqvist, Louis Parlant, Alexandra Silva:
Layer by Layer - Combining Monads. 153-172 - Bertram Felgenhauer, Franziska Rapp:
Layer Systems for Confluence - Formalized. 173-190 - Sergey Goncharov, Christoph Rauch, Lutz Schröder:
A Metalanguage for Guarded Iteration. 191-210 - Henriette Harmse, Katarina Britz, Aurona Gerber:
Generating Armstrong ABoxes for ALC ALC TBoxes. 211-230 - David Janin:
Spatio-Temporal Domains: An Overview. 231-251 - Einar Broch Johnsen, Martin Steffen, Johanna Beate Stumpf, Lars Tveito:
Checking Modal Contracts for Virtually Timed Ambients. 252-272 - Martin Jonás, Jan Strejcek:
Abstraction of Bit-Vector Operations for BDD-Based SMT Solvers. 273-291 - Ruggero Lanotte, Simone Tini:
Weak Bisimulation Metrics in Models with Nondeterminism and Continuous State Spaces. 292-312 - Henrich Lauko, Petr Rockai, Jiri Barnat:
Symbolic Computation via Program Transformation. 313-332 - Härmel Nestra:
Double Applicative Functors. 333-353 - Omer Nguena-Timo, Alexandre Petrenko, S. Ramesh:
Checking Sequence Generation for Symbolic Input/Output FSMs by Constraint Solving. 354-375 - Wilmer Ricciotti, James Cheney:
Explicit Auditing. 376-395 - Mikhail N. Rybakov, Dmitry Shkatov:
Complexity and Expressivity of Branching- and Alternating-Time Temporal Logics with Finitely Many Variables. 396-414 - Ryoma Senda, Yoshiaki Takata, Hiroyuki Seki:
Complexity Results on Register Context-Free Grammars and Register Tree Automata. 415-434 - Manuel Töws, Heike Wehrheim:
Information Flow Certificates. 435-454 - Hiroshi Umeo, Naoki Kamikawa, Gen Fujita:
The Smallest FSSP Partial Solutions for One-Dimensional Ring Cellular Automata: Symmetric and Asymmetric Synchronizers. 455-471 - Gerco van Heerdt, Justin Hsu, Joël Ouaknine, Alexandra Silva:
Convex Language Semantics for Nondeterministic Probabilistic Automata. 472-492 - David Venhoek, Joshua Moerman, Jurriaan Rot:
Fast Computations on Ordered Nominal Sets. 493-512 - Siyang Xiao, Hanru Jiang, Hongjin Liang, Xinyu Feng:
Non-preemptive Semantics for Data-Race-Free Programs. 513-531
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.
last updated on 2025-02-02 22:34 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
