• DocumentCode
    2141263
  • Title

    An Experimental Comparison of Theorem Provers for CTL

  • Author

    Goré, Rajeev ; Thomson, Jimmy ; Widmann, G.

  • Author_Institution
    Sch. of Comput. Sci., Australian Nat. Univ., Canberra, ACT, Australia
  • fYear
    2011
  • fDate
    12-14 Sept. 2011
  • Firstpage
    49
  • Lastpage
    56
  • Abstract
    We compare implementations of five theorem provers for Computation Tree Logic (CTL) based on tree-tableaux, graph-tableaux, binary decision diagrams, resolution and games using formula-classes from the literature. In the process, we gather and analyse a set of test formulae which could form the basis of a suite of benchmark formulae for CTL.
  • Keywords
    binary decision diagrams; game theory; theorem proving; trees (mathematics); CTL; binary decision diagrams; computation tree logic; games; graph-tableaux; theorem provers; tree-tableaux; Benchmark testing; Boolean functions; Compaction; Complexity theory; Computational modeling; Data structures; Games; automated reasoning; computation tree logic; experimental comparison;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Temporal Representation and Reasoning (TIME), 2011 Eighteenth International Symposium on
  • Conference_Location
    Lubeck
  • ISSN
    1530-1311
  • Print_ISBN
    978-1-4577-1242-5
  • Type

    conf

  • DOI
    10.1109/TIME.2011.16
  • Filename
    6065228
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2141263