7 citations · 13 across the 20 of their papers we have counts for
23 papers
A Program Logic for Abstract (Hyper)Properties
Paolo Baldan, Roberto Bruni, Francesco Ranzato +1
We introduce APPL (Abstract Program Property Logic), a unifying Hoare-style logic that subsumes standard Hoare logic, incorrectness logic, and several variants of Hyper Hoare logic…
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…
Abstract Interpretation-Based Feature Importance for SVMs
Abhinandan Pal, Francesco Ranzato, Caterina Urban +1
We propose a symbolic representation for support vector machines (SVMs) by means of abstract interpretation, a well-known and successful technique for designing and implementing st…
Local Completeness Logic on Kleene Algebra with Tests
Marco Milanese, Francesco Ranzato
Local Completeness Logic (LCL) has been put forward as a program logic for proving both the correctness and incorrectness of program specifications. LCL is an abstract logic, param…
Computing Reachable Simulations
Pierre Ganty, Nicolas Manini, Francesco Ranzato
We study the problem of computing the reachable principals of simulation preorder and the reachable blocks of simulation equivalence. Following a theoretical investigation of the d…
Intensional Kleene and Rice Theorems for Abstract Program Semantics
Paolo Baldan, Francesco Ranzato, Linpeng Zhang
Classical results in computability theory, notably Rice's theorem, focus on the extensional content of programs, namely, on the partial recursive functions that programs compute. L…