Skip to main content

UTP Semantics for Handel-C

  • Conference paper
Unifying Theories of Programming (UTP 2008)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 5713))

Included in the following conference series:

Abstract

Only limited progress has been made so far towards an axiomatic semantics or discovering the algebraic rules that characterise Handel-C programs. In this paper we present a UTP semantics together with extensions we needed to include in order to express Handel-C properties that were not addressable with standard UTP. We also show how our extensions can be abstracted to a more general context and prove a set of algebraic rules that hold for them. Finally, we use the semantics to prove some properties about Handel-C constructs.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Multivalue Logic System for VHDL Model Interoperability (Std_logic_1164). IEEE Standard 1164-1993 (1993)

    Google Scholar 

  2. Standard SystemC Language Reference Manual (LRM). IEEE Standard 1666-2005 (2005)

    Google Scholar 

  3. Breuer, P.T., Fernández, L.S., Kloos, C.D.: Proof theory and a validation condition generator for VHDL. In: Euro-VHDL ’94, pp. 512–517 (1994)

    Google Scholar 

  4. Butterfield, A.: Denotational semantics for prialt-free Handel-C. Technical report, The University of Dublin, Trinity College (December 2001)

    Google Scholar 

  5. Butterfield, A., Woodcock, J.: Semantic domains for Handel-C. Electronic Notes in Theoretical Computer Science, vol. 74 (2002)

    Google Scholar 

  6. Butterfield, A., Woodcock, J.: Semantics of prialt in Handel-C. In: Concurrent Systems Engineering. IOS Press, Amsterdam (2002)

    Google Scholar 

  7. Butterfield, A., Woodcock, J.: Prialt in handel-c: an operational semantics. International Journal on Software Tools Technology Transfer 7(3), 248–267 (2005)

    Article  Google Scholar 

  8. Butterfield, A., Woodcock, J.: A Hardware Compiler Semantics for Handel-C. In: MFCSIT 2004, Dublin, Ireland, August 2006. ENTCS, vol. 161, pp. 73–90 (2006)

    Google Scholar 

  9. Butterfield, A., Sherif, A., Woodcock, J.: Slotted-circus. In: IFM, pp. 75–97 (2007)

    Google Scholar 

  10. Celoxica Ltd. DK3: Handel-C Language Reference Manual (2002)

    Google Scholar 

  11. Hoare, C.A.R.: Communicating sequential processes. Commun. ACM 26(1), 100–106 (1983)

    Article  MathSciNet  Google Scholar 

  12. Hoare, C.A.R., Jifeng, H.: Unifying Theories of Programming. Prentice-Hall, Englewood Cliffs (1998)

    Google Scholar 

  13. Huibiao, Z., Bowen, J.P., Jifeng, H.: From operational semantics to denotational semantics for verilog. In: Margaria, T., Melham, T.F. (eds.) CHARME 2001. LNCS, vol. 2144, pp. 449–471. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  14. Kernighan, B.W.: The C Programming Language. Prentice Hall Professional Technical Reference (1988)

    Google Scholar 

  15. Perna, J.I., Woodcock, J.: A denotational semantics for Handel-C hardware compilation. In: ICFEM, pp. 266–285 (2007)

    Google Scholar 

  16. Perna, J.I., Woodcock, J.: Wire-Wise Correctness for Handel-C Synthesis in HOL. In: ETAPS’08 - Seventh International Workshop on Designing Correct Circuits (DCC), March 2008, pp. 86–100 (2008)

    Google Scholar 

  17. Salem, A.: Formal semantics of synchronous systemc. In: DATE ’03: Proceedings of the conference on Design, Automation and Test in Europe, Washington, DC, USA, p. 10376. IEEE Computer Society, Los Alamitos (2003)

    Google Scholar 

  18. Woodcock, J., Cavalcanti, A.: A concurrent language for refinement. In: Butterfield, A., Strong, G., Pahl, C. (eds.) IWFM, Workshops in Computing. BCS (2001)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Perna, J.I., Woodcock, J. (2010). UTP Semantics for Handel-C. In: Butterfield, A. (eds) Unifying Theories of Programming. UTP 2008. Lecture Notes in Computer Science, vol 5713. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-14521-6_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-14521-6_9

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-14520-9

  • Online ISBN: 978-3-642-14521-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics