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