The following pages link to Michaël Rusinowitch (Q437030):
Displayed 50 items.
- Decidability of equivalence of symbolic derivations (Q437031) (← links)
- Unification modulo homomorphic encryption (Q437037) (← links)
- Item:Q437030 (redirect page) (← links)
- Parametrized automata simulation and application to service composition (Q485834) (← links)
- Intruder deducibility constraints with negation. Decidability and application to secured service compositions (Q507348) (← links)
- Satisfiability of general intruder constraints with and without a set constructor (Q507349) (← links)
- An NP decision procedure for protocol insecurity with XOR (Q557799) (← links)
- Undecidability of ground reducibility for word rewriting systems with variables (Q674184) (← links)
- Theorem-proving with resolution and superposition (Q757094) (← links)
- On word problems in Horn theories (Q757095) (← links)
- Formal design and verification of operational transformation algorithms for copies convergence (Q820129) (← links)
- Compiling and securing cryptographic protocols (Q990127) (← links)
- Closure properties and decision problems of dag automata (Q1041757) (← links)
- Path of subterms ordering and recursive decomposition ordering revisited (Q1099655) (← links)
- On termination of the direct sum of term-rewriting systems (Q1108785) (← links)
- Automated deduction with associative-commutative operators (Q1340508) (← links)
- Any ground associative-commutative theory has a finite canonical system (Q1357668) (← links)
- Matching a set of strings with variable length don't cares (Q1391531) (← links)
- A rewriting approach to satisfiability procedures. (Q1401930) (← links)
- Incorporating decision procedures in implicit induction. (Q1404422) (← links)
- Observational proofs by rewriting. (Q1607227) (← links)
- Unification modulo ACUI plus distributivity axioms (Q1774555) (← links)
- Mechanical verification of an ideal incremental ABR conformance algorithm (Q1810852) (← links)
- Protocol insecurity with a finite number of sessions and composed keys is NP-complete. (Q1874404) (← links)
- Implicit induction in conditional theories (Q1891255) (← links)
- Reasoning with conditional axioms (Q1924731) (← links)
- Symbolic protocol analysis in the union of disjoint intruder theories: combining decision procedures (Q2268100) (← links)
- Unification modulo lists with reverse relation with certain word equations (Q2305403) (← links)
- One-variable context-free hedge automata (Q2424690) (← links)
- Tree automata with equality constraints modulo equational theories (Q2426520) (← links)
- Hierarchical combination of intruder theories (Q2482450) (← links)
- (Q2730723) (← links)
- (Q2754095) (← links)
- (Q2767013) (← links)
- (Q2767094) (← links)
- (Q2778866) (← links)
- (Q2819401) (← links)
- The Practice of Cryptographic Protocol Verification (Q2841213) (← links)
- (Q2844052) (← links)
- (Q2848035) (← links)
- Unification Modulo Chaining (Q2890181) (← links)
- Unification Modulo Synchronous Distributivity (Q2908474) (← links)
- (Q2917407) (← links)
- (Q3028369) (← links)
- Combining Satisfiability Procedures for Unions of Theories with a Shared Counting Operator (Q3084983) (← links)
- Verifying Cryptographic Protocols with Subterms Constraints (Q3498465) (← links)
- Closure of Hedge-Automata Languages by Hedge Rewriting (Q3522016) (← links)
- Towards an Automatic Analysis of Web Service Security (Q3525006) (← links)
- Hierarchical Combination of Intruder Theories (Q3527287) (← links)
- Applying a Theorem Prover to the Verification of Optimistic Replication Algorithms (Q3608819) (← links)