Skip to main content
Top

2011 | OriginalPaper | Chapter

7. Translation Validation of High-Level Synthesis

Authors : Sudipta Kundu, Sorin Lerner, Rajesh K. Gupta

Published in: High-Level Verification

Publisher: Springer New York

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

Abstract

Once the important properties of the high-level components have been verified possibly using techniques presented in Chaps. 5 and 6, the translation from the high-level design to low-level RTL still needs to be proven correct, thereby also guaranteeing that the important properties of the components are preserved. In this chapter we will discuss an approach that proves that the translation from high-level design to a scheduled design is correct, for each translation that the HLS tool performs. In the next chapter we will describe another approach that will allow us to write part of these tools in a provably correct manner.

Dont have a licence yet? Then find out more about our products and how to get one now:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Literature
6.
go back to reference Ashar, P., Bhattacharya, S., Raghunathan, A., Mukaiyama, A.: Verification of RTL generated from scheduled behavior in a high-level synthesis flow. In: ICCAD ’98: Proceedings of the 1998 IEEE/ACM International Conference on Computer-Aided Design, pp. 517–524 (1998). URL citeseer.ist.psu.edu/ashar98verification.html Ashar, P., Bhattacharya, S., Raghunathan, A., Mukaiyama, A.: Verification of RTL generated from scheduled behavior in a high-level synthesis flow. In: ICCAD ’98: Proceedings of the 1998 IEEE/ACM International Conference on Computer-Aided Design, pp. 517–524 (1998). URL citeseer.​ist.​psu.​edu/​ashar98verificat​ion.​html
7.
go back to reference Ashar, P., Raghunathan, A., Gupta, A., Bhattacharya, S.: Verification of scheduling in the presence of loops using uninterpreted symbolic simulation. In: ICCD ’99: Proceedings of the 1999 IEEE International Conference on Computer Design, pp. 458–466. IEEE Computer Society, Washington, DC, USA (1999) Ashar, P., Raghunathan, A., Gupta, A., Bhattacharya, S.: Verification of scheduling in the presence of loops using uninterpreted symbolic simulation. In: ICCD ’99: Proceedings of the 1999 IEEE International Conference on Computer Design, pp. 458–466. IEEE Computer Society, Washington, DC, USA (1999)
12.
go back to reference Benton, N.: Simple relational correctness proofs for static analyses and program transformations. In: Proceedings of the 31st ACM Symposium on Principles of Programming Languages (2004) Benton, N.: Simple relational correctness proofs for static analyses and program transformations. In: Proceedings of the 31st ACM Symposium on Principles of Programming Languages (2004)
23.
go back to reference Burch, J., Clarke, E., McMillan, K., Dill, D., Hwang, L.: Symbolic Model Checking: 1020 States and Beyond. In: Proceedings of the Fifth Annual IEEE Symposium on Logic in Computer Science, pp. 1–33. IEEE Computer Society Press, Washington, D.C. (1990). URL citeseer.ist.psu.edu/burch90symbolic.html Burch, J., Clarke, E., McMillan, K., Dill, D., Hwang, L.: Symbolic Model Checking: 1020 States and Beyond. In: Proceedings of the Fifth Annual IEEE Symposium on Logic in Computer Science, pp. 1–33. IEEE Computer Society Press, Washington, D.C. (1990). URL citeseer.​ist.​psu.​edu/​burch90symbolic.​html
25.
go back to reference Bustan, D., Grumberg, O.: Simulation based minimization. In: D.A. McAllester (ed.) Proceedings of the International Conference on Automated Deduction, LNCS, vol. 1831, pp. 255–270. Springer Verlag (2000) Bustan, D., Grumberg, O.: Simulation based minimization. In: D.A. McAllester (ed.) Proceedings of the International Conference on Automated Deduction, LNCS, vol. 1831, pp. 255–270. Springer Verlag (2000)
30.
go back to reference Chandy, K.M.: Parallel program design: a foundation. Addison-Wesley Longman Publishing Co., Inc., Boston, MA, USA (1988)MATH Chandy, K.M.: Parallel program design: a foundation. Addison-Wesley Longman Publishing Co., Inc., Boston, MA, USA (1988)MATH
35.
go back to reference C.N. Ip, D.L. Dill: Better verification through symmetry. In: D. Agnew, L. Claesen, R. Camposano (eds.) Computer Hardware Description Languages and their Applications, pp. 87–100. Elsevier Science Publishers B.V., Amsterdam, Netherland, Ottawa, Canada (1993). URL citeseer.ist.psu.edu/ip96better.html C.N. Ip, D.L. Dill: Better verification through symmetry. In: D. Agnew, L. Claesen, R. Camposano (eds.) Computer Hardware Description Languages and their Applications, pp. 87–100. Elsevier Science Publishers B.V., Amsterdam, Netherland, Ottawa, Canada (1993). URL citeseer.​ist.​psu.​edu/​ip96better.​html
44.
go back to reference Detlefs, D., Nelson, G., Saxe, J.B.: Simplify: A theorem prover for program checking. Journal of the Association for Computing Machinery 52(3), 365–473 (2005)MathSciNet Detlefs, D., Nelson, G., Saxe, J.B.: Simplify: A theorem prover for program checking. Journal of the Association for Computing Machinery 52(3), 365–473 (2005)MathSciNet
49.
go back to reference Dutertre, B., Schneider, S.: Using a PVS embedding of CSP to verify authentication protocols. In: TPHOLs ’97: Proceedings of the 10th International Conference on Theorem Proving in Higher Order Logics, Lecture Notes in Artificial Intelligence. Springer-Verlag (1997) Dutertre, B., Schneider, S.: Using a PVS embedding of CSP to verify authentication protocols. In: TPHOLs ’97: Proceedings of the 10th International Conference on Theorem Proving in Higher Order Logics, Lecture Notes in Artificial Intelligence. Springer-Verlag (1997)
54.
go back to reference Eveking, H., Hinrichsen, H., Ritter, G.: Automatic verification of scheduling results in high-level synthesis. In: DATE ’99: Proceedings of the conference on Design, automation and test in Europe, p. 12. ACM Press, New York, NY, USA (1999). DOI http://doi.acm.org/10.1145/307418.307449 Eveking, H., Hinrichsen, H., Ritter, G.: Automatic verification of scheduling results in high-level synthesis. In: DATE ’99: Proceedings of the conference on Design, automation and test in Europe, p. 12. ACM Press, New York, NY, USA (1999). DOI http://​doi.​acm.​org/​10.​1145/​307418.​307449
55.
go back to reference Fisler, K., Vardi, M.Y.: Bisimulation and Model Checking. In: Proceedings of the 10th Conference on Correct Hardware Design and Verification Methods. Bad Herrenalb Germany CA (1999) Fisler, K., Vardi, M.Y.: Bisimulation and Model Checking. In: Proceedings of the 10th Conference on Correct Hardware Design and Verification Methods. Bad Herrenalb Germany CA (1999)
69.
go back to reference Girkar, M., Polychronopoulos, C.D.: Automatic extraction of functional parallelism from ordinary programs. IEEE Transaction on Parallel Distributed Systems (1992) Girkar, M., Polychronopoulos, C.D.: Automatic extraction of functional parallelism from ordinary programs. IEEE Transaction on Parallel Distributed Systems (1992)
73.
go back to reference Goldberg, B., Zuck, L., Barrett, C.: Into the loops: Practical issues in translation validation for optimizing compilers. Electronic Notes in Theoretical Computer Science 132(1), 53–71 (2005)CrossRef Goldberg, B., Zuck, L., Barrett, C.: Into the loops: Practical issues in translation validation for optimizing compilers. Electronic Notes in Theoretical Computer Science 132(1), 53–71 (2005)CrossRef
78.
go back to reference Grötker, T., Liao, S., Martin, G., Swan, S.: System Design with SystemC. Kluwer Academic Publishers (2002) Grötker, T., Liao, S., Martin, G., Swan, S.: System Design with SystemC. Kluwer Academic Publishers (2002)
93.
go back to reference Hoare, C.A.R.: Communicating Sequential Processes. Prentice Hall International (1985) Hoare, C.A.R.: Communicating Sequential Processes. Prentice Hall International (1985)
96.
go back to reference Isobe, Y., Roggenbach, M.: A generic theorem prover of CSP refinement. In: TACAS ’05: Proceedings of the 11th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, Lecture Notes in Computer Science (LNCS), vol. 1503, pp. 103–123. Springer-Verlag (2005) Isobe, Y., Roggenbach, M.: A generic theorem prover of CSP refinement. In: TACAS ’05: Proceedings of the 11th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, Lecture Notes in Computer Science (LNCS), vol. 1503, pp. 103–123. Springer-Verlag (2005)
111.
go back to reference Kim, Y., Kopuri, S., Mansouri, N.: Automated formal verification of scheduling process using finite state machines with datapath (fsmd). In: ISQED ’04: Proceedings of the 5th International Symposium on Quality Electronic Design, pp. 110–115. IEEE Computer Society, Washington, DC, USA (2004) Kim, Y., Kopuri, S., Mansouri, N.: Automated formal verification of scheduling process using finite state machines with datapath (fsmd). In: ISQED ’04: Proceedings of the 5th International Symposium on Quality Electronic Design, pp. 110–115. IEEE Computer Society, Washington, DC, USA (2004)
116.
go back to reference Kundu, S., Lerner, S., Gupta, R.: Automated Refinement Checking of Concurrent Systems. In: ICCAD ’07: Proceedings of the 2007 IEEE/ACM International Conference on Computer-Aided Design, pp. 318–325. IEEE Press, Piscataway, NJ, USA (2007) Kundu, S., Lerner, S., Gupta, R.: Automated Refinement Checking of Concurrent Systems. In: ICCAD ’07: Proceedings of the 2007 IEEE/ACM International Conference on Computer-Aided Design, pp. 318–325. IEEE Press, Piscataway, NJ, USA (2007)
117.
go back to reference Kundu, S., Lerner, S., Gupta, R.: Validating High-Level Synthesis. In: CAV ’08: Proceedings of the 20th international conference on Computer Aided Verification, pp. 459–472. Springer, Princeton, NJ, USA (2008) Kundu, S., Lerner, S., Gupta, R.: Validating High-Level Synthesis. In: CAV ’08: Proceedings of the 20th international conference on Computer Aided Verification, pp. 459–472. Springer, Princeton, NJ, USA (2008)
119.
go back to reference Kundu, S., Lerner, S., Gupta, R.: Translation Validation in High-Level Synthesis. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 29, 566 – 579 (2010)CrossRef Kundu, S., Lerner, S., Gupta, R.: Translation Validation in High-Level Synthesis. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 29, 566 – 579 (2010)CrossRef
121.
go back to reference Lacey, D., Jones, N.D., Wyk, E.V., Frederiksen, C.C.: Proving correctness of compiler optimizations by temporal logic. In: Proceedings of the 29th ACM Symposium on Principles of Programming Languages (2002) Lacey, D., Jones, N.D., Wyk, E.V., Frederiksen, C.C.: Proving correctness of compiler optimizations by temporal logic. In: Proceedings of the 29th ACM Symposium on Principles of Programming Languages (2002)
123.
go back to reference Lam, M.: Software pipelining: an effective scheduling technique for VLIW machines. In: PLDI ’88: Proceedings of the 1988 ACM SIGPLAN conference on Programming Language Design and Implementation (1988) Lam, M.: Software pipelining: an effective scheduling technique for VLIW machines. In: PLDI ’88: Proceedings of the 1988 ACM SIGPLAN conference on Programming Language Design and Implementation (1988)
127.
go back to reference Lee, E.A., Sangiovanni-Vincentelli, A.L.: A framework for comparing models of computation. IEEE Transactions on CAD of Integrated Circuits and Systems 17(12), 1217–1229 (1998)CrossRef Lee, E.A., Sangiovanni-Vincentelli, A.L.: A framework for comparing models of computation. IEEE Transactions on CAD of Integrated Circuits and Systems 17(12), 1217–1229 (1998)CrossRef
137.
go back to reference Ltd., F.S.E.: Failures-divergence refinement: FDR2 user manual. Oxford, England, June 2005. Ltd., F.S.E.: Failures-divergence refinement: FDR2 user manual. Oxford, England, June 2005.
158.
go back to reference Narasimhan, N., Teica, E., Radhakrishnan, R., Govindarajan, S., Vemuri, R.: Theorem proving guided development of formal assertions in a resource-constrained scheduler for high-level synthesis. Formal Methods in System Design 19(3), 237–273 (2001). DOI http://dx.doi.org/10.1023/A:1011250531814 Narasimhan, N., Teica, E., Radhakrishnan, R., Govindarajan, S., Vemuri, R.: Theorem proving guided development of formal assertions in a resource-constrained scheduler for high-level synthesis. Formal Methods in System Design 19(3), 237–273 (2001). DOI http://​dx.​doi.​org/​10.​1023/​A:​1011250531814
160.
go back to reference Necula, G.C.: Translation validation for an optimizing compiler. In: PLDI ’00: Proceedings of the 2000 ACM SIGPLAN conference on Programming Language Design and Implementation (2000) Necula, G.C.: Translation validation for an optimizing compiler. In: PLDI ’00: Proceedings of the 2000 ACM SIGPLAN conference on Programming Language Design and Implementation (2000)
163.
go back to reference Owre, S., Rajan, S., Rushby, J., Shankar, N., Srivas, M.: PVS: Combining specification, proof checking, and model checking. In: Proceedings of Computer-Aided Verification, CAV ’96, Lecture Notes in Computer Science, vol. 1102, pp. 411–414. Springer-Verlag, New Brunswick, NJ (1996) Owre, S., Rajan, S., Rushby, J., Shankar, N., Srivas, M.: PVS: Combining specification, proof checking, and model checking. In: Proceedings of Computer-Aided Verification, CAV ’96, Lecture Notes in Computer Science, vol. 1102, pp. 411–414. Springer-Verlag, New Brunswick, NJ (1996)
165.
go back to reference Paulson, L.C.: Isabelle: A generic theorem prover, Lecure Notes in Computer Science, vol. 828. Springer Verlag (1994) Paulson, L.C.: Isabelle: A generic theorem prover, Lecure Notes in Computer Science, vol. 828. Springer Verlag (1994)
167.
go back to reference Peled, D.: Ten years of partial order reduction. In: CAV ’98: Proceedings of the international conference on Computer Aided Verification (1998) Peled, D.: Ten years of partial order reduction. In: CAV ’98: Proceedings of the international conference on Computer Aided Verification (1998)
170.
go back to reference Pnueli, A., Siegel, M., Singerman, E.: Translation validation. In: TACAS ’98: Proceedings of the 4th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, Lecture Notes in Computer Science, vol. 1384, pp. 151–166 (1998) Pnueli, A., Siegel, M., Singerman, E.: Translation validation. In: TACAS ’98: Proceedings of the 4th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, Lecture Notes in Computer Science, vol. 1384, pp. 151–166 (1998)
178.
go back to reference Rinard, M., Marinov, D.: Credible compilation. In: Proceedings of the FLoC Workshop Run-Time Result Verification (1999) Rinard, M., Marinov, D.: Credible compilation. In: Proceedings of the FLoC Workshop Run-Time Result Verification (1999)
180.
go back to reference Robinson, A., Voronkov, A. (eds.): Handbook of Automated Reasoning. Elsevier Science Publishers B. V., Amsterdam, The Netherlands, The Netherlands (2001)MATH Robinson, A., Voronkov, A. (eds.): Handbook of Automated Reasoning. Elsevier Science Publishers B. V., Amsterdam, The Netherlands, The Netherlands (2001)MATH
181.
go back to reference Roscoe, A.W., Gardiner, P.H.B., Goldsmith, M.H., Hulance, J.R., Jackson, D.M., Scattergood, J.B.: Hierarchical compression for model-checking csp or how to check 1020 dining philosophers for deadlock. In: TACAS ’95: Proceedings of the First International Workshop on Tools and Algorithms for Construction and Analysis of Systems, pp. 133–152. Springer-Verlag, London, UK (1995) Roscoe, A.W., Gardiner, P.H.B., Goldsmith, M.H., Hulance, J.R., Jackson, D.M., Scattergood, J.B.: Hierarchical compression for model-checking csp or how to check 1020 dining philosophers for deadlock. In: TACAS ’95: Proceedings of the First International Workshop on Tools and Algorithms for Construction and Analysis of Systems, pp. 133–152. Springer-Verlag, London, UK (1995)
183.
go back to reference Sander, I., Jantsch, A.: System modeling and transformational design refinement in forsyde [formal system design]. IEEE Transactions on CAD of Integrated Circuits and Systems 23(1), 17–32 (2004)CrossRef Sander, I., Jantsch, A.: System modeling and transformational design refinement in forsyde [formal system design]. IEEE Transactions on CAD of Integrated Circuits and Systems 23(1), 17–32 (2004)CrossRef
195.
go back to reference Tej, H., Wolff, B.: A corrected failure divergence model for csp in isabelle/hol. In: FME ’97: Proceedings of the 4th International Symposium of Formal Methods Europe on Industrial Applications and Strengthened Foundations of Formal Methods, pp. 318–337. Springer-Verlag, London, UK (1997) Tej, H., Wolff, B.: A corrected failure divergence model for csp in isabelle/hol. In: FME ’97: Proceedings of the 4th International Symposium of Formal Methods Europe on Industrial Applications and Strengthened Foundations of Formal Methods, pp. 318–337. Springer-Verlag, London, UK (1997)
212.
go back to reference Zuck, L., Pnueli, A., Fang, Y., Goldberg, B.: VOC: A methodology for the translation validation of optimizing compilers. Journal of Universal Computer Science 9(3), 223–247 (2003) Zuck, L., Pnueli, A., Fang, Y., Goldberg, B.: VOC: A methodology for the translation validation of optimizing compilers. Journal of Universal Computer Science 9(3), 223–247 (2003)
Metadata
Title
Translation Validation of High-Level Synthesis
Authors
Sudipta Kundu
Sorin Lerner
Rajesh K. Gupta
Copyright Year
2011
Publisher
Springer New York
DOI
https://doi.org/10.1007/978-1-4419-9359-5_7