3 papers
cs.FL2025
Structural Abstraction and Refinement for Probabilistic Programs
Guanyan Li, Juanen Li, Zhilei Han +3
In this paper, we present structural abstraction refinement, a novel framework for verifying the threshold problem of probabilistic programs. Our approach represents the structure…
cs.PL2022
ProbTA: A sound and complete proof rule for probabilistic verification
Guanyan Li, Zhilei Han, Fei He
We propose a sound and complete proof rule ProbTA for quantitative analysis of violation probability of probabilistic programs. Our approach extends the technique of trace abstract…
cs.PL2021
Solving String Constraints With Regex-Dependent Functions Through Transducers With Priorities And Variables
Taolue Chen, Alejandro Flores Lamas, Matthew Hague +6
Regular expressions are a classical concept in formal language theory. Regular expressions in programming languages (RegEx) such as JavaScript, feature non-standard semantics of op…