An Approach for the Specification, Verification and Synthesis of Secure Systems

Electronic Notes in Theoretical Computer Science

Volumn 168, Issue SPEC. ISS., 2007, Pages 29-43

  Martinelli, Fabio ^a   Matteucci, Ilaria ^a,b  

^a Istituto di informatica e telematica del Consiglio nazionale delle ricerche   (Italy)

^b UNIVERSITY OF SIENA   (Italy)

Author keywords

open system analysis; partial model checking; secure systems analysis; synthesis of controller operators

Indexed keywords

CONTROLLER OPERATORS; OPEN SYSTEM ANALYSIS; PARTIAL MODEL CHECKING; SECURE SYSTEMS ANALYSIS;

AUTOMATION; FORMAL LOGIC; INTELLIGENT CONTROL; MATHEMATICAL MODELS; SPECIFICATIONS;

SECURITY SYSTEMS;

EID: 33846587542     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.entcs.2006.12.003     Document Type: Article

References (23)

1. Andersen, H., "Verification of Temporal Properties of Concurrent Systems," Ph.D. thesis, Department of Computer Science, Aarhus University, Denmark (1993)
2. Andersen H.R. Partial Model Checking (Extended Abstract). Proceedings of the 10th Annual IEEE Symposium on Logic in Computer Science (1995), IEEE Computer Society Press 398-407
3. Bauer, L., J. Ligatti and D. Walker, More Enforceable Security Policies, in: I. Cervesato, editor, Foundations of Computer Security: Proceedings of the FLoC'02 workshop on Foundations of Computer Security (2002), pp. 95-104
4. Bauer L., Ligatti J., and Walker D. Edit Automata: Enforcement Mechanisms for Run-time Security Policies. International Journal of Information Security 4 (2005) 2-16
5. Bradfield J., and Stirling C. Modal logics and mu-calculi: an introduction. Handbook of Process Algebra (2001), Elsevier
6. Focardi R., and Gorrieri R. A Classification of Security Properties for Process Algebras. Journal of Computer Security 3 (1994/1995) 5-33
7. Focardi R., Gorrieri R., and Martinelli F. Classification of Security Properties - Part II: Network Security. Tutorial Lectures of the International School on Foundations of Security Analysis and Design. (FOSAD'02). Lecture Notes in Computer Science 2946 (2004) 139-185
8. Focardi R., and Martinelli F. A Uniform Approach for the Definition of Security Properties. FM'99: Proceedings of the Wold Congress on Formal Methods in the Development of Computing Systems-Volume I. Lecture Notes in Computer Science 1708 (1999) 794-813
9. Gnesi S., Lenzini G., and Martinelli F. Applying Generalized Non Deducibility on Compositions (GNDC) Approach in Dependability. Electronic Notes in Theoretical Computer Science 99 (2004) 111-126
10. Goguen, J.A. and J. Meseguer, Security Policy and Security Models, in: Proceedings of the 1982 Symposium on Security and Privacy (1982), pp. 11-20
11. Hoare C.A.R. Communicating Sequential Processes (1985), Prentice-Hall
12. Kupferman O., and Vardi M.Y. Module checking. In: Alur R., and Henzinger T.A. (Eds). Proceedings of the Eighth International Conference on Computer Aided Verification. Lecture Notes in Computer Science 1102 (1996) 75-86
13. Lowe, G., A Hierarchy of Authentication Specification, in: Proceedings of the 10th Computer Security Foundation Workshop (1997), pp. 31-43
14. Martinelli, F., "Formal Methods for the Analysis of Open Systems with Applications to Security Properties," Ph.D. thesis, University of Siena (1998)
15. Martinelli, F., Module Checking through Partial Model Checking, Technical Report 2002-TR-06, IIT-CNR (2002)
16. Martinelli F. Analysis of security protocols as open systems. Theoretical Computer Science 290 (2003) 1057-1106
17. Martinelli, F. and I. Matteucci, Modeling Security Automata with process algebras and related results (2006), presented at the 6th International Workshop on Issues in the Theory of Security (WITS'06) - Informal proceedings
18. Martinelli F., and Matteucci I. Through modeling to Synthesis of Security Automata. Proceedings of the 2nd International Workshop on Security and Trust Management. (STM'06). Electronic Notes in Theoretical Computer Science (2006)
19. Matteucci I. Automated synthesis of enforcing mechanisms for security properties in a timed setting. Proceedings of the Workshop on Information and Computer Security. (ICS'06). Electronic Notes in Theoretical Computer Science (2006)
20. Milner R. Communicating and mobile systems: the π-calculus (1999), Cambridge University Press
21. Müller-Olm M. Derivation of Characteristic Formulae. MFCS'98 Workshop on Concurrency. Electronic Notes in Theoretical Computer Science 18 (1998)
22. Schneider F.B. Enforceable security policies. ACM Transactions on Information and System Security 3 (2000) 30-50
23. Street R.S., and Emerson E.A. An automata theoretic procedure for the propositional μ-calculus. Information and Computation 81 (1989) 249-264