Author:
Hainry Emmanuel,Péchoux Romain
Subject
Computational Theory and Mathematics,Computer Science Applications,Information Systems,Theoretical Computer Science
Reference34 articles.
1. A new recursion-theoretic characterization of the poly-time functions;Bellantoni;Comput. Complex.,1992
2. Lambda calculus characterizations of poly-time;Leivant;Fundam. Inform.,1993
3. A sound type system for secure flow analysis;Volpano;J. Comput. Secur.,1996
4. Objects in polynomial time;Hainry,2015
5. A type system for complexity flow analysis;Marion,2011
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Declassification Policy for Program Complexity Analysis;Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science;2024-07-08
2. A General Noninterference Policy for Polynomial Time;Proceedings of the ACM on Programming Languages;2023-01-09
3. ComplexityParser: An Automatic Tool for Certifying Poly-Time Complexity of Java Programs;Theoretical Aspects of Computing – ICTAC 2021;2021