This HTML5 document contains 29 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
n12doi:10.1007/
dctermshttp://purl.org/dc/terms/
n2https://kar.kent.ac.uk/id/eprint/
n20https://kar.kent.ac.uk/id/eprint/70572#
wdrshttp://www.w3.org/2007/05/powder-s#
dchttp://purl.org/dc/elements/1.1/
n10http://purl.org/ontology/bibo/status/
rdfshttp://www.w3.org/2000/01/rdf-schema#
n14https://demo.openlinksw.com/about/id/entity/https/raw.githubusercontent.com/annajordanous/CO644Files/main/
n3http://eprints.org/ontology/
n16http://www.loc.gov/loc.terms/relators/
bibohttp://purl.org/ontology/bibo/
n6https://kar.kent.ac.uk/id/org/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
n19https://kar.kent.ac.uk/70572/
owlhttp://www.w3.org/2002/07/owl#
n4https://kar.kent.ac.uk/id/document/
n8https://kar.kent.ac.uk/id/
xsdhhttp://www.w3.org/2001/XMLSchema#
n17https://demo.openlinksw.com/about/id/entity/https/www.cs.kent.ac.uk/people/staff/akj22/materials/CO644/
n7https://kar.kent.ac.uk/id/person/

Statements

Subject Item
n2:70572
rdf:type
n3:BookSectionEPrint n3:EPrint bibo:Article bibo:BookSection
rdfs:seeAlso
n19:
owl:sameAs
n12:978-3-319-99725-4_13
n16:EDT
n7:ext-bdb002f94bf390e404ea62cb8dcac310
n3:hasDocument
n4:3157398 n4:3143174 n4:3143200 n4:3157395 n4:3157396 n4:3157397
n3:hasSubmitted
n4:3143174
dc:hasVersion
n4:3143174
dcterms:title
Closing the Performance Gap between Doubles and Rationals for Octagons
wdrs:describedby
n14:export_kar_RDFN3.n3 n17:export_kar_RDFN3.n3
dcterms:date
2018-08-30
dcterms:creator
n7:ext-a.m.king@kent.ac.uk n7:ext-4db2d1257711a548ba5b3c849f761d5f
bibo:status
n10:peerReviewed n10:published
dcterms:publisher
n6:ext-1c5ddec173ca8cdfba8b274309638579
bibo:abstract
Octagons have enduring appeal because their domain opera- tions are simple, readily mapping to for-loops which apply max, min and sum to the entries of a Difference Bound Matrix (DBM). In the quest for efficiency, arithmetic is often realised with double-precision floating- point, albeit at the cost of the certainty provided by arbitrary-precision rationals. In this paper we show how Compact DBMs (CoDBMs), which have recently been proposed as a memory refinement for DBMs, enable arithmetic calculation to be short-circuited in various domain operations. We also show how comparisons can be avoided by changing the tables which underpin CoDBMs. From the perspective of implementation, the optimisations are attractive because they too are conceptually simple, following the ethos of Octagons. Yet they can halve the running time on rationals, putting CoDBMs on rationals on a par with DBMs on doubles.
dcterms:isPartOf
n8:repository
bibo:authorList
n20:authors
bibo:editorList
n20:editors
bibo:volume
11002