Forward-Looking Problems

  • Ted HuffmireEmail author
  • Cynthia Irvine
  • Thuy D. Nguyen
  • Timothy Levin
  • Ryan Kastner
  • Timothy Sherwood


This chapter considers forward looking problems, including trustworthy tools, formal verification of hardware designs, configuration management, languages, physical attacks, design theft, and securing the entire manufacturing supply chain.


Model Check Design Flow Covert Channel Configuration Management Security Architecture 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


  1. 1.
    J. Brouchier, T. Kean, C. Marsh, D. Naccache, Temperature attacks. IEEE Secur. Priv. 7(2), 79–82 (2009) CrossRefGoogle Scholar
  2. 2.
    M. Gordon, Validating the PSL/Sugar specification language using automated reasoning. Form. Asp. Comput. 15(4), 406–421 (2003) zbMATHCrossRefGoogle Scholar
  3. 3.
    J. Hannan, F. Pfenning, Compiler verification in LF, in Proceedings of the 7th Annual IEEE Symposium on Logic in Computer Science (LICS), Santa Cruz, CA, June 1992 Google Scholar
  4. 4.
    W.A. Hunt, Microprocessor design verification. J. Autom. Reason. 5(4), 429–460 (1989) CrossRefGoogle Scholar
  5. 5.
    C.E. Irvine, K. Levitt, Trusted hardware: can it be trustworthy?, in Proceedings of the 44th Annual Design Automation Conference (DAC), San Diego, CA, June 2007 Google Scholar
  6. 6.
    T.E. Levin, C.E. Irvine, T.V. Benzel, G. Bhaskara, P.C. Clark, T.D. Nguyen, Design principles and guidelines for security. NPS Technical Report NPS-CS-07-014, Naval Postgraduate School, Monterey, CA, 21 November 2007 Google Scholar
  7. 7.
    H.G. Rice, Classes of recursively enumerable sets and their decision problems. Trans. Am. Math. Soc. 74, 358–366 (1953) MathSciNetzbMATHCrossRefGoogle Scholar
  8. 8.
    H. Sasaki, A formal semantics for Verilog-VHDL simulation interoperability by abstract state machine, in Proceedings of the Conference on Design, Automation, and Test in Europe (DATE), Munich, Germany, March 1999 Google Scholar
  9. 9.
    D. Spinellis, Reliable identification of bounded-length viruses is NP-complete. IEEE Trans. Inf. Theory 49(1), 280–284 (2003) MathSciNetzbMATHCrossRefGoogle Scholar
  10. 10.
    K. Thompson, Reflections on trusting trust. Commun. ACM 27(8), 761–763 (1984) CrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media B.V. 2010

Authors and Affiliations

  • Ted Huffmire
    • 1
    Email author
  • Cynthia Irvine
    • 1
  • Thuy D. Nguyen
    • 1
  • Timothy Levin
    • 1
  • Ryan Kastner
    • 2
  • Timothy Sherwood
    • 3
  1. 1.Department of Computer ScienceNaval Postgraduate SchoolMontereyUSA
  2. 2.Dept. of Computer Science and Eng.University of California, San DiegoLa JollaUSA
  3. 3.Department of Computer ScienceUC, Santa BarbaraSanta BarbaraUSA

Personalised recommendations