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
Higher-order logic
Validation
Secrecy
Malware
Méthodes formelles
Liveness
Privacy
Vérification
Narrowing
Separation logic
Combination of decision procedures
Semantics
Formal Methods
Web services
Simulation
Security protocols
Formal methods
Optimistic replication
Symbolic model
Behavioral detection
Cryptography
TLA+
Decision procedures
Term rewriting
Formal verification
Collaborative editors
Decision procedure
Verification
Automated reasoning
Process calculi
Equational theories
Timed automata
Intrusion detection
Réécriture
Tilings
Operational transformation
Abstract machines
E-voting
Symbolic animation
Refinement
Applied π-Calculus
Algorithmic randomness
Schwilgué
Automated deduction
Cellular automata
Superposition
Logarithms
Formal Verification
Raffinement
IMITATOR
Edward Sang
Termination
Automated verification
Satisfiability
Completeness
Temporal logic
Event-B
Parametric timed automata
Proof-based development
Social networks
Algorithm
Theorem proving
Protocoles
Obfuscation
Model-checking
Sécurité
Security
Formal method
Authentication
Combination
Protocols
Proof assistants
Satisfiability Modulo Theories
Protocol
Modelling
Protocoles cryptographiques
Cryptographic protocols
Complexity
Rewriting
First-order logic
Implicit computational complexity
Static analysis
Abstraction
Calculating machine
Reachability
Model checking
Composition
Sines
Tree automata
SMT
Automatic theorem provers
Computability
Computable analysis
Coq
Synchronization
Unification
Parameter synthesis
Distributed algorithms
Decidability
Distributed systems