Olga Kouchnarenko

Affiliations:
  • Université de Franche-Comté, Besançon, France


According to our database1, Olga Kouchnarenko authored at least 71 papers between 1996 and 2021.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2021
Automated Generation of Initial Configurations for Testing Component Systems.
Proceedings of the Formal Aspects of Component Software - 17th International Conference, 2021

2020
Testing adaptation policies for software components.
Softw. Qual. J., 2020

2019
Selected and extended papers from FACS 2016.
Sci. Comput. Program., 2019

2018
Assessing SMT and CLP approaches for workflow nets verification.
Int. J. Softw. Tools Technol. Transf., 2018

Test Generation from Event System Abstractions to Cover Their States and Transitions.
Program. Comput. Softw., 2018

Opacity for linear constraint Markov chains.
Discret. Event Dyn. Syst., 2018

Under-Approximation Generation Driven by Relevance Predicates and Variants.
Proceedings of the Tests and Proofs - 12th International Conference, 2018

An Approximation-Based Approach for the Random Exploration of Large Models.
Proceedings of the Tests and Proofs - 12th International Conference, 2018

2017
The emptiness problem for tree automata with at least one global disequality constraint is NP-hard.
Inf. Process. Lett., 2017

Component-Based Systems Reconfigurations Using Graph Transformations with GROOVE.
Autom. Control. Comput. Sci., 2017

Reduction of Workflow Nets for Generalised Soundness Verification.
Proceedings of the Verification, Model Checking, and Abstract Interpretation, 2017

Two under-approximation techniques for 3-modal abstraction coverage of event systems: Joint effort?
Proceedings of the 11th International Symposium on Theoretical Aspects of Software Engineering, 2017

Approximating Event System Abstractions by Covering Their States and Transitions.
Proceedings of the Perspectives of System Informatics, 2017

2016
Preserving opacity on Interval Markov Chains under simulation.
Proceedings of the 13th International Workshop on Discrete Event Systems, 2016

Workflow Nets Verification: SMT or CLP?
Proceedings of the Critical Systems: Formal Methods and Automated Verification, 2016

2015
A rule-based system for automatic decidability and combinability.
Sci. Comput. Program., 2015

Probabilistic Opacity in Refinement-Based Modeling.
CoRR, 2015

Practical Analysis Framework for Component Systems with Dynamic Reconfigurations.
Proceedings of the Formal Methods and Software Engineering, 2015

Constraint Solving for Verifying Modal Specifications of Workflow Nets with Data.
Proceedings of the Perspectives of System Informatics, 2015

2014
A random testing approach using pushdown automata.
Softw. Test. Verification Reliab., 2014

Component Substitution through Dynamic Reconfigurations.
Proceedings of the Proceedings 11th International Workshop on Formal Engineering approaches to Software Components and Architectures, 2014

The Emptiness Problem for Tree Automata with at Least One Disequality Constraint is NP-hard.
CoRR, 2014

Verifying Modal Workflow Specifications Using Constraint Solving.
Proceedings of the Integrated Formal Methods - 11th International Conference, 2014

Decentralised Evaluation of Temporal Patterns over Component-Based Systems at Runtime.
Proceedings of the Formal Aspects of Component Software - 11th International Symposium, 2014

2013
Enhancing Approximations for Regular Reachability Analysis.
Proceedings of the Implementation and Application of Automata, 2013

Automatic Decidability: A Schematic Calculus for Theories with Counting Operators.
Proceedings of the 24th International Conference on Rewriting Techniques and Applications, 2013

Random Grammar-Based Testing for Covering All Non-terminals.
Proceedings of the Sixth IEEE International Conference on Software Testing, 2013

Adapting Component-Based Systems at Runtime via Policies with Temporal Patterns.
Proceedings of the Formal Aspects of Component Software - 10th International Symposium, 2013

2012
Loops and overloops for Tree-Walking Automata.
Theor. Comput. Sci., 2012

A Rule-Based Framework for Building Superposition-Based Decision Procedures.
Proceedings of the Rewriting Logic and Its Applications - 9th International Workshop, 2012

On Positive TAGED with a Bounded Number of Constraints.
Proceedings of the Implementation and Application of Automata, 2012

Relaxing B Sharing Restrictions within CSP||B.
Proceedings of the Software Composition - 11th International Conference, 2012

When Structural Refinement of Components Keeps Temporal Properties over Reconfigurations.
Proceedings of the FM 2012: Formal Methods, 2012

From Linear Temporal Logic Properties to Rewrite Propositions.
Proceedings of the Automated Reasoning - 6th International Joint Conference, 2012

2011
Combining Proof and Model-checking to Validate Reconfigurable Architectures.
Electron. Notes Theor. Comput. Sci., 2011

Runtime Verification of Temporal Patterns for Dynamic Reconfigurations of Components.
Proceedings of the Formal Aspects of Component Software - 8th International Symposium, 2011

2010
Component simulation-based substitutivity managing QoS and composition issues.
Sci. Comput. Program., 2010

Component Simulation-based Substitutivity Managing QoS Aspects.
Electron. Notes Theor. Comput. Sci., 2010

Composition of Services with Constraints.
Electron. Notes Theor. Comput. Sci., 2010

Specifying generic Java programs: two case studies.
Proceedings of the of the Tenth Workshop on Language Descriptions, Tools and Applications, 2010

SAT Solvers for Queries over Tree Automata with Constraints.
Proceedings of the Third International Conference on Software Testing, 2010

Using Temporal Logic for Dynamic Reconfigurations of Components.
Proceedings of the Formal Aspects of Component Software - 7th International Workshop, 2010

Event-based adaptation policies for Fractal components.
Proceedings of the 8th ACS/IEEE International Conference on Computer Systems and Applications, 2010

2009
Handling Non Left-Linear Rules when Completing Tree Automata.
Int. J. Found. Comput. Sci., 2009

Tree Automata for Detecting Attacks on Protocols with Algebraic Cryptographic Primitives.
Proceedings of the Joint Proceedings of the 8th, 2009

TAGED Approximations for Temporal Properties Model-Checking.
Proceedings of the Implementation and Application of Automata, 2009

How to Tackle Integer Weighted Automata Positivity.
Proceedings of the Reachability Problems, 3rd International Workshop, 2009

2008
Approximation-based Tree Regular Model-Checking.
Nord. J. Comput., 2008

Verification of class liveness properties with java modelling language.
IET Softw., 2008

Handling Left-Quadratic Rules When Completing Tree Automata.
Electron. Notes Theor. Comput. Sci., 2008

Finer Is Better: Abstraction Refinement for Rewriting Approximations.
Proceedings of the Rewriting Techniques and Applications, 19th International Conference, 2008

Using CSP||B Components: Application to a Platoon of Vehicles.
Proceedings of the Formal Methods for Industrial Critical Systems, 2008

Towards Validating a Platoon of Cristal Vehicles Using CSP||B.
Proceedings of the Algebraic Methodology and Software Technology, 2008

2007
How to Handle QoS Aspects in Web Services Substitutivity Verification.
Proceedings of the 16th IEEE International Workshops on Enabling Technologies: Infrastructures for Collaborative Enterprises (WETICE 2007), 2007

2006
JML-based verification of liveness properties on a class in isolation.
Proceedings of the 2006 Conference on Specification and Verification of Component-Based Systems, 2006

Handling Algebraic Properties in Automatic Analysis of Security Protocols.
Proceedings of the Theoretical Aspects of Computing, 2006

How to Verify and Exploit a Refinement of Component-Based Systems.
Proceedings of the Perspectives of Systems Informatics, 2006

2005
The AVISPA Tool for the Automated Validation of Internet Security Protocols and Applications.
Proceedings of the Computer Aided Verification, 17th International Conference, 2005

2004
Verifying Invariants of Component-Based Systems through Refinement.
Proceedings of the Algebraic Methodology and Software Technology, 2004

2003
Refinement Preserves PLTL Properties.
Proceedings of the ZB 2003: Formal Specification and Development in Z and B, 2003

How to Compute the Refinement Relation for Parameterized Systems.
Proceedings of the 1st ACM & IEEE International Conference on Formal Methods and Models for Co-Design (MEMOCODE 2003), 2003

Refinement and Verification of Synchronized Component-Based Systems.
Proceedings of the FME 2003: Formal Methods, 2003

2002
Raffiner pour vérifier des systèmes paramétrés.
Tech. Sci. Informatiques, 2002

Synchronized Parallel Composition of Event Systems in B.
Proceedings of the ZB 2002: Formal Specification and Development in Z and B, 2002

Automatic Approximation for the Verification of Cryptographic Protocols.
Proceedings of the Formal Aspects of Security, First International Conference, 2002

2001
Reformulation: A Way to Combine Dynamic Properties and B Refinement.
Proceedings of the FME 2001: Formal Methods for Increasing Software Productivity, 2001

2000
Reformulate Dynamic Properties during B Refinement and Forget Variants and Loop Invariants.
Proceedings of the ZB 2000: Formal Specification and Development in Z and B, First International Conference of B and Z Users, York, UK, August 29, 2000

Ready-Simulation Is Not Ready to Express a Modular Refinement Relation.
Proceedings of the Fundamental Approaches to Software Engineering, 2000

1997
Sémantique des programmes récursifs-parallèles et méthodes pour leur analyse. (Semantics of recursive-parallel programs and methods for their analysis).
PhD thesis, 1997

A Formal Framework for the Analysis of Recursive-Parallel Programs.
Proceedings of the Parallel Computing Technologies, 1997

1996
A model for recursive-parallel programs.
Proceedings of the First International Workshop on Verification of Infinite State Systems, 1996


  Loading...