History effects and verification

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3302, Issue , 2004, Pages 107-128

  Skalka, Christian ^a   Smith, Scott ^b  

^a UNIVERSITY OF VERMONT   (United States)

^b JOHNS HOPKINS UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CALCULATIONS; COMPUTATIONAL LINGUISTICS; DIFFERENTIATION (CALCULUS); INFERENCE ENGINES;

HIGHER-ORDER PROGRAMS; LOGICAL PROPERTIES; MODEL-CHECKING TECHNIQUES; PROGRAM EXECUTION; SECURITY MECHANISM; SEQUENCE OF EVENTS; TYPE AND EFFECT SYSTEMS; TYPE INFERENCE ALGORITHM;

MODEL CHECKING;

EID: 35048838770     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30477-7_8     Document Type: Article

References (27)

1. Martín Abadi and Cédric Fournet. Access control based on execution history. In Proceedings of the 10th Annual Network and Distributed System Security Symposium (NDSS'03), feb 2003.
2. T. Amtoft, F. Nielson, and H. R. Nielson. Type and Effect Systems. Imperial College Press, 1999.
3. Thomas Ball and Sriram K. Rajamani. Bebop: A symbolic model checker for boolean programs. In SPIN, pages 113-130, 2000.
4. F. Besson, T. Jensen, D. Le Métayer, and T. Thorn. Model checking security properties of control flow graphs. J. Computer Security, 9:217-250, 2001.
5. Frédéric Besson, Thomas de Grenier de Latour, and Thomas Jensen. Secure calling contexts for stack inspection. In Proceedings of the Fourth ACM SIGPLAN Conference on Principles and Practice of Declarative Programming (PPDP'02), pages 76-87. ACM Press, 2002.
6. O. Burkart, D. Caucal, F. Moller, , and B. Steffen. Verification on infinite structures. In S. Smolka J. Bergstra, A. Pons, editor, Handbook on Process Algebra. North-Holland, 2001.
7. Hao Chen and David Wagner. MOPS: an infrastructure for examining security properties of software. In Proceedings of the 9th ACM Conference on Computer and Communications Security, pages 235-244, Washington, DC, November 18-22, 2002.
8. Thomas Colcombet and Pascal Fradet. Enforcing trace properties by program transformation. In 27th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 54-66, 2000.
9. Guy Edjlali, Anurag Acharya, and Vipin Chaudhary. History-based access control for mobile code. In ACM Conference on Computer and Communications Security, pages 38-48, 1998.
10. Jonathan Eifrig, Scott Smith, and Valery Trifonov. Type inference for recursively constrained types and its application to OOP. volume 1, 1995. http://www.elsevier.nl/locate/entcs/volumel.html.
11. J. Esparza. On the decidability of model checking for several mu-calculi and Petri nets. In Proceeding of CAAP '94, volume 787 of Lecture. Notes in Computer Science, 1994.
12. J. Esparza, A. Kucera, and S. Schwoon. Model-checking LTL with regular valuations for pushdown systems. In TACS: 4th International Conference on Theoretical Aspects of Computer Software, 2001.
13. Atsushi Igarashi and Naoki Kobayashi. Resource usage analysis. In Conference Record of POPL'02: The 29th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 331-342, Portland, Oregon, January 2002.
14. T. Jensen, D. Le Métayer, and T. Thorn. Verification of control flow based security properties. In Proceedings of the 1999 IEEE Symposium on Security and Privacy, 1999.
15. P. J. Stuckey K. Marriott and M. Sulzmann. Resource usage verification. In Proc. of First Asian Programming Languages Symposium, APLAS 2003, 2003.
16. Naoki Kobayashi. Time regions and effects for resource usage analysis. In Proceedings of ACM SIGPLAN International Workshop on Types in Languages Design and Implementation (TLDI'03), 2003.
17. Dexter Kozen. Results on the propositional mu-calculus. Theoretical Computer Science, 27:333-354, December 1983.
18. Yitzhak Mandelbaum, David Walker, and Robert Harper. An effective theory of type refinements. In Proceedings of the the Eighth ACM SIGPLAN International Conference on Functional Programming (ICFP'03), Uppsala, Sweden, August 2003.
19. François Pottier, Christian Skalka, and Scott Smith. A systematic approach to static access control. In David Sands, editor, Proceedings of the 10th European Symposium on Programming (ESOP'01), volume 2028 of Lecture Notes in Computer Science, pages 30-45. Springer Verlag, April 2001.
20. Fred B. Schneider. Enforceable security policies. Information and System Security, 3(1):30-50, 2000.
21. Christian Skalka and Scott Smith. Static enforcement of security with types. In Proceedings of the the Fifth ACM SIGPLAN International Conference on Functional Programming (ICFP'OO), pages 34-45, Montréal, Canada, September 2000.
22. Christian Skalka and Scott Smith. History types and verification. Extended manuscript, http://www.cs.uvm.edu/~skalka/skalka-smith-tr04.ps, 2004.
23. B. Steffen and O. Burkart. Model checking for context-free processes. In CONCUR'92, Stony Brook (NY), volume 630 of Lecture Notes in Computer Science (LNCS), pages 123-137, Heidelberg, Germany, 1992. Springer-Verlag.
24. Chris Stone. Singleton types and singleton kinds. Technical Report CMU-CS-00-153, Carnegie Mellon University, 2000.
25. Jean-Pierre Talpin and Pierre Jouvelot. The type and effect discipline. In Seventh Annual IEEE Symposium on Logic in Computer Science, Santa Cruz, California, pages 162-173, Los Alamitos, California, 1992. IEEE Computer Society Press.
26. David Walker. A type system for expressive security policies. In Conference Record of POPL'00: The 27th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 254-267, Boston, Massachusetts, January 2000.
27. Dan S. Wallach and Edward Felten. Understanding Java stack inspection. In Proceedings of the 1998 IEEE Symposium on Security and Privacy, May 1998.