Abstract
Any computer scientist who does research in logic and verification will sooner or later cross their path with Presburger arithmetic. This column, authoritatively and accessibly composed by Christoph Haase, fills the gap for a state-of-the-art introduction to the logic of Presburger arithmetic and its algorithmic properties. As well as conveying an illuminating brief history, the article provides plenty of pointers to ongoing cutting-edge work.
Recommendations
Verification Column
In this timely and comprehensive article, the authors provide an insightful overview of the lively field of automatic verification of hybrid systems. They focus on the fundamental problem of reachability, and consider both exact and approximate ...
Verification column
The growing popularity of verification competitions such as VerifyThis Verification Competition and the Competition on Software Verification (SV-COMP), both, incentivize as well as reward tool developers. VerifyThis 2016 was held in Eindhoven colocated ...
Incremental column-wise verification of arithmetic circuits using computer algebra
AbstractVerifying arithmetic circuits and most prominently multiplier circuits is an important problem which in practice still requires substantial manual effort. The currently most effective approach uses polynomial reasoning over pseudo boolean ...
Comments