21 citations · 35 across the 3 of their papers we have counts for
Showing cs.PLShow all
2 papers · 1 filter
cs.PL2010★ 8 cited
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…
cs.PL2007★ 6 cited
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…