Décidabilité And NotVincent D. Blondel
List of bibliographic references
Number of relevant bibliographic references: 32.| Ident. | Authors (with country if any) | Title |
|---|---|---|
| 000122 | Didier Galmiche [France] ; Yakoub Salhi [France] | Sequent calculi and decidability for intuitionistic hybrid logic |
| 000135 | Mouhebeddine Berrima [Tunisie] ; Narjes Ben Rajeb [Tunisie] ; Véronique Cortier [France] | DECIDING KNOWLEDGE IN SECURITY PROTOCOLS UNDER SOME E-VOTING THEORIES |
| 000138 | Christopher Lynch [États-Unis] ; Silvio Ranise [Italie] ; Christophe Ringeissen [France] ; Duc-Khanh Tran [Namibie] | Automatic decidability and combinability |
| 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 |
| 000349 | Guillaume Bonfante [France] | Some programming languages for LOGSPACE and PTIME |
| 000353 | Véronique Cortier [France] ; Michaël Rusinowitch [France] ; Eugen Zalinescu [France] | Relating two standard notions of secrecy |
| 000378 | Yannick Chevalier [France] ; Michaël Rusinowitch [France] | Hierarchical combination of intruder theories |
| 000396 | Manin Abadi [États-Unis] ; Véronique Cortier [France] | Deciding knowledge in security protocols under equational thoories |
| 000397 | Silvio Ghilardi [Italie] ; Enrica Nicolini [Italie] ; Silvio Ranise [Italie, France] ; Daniele Zucchelli [Italie, France] | Deciding extensions of the theory of arrays by integrating decision procedures and instantiation strategies |
| 000398 | Maria Paola Bonacina [Italie] ; Silvio Ghilardi [Italie] ; Enrica Nicolini [Italie] ; Silvio Ranise [Italie, France] ; Daniele Zucchelli [Italie, France] | Decidability and undecidability results for nelson-oppen and rewrite-based decision procedures |
| 000401 | Véronique Cortier [France] ; Steve Kremer [France] ; Ralf Kusters [Suisse] ; Bogdan Warinschi [France] | Computationally sound symbolic secrecy in the presence of hash functions |
| 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 |
| 000426 | Véronique Cortier [France] | Vérifier les protocoles cryptographiques |
| 000455 | Tomasz Truderung [France, Pologne] | Selecting theories and recursive protocols |
| 000462 | Guillaume Bonfante [France] ; Jean-Yves Marion [France] ; Jean-Yves Moyen [France] | Quasi-interpretations and small space bounds |
| 000472 | Hélène Kirchner [France] ; Silvio Ranise [France] ; Christophe Ringeissen [France] ; DUC KHANH TRAN [France] | On superposition-based satisfiability procedures and their combination |
| 000504 | Frédéric Blanqui [France] | Decidability of type-checking in the calculus of algebraic constructions with size annotations |
| 000559 | Philippe De Groote [France] ; Bruno Guillaume [France] ; Sylvain Salvati [France] | Vector addition tree automata |
| 000599 | Philippe De Groote [France] ; Sylvain Salvati [France] | Higher-order matching in the linear λ-calculus with pairing |
| 000617 | Martin Abadi [États-Unis] ; Veronique Cortier [France] | Deciding knowledge in security protocols under equational theories |
| 000663 | Cesare Tinelli [États-Unis] ; Christophe Ringeissen [France] | Unions of non-disjoint theories and combinations of satisfiability procedures |
| 000664 | Siva Anantharaman [France] ; Paliath Narendran [États-Unis] ; Michael Rusinowitch [France] | Unification modulo ACUI plus homomorphisms/distributivity |
| 000727 | Siva Anantharaman [France] ; Paliath Narendran [États-Unis] ; Michael Rusinowitch [France] | ACID-unification is NEXPTIME-decidable |
| 000729 | Nicolas Biri [France] ; Didier Galmiche [France] | A separation logic for resource distribution |
| 000775 | Didier Galmiche [France] ; Daniel Mery [France] ; David Pym [Royaume-Uni] | Resource tableaux |
| 000821 | Dominique Larchey-Wendling [France] | Combining proof-search and counter-model construction for deciding Gödel-Dummett logic |
| 000899 | Christophe Ringeissen [France] | Matching with free function symbols : A simple extension of matching? |
| 000961 | P. Narendran [États-Unis] ; M. Rusinowitch [France] | The theory of total unary RPO is decidable |
| 000A92 | V. Cortier [France] ; H. Ganzinger [Allemagne] ; F. Jacquemard [France] ; M. Veanes [Allemagne] | Decidable fragments of simultaneous rigid reachability |
| 000B11 | G. Perrier [France] | A PSPACE-complete fragment of second-order linear logic |
| 000B56 | T. Genet [France] | Decidable approximations of sets of descendants and sets of normal forms |
| This area was generated with Dilib version V0.6.33. |  |