AProVE 1.2: Automatic Termination Proofs in the Dependency Pair Framework. AProVE 1.2 is one of the most powerful systems for automated termination proofs of term rewrite systems (TRSs). It is the first tool which automates the new dependency pair framework [8] and therefore permits a completely flexible combination of different termination proof techniques. Due to this framework, AProVE 1.2 is also the first termination prover which can be fully configured by the user.

References in zbMATH (referenced in 160 articles , 1 standard article )

Showing results 1 to 20 of 160.
Sorted by year (citations)

1 2 3 ... 6 7 8 next

  1. Caltais, Georgiana; Tunç, Hünkar Can: Explaining safety failures in NetKAT (2021)
  2. Cirstea, Horatiu; Lermusiaux, Pierre; Moreau, Pierre-Etienne: Pattern eliminating transformations (2021)
  3. Lucas, Salvador: Derivational complexity and context-sensitive Rewriting (2021)
  4. Meyer, Fabian; Hark, Marcel; Giesl, Jürgen: Inferring expected runtimes of probabilistic integer programs using expected sizes (2021)
  5. Padon, Oded; Hoenicke, Jochen; McMillan, Kenneth L.; Podelski, Andreas; Sagiv, Mooly; Shoham, Sharon: Temporal prophecy for proving temporal properties of infinite-state systems (2021)
  6. Thiemann, René: A Perron-Frobenius theorem for deciding matrix growth (2021)
  7. Hamilton, G. W.: Distilling programs to prove termination (2020)
  8. Lucas, Salvador: Using well-founded relations for proving operational termination (2020)
  9. Lucas, Salvador; Meseguer, José; Gutiérrez, Raúl: The 2D dependency pair framework for conditional rewrite systems. II: Advanced processors and implementation techniques (2020)
  10. van Doorn, Floris; Ebner, Gabriel; Lewis, Robert Y.: Maintaining a library of formal mathematics (2020)
  11. Xu, Ming; Deng, Yuxin: Time-bounded termination analysis for probabilistic programs with delays (2020)
  12. Albert, Elvira; Bofill, Miquel; Borralleras, Cristina; Martin-Martin, Enrique; Rubio, Albert: Resource analysis driven by (conditional) termination proofs (2019)
  13. Fuhs, Carsten: Transforming derivational complexity of term rewriting to runtime complexity (2019)
  14. Ishizuki, Sayaka; Oyamaguchi, Michio; Sakai, Masahiko: Conditions for confluence of innermost terminating term rewriting systems (2019)
  15. Paulson, Lawrence C.; Nipkow, Tobias; Wenzel, Makarius: From LCF to Isabelle/HOL (2019)
  16. Beyer, Dirk; Gulwani, Sumit; Schmidt, David A.: Combining model checking and data-flow analysis (2018)
  17. Frohn, Florian; Giesl, Jürgen: Constant runtime complexity of term rewriting is semi-decidable (2018)
  18. Hensel, Jera; Giesl, Jürgen; Frohn, Florian; Ströder, Thomas: Termination and complexity analysis for programs with bitvector arithmetic by symbolic execution (2018)
  19. Kiefer, Moritz; Klebanov, Vladimir; Ulbrich, Mattias: Relational program reasoning using compiler IR (2018)
  20. Klebanov, Vladimir; Rümmer, Philipp; Ulbrich, Mattias: Automating regression verification of pointer programs by predicate abstraction (2018)

1 2 3 ... 6 7 8 next

Further publications can be found at: http://aprove.informatik.rwth-aachen.de/index.asp?subform=references.html