Simulating midlet's security claims with automata Modulo theory

PLAS'08: Proceedings of the ACM SIGPLAN 3rd Workshop on Programming Languages and Analysis for Security

Volumn , Issue , 2008, Pages 1-9

  Massacci, Fabio ^a   Siahaan, Ida S R ^a  

^a UNIVERSITY OF TRENTO   (Italy)

Author keywords

Automata; Mobile code; Security policy

Indexed keywords

AUTOMATA; DECIDABLE THEORIES; FAIR SIMULATIONS; MOBILE CODE; MOBILE CODES; MOBILE PLATFORMS; MODULO THEORIES; REALISTIC SCENARIOS; SECURITY POLICY;

BLOOD VESSEL PROSTHESES; CODES (SYMBOLS); COMPUTER SOFTWARE; COMPUTERS; EMBEDDED SYSTEMS; LINGUISTICS; ROBOTS; TECHNICAL PRESENTATIONS; TRANSLATION (LANGUAGES);

AUTOMATA THEORY;

EID: 57349119324     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1375696.1375698     Document Type: Conference Paper

References (30)

1. J, Bacon. Toward pervasive computing. IEEE Pervasive Camp. Magazine, 1(2):84, 2002. ISSN 1536-1268.
2. L. Bauer, J. Ligatti, and D. Walker. More enforceable security policies. In Found, of Camp. Security, 2002.
3. L. Bauer, J. Ligatti, and D. Walker. Composing security policies with polymer. In Proc. of the ACM SIGPIAN 2005 Conf. on Prog. Lang. Design and Implementation, pages 305-314. ACM Press, 2005. ISBN 1-59593-056-6.
4. N. Bielova, M. Dalla Torre, N. Dragoni, and 1. Siahaan. Matching policies with security claims of mobile applications. In Proc. of the 3rd Int. Conf. on Availability, Reliability and Security (ARES'08). IEEE Press, 2008.
5. M. Bozzano, R. Bruttornesso, A. Cirnatti, T. Junttila, S. Ranise, Rv. Rossum, and R. Sebastiani. Efficient satisfiability modulo theories via delayed theory combination. In K. Etessami and S.K. Rajamani, editors, Proc. cf CAV'05, volume 3576 of LNCS, pages 335-349. Springer-Verlag, 2005.
6. J.R. Büchi, On a decision method in restricted second-order arithmetic. In E. Nagel et al., editor, Int. Cong, on Logic, Methodology and Philosophy of Science, pages 1-11. Stanford University Press, 1962.
7. N. Dragoni, F. Massacci, K. Naliuka, and I. Siahaan. Security-by- Contract: Toward a Semantics for Digital Signatures on Mobile Code. In Proc. of EuroPKI'07. Springer-Verlag, 2007a.
8. N. Dragoni, F. Massacci, C. Schaefer, T. Walter, and E. Vetillard. A security-by-contracts architecture for pervasive services. In Proc. of the 3rd Int. Workshop on Security, Privacy and Trust in Pervasive and Ubiquitous Computing. IEEE Press, 2007b.
9. U. Erlingsson. The Inlined Reference Monitor Approach to Security Policy Enforcement. Technical report 2003-1916, Department of Computer Science, Cornell University, 2003.
10. U. Erlingsson and F.B. Schneider, lrm enforcement of Java stack inspection. In Proc. of Symp. on Sec. and Privacy, page 246. IEEE Press, 2000. ISBN 0-7695-0665-8.
11. K. Etessami, T. Wilke, and R. Schuller. Fair simulation relations, parity games, and state space reduction for büchi automata. SIAM J. on Comp., 34(5):1159-1175, 2005. ISSN 0097-5397.
12. S. Gurumurthy, R. Bloem, and F. Somenzi. Fair simulation minimization. In Proc. of CAV'02, pages 610-624. Springer-Verlag, 2002. ISBN 3-540-43997-8.
13. K.W. Hamlen, G. Morrisett, and F.B. Schneider. Certified in-lined reference monitoring on .net. In Proc. of the 2006 workshop on Prog. Lang, and analysis for security, pages 7-16. ACM Press, 2006.
14. M. Hennessy and H. Lin. Symbolic bisimulations. In MFPS'92: Selected papers of the meeting on Math. Foundations of Programming Semantics, pages 353-389. Elsevier Sci. Publishers B. V., 1995.
15. T.A. Henzinger, O. Kupferman, and S.K, Rajamani. Fair simulation. In Proc. of of the 8th Int. Conf. on Concurrency Theory, pages 273-287. Springer-Verlag, 1997.
16. T.A. Henzinger, R. Majumdar, and J.F. Raskin. A classification of symbolic transition systems. ACM Trans. Comput. Logic, 6( 1): 1-32, 2005. ISSN 1529-3785.
17. G.J. Holzmann. The Spin Model Checker: Primer and Reference Manual. Addison-Wesley Professional, 2004.
18. M. Jurdzinski. Small progress measures for solving parity games. InSTXCS '00: Proc. of the 17th Annual Symposium, on Theoretical Aspects of Computer Science, pages 290-301. Springer-Verlag, 2000. ISBN 3-540-67141-2.
19. F. Massacci and I. Siahaan. Matching midlet's security claims with a platform security policy using automata modulo theory. In Proc. of The 12th Nordic Workshop on Secure IT Systems (NordSec'07), 2007.
20. G.C. Necula. Proof-carrying code. In Proc. of the 24th ACM SIGPLAN-SIGACT Symp. on Princ. of Prog. Lang., pages 106-119. ACM Press, 1997. ISBN 0-89791-853-3.
21. G.C. Necula and P. Lee. Safe kernel extensions without run-time checking. In Proc. of the 7th USENIX symposium on Operating systems design and implementation, pages 229-243. ACM Press, 1996. ISBN 1-880446-82-0.
22. R. Nieuwenhuis, A. Oliveras, and C. Tinelli. Solving SAT and SAT Modulo Theories: from an Abstract Davis-Putnam-Logemann-Loveland Procedure to DPLL(T). J. of the ACM, 53(6):937-977, 2006.
23. S. Safra. On the Complexity of omega-Automata. In IEEE Symp. on Found. Comp. Science (FOCS'88), pages 319-327. IEEE Press, 1988.
24. FB. Schneider. Enforceable security policies. TISSEC, 3(l):30-50, 2000.
25. FB. Schneider, J.G. Morrisett, and R. Harper. A language-based approach to security. In Informatics - 10 Years Back. 10 Years Ahead., pages 86-101. Springer-Verlag, 2001. ISBN 3-540-41635-8.
26. R. Sekar, V.N. Venkatakrishnan, S. Basu, S. Bhatkar, and D.C. DuVar-ney. Model-carrying code: a practical approach for safe execution of untrusted applications. In Proc. of the 19th ACM Symp. on Operating Sys. Princ., pages 15-28. ACM Press, 2003. ISBN 1-58113-757-5.
27. D. Vanoverberghe, P. Philippaerts, L. Desmet, W. Joosen, F. Piessens, K. Naliuka, and F. Massacci. A flexible security architecture to support third-party applications on mobile devices. In Proc. of the 1st ACM Comp. Sec. Arch. Workshop, 2007.
28. M.Y. Vardi. Büchi complementation a 40-year saga. March 2006.
29. V. N. Venkatakrishnan, Ram Peri, and R. Sekar. Empowering mobile code using expressive security policies. In Proc. of The 10th New Security-Paradigms Workshop, 2002.
30. B.S. Yee. A sanctuary for mobile agents. In J. Vitek and CD. Jensen, editors, Secure Internet Programming, pages 261-273. Springer-Verlag, 1999.