Skip to main content
Top
Published in: Formal Methods in System Design 2/2014

01-10-2014

Verification of Galois field based circuits by formal reasoning based on computational algebraic geometry

Authors: Alexey Lvov, Luis A. Lastras-Montaño, Barry Trager, Viresh Paruthi, Robert Shadowen, Ali El-Zein

Published in: Formal Methods in System Design | Issue 2/2014

Log in

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

search-config
loading …

Abstract

Algebraic error correcting codes (ECC) are widely used to implement reliability features in modern servers and systems and pose a formidable verification challenge. We present a novel methodology and techniques for provably correct design of ECC logics. The methodology is comprised of a design specification method that directly exposes the ECC algorithm’s underlying math to a verification layer, encapsulated in a tool “BLUEVERI”, which establishes the correctness of the design conclusively by using an apparatus of computational algebraic geometry (Buchberger’s algorithm for Gröbner basis construction). We present results from its application to example circuits to demonstrate the effectiveness of the approach. The methodology has been successfully applied to prove correctness of large error correcting circuits on IBM’s POWER systems to protect memory storage and processor to memory communication, as well as a host of smaller error correcting circuits.

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 "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!

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!

Footnotes
1
Very often the uncorrectable error signal is both an internal signal upon which further things depend and also an output by itself.
 
Literature
1.
go back to reference Meaney PJ, Lastras-Montaño LA, Papazova VK, Stephens E, Johnson JS, Alves LC, O’Connor JA, Clarke WJ (2012) IBM zEnterprise redundant array of independent memory subsystem. IBM J Res Dev 56:1–4CrossRef Meaney PJ, Lastras-Montaño LA, Papazova VK, Stephens E, Johnson JS, Alves LC, O’Connor JA, Clarke WJ (2012) IBM zEnterprise redundant array of independent memory subsystem. IBM J Res Dev 56:1–4CrossRef
2.
go back to reference Lastras-Montaño LA, Meaney PJ, Stephens E, Trager BM, O’Connor J, Alves LC (2011) A new class of array codes for memory storage. In: Information theory and applications workshop (ITA), pp 1–10, 6–11 Lastras-Montaño LA, Meaney PJ, Stephens E, Trager BM, O’Connor J, Alves LC (2011) A new class of array codes for memory storage. In: Information theory and applications workshop (ITA), pp 1–10, 6–11
3.
go back to reference Bryant RE (1986) Graph based algorithms for Boolean function manipulation. IEEE Trans Comput C–35:677–691CrossRef Bryant RE (1986) Graph based algorithms for Boolean function manipulation. IEEE Trans Comput C–35:677–691CrossRef
4.
go back to reference Bryant RE, Chen Y-A (1995) Verification of arithmetic functions with binary moment diagrams. In: Design automation conference Bryant RE, Chen Y-A (1995) Verification of arithmetic functions with binary moment diagrams. In: Design automation conference
5.
go back to reference Kebschull U, Rosentiel W (1993) Efficient graph-based computation and manipulation of functional decision diagrams. In: European conference on design automation, pp 278–282 Kebschull U, Rosentiel W (1993) Efficient graph-based computation and manipulation of functional decision diagrams. In: European conference on design automation, pp 278–282
6.
go back to reference Mony H, Baumgartner J, Paruthi V, Kanzelman R, Kuehlmann A (2004) Scalable automated verification via expert-system guided transformations. In: Hu AJ, Martin AK (eds) Formal methods in computer-aided design. Springer, Berlin, pp 159–173CrossRef Mony H, Baumgartner J, Paruthi V, Kanzelman R, Kuehlmann A (2004) Scalable automated verification via expert-system guided transformations. In: Hu AJ, Martin AK (eds) Formal methods in computer-aided design. Springer, Berlin, pp 159–173CrossRef
7.
go back to reference Morioka S, Katayama Y, Yamane T (2001) Towards efficient verification of arithmetic algorithms over Galois fields. Proc Comput Aided Verif 2102:465–477CrossRef Morioka S, Katayama Y, Yamane T (2001) Towards efficient verification of arithmetic algorithms over Galois fields. Proc Comput Aided Verif 2102:465–477CrossRef
8.
go back to reference Lv J, Kalla P, Enescu F (2011) Verification of composite Galois field multipliers over \(GF((2^m)^n)\) using computer algebra techniques. In: Proceedings of IEEE international high level design validation and test, workshop, pp 136–143 Lv J, Kalla P, Enescu F (2011) Verification of composite Galois field multipliers over \(GF((2^m)^n)\) using computer algebra techniques. In: Proceedings of IEEE international high level design validation and test, workshop, pp 136–143
9.
go back to reference Pretzel O (1992) Error-correcting codes and finite fields. Oxford applied mathematics and CS series. Oxford University Press, Oxford. ISBN 0-198-59678-2 Pretzel O (1992) Error-correcting codes and finite fields. Oxford applied mathematics and CS series. Oxford University Press, Oxford. ISBN 0-198-59678-2
10.
go back to reference Lidl R, Niederreiter H (1997) Finite fields: encyclopedia of mathematics and its applications, vol 20. Cambridge University Press, Cambridge. ISBN: 0-521-39231-4 Lidl R, Niederreiter H (1997) Finite fields: encyclopedia of mathematics and its applications, vol 20. Cambridge University Press, Cambridge. ISBN: 0-521-39231-4
11.
go back to reference Cox D, Little J, O’Shea D (2010) Ideals, varieties and algorithms. Undergraduate texts in mathematics. Springer, New York. ISBN: 0-387-35650-9 Cox D, Little J, O’Shea D (2010) Ideals, varieties and algorithms. Undergraduate texts in mathematics. Springer, New York. ISBN: 0-387-35650-9
12.
go back to reference Sarwate D, Shanbhag N (2001) High-speed architectures for Reed–Solomon decoders. IEEE Trans VLSI Syst 9(5):641–655CrossRef Sarwate D, Shanbhag N (2001) High-speed architectures for Reed–Solomon decoders. IEEE Trans VLSI Syst 9(5):641–655CrossRef
14.
go back to reference Dreyer A, Marx O, Pavlenko E, Wedler M, Stoffel D, Kunz W, Greuel G (2011) Preprocessing polynomials for arithmetic reasoning within the SMT-Solver STABLE. In: Seventh international workshop on constraints in formal verification (CFV’11), San Jose, CA, USA Dreyer A, Marx O, Pavlenko E, Wedler M, Stoffel D, Kunz W, Greuel G (2011) Preprocessing polynomials for arithmetic reasoning within the SMT-Solver STABLE. In: Seventh international workshop on constraints in formal verification (CFV’11), San Jose, CA, USA
Metadata
Title
Verification of Galois field based circuits by formal reasoning based on computational algebraic geometry
Authors
Alexey Lvov
Luis A. Lastras-Montaño
Barry Trager
Viresh Paruthi
Robert Shadowen
Ali El-Zein
Publication date
01-10-2014
Publisher
Springer US
Published in
Formal Methods in System Design / Issue 2/2014
Print ISSN: 0925-9856
Electronic ISSN: 1572-8102
DOI
https://doi.org/10.1007/s10703-014-0206-z

Other articles of this Issue 2/2014

Formal Methods in System Design 2/2014 Go to the issue

Premium Partner