Search results

Page title matches

• Tools:AProVE
  |shortname=AProVE |homepage=http://aprove.informatik.rwth-aachen.de
  904 bytes (127 words) - 20:25, 25 May 2014

Page text matches

• Tools:TrafO
  ...Example: |publication=[[Bibtex:Giesl04|Automated Termination Proofs with AProVE]] the tools [[Tools:AProVE|AProVE]] and [[Tools:Jambox|Jambox]] in the versions that participated in the
  1 KB (191 words) - 14:52, 18 May 2009
• Certification of Relative Termination and Termination modulo Theories
  * [[Tools:AProVE|AProVE]]
  718 bytes (98 words) - 10:46, 24 April 2009
• Termination Competition 2014 Registration
  ** TRS Standard: TTT2, NaTT, AProVE, Wanda, muterm ** SRS Standard: TTT2, NaTT, AProVE, muterm
  4 KB (580 words) - 14:43, 19 July 2014
• Tools:AProVE
  |shortname=AProVE |homepage=http://aprove.informatik.rwth-aachen.de
  904 bytes (127 words) - 20:25, 25 May 2014
• Complexity:Techniques
  | [[Tools:AProVE]] | [[Tools:AProVE]]
  2 KB (231 words) - 11:59, 8 June 2012
• Bibtex:Giesl04
  title = {Automated Termination Proofs with AProVE},
  578 bytes (73 words) - 17:25, 13 May 2009
• Bibtex:GST06
  title = "AProVE 1.2: Automatic Termination Proofs in the Dependency Pair Framework",
  658 bytes (82 words) - 20:55, 13 May 2009
• Termination Competition 2012 Comments
  ...ion/resultDetail.seam?resultId=404090&cid=108046 here]. The reason is that AProVE used some additional inference rules that are not described in their IJCAR' ...s imposes a neglectable restriction for SRSs. For NO-answers, AProVE beats AProVE-Cert due to the use of an uncertified technique to find non-looping non-ter
  4 KB (699 words) - 04:07, 29 June 2012
• WScT08-Program
  ...n, [http://cl-informatik.uibk.ac.at/~thiemann/xml/aprove.dtd XML-output of AProVE], [http://cl-informatik.uibk.ac.at/~thiemann/xml/aproveToHTML.xsl translato
  920 bytes (118 words) - 13:32, 2 June 2008
• Tools:THOR
  ...Example: |publication=[[Bibtex:Giesl04|Automated Termination Proofs with AProVE]]
  763 bytes (116 words) - 18:27, 26 June 2012
• Tools:HOT
  ...Example: |publication=[[Bibtex:Giesl04|Automated Termination Proofs with AProVE]]
  789 bytes (119 words) - 07:14, 27 June 2012
• Tools:Wanda
  ...Example: |publication=[[Bibtex:Giesl04|Automated Termination Proofs with AProVE]]
  768 bytes (118 words) - 18:25, 26 June 2012
• Bibtex:AProVE14
  title = "Proving Termination of Programs Automatically with \textsf{AProVE}",
  1 KB (110 words) - 07:55, 29 July 2014
• Tools:KITTeL
  ...Example: |publication=[[Bibtex:Giesl04|Automated Termination Proofs with AProVE]]
  823 bytes (122 words) - 11:38, 25 April 2012
• Tools:NTI
  ...Example: |publication=[[Bibtex:Giesl04|Automated Termination Proofs with AProVE]]
  841 bytes (124 words) - 12:51, 20 August 2017
• Tools:Julia
  ...Example: |publication=[[Bibtex:Giesl04|Automated Termination Proofs with AProVE]]
  858 bytes (129 words) - 09:57, 22 December 2009
• Tools:PTNT
  ...Example: |publication=[[Bibtex:Giesl04|Automated Termination Proofs with AProVE]]
  900 bytes (134 words) - 15:33, 5 July 2010
• Tools:VMTL
  ...Example: |publication=[[Bibtex:Giesl04|Automated Termination Proofs with AProVE]]
  937 bytes (135 words) - 10:45, 30 December 2009
• Complexity
  ! [http://aprove.informatik.rwth-aachen.de/ AProVE] | [[Tools:AProVE]]
  6 KB (809 words) - 11:01, 28 June 2012
• Functional Programming
  and AProVE shows termination of 1294 of them. The termination analyzer AProVE has a web front end http://aprove.informatik.rwth-aachen.de/eval/Haskell/
  4 KB (669 words) - 14:40, 21 December 2009

View (previous 20 | next 20) (20 | 50 | 100 | 250 | 500)