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