Abadi, M., Banerjee, A., Heintze, N., and Riecke, J. A core calculus of dependency. In POPL '99, Proceedings of the 26th Annual ACM Symposium on Principles of Programming Languages (January 1999), 1999.
Abadi, M. and Plotkin, G. A per model of polymorphism and recursive types. In Proceedings of the Fifth Annual Symposium on Logic in Computer Science, 1990, pp. 355-365.
Andrews, G.R. and Reitman, R.P. An axiomatic approach to information flow in programs. ACM TOPLAS
(1) (1980) 56-75.Google Scholar
Banâ tre, J.-P., Bryce, C., and Le Métayer, D. Compile-time detection of information flow in sequential programs. In Computer Security-ESORICS '94, 3rd European Symposium on Research in Computer Security, 1994, D. Gollmann (Ed.). pp. 55-73. Vol. 875 of Lecture Notes in Computer Science.
Bell, D. and LaPadula, L. Secure computer systems: Unified exposition and multics interpretation. MTR-2997, Rev. 1, The MITRE Corporation, Bedford, Mass, 1976.Google Scholar
Cohen, E.S. Information transmission in computational systems. ACM SIGOPS Operating Systems Review
(5) (1977) 133-139.Google Scholar
Cohen, E.S. Information transmission in sequential programs. In Foundations of Secure Computation, R.A. DeMillo, D.P. Dobkin, A.K. Jones, and R.J. Lipton (Eds.). Academic Press, 1978, pp. 297-335.
Das, M., Reps, T., and Hentenryck, P.V. Semantic foundations of binding-time analysis for imperative programs. Partial Evaluation and Seman-tics-Based Program Manipulation. La Jolla, California, 1995, pp. 100-110.
Denning, D.E. A lattice model of secure information flow. Communications of the ACM
(5) (1976) 236-243.Google Scholar
Denning, D.E. and Denning, P.J. Certification of programs for secure information flow. Communications of the ACM
(7) (1977) 504-513.Google Scholar
Focardi, R. and Gorrieri, R. A classification of security properties for process algebra. J. Computer Security
(1) (1994) 5-33.Google Scholar
Goguen, J. and Meseguer, J. Security policies and security models. In Proceedings of the IEEE Symposium on Security and Privacy, 1982.
Gray III, J. Probabilistic interference. In Proceedings of the IEEE Symposium on Security and Privacy, Oakland, California, 1990, pp. 170-179.
Hankin, C.L. and Le Métayer, D. A type-based framework for program analysis. In Proceedings of the First Static Analysis Symposium, 1994. Vol. 864 of LNCS.
Heintze, N. and Riecke, J.G. The slam calculus: Programming with secrecy and integrity. In Conference Record of POPL'98: The 25th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, San Diego, California 1998, pp. 365-377.
Henglein, F. and Sands, D. A semantic model of binding times for safe partial evaluation. In Proc. Programming Languages: Implementations, Logics and Programs (PLILP), Utrecht, The Netherlands, M. Hermenegildo and S.D. Swierstra (Eds.). 1995, pp. 299-320. Vol. 982 of Lecture Notes in Computer Science.
Hunt, L.S. Abstract interpretation of functional languages: From theory to practice. Ph.D. thesis, Department of Computing, Imperial College of Science, Technology and Medicine, 1991.
Hunt, S. PERs generalise projections for strictness analysis. In Draft Proceedings of the third glasgow Functional Programming Workshop. Ullapool, 1900.
Hunt, S. and Sands, D. Binding time analysis: A new perspective. In Proceedings of the ACM Symposium on Partial Evaluation and Semantics-Based Program Manipulation (PEPM'91), 1991, pp. 154-164. ACM SIGPLAN Notices
Jensen, T.P. Abstract interpretation in logical form. Ph.D. thesis, Imperial College, University of London. 1992. Available as DIKU Report 93/11 from DIKU, University of Copenhagen.
Jones, C. and Plotkin, G.D. A probabilistic powerdomain of evaluations. In Proceedings, Fourth Annual Symposium on Logic in Computer Science, Asilomar Conference Center, Pacific Grove, California, 1989, pp. 186-195.
Kozen, D. Semantics of probabilistic programs. Journal of Computer and System Sciences
(1981) 328-350.Google Scholar
Kozen, D. A probabilistic PDL. Journal of Computer and System Sciences
(1985) 162-178.Google Scholar
Launchbury, J. Projection factorisations in partial evaluation. Ph.D. thesis, Department of Computing, University of Glasgow, 1989.
Leino, K.R.M. and Joshi, R. A semantic approach to secure information flow. In MPC'98, 1998.
Leino, K.R.M. and Joshi, R. A semantic approach to secure information flow. Science of Computer Programming
(1-3) (2000) 113-138.Google Scholar
Manes, E. Graduate Texts in Mathematics. Vol. 26, 1976, Springer-Verlag.
McCullough, D. Specifications for multi-level security and hook-up property. In Proceedings of the IEEE Symposium on Security and Privacy, 1987, pp. 161-166.
McLean, J. Security models and information flow. In Proceedings of the IEEE Symposium on Security and Privacy, Oakland, California, 1990a, pp. 180-187.
McLean, J. The specification and modeling of computer security. Computer
(1) (1990b) 9-16.Google Scholar
McLean, J. Security models. In Encyclopedia of Software Engineering, J. Marciniak (Ed.). Wiley &;;; Sons. 1994.
Mizuno, M. and Schmidt, D. Ascurity flowcontrol algorithm and its denotational semantics correctness proof. Formal Aspects of Computing
(6A) (1992) 727-754.Google Scholar
Moskowitz, I.S. and Costich, O.L. A classical automata approach to noninterference type problems. In The Computer Security Foundations Workshop V proceedings, the Franconia Inn, Franconia, New Hampshire. June 16-18, 1992, pp. 2-8.
Nielson, F. Two-level semantics and abstract interpretation. Theoretical Computer Science-Fundamental Studies
(1989) 117-242.Google Scholar
Ørbæ k, P. Can you trust your data?. In Proceedings of the TAPSOFT/FASE'95 Conference, P.D. Mosses, M.I. Schwartzbach, and M. Nielsen (Eds.). Aarhus, Denmark, 1995, pp. 575-590.
Ørbæ k, P. Trust and dependence analysis. Ph.D. thesis, Dept. of Computer Science, Univ. of Aarhus. BRICS report DS-97-2, 1997.
Ørbæ k, P. and Palsberg, J. Trust in the λ-calculus. Journal of Functional Programming
Plotkin, G. Post-graduate lecture notes in advanced domain theory (incorporating the “Pisa Notes”). Dept. of Computer Science, Univ. of Edinburgh. 1981.
Plotkin, G.D. A power domain construction. SIAM Journal on Computing
(3) (1976) 452-487.Google Scholar
Reynolds, J.C. Types, abstraction and parametric polymorphism. In Proceedings 9th IFIP World Computer Congress, Information Processing '83, Paris, France, 19-23 Sept 1983
, R.E.A. Mason (Ed.). North Holland, Amsterdam; 1983, pp. 513-523.Google Scholar
Sabelfeld, A. and Sands, D. A per model of secure information flow in sequential programs. In Proceedings of the 8th European Symposium on Programming, ESOP'99, Amsterdam, 1999, pp. 40-58.
Sabelfeld, A. and Sands, D. Probabilistic noninterference for multi-threaded programs. In Proceedings of the 13th IEEE Computer Security Foundations Workshop, Cambridge, England, 2000.
Smith, G. and Volpano, D. Secure information flow in a multi-threaded imperative language. In Conference Record of POPL '98: The 25th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 1998, pp. 355-364.
Smyth, M.B. Power domains. Journal of Computer and Systems Sciences
(1) (1978) 23-36.Google Scholar
Thiemann, P. and Klaeren, H. Binding-time analysis by security analysis. Universitt Tübingen, 1997.
Volpano, D. and Smith, G. Eliminating covert flows with minimum typings. In Proc. 10th IEEE Computer Security Foundations Workshop, 1997, pp. 156-168.
Volpano, D. and Smith, G. Probabilistic noninterference in a concurrent language. Journal of Computer Security
(2,3) (1999) 231-253.Google Scholar
Volpano, D., Smith, G., and Irvine, C. A sound type system for secure flow analysis. J. Computer Security
(3) (1996) 1-21.Google Scholar
Wadler, P. Theorems for free. Functional Programming Languages and Computer Architecture. 1989, pp. 347-359.
Wadler, P. and Hughes, R.J.M. Projections for strictness analysis. In 1987 Conference on Functional Programming and Computer Architecture, Portland, Oregon, 1987, pp. 385-407.