Author:
Hainry Emmanuel,Marion Jean-Yves,Péchoux Romain
Publisher
Springer Berlin Heidelberg
Reference23 articles.
1. Amadio, R.M., Dabrowski, F.: Feasible reactivity for synchronous cooperative threads. Electron. Notes Theor. Comput. Sci. 154(3), 33–43 (2006)
2. Amadio, R.M., Dabrowski, F.: Feasible reactivity in a synchronous pi-calculus. In: Proceedings of the 9th ACM SIGPLAN International Conference on Principles and Practice of Declarative Programming, PPDP 2007, pp. 221–230. ACM, New York (2007)
3. Biba, K.: Integrity considerations for secure computer systems. Technical report, Mitre corp Rep. (1977)
4. Buss, S.R.: The boolean formula value problem is in ALOGTIME. In: Proceedings of the Nineteenth Annual ACM Symposium on Theory of Computing, STOC 1987, pp. 123–131. ACM, New York (1987)
5. Chandra, A., Kozen, D., Stockmeyer, L.: Alternation. J. ACM 28(1), 114–133 (1981)
Cited by
11 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. Causal computational complexity of distributed processes;Information and Computation;2023-01
4. Types for Complexity of Parallel Computation in Pi-calculus;ACM Transactions on Programming Languages and Systems;2022-07-15
5. A tier-based typed programming language characterizing Feasible Functionals;Logical Methods in Computer Science;2022-02-24