Josée Desharnais

Orcid: 0000-0003-2410-3314

Affiliations:
  • Laval University, Québec City, Canada


According to our database1, Josée Desharnais authored at least 42 papers between 1997 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
A cop-winning strategy on strongly cop-win graphs.
Discret. Math., August, 2023

Unsupervised User-Based Insider Threat Detection Using Bayesian Gaussian Mixture Models.
Proceedings of the 20th Annual International Conference on Privacy, Security and Trust, 2023

2021
General Cops and Robbers games with randomness.
Theor. Comput. Sci., 2021

2020
Implicit Variational Inference: the Parameter and the Predictor Space.
CoRR, 2020

Toward Semantic-Based Android Malware Detection Using Model Checking and Machine Learning.
Proceedings of the Risks and Security of Internet and Systems, 2020

2019
Finite Approximation of LMPs for Exact Verification of Reachability Properties.
Proceedings of the Quantitative Evaluation of Systems, 16th International Conference, 2019

Beyond Labels: Permissiveness for Dynamic Information Flow Enforcement.
Proceedings of the 32nd IEEE Computer Security Foundations Symposium, 2019

2017
A progress-sensitive flow-sensitive inlined information-flow control monitor (extended version).
Comput. Secur., 2017

2016
A Progress-Sensitive Flow-Sensitive Inlined Information-Flow Control Monitor.
Proceedings of the ICT Systems Security and Privacy Protection, 2016

Andrana: Quick and Accurate Malware Detection for Android.
Proceedings of the Foundations and Practice of Security - 9th International Symposium, 2016

2015
Bounding an Optimal Search Path with a Game of Cop and Robber on Graphs.
Proceedings of the Principles and Practice of Constraint Programming, 2015

2014
Laudatio for Prakash Panangaden.
Proceedings of the Horizons of the Mind. A Tribute to Prakash Panangaden, 2014

2013
Testing probabilistic equivalence through Reinforcement Learning.
Inf. Comput., 2013

Enforcing Information Flow by Combining Static and Dynamic Analysis.
Proceedings of the Foundations and Practice of Security - 6th International Symposium, 2013

2012
Enforcing Information Flow Policies by a Three-Valued Analysis.
Proceedings of the Computer Network Security, 2012

2011
A logical duality for underspecified probabilistic systems.
Inf. Comput., 2011

Computing Distances between Probabilistic Automata
Proceedings of the Proceedings Ninth Workshop on Quantitative Aspects of Programming Languages, 2011

Analysis of Non-Linear Probabilistic Hybrid Systems
Proceedings of the Proceedings Ninth Workshop on Quantitative Aspects of Programming Languages, 2011

2010
Weak bisimulation is sound and complete for pCTL<sup>*</sup>.
Inf. Comput., 2010

Continuous Time and/or Continuous Distributions.
Proceedings of the Computer Performance Engineering, 2010

2009
Learning the Difference between Partially Observable Dynamical Systems.
Proceedings of the Machine Learning and Knowledge Discovery in Databases, 2009

A Demonic Approach to Information in Probabilistic Systems.
Proceedings of the CONCUR 2009 - Concurrency Theory, 20th International Conference, 2009

2008
Approximate Analysis of Probabilistic Processes: Logic, Simulation and Games.
Proceedings of the Fifth International Conference on the Quantitative Evaluaiton of Systems (QEST 2008), 2008

2006
Bisimulation and cocongruence for probabilistic systems.
Inf. Comput., 2006

Trace Equivalence Characterization Through Reinforcement Learning.
Proceedings of the Advances in Artificial Intelligence, 2006

2005
Static Analysis of Programs Using Omega Algebra with Tests.
Proceedings of the Relational Methods in Computer Science, 2005

2004
Metrics for labelled Markov processes.
Theor. Comput. Sci., 2004

2003
Continuous stochastic logic characterizes bisimulation of continuous-time Markov processes.
J. Log. Algebraic Methods Program., 2003

Approximating labelled Markov processes.
Inf. Comput., 2003

Preface.
Proceedings of the Workshop on Domain Theoretic Methods for Probabilistic Processes, 2003

Labelled Markov Processes: Stronger and Faster Approximations.
Proceedings of the Workshop on Domain Theoretic Methods for Probabilistic Processes, 2003

Labelled Markov Processes: Stronger and Faster Approximations.
Proceedings of the 18th IEEE Symposium on Logic in Computer Science (LICS 2003), 2003

A Fixpoint Logic for Labeled Markov Processes.
Proceedings of the FICS '03, 2003

Conditional Expectation and the Approximation of Labelled Markov Processes.
Proceedings of the CONCUR 2003, 2003

2002
Bisimulation for Labelled Markov Processes.
Inf. Comput., 2002

The Metric Analogue of Weak Bisimulation for Probabilistic Processes.
Proceedings of the 17th IEEE Symposium on Logic in Computer Science (LICS 2002), 2002

Secure Self-certified Code for Java.
Proceedings of the Formal Aspects of Security, First International Conference, 2002

Weak Bisimulation is Sound and Complete for PCTL*.
Proceedings of the CONCUR 2002, 2002

2000
Approximating Labeled Markov Processes.
Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science, 2000

1999
Metrics for Labeled Markov Systems.
Proceedings of the CONCUR '99: Concurrency Theory, 1999

1998
A Logical Characterization of Bisimulation for Labeled Markov Processes.
Proceedings of the Thirteenth Annual IEEE Symposium on Logic in Computer Science, 1998

1997
Bisimulation for Labelled Markov Processes.
Proceedings of the Proceedings, 12th Annual IEEE Symposium on Logic in Computer Science, Warsaw, Poland, June 29, 1997


  Loading...