3 papers
cs.PL2026
Polynomial Invariant Generation for Floating-Point Programs
Xuran Cai, Liqian Chen, Hongfei Fu
In numeric-intensive computations, it is well known that the execution of floating-point programs is imprecise as floating-point arithmetic incurs round-off errors. Although round-…
cs.PL2026
Series-Parallel-Loop Decompositions of Control-flow Graphs
Xuran Cai, Amir Goharshady, S Hitarth +1
Control-flow graphs (CFGs) of structured programs are well known to exhibit strong sparsity properties. Traditionally, this sparsity has been modeled using graph parameters such as…
cs.CL2026
Efficient Algorithms for Partial Constraint Satisfaction Problems over Control-flow Graphs
Xuran Cai, Amir Goharshady
In this work, we focus on the Partial Constraint Satisfaction Problem (PCSP) over control-flow graphs (CFGs) of programs. PCSP serves as a generalization of the well-known Constrai…