| Publication | Date of Publication | Type |
|---|
An approximation-based approach for the random exploration of large models
Tests and Proofs | 2023-05-05 | Paper |
Under-approximation generation driven by relevance predicates and variants
Tests and Proofs | 2023-05-05 | Paper |
Approximating event system abstractions by covering their states and transitions
Lecture Notes in Computer Science | 2021-05-26 | Paper |
Test generation from event system abstractions to cover their states and transitions
Programming and Computer Software | 2020-12-17 | Paper |
Opacity for linear constraint Markov chains
Discrete Event Dynamic Systems | 2018-04-18 | Paper |
Reduction of workflow nets for generalised soundness verification
Lecture Notes in Computer Science | 2017-02-21 | Paper |
Automatic decidability: a schematic calculus for theories with counting operators
| 2017-02-01 | Paper |
Constraint Solving for Verifying Modal Specifications of Workflow Nets with Data
Lecture Notes in Computer Science | 2016-12-21 | Paper |
The emptiness problem for tree automata with at least one global disequality constraint is NP-hard
Information Processing Letters | 2016-11-23 | Paper |
Handling left-quadratic rules when completing tree automata
Electronic Notes in Theoretical Computer Science | 2015-03-23 | Paper |
Tree automata for detecting attacks on protocols with algebraic cryptographic primitives
Electronic Notes in Theoretical Computer Science | 2015-03-19 | Paper |
Enhancing approximations for regular reachability analysis
Implementation and Application of Automata | 2013-08-07 | Paper |
When Structural Refinement of Components Keeps Temporal Properties over Reconfigurations
FM 2012: Formal Methods | 2012-11-08 | Paper |
A rule-based framework for building superposition-based decision procedures
Rewriting Logic and Its Applications | 2012-10-16 | Paper |
On positive TAGED with a bounded number of constraints
Implementation and Application of Automata | 2012-09-20 | Paper |
From linear temporal logic properties to rewrite propositions
Automated Reasoning | 2012-09-05 | Paper |
Loops and overloops for tree-walking automata
Theoretical Computer Science | 2012-08-09 | Paper |
Loops and overloops for tree walking automata
Implementation and Application of Automata | 2011-07-29 | Paper |
Component simulation-based substitutivity managing QoS and composition issues
Science of Computer Programming | 2010-08-26 | Paper |
How to verify and exploit a refinement of component-based systems
Perspectives of Systems Informatics | 2010-02-02 | Paper |
HANDLING NON LEFT-LINEAR RULES WHEN COMPLETING TREE AUTOMATA
International Journal of Foundations of Computer Science | 2009-11-19 | Paper |
How to Tackle Integer Weighted Automata Positivity
Lecture Notes in Computer Science | 2009-11-19 | Paper |
Approximation-based tree regular model-checking
| 2009-10-12 | Paper |
TAGED Approximations for Temporal Properties Model-Checking
Implementation and Application of Automata | 2009-07-09 | Paper |
Handling Algebraic Properties in Automatic Analysis of Security Protocols
Lecture Notes in Computer Science | 2008-09-11 | Paper |
Finer Is Better: Abstraction Refinement for Rewriting Approximations
Rewriting Techniques and Applications | 2008-08-28 | Paper |
Algebraic Methodology and Software Technology
Lecture Notes in Computer Science | 2005-08-25 | Paper |
scientific article; zbMATH DE number 2080014 (Why is no real title available?)
| 2004-08-03 | Paper |
scientific article; zbMATH DE number 2013594 (Why is no real title available?)
| 2003-12-04 | Paper |
scientific article; zbMATH DE number 1693540 (Why is no real title available?)
| 2002-01-22 | Paper |
