About: Incrementally Closing Octagons

Not logged in : Login

(Sponging disallowed)

Facets (new session)
Description
Metadata
Settings
- Rule:
- Inverse Functional Properties:
- "Same As":

About: Incrementally Closing Octagons Goto Sponge NotDistinct Permalink

An Entity of Type : bibo:AcademicArticle, within Data Space : linkeddata.uriburner.com:28898 associated with source document(s)

Attributes	Values
type	http://eprints.org/ontology/ArticleEPrint http://eprints.org/ontology/EPrint Article Academic Article
seeAlso	HTML Summary of #64181 Incrementally Closing Octagons
sameAs	Incrementally Closing Octagons
http://eprints.org/ontology/hasDocument	Incrementally Closing Octagons (Other) Incrementally Closing Octagons (Other) Incrementally Closing Octagons (Other) Incrementally Closing Octagons (Other) Incrementally Closing Octagons (Other) Incrementally Closing Octagons (Other) Incrementally Closing Octagons (PDF) Incrementally Closing Octagons (Other) Incrementally Closing Octagons (Other) Incrementally Closing Octagons (Other) Incrementally Closing Octagons (Other) Incrementally Closing Octagons (PDF)
http://eprints.org/ontology/hasPublished	Incrementally Closing Octagons (PDF)
http://eprints.org/ontology/hasSubmitted	Incrementally Closing Octagons (PDF)
dc:hasVersion	Incrementally Closing Octagons (PDF) Incrementally Closing Octagons (PDF)
Title	Incrementally Closing Octagons
described by	https://demo.openlinksw.com/about/id/entity/https/raw.githubusercontent.com/annajordanous/CO644Files/main/export_kar_RDFN3.n3
Date	2019-11
Creator	Aziem Chawdhary Andy King Ed Robbins
status	peer reviewed published
Publisher	Springer
abstract	The octagon abstract domain is a widely used numeric abstract domain expressing relational information between variables whilst being both computationally efficient and simple to implement. Each element of the domain is a system of constraints where each constraint takes the restricted form ±xi±xj≤c. A key family of operations for the octagon domain are closure algorithms, which check satisfiability and provide a normal form for octagonal constraint systems. We present new quadratic incremental algorithms for closure, strong closure and integer closure and proofs of their correctness. We highlight the benefits and measure the performance of these new algorithms.
Is Part Of	Formal Methods in System Design https://kar.kent.ac.uk/id/repository
list of authors	https://kar.kent.ac.uk/id/eprint/64181#authors
issue	2
volume	54
is topic of	https://raw.githubusercontent.com/annajordanous/CO644Files/main/export_kar_RDFN3.n3
is primary topic of	HTML Summary of #64181 Incrementally Closing Octagons

Faceted Search & Find service v1.17_git149 as of Dec 03 2024

Alternative Linked Data Documents: iSPARQL | ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 08.03.3332 as of Jan 29 2025, on Linux (x86_64-generic-linux-glibc25), Single-Server Edition (378 GB total memory, 22 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2025 OpenLink Software