Exploiting Functional Models to Assess the Security Aspect in Embedded System Design

Communications in Computer and Information Science

Volumn 377 CCIS, Issue , 2013, Pages 90-97

  Stierand, Ingo ^a   Malipatlolla, Sunil ^b  

^a UNIVERSITY OF OLDENBURG   (Germany)

^b OFFIS INSTITUTE FOR INFORMATION TECHNOLOGY   (Germany)

Author keywords

Embedded System; Formalization; Real Time; Security Protocols; Validation

Indexed keywords

DATA FLOW ANALYSIS; EMBEDDED SOFTWARE; NETWORK SECURITY;

AUTOMOTIVE EMBEDDED SYSTEMS; FORMALIZATION; FUNCTIONAL MODEL; REAL-TIME; SECURITY ASPECTS; SECURITY FEATURES; SECURITY PROTOCOLS; VALIDATION;

EMBEDDED SYSTEMS;

EID: 84904599156     PISSN: 18650929     EISSN: None     Source Type: Book Series    
DOI: 10.1007/978-3-642-40576-1_10     Document Type: Conference Paper

References (15)

1. Alur, R., Dill, D. L.: A Theory of Timed Automata. Theoretical Computer Science 126(2), 183-235 (1994).
2. Benveniste, A., Berry, G.: The Synchronous Approach to Reactive and Real-Time Systems. Proceedings of the IEEE 79, 1270-1282 (1991).
3. Büker, M., Metzner, A., Stierand, I.: Testing real-time task networks with functional extensions using model-checking. In: Proc. 14th IEEE International Conference on Emerging Technologies & Factory Automation, pp. 564-573. IEEE Press (2009).
4. Cortier, V., Kremer, S. (eds.): Formal Models and Techniques for Analyzing Security Protocols. IOS Press (2011).
5. Crazzolara, F., Winskel, G.: Petri nets in cryptographic protocols. In: Proceedings of the 15th International Parallel & Distributed Processing Symposium, IPDPS 2001, p. 149. IEEE Computer Society, Washington, DC (2001), http://dl. acm. org/citation. cfm?id=645609. 662336.
6. Denning, D. E.: A lattice model of secure information flow. Communications of the ACM 19(5), 236-243 (1976).
7. Faber, J., Stierand, I.: From high-level verification to real-time scheduling: A property-preserving integration. Reports of SFB/TR 14 AVACS 19, SFB/TR 14 AVACS (May 2007), iSSN: 1860-9821, http://www. avacs. org.
8. Fröschle, S.: Adding branching to the strand space model. Electron. Notes Theor. Comput. Sci. 242(1), 139-159 (2009).
9. Fröschle, S., Sommer, N.: Reasoning with Past to Prove PKCS#11 Keys Secure. In: Degano, P., Etalle, S., Guttman, J. (eds.) FAST 2010. LNCS, vol. 6561, pp. 96-110. Springer, Heidelberg (2011).
10. Ghamarian, A. H., Geilen, M. C. W., Basten, T., Theelen, B. D., Mousavi, M. R., Stuijk, S.: Liveness and boundedness of synchronous data flow graphs. In: FMCAD 2006: Proceedings of the Formal Methods in Computer Aided Design, pp. 68-75. IEEE Computer Society, Washington, DC (2006).
11. Lowe, G.: Analysing Security Protocols Using CSP. In: Cortier, Kremer (eds.) [4] (2011).
12. Malipatlolla, S., Stierand, I.: Evaluating the Impact of Integrating a Security Module on the Real-Time Properties of a System. In: Schirner, G., Götz, M., Rettberg, A., Zanella, M. C., Rammig, F. J. (eds.) IESS 2013. IFIP AICT, vol. 403, pp. 343-352. Springer, Heidelberg (2013).
13. Fabrega, F. J. T., Herzog, J. C., Guttman, J. D.: Strand spaces: why is a security protocol correct? In: IEEE Symposium on Security and Privacy, pp. 160-171 (1998).
14. Tindell, K. W., Burns, A., Wellings, A. J.: Allocating hard real-time tasks: An NPHard problem made easy. Real-Time Systems 4, 145-165 (1992).
15. Yip, A., Wang, X., Zeldovich, N., Kaashoek, M. F.: Improving application security with data flow assertions. In: Proceedings of the ACM SIGOPS 22nd Symposium on Operating Systems Principles, pp. 291-304. ACM (2009).