Advertisement

Initial Ideas for Automatic Design and Verification of Control Logic in Reversible HDLs

Work in Progress Report
  • Robert Wille
  • Oliver Keszocze
  • Lars Othmer
  • Michael Kirkedal Thomsen
  • Rolf Drechsler
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9720)

Abstract

In imperative reversible languages the commonly used conditional statements must, in addition to the established if-condition for forward computation, be extended with an additional fi-condition for backward computation. Unfortunately, deriving correct and consistent fi-conditions is often not obvious. Moreover, implementations exist which may not be realized with a reversible control flow at all. In this work, we propose automatic methods for descriptions in the reversible HDL SyReC that can generate the required fi-conditions and check whether a reversible control flow indeed can be realized. The envisioned solution utilizes predicate transformer semantics based on Hoare logic. The presented ideas constitute the first steps towards automatic methods for these important designs steps in the domain of reversible circuit design.

Notes

Acknowledgments

This work has partially been supported by the EU COST Action IC1405.

References

  1. 1.
    Wille, R., Schönborn, E., Soeken, M., Drechsler, R.: SyReC: a hardware description language for the specification and synthesis of reversible circuits. Integr. VLSI J. 53, 39–53 (2016)CrossRefGoogle Scholar
  2. 2.
    Yokoyama, T., Axelsen, H.B., Glück, R.: Principles of a reversible programming language. In: Proceedings of 5th Conference on Computing Frontiers (CF 2008), pp. 43–54. ACM (2008)Google Scholar
  3. 3.
    Hoare, C.A.R.: An axiomatic basis for computer programming. Commun. ACM 12(10), 576–580 (1969)CrossRefzbMATHGoogle Scholar
  4. 4.
    Biere, A., Biere, A., Heule, M., van Maaren, H., Walsh, T.: Handbook of Satisfiability. IOS Press, Amsterdam (2009)zbMATHGoogle Scholar
  5. 5.
    Wille, R., Lye, A., Niemann, P.: Checking reversibility of Boolean functions. In: Conference on Reversible Computation (2016)Google Scholar

Copyright information

© Springer International Publishing Switzerland 2016

Authors and Affiliations

  • Robert Wille
    • 1
    • 2
  • Oliver Keszocze
    • 2
    • 3
  • Lars Othmer
    • 3
  • Michael Kirkedal Thomsen
    • 4
  • Rolf Drechsler
    • 2
    • 3
  1. 1.Institute for Integrated CircuitsJohannes Kepler UniversityLinzAustria
  2. 2.Cyber-Physical SystemsDFKI GmbHBremenGermany
  3. 3.Institute of Computer ScienceUniversity of BremenBremenGermany
  4. 4.Department of Computer ScienceUniversity of CopenhagenCopenhagenDenmark

Personalised recommendations