Zobrazeno 1 - 10 of 52 pro vyhledávání: '"Wijs, A.J."'
1
Akademický článek
Extended beam search for non-exhaustive state space analysis
Autor: Wijs, A.J., Torabi Dashti, M.
Publikováno v: In Journal of Logic and Algebraic Programming 2012 81(1):46-69
Zobrazit plný text záznamu
2
Compositional model checking is lively
Autor: de Putter, S.M.J., Wijs, A.J., Proença, J., Lumpe, M.
Publikováno v: Formal Aspects of Component Software ISBN: 9783319680330
FACS
Formal Aspects of Component Software: 14th International Conference, FACS 2017, Braga, Portugal, October 10-13, 2017, Proceedings, 117-136
STARTPAGE=117;ENDPAGE=136;TITLE=Formal Aspects of Component Software
Compositional model checking approaches attempt to limit state space explosion by iteratively combining behaviour of some of the components in the system and reducing the result modulo an appropriate equivalence relation. For an equivalence relation
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::dab5c3445f7902d65f8365085ec449a7
http://www.scopus.com/inward/record.url?scp=85030716629&partnerID=8YFLogxK
Zobrazit plný text záznamu
3
Akademický článek
Analyzing a χ model of a turntable system using Spin, CADP and Uppaal
Autor: Bortnik, E., Trčka, N., Wijs, A.J., Luttik, B., van de Mortel-Fronczak, J.M., Baeten, J.C.M., Fokkink, W.J., Rooda, J.E.
Publikováno v: In Journal of Logic and Algebraic Programming 2005 65(2):51-104
Zobrazit plný text záznamu
4
An O(m log n) algorithm for stuttering equivalence and branching bisimulation
Autor: Groote, J.F., Wijs, A.J., Chechik, M., Raskin, J.-F.
Publikováno v: Tools and Algorithms for the Construction and Analysis of Systems ISBN: 9783662496732
TACAS
Tools and Algorithms for the Construction and Analysis of Systems: 22nd International Conference, TACAS 2016, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2016, Eindhoven, The Netherlands, April 2-8, 2016, Proceedings, 607-624
STARTPAGE=607;ENDPAGE=624;TITLE=Tools and Algorithms for the Construction and Analysis of Systems
We provide a new algorithm to determine stuttering equivalence with time complexity $$Om \log n$$, where n is the number of states and m is the number of transitions of a Kripke structure. This algorithm can also be used to determine branching bisimu
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3cf02b61a4d0e9b642b1eb3bd154549d
http://www.scopus.com/inward/record.url?scp=84964057222&partnerID=8YFLogxK
Zobrazit plný text záznamu
5
Towards modular verification of threaded concurrent executable code generated from DSL models
Autor: Bosnacki, D., van den Brand, M.G.J., Gabriels, J.M.A.M., Jacobs, B., Kuiper, R., Roede, S., Wijs, A.J., Zhang, D., Braga, C., Csaba Ölveczky, P.
Publikováno v: Formal Aspects of Component Software ISBN: 9783319289335
FACS
Formal Aspects of Component Software: 12th International Conference, FACS 2015, Niterói, Brazil, October 14-16, 2015, Revised Selected Papers, 141-160
STARTPAGE=141;ENDPAGE=160;TITLE=Formal Aspects of Component Software
An important problem in Model Driven Engineering is maintaining the correctness of a specification under model transformations. We consider this issue for a framework that implements the transformation chain from the modeling language SLCO to Java. I
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5fa4d8227b85747f39b6d59660917e66
http://www.scopus.com/inward/record.url?scp=84958093527&partnerID=8YFLogxK
Zobrazit plný text záznamu
6
On the scalability of the GPUexplore explicit-state model checker
Autor: Cassee, Nathan W., Neele, T.S., Wijs, A.J., Kehrer, Timo, Miller, Alice
Publikováno v: Proceedings Third Workshop on Graphs as Models (GaM 2017), 23 April 2017, Uppsala, Sweden, 38-52
STARTPAGE=38;ENDPAGE=52;TITLE=Proceedings Third Workshop on Graphs as Models (GaM 2017), 23 April 2017, Uppsala, Sweden
Electronic Proceedings in Theoretical Computer Science, Vol 263, Iss Proc. GaM 2017, Pp 38-52 (2017)
GaM@ETAPS
The use of graphics processors (GPUs) is a promising approach to speed up model checking to such an extent that it becomes feasible to instantly verify software systems during development. GPUexplore is an explicit-state model checker that runs all i
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4d521551c54b3b17a1186bc2c60adecf
https://research.tue.nl/nl/publications/62cdf19a-3b9a-431c-9d38-2a185f0c7f32
Zobrazit plný text záznamu
7
Compositional model checking with incremental counter-example construction
Autor: Wijs, A.J., Neele, T.S., Majumdar, R., Kunčak, V.
Publikováno v: Computer Aided Verification: 29th International Conference, CAV 2017, Heidelberg, Germany, July 24-28, 2017, Proceedings, Part I, 570-590
STARTPAGE=570;ENDPAGE=590;TITLE=Computer Aided Verification
Computer Aided Verification ISBN: 9783319633862
CAV (1)
In compositional model checking, the approach is to reason about the correctness of a system by lifting results obtained in analyses of subsystems to the system-level. The main challenge, however, is that requirements, in the form of temporal logic f
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::aa38a68094f1191e281c6b22bba6da1e
https://research.tue.nl/nl/publications/31781f6c-89bc-4105-92e5-8b1a0779814c
Zobrazit plný text záznamu
9
Efficient Instantiation of Parameterised Boolean Equation Systems to Parity Games
Autor: Kant, Gijs, van de Pol, Jan Cornelis, Wijs, A.J., Bošnački, D., Edelkamp, S.
Publikováno v: Electronic Proceedings in Theoretical Computer Science, Vol 99, Iss Proc. GRAPHITE 2012, Pp 50-65 (2012)
GRAPHITE
First Workshop on GRAPH Inspection and Traversal Engineering (GRAPHITE 2012), 50-65
STARTPAGE=50;ENDPAGE=65;TITLE=First Workshop on GRAPH Inspection and Traversal Engineering (GRAPHITE 2012)
Parameterised Boolean Equation Systems (PBESs) are sequences of Boolean fixed point equations with data variables, used for, e.g., verification of modal mu-calculus formulae for process algebraic specifications with data. Solving a PBES is usually do
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3c472fec44fd1aa31a87b0fa2e101716
https://doi.org/10.4204/eptcs.99.7
Zobrazit plný text záznamu
10
GPU Accelerated Strong and Branching Bisimilarity Checking
Autor: Wijs, A.J., Baier, C., Tinelli, C.
Publikováno v: Tools and Algorithms for the Construction and Analysis of Systems ISBN: 9783662466803
TACAS
Tools and Algorithms for the Construction and Analysis of Systems: 21st International Conference, TACAS 2015, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2015, London, UK, April 11-18, 2015, Proceedings, 368-383
STARTPAGE=368;ENDPAGE=383;TITLE=Tools and Algorithms for the Construction and Analysis of Systems
Bisimilarity checking is an important operation to perform explicit-state model checking when the state space of a model under verification has already been generated. It can be applied in various ways: reduction of a state space w.r.t. a particular
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f3e6f77d230353b9796a3975c57a7a55
https://doi.org/10.1007/978-3-662-46681-0_29
Zobrazit plný text záznamu

Vyhledávací nástroje:

Upřesnit hledání

Omezení vyhledávání
Plný text Recenzováno Digitální knihovna AV ČR
Zdroje