Sophie Pinchinat

Publication Activity (10 Years)

Years Active: 1990-2024
Publications (10 Years): 34

Top Venues

CoRR

GraMSec@CSF

Inf. Comput.

IJCAI

Grenoble Institute of Technology, France (PHD)

Education History

Grenoble Institute of Technology, France

PHD

Publications

Thomas Brihaye, Sophie Pinchinat, Alexandre Terefenko
Semantics of Attack-Defense Trees for Dynamic Countermeasures and a New Hierarchy of Star-Free Languages. LATIN (2) (2024)
Thomas Brihaye, Sophie Pinchinat, Alexandre Terefenko
Sémantique Formelle à Deux Joueurs pour Arbres d'Attaque. CNIA (2023)
Thomas Brihaye, Sophie Pinchinat, Alexandre Terefenko
Semantics of Attack-Defense Trees for Dynamic Countermeasures and a New Hierarchy of Star-free Languages. CoRR (2023)
Côme Neyrand, Sophie Pinchinat
On the Role of Postconditions in Dynamic First-Order Epistemic Logic. CoRR (2022)
Sophie Pinchinat, Sasha Rubin, François Schwarzentruber
Formula Synthesis in Propositional Dynamic Logic with Shuffle. AAAI (2022)
Dylan Bellier, Sophie Pinchinat, François Schwarzentruber
Dependency Matrices for Multiplayer Strategic Dependencies. FSTTCS (2022)
Thomas Brihaye, Sophie Pinchinat, Alexandre Terefenko
Adversarial Formal Semantics of Attack Trees and Related Problems. GandALF (2022)
Johann Gamper, Sophie Pinchinat, Guido Sciavicco
Special Issue - Selected Papers from the 26th International Symposium on Temporal Representation and Reasoning. Inf. Comput. 280 (2021)
Raphaël Berthon, Nathanaël Fijalkow, Emmanuel Filiot, Shibashis Guha, Bastien Maubert, Aniello Murano, Laureline Pinault, Sophie Pinchinat, Sasha Rubin, Olivier Serre
Alternating Tree Automata with Qualitative Semantics. ACM Trans. Comput. Log. 22 (1) (2021)
Raphaël Berthon, Nathanaël Fijalkow, Emmanuel Filiot, Shibashis Guha, Bastien Maubert, Aniello Murano, Laureline Pinault, Sophie Pinchinat, Sasha Rubin, Olivier Serre
Alternating Tree Automata with Qualitative Semantics. CoRR (2020)
Sophie Pinchinat, François Schwarzentruber, Sébastien Lê Cong
Library-Based Attack Tree Synthesis. GraMSec@CSF (2020)
Thomas Bolander, Tristan Charrier, Sophie Pinchinat, François Schwarzentruber
DEL-based epistemic planning: Decidability and complexity. Artif. Intell. 287 (2020)
Bastien Maubert, Sophie Pinchinat, François Schwarzentruber, Silvia Stranieri
Concurrent Games in Dynamic Epistemic Logic. IJCAI (2020)
Bastien Maubert, Aniello Murano, Sophie Pinchinat, François Schwarzentruber, Silvia Stranieri
Dynamic Epistemic Logic Games with Epistemic Temporal Goals. ECAI (2020)
Bastien Maubert, Aniello Murano, Sophie Pinchinat, François Schwarzentruber, Silvia Stranieri
Dynamic Epistemic Logic Games with Epistemic Temporal Goals. CoRR (2020)
Tristan Charrier, Sophie Pinchinat, François Schwarzentruber
Symbolic model checking of public announcement protocols. J. Log. Comput. 29 (8) (2019)
Sophie Pinchinat, Barbara Fila, Florence Wacheux, Yann Thierry-Mieg
Attack Trees: A Notion of Missing Attacks. GraMSec@CSF (2019)
Abdallah Saffidine, Sébastien Lê Cong, Sophie Pinchinat, François Schwarzentruber
The Packed Interval Covering Problem is NP-complete. CoRR (2019)
Wojciech Widel, Maxime Audinot, Barbara Fila, Sophie Pinchinat
Beyond 2014: Formal Methods for Attack Tree-based Security Modeling. ACM Comput. Surv. 52 (4) (2019)
Bastien Maubert, Sophie Pinchinat, François Schwarzentruber
Reachability Games in Dynamic Epistemic Logic. CoRR (2019)
Bastien Maubert, Sophie Pinchinat, François Schwarzentruber
Reachability Games in Dynamic Epistemic Logic. IJCAI (2019)
Sophie Pinchinat
S. Demri, V. Goranko, M. Lange, Temporal Logics in Computer Science - Finite-State Systems - Cambridge University Press 2016, pp. 752. ISBN-10: 1107028361 (hardcover) £90.00; ISBN-13: 978-1107028364; online ISBN: 978-1139236119 (kindle) £85.50. Stud Logica 107 (5) (2019)
Maxime Audinot, Sophie Pinchinat, François Schwarzentruber, Florence Wacheux
Deciding the Non-emptiness of Attack Trees. GraMSec@FLoC (2018)
Gaëtan Douéneau-Tabot, Sophie Pinchinat, François Schwarzentruber
Chain-Monadic Second Order Logic over Regular Automatic Trees and Epistemic Planning Synthesis. Advances in Modal Logic (2018)
Maxime Audinot, Sophie Pinchinat, Barbara Kordy
Guided Design of Attack Trees: A System-Based Approach. CSF (2018)
Sébastien Lê Cong, Sophie Pinchinat, François Schwarzentruber
Small Undecidable Problems in Epistemic Planning. IJCAI (2018)
Catalin Dima, Bastien Maubert, Sophie Pinchinat
Relating Paths in Transition Systems: The Fall of the Modal Mu-Calculus. ACM Trans. Comput. Log. 19 (3) (2018)
Maxime Audinot, Sophie Pinchinat, Barbara Kordy
Is My Attack Tree Correct? ESORICS (1) (2017)
Tristan Charrier, Sophie Pinchinat, François Schwarzentruber
Model Checking Against Arbitrary Public Announcement Logic: A First-Order-Logic Prover Approach for the Existential Fragment. DALI@TABLEAUX (2017)
Maxime Audinot, Sophie Pinchinat, Barbara Kordy
Is my attack tree correct? Extended version. CoRR (2017)
Sophie Pinchinat, François Schwarzentruber
Preface. FLAP 4 (1) (2017)
Mohamadou Lamine Diouf, Sophie Pinchinat
Complexity of Opacity algorithm in data-centric workflow system [Complexité de l'algorithme de l'opacité dans les systèmes Workflows centrés sur les documents]. ARIMA J. 25 (2016)
Maxime Audinot, Sophie Pinchinat
On the Soundness of Attack Trees. GraMSec@CSF (2016)
Catalin Dima, Bastien Maubert, Sophie Pinchinat
Relating Paths in Transition Systems: the Fall of the Modal mu-Calculus. ICTCS (2016)
Sébastien Chédor, Christophe Morvan, Sophie Pinchinat, Hervé Marchand
Diagnosis and opacity problems for infinite state systems modeled by recursive tile systems. Discret. Event Dyn. Syst. 25 (1-2) (2015)
Laura Bozzelli, Bastien Maubert, Sophie Pinchinat
Unifying Hyper and Epistemic Temporal Logics. FoSSaCS (2015)
Sophie Pinchinat, Mathieu Acher, Didier Vojtisek
ATSyRa: An Integrated Environment for Synthesizing Attack Trees - (Tool Paper). GraMSec@CSF (2015)
Laura Bozzelli, Hans van Ditmarsch, Sophie Pinchinat
The complexity of one-agent refinement modal logic. Theor. Comput. Sci. 603 (2015)
John Christopher McCabe-Dansted, Tim French, Sophie Pinchinat, Mark Reynolds
Expressiveness and succinctness of a logic of robustness. J. Appl. Non Class. Logics 25 (3) (2015)
Guillaume Aucher, Bastien Maubert, Sophie Pinchinat, François Schwarzentruber
Games with Communication: From Belief to Preference Change. PRIMA (2015)
Catalin Dima, Bastien Maubert, Sophie Pinchinat
Relating Paths in Transition Systems: The Fall of the Modal Mu-Calculus. MFCS (1) (2015)
Laura Bozzelli, Bastien Maubert, Sophie Pinchinat
Uniform strategies, rational relations and jumping automata. Inf. Comput. 242 (2015)
Laura Bozzelli, Bastien Maubert, Sophie Pinchinat
Unifying Hyper and Epistemic Temporal Logic. CoRR (2014)
Catalin Dima, Bastien Maubert, Sophie Pinchinat
The Expressive Power of Epistemic $μ$-Calculus. CoRR (2014)
Sophie Pinchinat, Mathieu Acher, Didier Vojtisek
Towards Synthesis of Attack Trees for Supporting Computer-Aided Risk Analysis. SEFM Workshops (2014)
Guillaume Aucher, Bastien Maubert, Sophie Pinchinat
Automata Techniques for Epistemic Protocol Synthesis. SR (2014)
Bastien Maubert, Sophie Pinchinat
A General Notion of Uniform Strategies. IGTR 16 (1) (2014)
Laura Bozzelli, Hans van Ditmarsch, Tim French, James Hales, Sophie Pinchinat
Refinement modal logic. Inf. Comput. 239 (2014)
Laura Bozzelli, Sophie Pinchinat
Verification of gap-order constraint abstractions of counter systems. Theor. Comput. Sci. 523 (2014)
Laura Bozzelli, Hans van Ditmarsch, Sophie Pinchinat
The Complexity of One-Agent Refinement Modal Logic. IJCAI (2013)
Nathanaël Fijalkow, Sophie Pinchinat, Olivier Serre
Emptiness Of Alternating Tree Automata Using Games With Imperfect Information. FSTTCS (2013)
Bastien Maubert, Sophie Pinchinat
Jumping Automata for Uniform Strategies. FSTTCS (2013)
Bastien Maubert, Sophie Pinchinat, Laura Bozzelli
The Complexity of Synthesizing Uniform Strategies SR (2013)
John Christopher McCabe-Dansted, Tim French, Mark Reynolds, Sophie Pinchinat
Specifying Robustness. CoRR (2013)
Alessio Lomuscio, Sophie Pinchinat, Holger Schlingloff
VaToMAS - Verification and Testing of Multi-Agent Systems (Dagstuhl Seminar 13181). Dagstuhl Reports 3 (4) (2013)
Laura Bozzelli, Hans van Ditmarsch, Sophie Pinchinat
The Complexity of One-Agent Refinement Modal Logic. JELIA (2012)
Nathalie Bertrand, Axel Legay, Sophie Pinchinat, Jean-Baptiste Raclet
Modal event-clock specifications for timed component-based design. Sci. Comput. Program. 77 (12) (2012)
Bastien Maubert, Sophie Pinchinat
Uniform Strategies CoRR (2012)
Sébastien Chédor, Christophe Morvan, Sophie Pinchinat, Hervé Marchand
Analysis of partially observed recursive tile systems. WODES (2012)
Laura Bozzelli, Axel Legay, Sophie Pinchinat
On timed alternating simulation for concurrent timed games. Acta Informatica 49 (4) (2012)
Laura Bozzelli, Sophie Pinchinat
Verification of Gap-Order Constraint Abstractions of Counter Systems. VMCAI (2012)
Laura Bozzelli, Hans van Ditmarsch, Tim French, James Hales, Sophie Pinchinat
Refinement Modal Logic CoRR (2012)
Laura Bozzelli, Axel Legay, Sophie Pinchinat
Hardness of preorder checking for basic formalisms. Theor. Comput. Sci. 412 (49) (2011)
Bastien Maubert, Sophie Pinchinat, Laura Bozzelli
Opacity Issues in Games with Imperfect Information GandALF (2011)
Laura Bozzelli, Axel Legay, Sophie Pinchinat
Hardness of Preorder Checking for Basic Formalisms. LPAR (Dakar) (2010)
Hans van Ditmarsch, Tim French, Sophie Pinchinat
Future Event Logic - Axioms and Complexity. Advances in Modal Logic (2010)
Christophe Morvan, Sophie Pinchinat
Diagnosability of Pushdown Systems. Haifa Verification Conference (2009)
Bastien Maubert, Sophie Pinchinat
Games with Opacity Condition. RP (2009)
John Christopher McCabe-Dansted, Tim French, Mark Reynolds, Sophie Pinchinat
On the Expressivity of RoCTL*. TIME (2009)
Laura Bozzelli, Axel Legay, Sophie Pinchinat
On Timed Alternating Simulation for Concurrent Timed Games. FSTTCS (2009)
Nathalie Bertrand, Sophie Pinchinat, Jean-Baptiste Raclet
Refinement and Consistency of Timed Modal Specifications. LATA (2009)
Nathalie Bertrand, Axel Legay, Sophie Pinchinat, Jean-Baptiste Raclet
A Compositional Approach on Modal Specifications for Timed Systems. ICFEM (2009)
Andreas Bauer, Sophie Pinchinat
-Languages: A Topological Perspective. Discret. Event Dyn. Syst. 19 (4) (2009)
Dietmar Berwanger, Sophie Pinchinat
Game Quantification Patterns. ICLA (2009)
Guillaume Feuillade, Sophie Pinchinat
Modal Specifications for the Control Theory of Discrete Event Systems. Discret. Event Dyn. Syst. 17 (2) (2007)
Sophie Pinchinat
A Generic Constructive Solution for Concurrent Games with Expressive Constraints on Strategies. ATVA (2007)
Sophie Pinchinat, Stéphane Riedweg
A decidable class of problems for control under partial observation. Inf. Process. Lett. 95 (4) (2005)
Sophie Pinchinat, Stéphane Riedweg
You can always compute maximally permissive controllers under partial observation when they exist. ACC (2005)
Sophie Pinchinat, Stéphane Riedweg
On the Architectures in Decentralized Supervisory Control. CDC/ECC (2005)
Stéphane Riedweg, Sophie Pinchinat
Quantified Mu-Calculus for Control Synthesis. MFCS (2003)
Mirabelle Nebut, Sophie Pinchinat
A Decidable Clock Language for Synchronous Specifications. Electron. Notes Theor. Comput. Sci. 65 (5) (2002)
Hervé Marchand, Sophie Pinchinat
Supervisory control problem using symbolic bisimulation techniques. ACC (2000)
Olga Kushnarenko, Sophie Pinchinat
Intensional Approaches for Symbolic Methods. Electron. Notes Theor. Comput. Sci. 18 (1998)
Sophie Pinchinat, Éric Rutten, R. K. Shyamasundar
Taxonomy and Expressiveness of Preemption: A Syntactic Approach. ASIAN (1998)
Sophie Pinchinat, Éric Rutten, R. K. Shyamasundar
Preemption Primitives in Reactive Languages (A Preliminary Report). ASIAN (1995)
François Laroussinie, Sophie Pinchinat, Philippe Schnoebelen
Translations Between Modal Logics of Reactive Systems. Theor. Comput. Sci. 140 (1) (1995)
François Laroussinie, Sophie Pinchinat, Philippe Schnoebelen
Translation Results for Modal Logics of Reactive Systems. AMAST (1993)
Sophie Pinchinat
Ordinal Processes in Comparative Concurrency Semantics. CSL (1991)
Philippe Schnoebelen, Sophie Pinchinat
On the Weak Adequacy of Branching-Time Remporal Logic. ESOP (1990)

Sophie Pinchinat.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Sophie Pinchinat