Local Higher-Order Fixpoint Iteration

Autor: Bruse, Florian, Kreiker, Jörg, Lange, Martin, Sälzer, Marco

Publikováno v: EPTCS 326, 2020, pp. 97-113

Local fixpoint iteration describes a technique that restricts fixpoint iteration in function spaces to needed arguments only. It has been studied well for first-order functions in abstract interpretation and also in model checking. Here we consider t

Externí odkaz: http://arxiv.org/abs/2009.10881

Graph abstraction and abstract graph transformations (Amended version)

Autor: Boneva, I.B., Kreiker, Jörg, Kurban, M.E., Rensink, Arend, Zambon, Eduardo

Many important systems such as concurrent heap-manipulating programs, communication networks, or distributed algorithms, are hard to verify due to their inherent dynamics and unboundedness. Graphs are an intuitive representation for the states of the

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=narcis______::2e0f49f59462cc58722e63e4824c9517
https://research.utwente.nl/en/publications/graph-abstraction-and-abstract-graph-transformations-amended-version(2ed3f0ef-7f4d-4e3c-90bc-1203b4c0d227).html

Graph Abstraction for a Modal Logic

Autor: Boneva, Iovka, Ehrig, H, Kreiker, Jörg, Kurban, M.E., Rensink, Arend

Publikováno v: Bulletin of the European Association for Theoretical Computer Science, 97, 106-116. European Association for Theoretical Computer Science

We are studying a particular graph abstraction, based on the concept of retaining neighbourhood information up to a certain radius for each node. In this contribution, we present a modal logic on graphs that is preserved and reflected by this abstrac

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=narcis______::000c1eea27c7238ff78991c6d5b5d616
https://research.utwente.nl/en/publications/graph-abstraction-for-a-modal-logic(f72316b7-bc04-4c32-ab72-7ac1c2606551).html