Cite
APA Citation
Seladji, Y., & Qu, Z. (2018). polyhedron over-approximation for complexity reduction in static analysis. International journal of computer mathematics, 3(4), 215–229. http://access.bl.uk/ark:/81055/vdc_100073409430.0x000004
This is an interim version of our Electronic Legal Deposit Catalogue-eJournals and eBooks while we continue to recover from a cyber-attack.
Seladji, Y., & Qu, Z. (2018). polyhedron over-approximation for complexity reduction in static analysis. International journal of computer mathematics, 3(4), 215–229. http://access.bl.uk/ark:/81055/vdc_100073409430.0x000004