40 citations
- Radboud University NijmegenNL12 papers
- Utrecht UniversityNL7 papers
- Centrum Wiskunde & InformaticaNL6 papers
- Leiden UniversityNL3 papers
- Shahid Beheshti UniversityIR3 papers
- Tilburg UniversityNL3 papers
- Centraal Bureau voor de StatistiekNL2 papers
- Centre National de la Recherche ScientifiqueFR2 papers
- Eindhoven University of TechnologyNL2 papers
- Instituto de Engenharia de Sistemas e Computadores Investigação e DesenvolvimentoPT2 papers
- Institut Polytechnique de ParisFR2 papers
- Norwegian University of Life SciencesNO2 papers
13 papers · 1 filter
Dynamic Separation Logic
Frank S. de Boer, Hans-Dieter A. Hiep, Stijn de Gouw
This paper introduces a dynamic logic extension of separation logic. The assertion language of separation logic is extended with modalities for the five types of the basic instruct…
No Finite Model Property for Logics of Quantified Announcements
Hans van Ditmarsch, Tim French, Rustam Galimullin
Quantification over public announcements shifts the perspective from reasoning strictly about the results of a particular announcement to reasoning about the existence of an announ…
Providing Hints, Next Steps and Feedback in a Tutoring System for Structural Induction
Josje Lodder, Bastiaan Heeren, Johan Jeuring
Structural induction is a proof technique that is widely used to prove statements about discrete structures. Students find it hard to construct inductive proofs, and when learning…
Quantifying over Boolean announcements
Hans van Ditmarsch, Tim French
Various extensions of public announcement logic have been proposed with quantification over announcements. The best-known extension is called arbitrary public announcement logic, A…
Games for Bisimulations and Abstraction
David De Frutos Escrig, Jeroen J. A. Keiren, Tim A. C. Willemse
Weak bisimulations are typically used in process algebras where silent steps are used to abstract from internal behaviours. They facilitate relating implementations to specificatio…
Parity Game Reductions
S. Cranen, J. J. A. Keiren, T. A. C. Willemse
Parity games play a central role in model checking and satisfiability checking. Solving parity games is computationally expensive, among others due to the size of the games, which,…