The following pages link to Tim A. C. Willemse (Q960854):
Displayed 50 items.
- (Q716321) (redirect page) (← links)
- (Q2117020) (redirect page) (← links)
- Verification of reactive systems via instantiation of parameterised Boolean equation systems (Q716322) (← links)
- Invariants for parameterised Boolean equation systems (Q960855) (← links)
- Search algorithms for automated validation (Q1014571) (← links)
- Parity game reductions (Q1656552) (← links)
- A formalisation of consistent consequence for Boolean equation systems (Q1687766) (← links)
- Off-the-shelf automated analysis of liveness properties for just paths (extended abstract) (Q2117021) (← links)
- Off-the-shelf automated analysis of liveness properties for just paths (Q2182670) (← links)
- The inconsistent labelling problem of stutter-preserving partial-order reduction (Q2200842) (← links)
- Model-checking processes with data (Q2486254) (← links)
- Branching bisimulation for probabilistic systems: characteristics and decidability (Q2491633) (← links)
- Parameterised Boolean equation systems (Q2571204) (← links)
- Decomposing monolithic processes in a process algebra with multi-actions (Q2693301) (← links)
- On Parity Game Preorders and the Logic of Matching Plays (Q2794366) (← links)
- Branching Bisimulation Games (Q2827464) (← links)
- Proof Graphs for Parameterised Boolean Equation Systems (Q2842127) (← links)
- (Q2848135) (← links)
- Consistent Consequence for Boolean Equation Systems (Q2891375) (← links)
- A Cure for Stuttering Parity Games (Q2915107) (← links)
- Structural Analysis of Boolean Equation Systems (Q2946656) (← links)
- Folk Theorems on the Correspondence between State-Based and Event-Based Systems (Q3075540) (← links)
- Cooking Your Own Parity Game Preorders Through Matching Plays (Q3177339) (← links)
- (Q3384882) (← links)
- Liveness Analysis for Parameterised Boolean Equation Systems (Q3457791) (← links)
- Using SMT for Solving Fragments of Parameterised Boolean Equation Systems (Q3460542) (← links)
- Equivalence Checking for Infinite Systems Using Parameterized Boolean Equation Systems (Q3525633) (← links)
- Invariants for Parameterised Boolean Equation Systems (Q3541018) (← links)
- Consistent Correlations for Parameterised Boolean Equation Systems with Applications in Correctness Proofs for Manipulations (Q3584957) (← links)
- Integrating Verification, Testing, and Learning for Cryptographic Protocols (Q3608895) (← links)
- Static Analysis Techniques for Parameterised Boolean Equation Systems (Q3617762) (← links)
- (Q4596797) (← links)
- (Q4986259) (← links)
- (Q4992503) (← links)
- (Q5013885) (← links)
- (Q5020944) (← links)
- Family-Based SPL Model Checking Using Parity Games with Variability (Q5039535) (← links)
- (Q5129943) (← links)
- (Q5150133) (← links)
- (Q5155669) (← links)
- Partial-Order Reduction for Parity Games with an Application on Parameterised Boolean Equation Systems (Q5164176) (← links)
- Family-Based Model Checking with mCRL2 (Q5215913) (← links)
- Abstraction in Fixpoint Logic (Q5277894) (← links)
- Formal Methods for Components and Objects (Q5311288) (← links)
- CONCUR 2004 - Concurrency Theory (Q5311482) (← links)
- An Overview of the mCRL2 Toolset and Its Recent Advances (Q5326326) (← links)
- Evidence for Fixpoint Logic (Q5351951) (← links)
- Formal Approaches to Software Testing (Q5710638) (← links)
- A Complete Axiomatisation of Branching Bisimulation for Probabilistic Systems with an Application in Protocol Verification (Q5756596) (← links)
- (Q5856411) (← links)
- Integrated Formal Methods (Q5901615) (← links)