Théorie équationnelle And NotNarjes Ben Rajeb
List of bibliographic references
Number of relevant bibliographic references: 24.Ident. | Authors (with country if any) | Title |
---|---|---|
000251 | Mathieu Baudet [France] ; Véronique Cortier [France] ; Steve Kremer [France] | Computationally sound implementations of equational theories against passive adversaries |
000280 | Yannick Chevalier [France] ; Michael Rusinowitch [France] | Hierarchical combination of intruder theories |
000335 | Florent Jacquemard [France] ; Michael Rusinowitch [France] ; Laurent Vigneron [France] | Tree automata with equality constraints modulo equational theories |
000378 | Yannick Chevalier [France] ; Michaël Rusinowitch [France] | Hierarchical combination of intruder theories |
000379 | Martin Abadi [États-Unis] ; Mathieu Baudet [France] ; Bogdan Warinschi [France] | Guessing attacks and the computational soundness of static equivalence |
000396 | Manin Abadi [États-Unis] ; Véronique Cortier [France] | Deciding knowledge in security protocols under equational thoories |
000417 | Franz Baader [Allemagne] ; Silvio Ghilardi [Italie] ; Cesare Tinelli [États-Unis] | A new combination procedure for the word problem that generalizes fusion decidability results in modal logics |
000508 | Mathieu Baudet [France] ; Véronique Cortier [France] ; Steve Kremer [France] | Computationally sound implementations of equational theories against passive adversaries |
000617 | Martin Abadi [États-Unis] ; Veronique Cortier [France] | Deciding knowledge in security protocols under equational theories |
000632 | David Deharbe [Brésil] ; Abdessamad Imine [France] ; Silvio Ranise [France] | Abstraction-driven verification of array programs |
000663 | Cesare Tinelli [États-Unis] ; Christophe Ringeissen [France] | Unions of non-disjoint theories and combinations of satisfiability procedures |
000681 | Eric Deplagne [France] ; Claude Kirchner [France] ; Hélène Kirchner [France] ; Quang Huy Nguyen [France] | Proof search and proof check for equational and inductive theorems |
000690 | Christophe Ringeissen [France] | Matching in a class of combined non-disjoint theories |
000727 | Siva Anantharaman [France] ; Paliath Narendran [États-Unis] ; Michael Rusinowitch [France] | ACID-unification is NEXPTIME-decidable |
000874 | Alessandro Armando [Italie] ; Silvio Ranise [Italie, France] ; Michaël Rusinowitch [France] | Uniform derivation of decision procedures by superposition |
000899 | Christophe Ringeissen [France] | Matching with free function symbols : A simple extension of matching? |
000911 | Hubert Comon [France] ; Claude Kirchner [France] | Constraint solving on terms |
000959 | Miki Hermann [France] ; Phokion G. Kolaitis [États-Unis] | Unification algorithms cannot be combined in polynomial time |
000969 | A. Bouhoula [États-Unis, France] ; J.-P. Jouannaud [France] ; J. Meseguer [États-Unis] | Specification and proof in membership equational logic |
000C19 | M. Hermann [France] ; P. G. Kolaitis [États-Unis] | On the complexity of unification and disunification in commutative idempotent semigroups |
000C25 | C. Kirchner [France] ; C. Ringeissen [France] | Higher-order equational unification via explicit substitutions |
000D58 | E. Domenjoud [France] | AC unification through order-sorted AC1 unification |
000D65 | M. Hermann ; C. Kirchner ; H. Kirchner | Implementations of term rewriting systems |
000D66 | N. Doggaz ; C. Kirchner | Completion for unification |
This area was generated with Dilib version V0.6.33. |