RATSY – A New Requirements Analysis Tool with Synthesis

  • Roderick Bloem
  • Alessandro Cimatti
  • Karin Greimel
  • Georg Hofferek
  • Robert Könighofer
  • Marco Roveri
  • Viktor Schuppan
  • Richard Seeber
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6174)

Abstract

Formal specifications play an increasingly important role in system design-flows. Yet, they are not always easy to deal with. In this paper we present RATSY, a successor of the Requirements Analysis Tool RAT. RATSY extends RAT in several ways. First, it includes a new graphical user interface to specify system properties as simple Büchi word automata. Second, it can help debug incorrect specifications by means of a game-based approach. Third, it allows correct-by-construction synthesis of systems from their temporal properties. These new features and their seamless integration assist in property-based design processes.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Beazley, D.M.: SWIG: An easy to use tool for integrating scripting languages with C and C++. In: Proc. 4th USENIX Tcl/Tk Workshop, pp. 129–139 (1996)Google Scholar
  2. 2.
    Bloem, R., Cavada, R., Pill, I., Roveri, M., Tchaltsev, A.: Rat: A tool for the formal analysis of requirements. In: Damm, W., Hermanns, H. (eds.) CAV 2007. LNCS, vol. 4590, pp. 263–267. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  3. 3.
    Cimatti, A., Clarke, E., Giunchiglia, E., Giunchiglia, F., Pistore, M., Roveri, M., Sebastiani, R., Tacchella, A.: NuSMV version 2: An opensource tool for symbolic model checking. In: Brinksma, E., Larsen, K.G. (eds.) CAV 2002. LNCS, vol. 2404, pp. 359–364. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  4. 4.
    Dellacherie, S.: Automatic bus-protocol verification using assertions. In: GSPx’04 (2004)Google Scholar
  5. 5.
    Filiot, E., Jin, N., Raskin, J.: An antichain algorithm for LTL realizability. In: Bouajjani, A., Maler, O. (eds.) CAV 2009. LNCS, vol. 5643, pp. 263–277. Springer, Heidelberg (2009)Google Scholar
  6. 6.
    Jobstmann, B., Bloem, R.: Optimizations for LTL synthesis. In: FMCAD, pp. 117–124 (2006)Google Scholar
  7. 7.
    Jobstmann, B., Galler, S., Weiglhofer, M., Bloem, R.: Anzu: A tool for property synthesis. In: Damm, W., Hermanns, H. (eds.) CAV 2007. LNCS, vol. 4590, pp. 258–262. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  8. 8.
    Könighofer, R., Hofferek, G., Bloem, R.: Debugging formal specifications using simple counterstrategies. In: FMCAD, pp. 152–159 (2009)Google Scholar
  9. 9.
    Piterman, N., Pnueli, A., Saár, Y.: Synthesis of reactive(1) designs. In: Emerson, E.A., Namjoshi, K.S. (eds.) VMCAI 2006. LNCS, vol. 3855, pp. 364–380. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  10. 10.
    Schewe, S., Finkbeiner, B.: Bounded synthesis. In: Namjoshi, K.S., Yoneda, T., Higashino, T., Okamura, Y. (eds.) ATVA 2007. LNCS, vol. 4762, pp. 474–488. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  11. 11.
    Sohail, S., Somenzi, F.: Safety first: A two-stage algorithm for LTL games. In: FMCAD, pp. 77–84 (2009)Google Scholar
  12. 12.
    Somenzi, F.: CUDD: CU Decision Diagram Package. University of Colorado at Boulder, ftp://vlsi.colorado.edu/pub/
  13. 13.
    Somenzi, F., Bloem, R.: Efficient Büchi automata from LTL formulae. In: Emerson, E.A., Sistla, A.P. (eds.) CAV 2000. LNCS, vol. 1855, pp. 248–263. Springer, Heidelberg (2000)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Roderick Bloem
    • 1
  • Alessandro Cimatti
    • 2
  • Karin Greimel
    • 1
  • Georg Hofferek
    • 1
  • Robert Könighofer
    • 1
  • Marco Roveri
    • 2
  • Viktor Schuppan
    • 2
  • Richard Seeber
    • 1
  1. 1.Graz University of TechnologyAustria
  2. 2.Fondazione Bruno KesslerTrentoItaly

Personalised recommendations