Artikel mit Open-Access-Mandaten - Hongfei FuWeitere Informationen
Verfügbar: 20
Algorithmic analysis of qualitative and quantitative termination problems for affine probabilistic programs
K Chatterjee, H Fu, P Novotný, R Hasheminezhad
ACM Transactions on Programming Languages and Systems (TOPLAS) 40 (2), 1-45, 2018
Mandate: Fonds zur Förderung der wissenschaftlichen Forschung, National Natural …
Termination analysis of probabilistic programs through Positivstellensatz’s
K Chatterjee, H Fu, AK Goharshady
Computer Aided Verification: 28th International Conference, CAV 2016 …, 2016
Mandate: Fonds zur Förderung der wissenschaftlichen Forschung, National Natural …
Termination of nondeterministic probabilistic programs
H Fu, K Chatterjee
Verification, Model Checking, and Abstract Interpretation: 20th …, 2019
Mandate: Fonds zur Förderung der wissenschaftlichen Forschung, National Natural …
Proving expected sensitivity of probabilistic programs with randomized variable-dependent termination time
P Wang, H Fu, K Chatterjee, Y Deng, M Xu
Proceedings of the ACM on Programming Languages 4 (POPL), 1-30, 2019
Mandate: Fonds zur Förderung der wissenschaftlichen Forschung, National Natural …
Cost analysis of nondeterministic probabilistic programs
P Wang, H Fu, AK Goharshady, K Chatterjee, X Qin, W Shi
Proceedings of the 40th ACM SIGPLAN Conference on Programming Language …, 2019
Mandate: Fonds zur Förderung der wissenschaftlichen Forschung, National Natural …
Polynomial invariant generation for non-deterministic recursive programs
K Chatterjee, H Fu, AK Goharshady, EK Goharshady
Proceedings of the 41st ACM SIGPLAN Conference on Programming Language …, 2020
Mandate: Fonds zur Förderung der wissenschaftlichen Forschung, National Natural …
Non-polynomial worst-case analysis of recursive programs
K Chatterjee, H Fu, AK Goharshady
ACM Transactions on Programming Languages and Systems (TOPLAS) 41 (4), 1-52, 2019
Mandate: Fonds zur Förderung der wissenschaftlichen Forschung, National Natural …
Modular verification for almost-sure termination of probabilistic programs
M Huang, H Fu, K Chatterjee, AK Goharshady
Proceedings of the ACM on Programming Languages 3 (OOPSLA), 1-29, 2019
Mandate: Fonds zur Förderung der wissenschaftlichen Forschung, National Natural …
Polynomial reachability witnesses via Stellensätze
A Asadi, K Chatterjee, H Fu, AK Goharshady, M Mahdavi
Proceedings of the 42nd ACM SIGPLAN International Conference on Programming …, 2021
Mandate: National Natural Science Foundation of China, European Commission
New approaches for almost-sure termination of probabilistic programs
M Huang, H Fu, K Chatterjee
Programming Languages and Systems: 16th Asian Symposium, APLAS 2018 …, 2018
Mandate: Fonds zur Förderung der wissenschaftlichen Forschung, National Natural …
Automated recurrence analysis for almost-linear expected-runtime bounds
K Chatterjee, H Fu, A Murhekar
International Conference on Computer Aided Verification, 118-139, 2017
Mandate: Fonds zur Förderung der wissenschaftlichen Forschung, National Natural …
Quantitative analysis of assertion violations in probabilistic programs
J Wang, Y Sun, H Fu, K Chatterjee, AK Goharshady
Proceedings of the 42nd ACM SIGPLAN International Conference on Programming …, 2021
Mandate: National Natural Science Foundation of China
Scalable linear invariant generation with Farkas’ lemma
H Liu, H Fu, Z Yu, J Song, G Li
Proceedings of the ACM on Programming Languages 6 (OOPSLA2), 204-232, 2022
Mandate: National Natural Science Foundation of China
Affine loop invariant generation via matrix algebra
Y Ji, H Fu, B Fang, H Chen
International Conference on Computer Aided Verification, 257-281, 2022
Mandate: National Natural Science Foundation of China
Automated tail bound analysis for probabilistic recurrence relations
Y Sun, H Fu, K Chatterjee, AK Goharshady
International Conference on Computer Aided Verification, 16-39, 2023
Mandate: National Natural Science Foundation of China, Research Grants Council, Hong Kong
Static Posterior Inference of Bayesian Probabilistic Programming via Polynomial Solving
P Wang, T Yang, H Fu, G Li, CHL Ong
Proceedings of the ACM on Programming Languages 8 (PLDI), 1361-1386, 2024
Mandate: UK Engineering and Physical Sciences Research Council
Demystifying Template-Based Invariant Generation for Bit-Vector Programs
P Yao, J Ke, J Sun, H Fu, R Wu, K Ren
2023 38th IEEE/ACM International Conference on Automated Software …, 2023
Mandate: National Natural Science Foundation of China
Repo4QA: Answering Coding Questions via Dense Retrieval on GitHub Repositories
M Chen, G Li, C Ma, J Li, H Fu
29th International Conference on Computational Linguistics (COLING 2022 …, 2022
Mandate: National Natural Science Foundation of China
Affine Disjunctive Invariant Generation with Farkas' Lemma
J Ke, H Fu, H Liu, L Chen, G Li
arXiv preprint arXiv:2307.13318, 2023
Mandate: US National Science Foundation
Verifying probabilistic timed automata against omega-regular dense-time properties
H Fu, Y Li, J Li
Quantitative Evaluation of Systems: 15th International Conference, QEST 2018 …, 2018
Mandate: National Natural Science Foundation of China
Angaben zur Publikation und Finanzierung werden automatisch von einem Computerprogramm ermittelt