Reviewed and Accepted Conference Papers
- Yixuan Li, Julian Parsert, Elizabeth Polgreen. Guiding Enumerative Program Synthesis with Large Language Models. accepted at: 36th International Conference on Computer Aided Verification (CAV). preprint. 2024.
- Julian Parsert and Elizabeth Polgreen. Reinforcement Learning and Data-Generation for Syntax-Guided Synthesis. Thirty-Eighth AAAI Conference on Artificial Intelligence (AAAI). 2024. doi:10.1609/AAAI.V38I9.28938.
- Julian Parsert, Chad Brown, Mikolas Janota, and Cezary Kaliszyk. Experiments on Infinite Model Finding in SMT Solving. Proceedings of 24th International Conference on Logic for Programming, Artificial Intelligence and Reasoning (LPAR 2023). 2023. doi:10.29007/slrm
- Mirco Giacobbe and Daniel Kroening and Julian Parsert. Neural Termination Analysis. Proceedings of the 30th ACM Joint European Software Engineering Conference and Symposium on the Foundations of Software Engineering (ESEC/FSE). 2022. doi:10.1145/3540250.3549120
- Julian Parsert, Stephanie Autherith, and Cezary Kaliszyk. Property Preserving Embedding of First-order Logic. 6th Global Conference on Artificial Intelligence (GCAI). 2020. doi:978-3- 319-94821-8_29.
- Julian Parsert and Cezary Kaliszyk. Towards Formal Foundations for Game Theory. 9th International Conference on Interactive Theorem Proving (ITP), pp. 495–503. 2018. doi:978- 3-319-94821-8_29.
- Florian Meßner, Julian Parsert, Schöpf Jonas, and Christian Sternagel. A Formally Verified Solver for Homogeneous Linear Diophantine Equations. 9th International Conference on Interactive Theorem Proving (ITP), pp. 441–458. 2018. doi:10.1007/978-3-319-94821-8_- 26.
- Julian Parsert and Cezary Kaliszyk. Formal Microeconomic Foundations and the First Welfare Theorem. 7th ACM Conference on Certified Programs and Proofs (CPP), ACM, pp. 91-101, 2018. doi:10.1145/3167100.
- Yutaka Nagashima and Julian Parsert. System Description: Goal-Oriented Conjecturing for Isabelle/HOL. Intelligent Computer Mathematics - 11th International Conference (CICM), volume 11006 of LNCS, pp. 225-231, 2018 doi:10.1007/978-3-319-96812-4_19.
Reviewed and Accepted Journal Articles
- Stanisław Purgał, Julian Parsert, Cezary Kaliszyk. A study of continuous vector representations for theorem proving. Journal of Logic and Computation, Volume 31, Issue 8, December 2021, Pages 2057–2083 doi:10.1093/logcom/exab006.
Pre-prints or Articles Under Submission
- David M. Cerna and Julian Parsert. One is all you need: Second-order Unification without First-order Variables. under submission. preprint. 2024.
Formalization Journals
- Julian Parsert and Cezary Kaliszyk. Microeconomics and the First Welfare Theorem. Archive of Formal Proofs, 2017.
- Florian Meßner, Julian Parsert, Jonas Schöpf, and Christian Sternagel. Homogeneous Linear Diophantine Equations. Archive of Formal Proofs, 2017.
- Julian Parsert and Cezary Kaliszyk. Von-Neumann-Morgenstern Utility Theorem. Archive of Formal Proofs, 2018.
- Julian Parsert and Cezary Kaliszyk. Linear Programming. Archive of Formal Proofs, 2019.