In: International journal on software tools for technology transfer, 2021, p. 15
The use of propositional logic and systems of linear inequalities over reals is a common means to model software for formal verification. Craig interpolants constitute a central building block in this setting for over-approximating reachable states, e.g. as candidates for inductive loop invariants. Interpolants for a linear system can be efficiently computed from a Simplex refutation by ...
|
In: Advances in Computational Mathematics, 2015, vol. 41, no. 5, p. 1255-1288
|
In: IMA Journal of Numerical Analysis, 2018, vol. 38, no. 2, p. 921-954
|
In: Monatshefte für Mathematik, 2015, vol. 178, no. 2, p. 171-190
|
In: Annales Henri Poincaré, 2015, vol. 16, no. 3, p. 709-799
|
In: BIT Numerical Mathematics, 2015, vol. 55, no. 4, p. 1125-1143
|
In: The Ramanujan Journal, 2015, vol. 38, no. 2, p. 383-422
|
In: Foundations of Computational Mathematics, 2015, vol. 15, no. 2, p. 313-362
|
In: Mathematische Zeitschrift, 2015, vol. 281, no. 3-4, p. 1183-1189
|
In: BIT Numerical Mathematics, 2015, vol. 55, no. 2, p. 459-485
|