Author:
Asadi Ali,Chatterjee Krishnendu,Goharshady Amir Kafshdar,Mohammadi Kiarash,Pavlogiannis Andreas
Publisher
Springer International Publishing
Reference37 articles.
1. Asadi, A., et al.: Faster algorithms for quantitative analysis of Markov chains and Markov decision processes with small treewidth. arXiv preprint:2004.08828 (2020)
2. Ashok, P., Chatterjee, K., Daca, P., Křetínský, J., Meggendorfer, T.: Value iteration for long-run average reward in Markov decision processes. In: CAV (2017)
3. Bellman, R.: A Markovian decision process. J. Math. Mech. 6, 679–684 (1957)
4. Berkelaar, M., Eikland, K., Notebaert, P.: lpsolve linear programming system (2004)
5. Blackburn, S.M., et al.: The DaCapo benchmarks: Java benchmarking development and analysis. In: OOPSLA (2006)
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Exploiting the Sparseness of Control-Flow and Call Graphs for Efficient and On-Demand Algebraic Program Analysis;Proceedings of the ACM on Programming Languages;2023-10-16
2. The Bounded Pathwidth of Control-Flow Graphs;Proceedings of the ACM on Programming Languages;2023-10-16
3. Efficient Interprocedural Data-Flow Analysis Using Treedepth and Treewidth;Lecture Notes in Computer Science;2023
4. Optimal Mining: Maximizing Bitcoin Miners' Revenues from Transaction Fees;2022 IEEE International Conference on Blockchain (Blockchain);2022-08
5. Efficient approximations for cache-conscious data placement;Proceedings of the 43rd ACM SIGPLAN International Conference on Programming Language Design and Implementation;2022-06-09