Subramani, K.; Wojciechowki, Piotr A polynomial time algorithm for read-once certification of linear infeasibility in UTVPI constraints. (English) Zbl 1421.68181 Algorithmica 81, No. 7, 2765-2794 (2019). MSC: 68W05 05C70 68T20 68W40 90C05 90C27 PDF BibTeX XML Cite \textit{K. Subramani} and \textit{P. Wojciechowki}, Algorithmica 81, No. 7, 2765--2794 (2019; Zbl 1421.68181) Full Text: DOI
Subramani, K.; Wojciechowski, Piotr A certifying algorithm for lattice point feasibility in a system of UTVPI constraints. (English) Zbl 1394.90499 J. Comb. Optim. 35, No. 2, 389-408 (2018). MSC: 90C27 PDF BibTeX XML Cite \textit{K. Subramani} and \textit{P. Wojciechowski}, J. Comb. Optim. 35, No. 2, 389--408 (2018; Zbl 1394.90499) Full Text: DOI
Subramani, K.; Wojciechowski, Piotr A combinatorial certifying algorithm for linear feasibility in UTVPI constraints. (English) Zbl 1360.68889 Algorithmica 78, No. 1, 166-208 (2017). MSC: 68W05 68W40 PDF BibTeX XML Cite \textit{K. Subramani} and \textit{P. Wojciechowski}, Algorithmica 78, No. 1, 166--208 (2017; Zbl 1360.68889) Full Text: DOI
Subramani, K.; Wojciechowski, Piotr An optimal algorithm for computing the integer closure of UTVPI constraints. (English) Zbl 06576388 Kaykobad, Mohammad (ed.) et al., WALCOM: algorithms and computation. 10th international workshop, WALCOM 2016, Kathmandu, Nepal, March 29–31, 2016. Proceedings. Cham: Springer (ISBN 978-3-319-30138-9/pbk; 978-3-319-30139-6/ebook). Lecture Notes in Computer Science 9627, 154-165 (2016). MSC: 68Wxx PDF BibTeX XML Cite \textit{K. Subramani} and \textit{P. Wojciechowski}, Lect. Notes Comput. Sci. 9627, 154--165 (2016; Zbl 06576388) Full Text: DOI
Bagnara, Roberto; Hill, Patricia M.; Zaffanella, Enea Weakly-relational shapes for numeric abstractions: Improved algorithms and proofs of correctness. (English) Zbl 1185.68405 Form. Methods Syst. Des. 35, No. 3, 279-323 (2009). MSC: 68Q60 68M99 PDF BibTeX XML Cite \textit{R. Bagnara} et al., Form. Methods Syst. Des. 35, No. 3, 279--323 (2009; Zbl 1185.68405) Full Text: DOI