21 citations · 35 across the 3 of their papers we have counts for
3 papers
The Automatic Synthesis of Linear Ranking Functions: The Complete Unabridged Version
Roberto Bagnara, Fred Mesnard, Andrea Pescetti +1
The classical technique for proving termination of a generic sequential computer program involves the synthesis of a ranking function for each loop of the program. Linear ranking f…
On the Design of Generic Static Analyzers for Modern Imperative Languages
Roberto Bagnara, Patricia M. Hill, Andrea Pescetti +1
The design and implementation of precise static analyzers for significant fragments of modern imperative languages like C, C++, Java and Python is a challenging problem. In this pa…
PURRS: Towards Computer Algebra Support for Fully Automatic Worst-Case Complexity Analysis
Roberto Bagnara, Andrea Pescetti, Alessandro Zaccagnini +1
Fully automatic worst-case complexity analysis has a number of applications in computer-assisted program manipulation. A classical and powerful approach to complexity analysis cons…