Tobias Kappé

Orcid: 0000-0002-6068-880X

Affiliations:
  • University of Amsterdam, The Netherlands
  • University College London, UK (former)
  • Leiden University, The Netherlands (former)


According to our database1, Tobias Kappé authored at least 28 papers between 2015 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Formal Abstractions for Packet Scheduling.
Proc. ACM Program. Lang., October, 2023

Probabilistic Guarded KAT Modulo Bisimilarity: Completeness and Complexity.
Proceedings of the 50th International Colloquium on Automata, Languages, and Programming, 2023

A Complete Inference System for Skip-free Guarded Kleene Algebra with Tests.
Proceedings of the Programming Languages and Systems, 2023

Completeness and the Finite Model Property for Kleene Algebra, Reconsidered.
Proceedings of the Relational and Algebraic Methods in Computer Science, 2023

2022
Leapfrog: certified equivalence for protocol parsers.
Proceedings of the PLDI '22: 43rd ACM SIGPLAN International Conference on Programming Language Design and Implementation, San Diego, CA, USA, June 13, 2022

Concurrent NetKAT - Modeling and analyzing stateful, concurrent networks.
Proceedings of the Programming Languages and Systems, 2022

A Categorical Framework for Learning Generalised Tree Automata.
Proceedings of the Coalgebraic Methods in Computer Science, 2022

2021
Equivalence checking for weak bi-Kleene algebra.
Log. Methods Comput. Sci., 2021

Guarded Kleene Algebra with Tests: Coequations, Coinduction, and Completeness.
Proceedings of the 48th International Colloquium on Automata, Languages, and Programming, 2021

Learning Pomset Automata.
Proceedings of the Foundations of Software Science and Computation Structures, 2021

2020
Concurrent Kleene Algebra: completeness and decidability.
PhD thesis, 2020

Guarded Kleene algebra with tests: verification of uninterpreted programs in nearly linear time.
Proc. ACM Program. Lang., 2020

Concurrent Kleene Algebra with Observations: From Hypotheses to Completeness.
Proceedings of the Foundations of Software Science and Computation Structures, 2020

Partially Observable Concurrent Kleene Algebra.
Proceedings of the 31st International Conference on Concurrency Theory, 2020

2019
Soft component automata: Composition, compilation, logic, and verification.
Sci. Comput. Program., 2019

On series-parallel pomset languages: Rationality, context-freeness and automata.
J. Log. Algebraic Methods Program., 2019

Completeness and Incompleteness of Synchronous Kleene Algebra.
Proceedings of the Mathematics of Program Construction - 13th International Conference, 2019

Kleene Algebra with Observations.
Proceedings of the 30th International Conference on Concurrency Theory, 2019

Tree Automata as Algebras: Minimisation and Determinisation.
Proceedings of the 8th Conference on Algebra and Coalgebra in Computer Science, 2019

2018
Decision problems for Clark-congruential languages.
Proceedings of the 14th International Conference on Grammatical Inference, 2018

Concurrent Kleene Algebra: Free Model and Completeness.
Proceedings of the Programming Languages and Systems, 2018

Learning to Coordinate.
Proceedings of the It's All About Coordination, 2018

2017
Constraint automata with memory cells and their composition.
Sci. Comput. Program., 2017

A Component-Oriented Framework for Autonomous Agents.
Proceedings of the Formal Aspects of Component Software - 14th International Conference, 2017

Brzozowski Goes Concurrent - A Kleene Theorem for Pomset Languages.
Proceedings of the 28th International Conference on Concurrency Theory, 2017

2016
A Compositional Framework for Preference-Aware Agents.
Proceedings of the The First Workshop on Verification and Validation of Cyber-Physical Systems, 2016

Formal Specification and Analysis of Robust Adaptive Distributed Cyber-Physical Systems.
Proceedings of the Formal Methods for the Quantitative Evaluation of Collective Adaptive Systems, 2016

2015
Composing Constraint Automata, State-by-State.
Proceedings of the Formal Aspects of Component Software - 12th International Conference, 2015


  Loading...