Problème terminaison And NotSilvio Ranise
List of bibliographic references
Number of relevant bibliographic references: 12.Ident. | Authors (with country if any) | Title |
---|---|---|
000356 | Olivier Bournez [France] ; Florent Garnier [France] | Proving positive almost sure termination under strategies |
000449 | Clara Bertolissi [France] | The graph rewriting calculus : Confluence and expressiveness |
000462 | Guillaume Bonfante [France] ; Jean-Yves Marion [France] ; Jean-Yves Moyen [France] | Quasi-interpretations and small space bounds |
000463 | Olivier Bournez [France] ; Florent Garnier [France] | Proving positive almost-sure termination |
000468 | Carlos Areces [France] ; Daniel Gorin [Argentine] | Ordered resolution with selection for H(@) |
000504 | Frédéric Blanqui [France] | Decidability of type-checking in the calculus of algebraic constructions with size annotations |
000527 | Olivier Fissore [France] ; Isabelle Gnaedig [France] ; Hélène Kirchner [France] | A proof of weak termination providing the right way to terminate |
000613 | Walid Gaaloul [France] ; Sami Bhiri [France] ; Claude Godart [France] | Discovering workflow transactional behavior from event-based log |
000633 | Frédéric Blanqui [France] | A type-based termination criterion for dependently-typed higher-order rewrite systems |
000B55 | H. Touzet [France] | Encoding the Hydra battle as a rewrite system |
000C06 | T. Genet [France] ; I. Gnaedig [France] | Termination proofs using gpo ordering constraints |
000D59 | J. Rouyer [France] | Preuves de terminaison de systèmes de réécriture fondées sur les interprétations polynomiales. Une méthode basée sur le théorème de Sturm |
This area was generated with Dilib version V0.6.33. |