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

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

Namespace Prefixes

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

Statements

Subject Item
n2:67227
rdf:type
n5:BookSectionEPrint bibo:BookSection n5:EPrint bibo:Article
rdfs:seeAlso
n19:
owl:sameAs
n21:978-3-319-99725-4_13
n3:EDT
n4:ext-1cc2e2fcc40dc433e58c33f2af8f61c5
n5:hasAccepted
n6:1579622
n5:hasDocument
n6:3158060 n6:1579622 n6:2992044 n6:3158061 n6:3158058 n6:3158059
dc:hasVersion
n6:1579622
dcterms:title
Closing the Performance Gap between Doubles and Rationals for Octagons
wdrs:describedby
n14:export_kar_RDFN3.n3 n23:export_kar_RDFN3.n3
dcterms:date
2018-08-29
dcterms:creator
n4:ext-a.a.chawdhary@kent.ac.uk n4:ext-a.m.king@kent.ac.uk
bibo:status
n16:peerReviewed n16:published
dcterms:publisher
n11:ext-1c5ddec173ca8cdfba8b274309638579
bibo:abstract
Octagons have enduring appeal because their domain operations 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 has 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 halve the running time on rationals, putting CoDBMs on rationals on a par with DBMs on doubles.
dcterms:isPartOf
n9:ext-03029743 n10:repository
dcterms:subject
n12:T1 n12:Q
bibo:authorList
n17:authors
bibo:editorList
n17:editors
bibo:presentedAt
n22:ext-6e73f8710d375d2bcfd900c915bb96c0
bibo:volume
11002