Skip to main content

5 Result(s)

within T. A. C. Willemse Remove this filter

and

  1. No Access

    Chapter and Conference Paper

    On Parity Game Preorders and the Logic of Matching Plays

    Parity games can be used to solve satisfiability, verification and controller synthesis problems. As part of an effort to better understand their nature, or the nature of the problems they solve, preorders on ...

    M. W. Gazda, T. A. C. Willemse in SOFSEM 2016: Theory and Practice of Computer Science (2016)

  2. No Access

    Living Reference Work Entry In depth

    Parity Games

    T. A. C. Willemse, M. Gazda in Encyclopedia of Algorithms

  3. No Access

    Chapter and Conference Paper

    Instantiation for Parameterised Boolean Equation Systems

    Verification problems for finite- and infinite-state processes, like model checking and equivalence checking, can effectively be encoded in Parameterised Boolean Equation Systems (PBESs). Solving the PBES solv...

    A. van Dam, B. Ploeger, T. A. C. Willemse in Theoretical Aspects of Computing - ICTAC 2008 (2008)

  4. No Access

    Chapter and Conference Paper

    Integrating Verification, Testing, and Learning for Cryptographic Protocols

    The verification of cryptographic protocol specifications is an active research topic and has received much attention from the formal verification community. By contrast, the black-box testing of actual implement...

    Martijn Oostdijk, Vlad Rusu, Jan Tretmans, R. G. de Vries… in Integrated Formal Methods (2007)

  5. No Access

    Chapter and Conference Paper

    A Symbolic Framework for Model-Based Testing

    The starting point for Model-Based Testing is an implementation relation that formally defines when a formal model representing the System Under Test conforms to a formal model constituting its specification. ...

    L. Frantzen, J. Tretmans, T. A. C. Willemse in Formal Approaches to Software Testing and … (2006)