An approach to synthesise safe systems

International Journal of Security and Networks

Volumn 1, Issue 1-2, 2006, Pages 62-74

  Jhumka, Arshad ^a   Freiling, Felix ^b   Fetzer, Christof ^c   Suri, Neeraj ^d  

^a UNIVERSITY OF WARWICK   (United Kingdom)

^b UNIVERSITY OF MANNHEIM   (Germany)

^c DRESDEN UNIVERSITY OF TECHNOLOGY   (Germany)

^d DARMSTADT UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

formal methods; program transformation; reliability; safe systems; security

Indexed keywords

EID: 77954341184     PISSN: 17478405     EISSN: 17478413     Source Type: Journal    
DOI: 10.1504/ijsn.2006.010824     Document Type: Article

References (25)

1. Alpern, B. and Schneider, F.B. (1985) ‘Defining liveness’, Information Processing Letters, Vol. 21, pp.181–185.
2. Arora, A., Attie, P.C. and Emerson, E.A. (1998) ‘Synthesis of fault-tolerant concurrent programs’, Proceedings of the 17th Annual ACM Symposium on Principles of Distributed Computing (PODC’98), pp.173–182.
3. Arora, A. and Kulkarni, K.S. (1998) ‘Component based design of multitolerant systems’, IEEE Transactions on Software Engineering, Vol. 24 No. 1, pp.63–78.
4. Arora, A. and Kulkarni, S.S. (1991) ‘Detectors and correctors: a theory of fault-tolerance components’, Proceedings of the 18th IEEE International Conference on Distributed Computing Systems (ICDCS98), pp.436–443.
5. Chandy, K.M. and Misra, J. (1988) Parallel Program Design: A Foundation, Reading, MA: Addison-Wesley.
6. Chen, H. and Wagner, D. (2002) ‘MOPS: an infrastructure for examining security properties of software’, SIGSAC: Ninth ACM Conference on Computer and Communications Security, ACM SIGSAC, pp.235–244.
7. Dijkstra, E.W. (1975) ‘Guarded commands, nondeterminacy, and formal derivation of programs’, Communications of the ACM, Vol. 18, No. 8, pp.453–457.
8. Erlingsson, Ú. and Schneider, F.B. (2000) ‘IRM enforcement of java stack inspection’, IEEE Symposium on Security and Privacy, pp.246–255.
9. Gärtner, F. (1999) ‘Transformational approaches to the specification and verification of fault-tolerant systems: formal background and classification’, Journal of Universal Computer Science (J.UCS), Vol. 5, No. 10, pp.668–692, October, Special Issue on Dependability Evaluation and Assessment.
10. Gärtner, F.C. and Jhumka. A. (2004) ‘Automating the addition of fail-safe fault-tolerance: beyond fusion-closed specifications’, Proceedings of Formal Techniques in Real-Time and Fault-Tolerant Systems (FTRTFT), Grenoble, France, September, pp.183–198.
11. Gumm, H.P. (1993) ‘Another glance at the Alpern-Schneider characterization of safety and liveness in concurrent executions’, Information Processing Letters, Vol. 47, No. 6, pp.291–294.
12. Hamlen, K.W., Morrisett, G. and Schneider, F.B. (2000) ‘Computability classes for enforcement mechanisms’, j-TOPLAS, Vol. 28, No. 1, pp.175–205.
13. Hiller, M. (2000) ‘Executable assertions for detecting data errors in embedded control systems’, Proceedings of the International Conference on Dependable Systems and Network (DSN 2000), pp.24–33.
14. Jhumka, A., Hiller, M., Claesson, V. and Suri, N. (2002) ‘On systematic design of consistent executable assertions for distributed embedded software’, Proceedings of the ACM Joint Conference on Languages, Compilers and Tools for Embedded Systems/Software and Compilers for Embedded Systems (LCTES/SCOPES), pp.74–83.
15. Kulkarni, S.S. (1999) ‘Component based design of fault-tolerance’, PhD Thesis, Department of Computer and Information Science, The Ohio State University.
16. Kulkarni, S.S. and Arora, A. (2000) ‘Automating the addition of fault-tolerance’, in M. Joseph (Ed). Formal Techniques in Real-Time and Fault-Tolerant Systems, Sixth International Symposium (FTRTFT 2000) Proceedings, No. 1926 in Lecture Notes in Computer Science, Pune, India, September, Springer-Verlag, pp.82–93.
17. Kulkarni, S.S. and Ebnenasir, A. (2002) ‘Complexity of adding failsafe fault-tolerance’, Proceedings of the 22nd IEEE International Conference on Distributed Computing Systems (ICDCS 2002), IEEE Computer Society Press, pp.337–344.
18. Lamport, P. (1977) ‘Proving the correctness of multiprocess programs’, IEEE Transactions on Software Engineering, Vol. 3, No. 2, pp.125–143.
19. Leveson, N.G., Cha, S.S., Knight, J.C. and Shimeall, T.J. (1990) ‘The use of self checks and voting in software error detection: an empirical study’, IEEE Transactions on Software Engineering, Vol. 16, No. 4, pp.432–443.
20. Ligatti, J., Bauer, L. and Walker, D. (2005) ‘Edit automata: enforcement mechanisms for run-time security policies’, International Journal of Information Security, Vol. 4, Nos. 1/2, pp.2–16.
21. Liu, Z. (1991) ‘Fault-tolerant programming by transformations’, PhD Thesis, University of Warwick, Department of Computer Science.
22. Liu, Z. and Joseph, M. (1992) ‘Transformation of programs for fault-tolerance’, Formal Aspects of Computing, Vol. 4, No. 5, pp.442–469.
23. Peled, D. and Joseph, M. (1994) ‘A compositional framework for fault-tolerance by specification transformation’, Theoretical Computer Science, Vol. 128, pp.99–125.
24. Powell, D. (1992) ‘Failure mode assumptions and assumption coverage’, In D.K. Pradhan (Ed). Proceedings of the 22nd Annual International Symposium on Fault-Tolerant Computing (FTCS ’92), July, Boston, MA: IEEE Computer Society Press, pp.386–395.
25. Schneider, F.B. (2000) ‘Enforceable security policies’, ACM Transactions on Information System Security, Vol. 3, No. 1, pp.30–50.