28 citations · 54 across the 9 of their papers we have counts for
Showing 2019Show all
2 papers · 1 filter
cs.LO2019★ 1 cited
POTL: A First-Order Complete Temporal Logic for Operator Precedence Languages
Michele Chiari, Dino Mandrioli, Matteo Pradella
The problem of model checking procedural programs has fostered much research towards the definition of temporal logics for reasoning on context-free structures. The most notable of…
cs.PL2019★ 6 cited
Correct Approximation of IEEE 754 Floating-Point Arithmetic for Program Verification
Roberto Bagnara, Abramo Bagnara, Fabio Biselli +2
Verification of programs using floating-point arithmetic is challenging on several accounts. One of the difficulties of reasoning about such programs is due to the peculiarities of…