207 results on '"Pinchinat, Sophie"'
Search Results
2. Semantics of Attack-Defense Trees for Dynamic Countermeasures and a New Hierarchy of Star-Free Languages
3. Adversarial Formal Semantics of Attack Trees and Related Problems
4. On the Role of Postconditions in Dynamic First-Order Epistemic Logic
5. Alternating Tree Automata with Qualitative Semantics
6. Dynamic Epistemic Logic Games with Epistemic Temporal Goals
7. The Packed Interval Covering Problem is NP-complete
8. Reachability Games in Dynamic Epistemic Logic
9. Is my attack tree correct? Extended version
10. Library-Based Attack Tree Synthesis
11. DEL-based epistemic planning: Decidability and complexity
12. Attack Trees: A Notion of Missing Attacks
13. Deciding the Non-emptiness of Attack Trees
14. Unifying Hyper and Epistemic Temporal Logic
15. The Expressive Power of Epistemic $\mu$-Calculus
16. Automata Techniques for Epistemic Protocol Synthesis
17. Specifying Robustness
18. The Complexity of Synthesizing Uniform Strategies
19. 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
20. Model Checking Against Arbitrary Public Announcement Logic: A First-Order-Logic Prover Approach for the Existential Fragment
21. Uniform Strategies
22. Refinement Modal Logic
23. Opacity Issues in Games with Imperfect Information
24. Strategic Reasoning under Imperfect Information - The Case of Synchronous Recall
25. Library-Based Attack Tree Synthesis
26. Is My Attack Tree Correct?
27. Sémantique Formelle à Deux Joueurs pour Arbres d'Attaque
28. ATSyRa: An Integrated Environment for Synthesizing Attack Trees : (Tool Paper)
29. On the Soundness of Attack Trees
30. Deciding the Non-emptiness of Attack Trees
31. Attack Trees: A Notion of Missing Attacks
32. Relating Paths in Transition Systems: The Fall of the Modal Mu-Calculus
33. Unifying Hyper and Epistemic Temporal Logics
34. Games with Communication: From Belief to Preference Change
35. Towards Synthesis of Attack Trees for Supporting Computer-Aided Risk Analysis
36. Formula Synthesis in Propositional Dynamic Logic with Shuffle
37. The complexity of one-agent refinement modal logic
38. Uniform strategies, rational relations and jumping automata
39. Dependency Matrices for Multiplayer Strategic Dependencies
40. Refinement modal logic
41. The Complexity of One-Agent Refinement Modal Logic
42. Verification of Gap-Order Constraint Abstractions of Counter Systems
43. Diagnosability of Pushdown Systems
44. Adversarial Formal Semantics of Attack Trees and Related Problems
45. Hardness of Preorder Checking for Basic Formalisms
46. Verification of gap-order constraint abstractions of counter systems
47. A Compositional Approach on Modal Specifications for Timed Systems
48. Games with Opacity Condition
49. Refinement and Consistency of Timed Modal Specifications
50. Game Quantification Patterns
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.