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
-
Quentin Guilmant, Engel Lefaucheux, Joël Ouaknine, James Worrell. The 2-Dimensional Constraint Loop Problem Is Decidable. 51st International Colloquium on Automata, Languages, and Programming (ICALP 2024), Tallinn University of Technology, Jul 2024, Tallin, Estonia. pp.21, ⟨10.4230/LIPIcs.ICALP.2024.140⟩. ⟨hal-04644417⟩
-
Małgorzata Biernacka, Dariusz Biernacki, Sergueï Lenglet, Alan Schmitt. Optimizing a Non-Deterministic Abstract Machine with Environments. FSCD 2024 - 9th International Conference on Formal Structures for Computation and Deduction, Jul 2024, Tallinn, Estonia. pp.1-22, ⟨10.4230/LIPIcs.FSCD.2024.11⟩. ⟨hal-04643294⟩
Nombre de documents fulltext
1 258
Répartition des dépôts par type de document
Mots Clés
Logarithms
TLA+
Réécriture
Vérification
Unification
Protocol
Formal Verification
Edward Sang
Protocols
Social networks
Parameter synthesis
Security protocols
Privacy
Sécurité
Static analysis
Temporal logic
Term rewriting
Equational theories
E-voting
SMT
Narrowing
Formal Methods
Timed automata
Obfuscation
Automated deduction
Complexity
Automatic theorem provers
Refinement
Security
Cryptographic protocols
Validation
Modelling
Abstraction
Méthodes formelles
Synchronization
Model checking
Distributed systems
Intrusion detection
Tree automata
Algorithmic randomness
Protocoles cryptographiques
Cryptography
Parametric timed automata
Combination of decision procedures
Event-B
Protocoles
Secrecy
Distributed algorithms
Process calculi
Cellular automata
Combination
Collaborative editors
Computability
Proof assistants
Automated verification
Symbolic animation
Raffinement
Composition
Decidability
Behavioral detection
Rewriting
Superposition
Formal method
Coq
Theorem proving
Algorithm
Web services
Implicit computational complexity
Computable analysis
Termination
Model-checking
Tilings
Reachability
Malware
IMITATOR
Operational transformation
Optimistic replication
Decision procedures
Completeness
Proof-based development
Applied π-Calculus
Abstract machines
Calculating machine
Formal verification
Decision procedure
Separation logic
Symbolic model
Simulation
Semantics
Authentication
Formal methods
Sines
Automated reasoning
Verification
Satisfiability Modulo Theories
First-order logic
Satisfiability
Liveness
Schwilgué
Constraint solving