Loading...
Sous-collection du département 2 : Méthodes formelles
Pour toute question ou remarque au sujet de cette collection, veuillez nous contacter à publications@loria.fr
Derniers Dépôts
-
Emmanuel Hainry, Bruce M Kapron, Jean-Yves Marion, Romain Péchoux. Complete and tractable machine-independent characterizations of second-order polytime. FoSSaCS 2022 - 25th International Conference on Foundations of Software Science and Computation Structures, Apr 2022, Munich, Germany. pp.368-388, ⟨10.1007/978-3-030-99253-8_19⟩. ⟨hal-03722245v3⟩
-
Saraid Dwyer Satterfield, Serdar Erbatur, Andrew M. Marshall, Christophe Ringeissen. Knowledge Problems in Security Protocols: Going Beyond Subterm Convergent Theories. 8th International Conference on Formal Structures for Computation and Deduction (FSCD 2023), Jul 2023, Rome, Italy. pp.30:1--30:19, ⟨10.4230/LIPIcs.FSCD.2023.30⟩. ⟨hal-04214220⟩
Nombre de documents fulltext
1 240
Répartition des dépôts par type de document
Mots Clés
Automated deduction
Cryptography
Implicit computational complexity
Model-checking
Distributed systems
Rewriting
TLA+
Refinement
Combination of decision procedures
Coq
Intrusion detection
Schwilgué
Automatic theorem provers
Computable analysis
Modelling
Superposition
Abstract machines
Formal methods
Secrecy
Decision procedure
IMITATOR
Algorithmic randomness
E-voting
Termination
Symbolic model
Composition
Distributed algorithms
Behavioral detection
Proof-based development
Synchronization
Formal Methods
Formal Verification
Unification
Event-B
Logarithms
Vérification
Applied π-Calculus
Process calculi
Optimistic replication
Calculating machine
Tilings
Réécriture
Security
Formal verification
SMT
Protocoles
Narrowing
Sécurité
Timed automata
Tree automata
Decidability
First-order logic
Abstraction
Symbolic animation
Decision procedures
Simulation
Theorem proving
Security protocols
Semantics
Higher-order logic
Computability
Privacy
Sines
Static analysis
Temporal logic
Formal method
Model checking
Edward Sang
Proof assistants
Cellular automata
Separation logic
Web services
Satisfiability
Parametric timed automata
Completeness
Complexity
Social networks
Operational transformation
Cryptographic protocols
Méthodes formelles
Term rewriting
Parameter synthesis
Constraint solving
Algorithm
Collaborative editors
Satisfiability Modulo Theories
Protocol
Validation
Protocols
Authentication
Automated verification
Automated reasoning
Obfuscation
Reachability
Malware
Raffinement
Combination
Protocoles cryptographiques
Verification
Equational theories