Skip to main content
SpringerLink
Log in
Book cover

International Symposium on Automated Technology for Verification and Analysis

ATVA 2004: Automated Technology for Verification and Analysis pp 474–478Cite as

Efficient Representation of Algebraic Expressions

  • Conference paper

  • 354 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 3299))

Abstract

In behavioral verification and synthesis, a large number of algebraic expressions can be generated. Their representation needs to be compact, efficient, and precise. We designed a basic algebraic normal form of multiple algebraic expressions. It supports non-redundant storage, and expression transformation and expression efficiently.

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

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Plaisted, D.A.: Equational reasoning and term rewriting systems. In: Gabbay, D., Siekmann, J. (eds.) Handbook of Logic in Artificial Intelligence and Logic Programming, vol. 1, Oxford University Press, New York (1993)

    Google Scholar 

  2. Ariola, Z.M., Arvind: A syntactic approach to program transformations. In: Proc. of the 1991 ACM SIGPLAN Symp. on Partial Evaluation and Semantics-Based Program Manipulation, vol. 26(9) (1991)

    Google Scholar 

  3. Erwig, M.: Functional programming with graphs. In: Proc. the 2nd ACM SIGPLAN Intl Conf. on Functional Programming (1997)

    Google Scholar 

  4. Sarkar, M.S.: GXL - a new graph transformation language. In: Proc. the 42nd Annual Southeast Regional Conf. (2004)

    Google Scholar 

  5. Muchnick, S.S.: Advanced Compiler Design Implementation. Morgan Kaufmann Publishers, San Francisco (1997)

    Google Scholar 

  6. Bryant, R.E.: Graph based allgorithms for Boolean function manipulation. IEEE Trans. on Computers C-35(8) (1986)

    Google Scholar 

  7. Hoffmann, C.M., ODonnell, M.J.: Pattern matching in trees. J. ACM 29(1) (1982)

    Google Scholar 

  8. Dubiner, M., et al.: Faster tree pattern matching. J. ACM 41(2) (1994)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Electrical Engineering, National Sun Yat-Sen University, Kao-Hsiung, Taiwan, ROC

    Tsung Lee & Pen-Ho Yu

Authors
  1. Tsung Lee
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Pen-Ho Yu
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Grad. Inst. of Electronic Engineering, National Taiwan University, Taiwan, ROC

    Farn Wang

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lee, T., Yu, PH. (2004). Efficient Representation of Algebraic Expressions. In: Wang, F. (eds) Automated Technology for Verification and Analysis. ATVA 2004. Lecture Notes in Computer Science, vol 3299. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30476-0_39

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-30476-0_39

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-23610-8

  • Online ISBN: 978-3-540-30476-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation