ConSpec - A Formal Language for Policy Specification

Electronic Notes in Theoretical Computer Science

Volumn 197, Issue 1, 2008, Pages 45-58

  Aktug, Irem ^a   Naliuka, Katsiaryna ^b  

^a ROYAL INSTITUTE OF TECHNOLOGY   (Sweden)

^b UNIVERSITY OF TRENTO   (Italy)

Author keywords

ConSpec; security automata; security policy; Specification languages

Indexed keywords

AUTOMATA THEORY; LIFE CYCLE; SECURITY OF DATA; SEMANTICS; SPECIFICATION LANGUAGES;

CONSPEC; SECURITY AUTOMATA; SECURITY POLICY;

FORMAL LANGUAGES;

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

References (16)

1. Aktug I., Gurov D., Piessens F., Seehusen F., Vanoverberghe D., and Vétillard E. Static analysis algorithms and tools for code-contract compliance. Public Deliverable D3.1.2, S3MS (2006). http://s3ms.org
2. Bauer, L., J. Ligatti and D. Walker, A language and system for composing security policies, Technical Report TR-681-03, Princeton University (2004)
3. Courcoubetis C., Vardi M., Wolper P., and Yannakakis M. Memory-efficient algorithms for the verification of temporal properties. Form. Methods Syst. Des. 1 (1992) 275-288
4. Dragoni, N., F. Massacci, K. Naliuka and I. Siahaan, Security-by-contract: Toward a semantics for digital signatures on mobile code, in: European PKI Workshop: Theory and Practice (to appear), 2007
5. Erlingsson, U., "The inlined reference monitor approach to security policy enforcement," Ph.D. thesis, Dep. of Computer Science, Cornell University (2004)
6. Erlingsson, U. and F. B. Schneider, SASI enforcement of security policies: a retrospective, in: Proc. of the Workshop on New Security Paradigms (NSPW '99) (2000), pp. 87-95. URL http://research.microsoft.com/users/ulfar/tr99_1758.pdf
7. Havelund K., and Rosu G. Efficient monitoring of safety properties. Int. J. on Software Tools for Technology Transfer (2004)
8. Holzmann G.J. The model checker SPIN. Software Engineering 23 (1997) 279-295
9. Hopcroft J.E. On the equivalence and containment problems for context-free languages. Theory of Computing Systems 3 (1969) 119-124
10. Hunt H.B., and Rosenkrantz D.J. On equivalence and containment problems for formal languages. J. ACM 24 (1977) 387-396
11. Kesten Y., Manna Z., McGuire H., and Pnueli A. A decision algorithm for full propositional temporal logic. CAV (1993) 97-109
12. Ligatti J., Bauer L., and Walker D. Edit automata: enforcement mechanisms for run-time security policies. Int. J. of Information Security (2003)
13. Necula, G.C., Proof-carrying code, in: ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 1997
14. Schneider F.B. Enforceable security policies. ACM Transactions on Information and System Security 3 (2000) 30-50
15. Sekar, R., V. Venkatakrishnan, S. Basu, S. Bhatkar and D. C. DuVarney, Model-carrying code: a practical approach for safe execution of untrusted applications, ACM SIGOPS Operating Systems Review (2003)
16. Zobel A., Simoni C., Piazza D., Nuez X., and Rodriguez D. Business case and security requirements. Public Deliverable D5.1.1, S3MS ((2006). http://s3ms.org