Funder
Japan Science and Technology Agency
Austrian Science Fund
European Research Council
Agence Nationale de la Recherche
Japan Society for the Promotion of Science
Reference39 articles.
1. PMaude: Rewrite-based specification language for probabilistic object systems;Agha;Electron. Notes Theor. Comput. Sci.,2006
2. Verifying Polytime Computability Automatically;Avanzini,2013
3. On probabilistic term rewriting;Avanzini,2018
4. Modular runtime complexity analysis of probabilistic while programs;Avanzini,2019
5. Term Rewriting and All That;Baader,1998
Cited by
19 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. On the Almost-Sure Termination of Binary Sessions;Proceedings of the 26th International Symposium on Principles and Practice of Declarative Programming;2024-09-09
2. Hopping Proofs of Expectation-Based Properties: Applications to Skiplists and Security Proofs;Proceedings of the ACM on Programming Languages;2024-04-29
3. Positive Almost-Sure Termination: Complexity and Proof Rules;Proceedings of the ACM on Programming Languages;2024-01-05
4. On the Hardness of Analyzing Quantum Programs Quantitatively;Lecture Notes in Computer Science;2024
5. Monadic Intersection Types, Relationally;Lecture Notes in Computer Science;2024