Publications
Chosen filters:
Chosen filters:
Reconstructing and Improving Parity Game Solvers with Justifications KU Leuven
In certain industries, such as medical or aerospace, failure can result inunacceptable losses. To ensure safety, checks are implemented for every stepin the process: standards, certifications, testing, maintenance schedules. . . For
software, this encompasses researching diverse approaches including automatictesting, safer programming languages, declarative languages to separateknowledge from execution, or generating provably correct ...
software, this encompasses researching diverse approaches including automatictesting, safer programming languages, declarative languages to separateknowledge from execution, or generating provably correct ...
Improving Parity Game Solvers with Justifications KU Leuven
Parity games are infinite two-player games played on node-weighted directed graphs. Formal verification problems such as verifying and synthesizing automata, bounded model checking of LTL, CTL*, propositional ยต-calculus, ...reduce to problems over parity games. The core problem of parity game solving is deciding the winner of some (or all) nodes in a parity game. In this paper, we improve several parity game solvers by using a justification ...
Resilient delegation revocation with precedence for predecessors is NP-complete KU Leuven
In ownership-based access control frameworks with the possibility of delegating permissions and administrative rights, chains of delegated accesses will form. There are different ways to treat these delegation chains when revoking rights, which give rise to different revocation schemes. One possibility studied in the literature is to revoke rights by issuing negative authorizations, meant to ensure that the revocation is resilient to a later ...
Visualising interactive inferences with IDPD3 KU Leuven
A large part of the use of knowledge base systems is the interpretation of the output by the end-users and the interaction with these users. Even during the development process visualisations can be a great help to the developer. We created IDPD3 as a library to visualise models of logic theories. IDPD3 is a new version of IDP Draw and adds support for visualised interactive simulations.