F. Pottier and S. Conchon. Information ow inference for free. In Proceedings ICFP'00, 2000.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....limited form of declassi cation. Ferrari et al. 4] augment information ow controls in an object oriented system with a form of dynamically checked declassi cation called waivers. However, these e orts provide only limited characterization of the safety of declassi cation. Pottier and Conchon [15] argue that access control and information ow are orthogonal issues, and that the use of declassi cation mechanisms can be moderated by access controls. This proposal seems similar to Jif s use of authority declarations. Whether access control alone is sucient in practice to regulate declassi ....

Francois Pottier and Sylvain Conchon. Information ow inference for free. In Proc. 5th ACM SIGPLAN International Conference on Functional Programming (ICFP), pages 46-57, September 2000.

....which happens to be public, that is, not secret. We try to use public key only with the latter meaning, and prefer encryption key for the former. The type system. The type system is based on old ideas on secrecy levels [15] and on the newer trend of representing these levels in types (e.g. [1, 11, 19 21, 29, 30, 33, 35]) For example, Public and Secret are the types of public data and secret data, respectively. In addition, the type system gives information on the intended usage and structure of data, like standard type systems. For example, T 1 ; T 2 ] is the type of a secret encryption key that is used to ....

Francois Pottier and Sylvain Conchon. Information ow inference for free. In Proceedings of the 2000.

....which can be assumed to be the kernel of more sophisticated practical languages. 22 The question of secure information ow and noninterference has also been investigated in the setting of process calculi [5, 15] More recently, there have been studies on noninterference for functional languages [14] and mobile process calculi [9] 8] and [7] The latter papers are closer to our work, as they use a type system to enforce noninterference. The treatment in [9] and [8] however, seems overly restrictive: it amounts (at least in the core calculus) to forbid all control ow from actions on high ....

....from actions on high channels to actions on low channels. In [9] the core calculus is extended with more sophisticated constructs; in the extended calculus some actions may be classi ed as innocuous , and the restriction on control ow may be relaxed when these actions are involved. The papers [14] and [7] are less restrictive and closer in spirit to our approach, as they try to distinguish the dangerous control ow (implementing information ow) from the harmless control ow which should not be restricted. Another related paper is [1] which studies secrecy properties in security protocols ....

F. Pottier and S. Conchon. Information ow inference for free. In Proceedings ICFP'00, 2000.

....also the heart of several other analyses. For example, this is the case for security analysis [12, 20, 25] and for useless code analysis [5, 15, 26] program slice analysis etc. Several researchers have addressed the problem of how to systematically extend a type system with dependency information [1, 9, 18, 19]. The goal of these researchers is similar to ours, but generally more limited with respect to scope. F ahndrich and Rehof have recently proposed a new method for ow analysis [8] In the absence of recursive types, the method o ers improved worst case time complexity for ow analysis, namely ....

F. Pottier and S. Conchon. Information ow inference for free. In Proc. 5th Int. Conf. Functional Programming (ICFP'00), pages 46-57. ACM Press, 2000.

....formal results obtained in this area concern extremely reduced programming INRIA, BP 105, F 78153 Le Chesnay Cedex, France. To be presented at the 29 th ACM Symposium on Principles Of Programming Languages, Portland, Oregon, January 2002. languages. Several papers address pure calculi [8, 1, 16]. Volpano et al. 22, 21] study a core imperative programming language, where all variables store integers. Standing in sharp contrast, Myers [10, 11] considers the full Java language, including objects, exceptions, parameterized classes, etc. However, he does not give a formal proof of ....

....et al. 2] devised a labelled operational semantics of the calculus, where the labels attached to a term indicate how much information it carries. Executing a program under such a semantics amounts to performing a dynamic dependency analysis along with the actual computation. Pottier and Conchon [16] later showed how static, type based dependency analyses could be systematically derived, and proven safe, from such a labelled semantics. Unfortunately, in a programming language with side ef fects, it is possible to leak information through the absence of a certain e ect. Indeed, consider the ....

[Article contains additional citation context not shown here]

Francois Pottier and Sylvain Conchon. Information ow inference for free. In Proceedings of the the Fifth ACM SIGPLAN International Conference on Functional Programming (ICFP'00), pages 46-57, September 2000. URL: http://pauillac.inria.fr/~fpottier/publis/ fpottier-conchon-icfp00.ps.gz.

No context found.

F. Pottier and S. Conchon. Information ow inference for free. In Proceedings ICFP'00, 2000.

No context found.

Francois Pottier and Sylvain Conchon. Information ow inference for free. In Proc. 5th ACM SIGPLAN International Conference on Functional Programming (ICFP), pages 46-57, September 2000.

No context found.

Pottier, F. and Conchon, S, Information ow inference for free, ICFP00, 46-57, ACM, 2000.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC