16 citations · 46 across the 17 of their papers we have counts for
Showing 2025Show all
2 papers · 1 filter
cs.LO2025
Model Checking as Program Verification by Abstract Interpretation (Extended Version)
Paolo Baldan, Roberto Bruni, Francesco Ranzato +1
Abstract interpretation offers a powerful toolset for static analysis, tackling precision, complexity and state-explosion issues. In the literature, state partitioning abstractions…
cs.LO2025
Approximating Fixpoints of Approximated Functions
Paolo Baldan, Sebastian Gurke, Barbara König +2
Fixpoints are ubiquitous in computer science and when dealing with quantitative semantics and verification one often considers least fixpoints of (higher-dimensional) functions ove…