Feasible reactivity in a synchronous pi-calculus, PPDP, pp.221-230, 2007. ,
URL : https://hal.archives-ouvertes.fr/hal-00130322
Resource control for synchronous cooperative threads, In CONCUR, pp.68-82, 2004. ,
URL : https://hal.archives-ouvertes.fr/hal-00146983
Light types for polynomial time computation in lambda-calculus, LICS, pp.266-275, 2004. ,
URL : https://hal.archives-ouvertes.fr/hal-00012752
Secure computer system: unified exposition and multics interpretation, 1976. ,
A new recursion-theoretic characterization of the polytime functions, Computational Complexity, vol.106, issue.2, pp.97-110, 1992. ,
DOI : 10.1007/BF01201998
Integrity considerations for secure computer systems, Mitre corp Rep, 1977. ,
Quasi-interpretations a way to control resources, Theoretical Computer Science, vol.412, issue.25, 2011. ,
DOI : 10.1016/j.tcs.2011.02.007
URL : https://hal.archives-ouvertes.fr/hal-00591862
Non-interference for concurrent programs, ICALP, pp.382-395, 2001. ,
Proving thread termination, PLDI, pp.320-330, 2007. ,
DOI : 10.1145/1273442.1250771
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.592.1970
Light Linear Logic, Information and Computation, vol.143, issue.2, pp.175-204, 1998. ,
DOI : 10.1006/inco.1998.2700
Linear types and non-size-increasing polynomial time computation, Information and Computation, vol.183, issue.1, pp.57-85, 2003. ,
DOI : 10.1016/S0890-5401(03)00009-9
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.17.216
The expressive power of higher-order types or, life without CONS, Journal of Functional Programming, vol.11, issue.1, pp.5-94, 2001. ,
DOI : 10.1017/S0956796800003889
A flow calculus of wp-bounds for complexity analysis, ACM Trans. Comput. Log, vol.10, issue.4, 2009. ,
Computability and Complexity from a Programming Perspective, 1997. ,
DOI : 10.1007/978-94-010-0413-8_4
A Foundational Delineation of Poly-time, Information and Computation, vol.110, issue.2, pp.391-420, 1994. ,
DOI : 10.1006/inco.1994.1038
Predicative recurrence and computational complexity i: Word recurrence and poly-time, Feasible Mathematrics II, 1994. ,
An elementary affine lambda-calculus with multithreading and side effects, TLCA, pp.138-152, 2011. ,
A Type System for Complexity Flow Analysis, 2011 IEEE 26th Annual Symposium on Logic in Computer Science, pp.123-132, 2011. ,
DOI : 10.1109/LICS.2011.41
URL : https://hal.archives-ouvertes.fr/hal-00591853
Sup-interpretations, a semantic method for static analysis of program resources, ACM Transactions on Computational Logic, vol.10, issue.4, p.27, 2009. ,
DOI : 10.1145/1555746.1555751
URL : https://hal.archives-ouvertes.fr/inria-00446057
Certifying Polynomial Time and Linear/Polynomial Space for Imperative Programs, SIAM Journal on Computing, vol.35, issue.5, pp.1122-1147, 2006. ,
DOI : 10.1137/S0097539704445597
Language-based information-flow security, IEEE Journal on Selected Areas in Communications, vol.21, issue.1, pp.5-19, 2003. ,
DOI : 10.1109/JSAC.2002.806121
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.10.3979
Secure information flow in a multi-threaded imperative language, Proceedings of the 25th ACM SIGPLAN-SIGACT symposium on Principles of programming languages , POPL '98, pp.355-364, 1998. ,
DOI : 10.1145/268946.268975
A sound type system for secure flow analysis, Journal of Computer Security, vol.4, issue.2-3, pp.167-188, 1996. ,
DOI : 10.3233/JCS-1996-42-304