Sophie Pinchinat

According to our database1, Sophie Pinchinat
  • authored at least 57 papers between 1990 and 2017.
  • has a "Dijkstra number"2 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2017
Is my attack tree correct? Extended version.
CoRR, 2017

Is My Attack Tree Correct?
Proceedings of the Computer Security - ESORICS 2017, 2017

2016
Relating Paths in Transition Systems: the Fall of the Modal mu-Calculus.
Proceedings of the 17th Italian Conference on Theoretical Computer Science, 2016

On the Soundness of Attack Trees.
Proceedings of the Graphical Models for Security - Third International Workshop, 2016

2015
The complexity of one-agent refinement modal logic.
Theor. Comput. Sci., 2015

Expressiveness and succinctness of a logic of robustness.
Journal of Applied Non-Classical Logics, 2015

Uniform strategies, rational relations and jumping automata.
Inf. Comput., 2015

Diagnosis and opacity problems for infinite state systems modeled by recursive tile systems.
Discrete Event Dynamic Systems, 2015

Games with Communication: From Belief to Preference Change.
Proceedings of the PRIMA 2015: Principles and Practice of Multi-Agent Systems, 2015

Relating Paths in Transition Systems: The Fall of the Modal Mu-Calculus.
Proceedings of the Mathematical Foundations of Computer Science 2015, 2015

Unifying Hyper and Epistemic Temporal Logics.
Proceedings of the Foundations of Software Science and Computation Structures, 2015

ATSyRa: An Integrated Environment for Synthesizing Attack Trees - (Tool Paper).
Proceedings of the Graphical Models for Security - Second International Workshop, 2015

2014
Verification of gap-order constraint abstractions of counter systems.
Theor. Comput. Sci., 2014

A General Notion of Uniform Strategies.
IGTR, 2014

Refinement modal logic.
Inf. Comput., 2014

The Expressive Power of Epistemic $μ$-Calculus.
CoRR, 2014

Unifying Hyper and Epistemic Temporal Logic.
CoRR, 2014

Automata Techniques for Epistemic Protocol Synthesis.
Proceedings of the Proceedings 2nd International Workshop on Strategic Reasoning, 2014

Towards Synthesis of Attack Trees for Supporting Computer-Aided Risk Analysis.
Proceedings of the Software Engineering and Formal Methods, 2014

2013
VaToMAS - Verification and Testing of Multi-Agent Systems (Dagstuhl Seminar 13181).
Dagstuhl Reports, 2013

The Complexity of Synthesizing Uniform Strategies
Proceedings of the Proceedings 1st International Workshop on Strategic Reasoning, 2013

Specifying Robustness.
CoRR, 2013

The Complexity of One-Agent Refinement Modal Logic.
Proceedings of the IJCAI 2013, 2013

Jumping Automata for Uniform Strategies.
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2013

Emptiness Of Alternating Tree Automata Using Games With Imperfect Information.
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2013

2012
Modal event-clock specifications for timed component-based design.
Sci. Comput. Program., 2012

Uniform Strategies
CoRR, 2012

Refinement Modal Logic
CoRR, 2012

On timed alternating simulation for concurrent timed games.
Acta Inf., 2012

Analysis of partially observed recursive tile systems.
Proceedings of the 11th International Workshop on Discrete Event Systems, 2012

Verification of Gap-Order Constraint Abstractions of Counter Systems.
Proceedings of the Verification, Model Checking, and Abstract Interpretation, 2012

The Complexity of One-Agent Refinement Modal Logic.
Proceedings of the Logics in Artificial Intelligence - 13th European Conference, 2012

2011
Hardness of preorder checking for basic formalisms.
Theor. Comput. Sci., 2011

Opacity Issues in Games with Imperfect Information
Proceedings of Second International Symposium on Games, 2011

2010
Hardness of Preorder Checking for Basic Formalisms.
Proceedings of the Logic for Programming, Artificial Intelligence, and Reasoning, 2010

Future Event Logic - Axioms and Complexity.
Proceedings of the Advances in Modal Logic 8, 2010

2009
Prognosis of omega-Languages for the Diagnosis of *-Languages: A Topological Perspective.
Discrete Event Dynamic Systems, 2009

On the Expressivity of RoCTL*.
Proceedings of the TIME 2009, 2009

Games with Opacity Condition.
Proceedings of the Reachability Problems, 3rd International Workshop, 2009

Refinement and Consistency of Timed Modal Specifications.
Proceedings of the Language and Automata Theory and Applications, 2009

Game Quantification Patterns.
Proceedings of the Logic and Its Applications, Third Indian Conference, 2009

A Compositional Approach on Modal Specifications for Timed Systems.
Proceedings of the Formal Methods and Software Engineering, 2009

Diagnosability of Pushdown Systems.
Proceedings of the Hardware and Software: Verification and Testing, 2009

On Timed Alternating Simulation for Concurrent Timed Games.
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2009

2007
Modal Specifications for the Control Theory of Discrete Event Systems.
Discrete Event Dynamic Systems, 2007

A Generic Constructive Solution for Concurrent Games with Expressive Constraints on Strategies.
Proceedings of the Automated Technology for Verification and Analysis, 2007

2005
A decidable class of problems for control under partial observation.
Inf. Process. Lett., 2005

2003
Quantified Mu-Calculus for Control Synthesis.
Proceedings of the Mathematical Foundations of Computer Science 2003, 2003

2002
A Decidable Clock Language for Synchronous Specifications.
Electr. Notes Theor. Comput. Sci., 2002

1998
Intensional Approaches for Symbolic Methods.
Electr. Notes Theor. Comput. Sci., 1998

Taxonomy and Expressiveness of Preemption: A Syntactic Approach.
Proceedings of the Advances in Computing Science, 1998

1995
Translations Between Modal Logics of Reactive Systems.
Theor. Comput. Sci., 1995

Preemption Primitives in Reactive Languages (A Preliminary Report).
Proceedings of the Algorithms, 1995

1993
Des bisimulations pour la sémantique des systèmes réactifs. (Bisimulations for the semantics of reactive systems).
PhD thesis, 1993

Translation Results for Modal Logics of Reactive Systems.
Proceedings of the Algebraic Methodology and Software Technology (AMAST '93), 1993

1991
Ordinal Processes in Comparative Concurrency Semantics.
Proceedings of the Computer Science Logic, 5th Workshop, 1991

1990
On the Weak Adequacy of Branching-Time Remporal Logic.
Proceedings of the ESOP'90, 1990


  Loading...