21 citations · 78 across the 23 of their papers we have counts for
1 paper · 2 filters
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…