Výsledky vyhledávání - "Dijk, Tom Van"

IntelliJML: a JML plugin for IntelliJ IDEA

Autor: Monteiro, Steven, Sokolovas, Erikas, Wittingen, Ellen, Dijk, Tom Van, Huisman, Marieke, Cok, David R.

Publikováno v: FTfJP 2021-Proceedings of the 23rd ACM International Workshop on Formal Techniques for Java-Like Programs, co-located with ECOOP/ISSTA 2021, 39-42
STARTPAGE=39;ENDPAGE=42;TITLE=FTfJP 2021-Proceedings of the 23rd ACM International Workshop on Formal Techniques for Java-Like Programs, co-located with ECOOP/ISSTA 2021

Java code can be annotated with formal specifications using the Java Modelling Language (JML). Previous work has provided IDE plugins intended to help write JML, but mostly for the Eclipse IDE. We introduce IntelliJML, a JML plugin for IntelliJ IDEA,

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e02819fadf75ccdbda283a64e1c83578
https://doi.org/10.1145/3464971.3468423

Zobrazit plný text záznamu

Simple Fixpoint Iteration To Solve Parity Games

Autor: Dijk, Tom van, Rubbens, Bob, Leroux, Jérôme, Raskin, Jean-François

Publikováno v: Electronic Proceedings in Theoretical Computer Science, Vol 305, Iss Proc. GandALF 2019, Pp 123-139 (2019)
Proceedings Tenth International Symposium on Games, Automata, Logics, and Formal Verification, GandALF 2019: Bordeaux, France, 2-3rd September 2019, 123-139
STARTPAGE=123;ENDPAGE=139;TITLE=Proceedings Tenth International Symposium on Games, Automata, Logics, and Formal Verification, GandALF 2019

A naive way to solve the model-checking problem of the mu-calculus uses fixpoint iteration. Traditionally however mu-calculus model-checking is solved by a reduction in linear time to a parity game, which is then solved using one of the many algorith

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5cba7799a18d106730105d67c90b6c7d
https://doaj.org/article/98683258d3cf4e14bfbdd52d04761188

Zobrazit plný text záznamu

A Parity Game Tale of Two Counters

Autor: Dijk, Tom van, Leroux, Jérôme, Raskin, Jean-François

Publikováno v: Electronic Proceedings in Theoretical Computer Science, Vol 305, Iss Proc. GandALF 2019, Pp 107-122 (2019)
GandALF
Proceedings Tenth International Symposium on Games, Automata, Logics, and Formal Verification, GandALF 2019: Bordeaux, France, 2-3rd September 2019, 107-122
STARTPAGE=107;ENDPAGE=122;TITLE=Proceedings Tenth International Symposium on Games, Automata, Logics, and Formal Verification, GandALF 2019

Parity games are simple infinite games played on finite graphs with a winning condition that is expressive enough to capture nested least and greatest fixpoints. Through their tight relationship to the modal mu-calculus, they are used in practice for

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c2a59549f251f9f49affc8cc6897984a
https://doaj.org/article/3e4a670e15254cf5b8ec73b69072ddad

Zobrazit plný text záznamu

Multi-core On-The-Fly Saturation

Autor: Dijk, Tom van, Meijer, Jeroen, van de Pol, Jaco

Publikováno v: Dijk, T V, Meijer, J & van de Pol, J 2019, Multi-core On-The-Fly Saturation . in Tools and Algorithms for the Construction and Analysis of Systems, 25th International Conference, (TACAS) 2019, Held as Part of the European Joint Conferences on Theory and Practice of Software, (ETAPS) 2019, Prague, Czech Republic, April 6-11, 2019, Proceedings, Part II . Springer, Lecture Notes in Computer Science, vol. 11428, pp. 58-75, 25th International Conference, TACAS 2019, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2019, Prag, Czech Republic, 06/04/2019 . https://doi.org/10.1007/978-3-030-17465-1_4

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::bc27df08f2b95088708baed8dc4e3d7c
https://pure.au.dk/portal/da/publications/multicore-onthefly-saturation(bdb0f4b1-f2c1-4aef-bda6-2f7da7a85c3f).html

Zobrazit plný text záznamu