Summary
This page is dedicated to the VERLAN project, which I worked on from September 2021 to August 2024. This project has received funding from the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie grant agreement No 101027412.
The mission statement of the project was as follows:
Limitations to a programming language can help boost the production of more readable and maintainable software. A limited fragment associated with the semantic domain can introduce more efficient algorithms for verification and analysis beginning with the characterisation of the semantic domain. The EU-funded VERLAN project will review the semantic domains of fragments of programming languages under a formal language theory perspective. VERLAN will study the three mathematical frameworks to categorise formal languages and derive new algorithms for three fundamental problems in program verification – refactoring, equivalence checking, and learning.
Publications
The following published works resulted from efforts during the project.
Probabilistic Guarded KAT Modulo Bisimilarity: Completeness and Complexity
[ICALP 2023]
A Complete Inference System for Skip-free Guarded Kleene Algebra with Tests
[ESOP 2023]
Completeness and the Finite Model Property for Kleene Algebra, Reconsidered
[RAMiCS 2023]
Leapfrog: Certified Equivalence for Protocol Parsers
[PLDI 2022]
A Categorical Framework for Learning Generalised Tree Automata
[CMCS 2022]
Concurrent NetKAT: modeling and analyzing stateful, concurrent networks
[ESOP 2022]