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⟩
-
-
-
Kostia Chardonnet, Louis Lemonnier, Benoît Valiron. Semantics for a Turing-Complete Reversible Programming Language with Inductive Types. FSCD 2024 - 9th International Conference on Formal Structures for Computation and Deduction, Jul 2024, Tallinn, Estonia. pp.19:1-19:19, ⟨10.4230/LIPIcs.FSCD.2024.19⟩. ⟨hal-04636603⟩
-
Nombre de documents fulltext
1 258
Répartition des dépôts par type de document
Mots Clés
First-order logic
Decision procedure
Completeness
Satisfiability
Abstraction
Vérification
Cellular automata
Raffinement
Tree automata
Semantics
Authentication
Applied π-Calculus
Liveness
E-voting
Complexity
Collaborative editors
Algorithm
Validation
Synchronization
Superposition
Operational transformation
Parameter synthesis
Sines
Symbolic model
Protocoles cryptographiques
Automated reasoning
Malware
Satisfiability Modulo Theories
Termination
Rewriting
Process calculi
Formal Verification
Static analysis
Parametric timed automata
Cryptographic protocols
Decision procedures
Méthodes formelles
Constraint solving
Temporal logic
Symbolic animation
Event-B
Sécurité
Proof-based development
Theorem proving
Formal method
Automatic theorem provers
Unification
Schwilgué
Abstract machines
Logarithms
Reachability
Automated deduction
IMITATOR
Intrusion detection
Protocol
Algorithmic randomness
Computability
Automated verification
Proof assistants
Term rewriting
Model-checking
Cryptography
Protocols
Model checking
Calculating machine
Equational theories
Réécriture
Formal Methods
Formal verification
Edward Sang
Obfuscation
Narrowing
Distributed systems
Distributed algorithms
Privacy
Optimistic replication
Computable analysis
Decidability
Timed automata
Security
Combination of decision procedures
Separation logic
Protocoles
Formal methods
Secrecy
Composition
Verification
Implicit computational complexity
Social networks
SMT
Behavioral detection
TLA+
Security protocols
Web services
Tilings
Simulation
Combination
Refinement
Coq
Modelling