A Few Graph-Based Relational Numerical Abstract Domains
Static Analysis Symposium (SAS) (09/2002) 117-132 This article presents the systematic design of a class of relational numerical abstract domains from non-relational ones. Constructed domains represent sets of invariants of the form (vj - vi in C), where vj and vi are two variables, and C lives in a...
Saved in:
| Main Author | |
|---|---|
| Format | Journal Article |
| Language | English |
| Published |
15.03.2007
|
| Subjects | |
| Online Access | Get full text |
| DOI | 10.48550/arxiv.cs/0703075 |
Cover
| Abstract | Static Analysis Symposium (SAS) (09/2002) 117-132 This article presents the systematic design of a class of relational
numerical abstract domains from non-relational ones. Constructed domains
represent sets of invariants of the form (vj - vi in C), where vj and vi are
two variables, and C lives in an abstraction of P(Z), P(Q), or P(R). We will
call this family of domains weakly relational domains. The underlying concept
allowing this construction is an extension of potential graphs and
shortest-path closure algorithms in exotic-like algebras. Example constructions
are given in order to retrieve well-known domains as well as new ones. Such
domains can then be used in the Abstract Interpretation framework in order to
design various static analyses. Amajor benfit of this construction is its
modularity, allowing to quickly implement new abstract domains from existing
ones. |
|---|---|
| AbstractList | Static Analysis Symposium (SAS) (09/2002) 117-132 This article presents the systematic design of a class of relational
numerical abstract domains from non-relational ones. Constructed domains
represent sets of invariants of the form (vj - vi in C), where vj and vi are
two variables, and C lives in an abstraction of P(Z), P(Q), or P(R). We will
call this family of domains weakly relational domains. The underlying concept
allowing this construction is an extension of potential graphs and
shortest-path closure algorithms in exotic-like algebras. Example constructions
are given in order to retrieve well-known domains as well as new ones. Such
domains can then be used in the Abstract Interpretation framework in order to
design various static analyses. Amajor benfit of this construction is its
modularity, allowing to quickly implement new abstract domains from existing
ones. |
| Author | Miné, Antoine |
| Author_xml | – sequence: 1 givenname: Antoine surname: Miné fullname: Miné, Antoine organization: LIENS |
| BackLink | https://doi.org/10.48550/arXiv.cs/0703075$$DView paper in arXiv |
| BookMark | eNrjYmDJy89LZWCQNDTQM7EwNTXQTyyqyCzTSy7WNzA3MDYwN-VkMHdUcEstV3AvSizI0HVKLE5NUQhKzUksyczPS8xR8CvNTS3KTAayHJOKS4oSk0sUXPJzEzPzinkYWNMSc4pTeaE0N4O8m2uIs4cu2Ir4gqLM3MSiyvjk4nioVcaEVQAA8Y81mQ |
| ContentType | Journal Article |
| DBID | AKY GOX |
| DOI | 10.48550/arxiv.cs/0703075 |
| DatabaseName | arXiv Computer Science arXiv.org |
| DatabaseTitleList | |
| Database_xml | – sequence: 1 dbid: GOX name: arXiv.org url: http://arxiv.org/find sourceTypes: Open Access Repository |
| DeliveryMethod | fulltext_linktorsrc |
| ExternalDocumentID | cs_0703075 |
| GroupedDBID | AKY GOX |
| ID | FETCH-arxiv_primary_cs_07030753 |
| IEDL.DBID | GOX |
| IngestDate | Tue Jul 22 23:01:10 EDT 2025 |
| IsDoiOpenAccess | true |
| IsOpenAccess | true |
| IsPeerReviewed | false |
| IsScholarly | false |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-arxiv_primary_cs_07030753 |
| OpenAccessLink | https://arxiv.org/abs/cs/0703075 |
| ParticipantIDs | arxiv_primary_cs_0703075 |
| PublicationCentury | 2000 |
| PublicationDate | 2007-03-15 |
| PublicationDateYYYYMMDD | 2007-03-15 |
| PublicationDate_xml | – month: 03 year: 2007 text: 2007-03-15 day: 15 |
| PublicationDecade | 2000 |
| PublicationYear | 2007 |
| Score | 2.7545807 |
| SecondaryResourceType | preprint |
| Snippet | Static Analysis Symposium (SAS) (09/2002) 117-132 This article presents the systematic design of a class of relational
numerical abstract domains from... |
| SourceID | arxiv |
| SourceType | Open Access Repository |
| SubjectTerms | Computer Science - Programming Languages |
| Title | A Few Graph-Based Relational Numerical Abstract Domains |
| URI | https://arxiv.org/abs/cs/0703075 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwY2BQMU5KtbBIMk7TTUkyNNE1SbNM1U20SEzSTUoySzM3tUw0MgHPmPr6mXmEmnhFmEYwMSjA9sIkFlVklkHOB04q1k8u1oecWGXKzMAMbCiANvP6R0AmJ8FHcUHVI9QB25hgIaRKwk2QgR_aulNwhESHEANTap4Ig7mjgltquYI76GhoXSdgrZGiAFuCBlTrVwqZMwHqSgINOySXKLjk5wL768WiDPJuriHOHrpgq-ILIOdCxCcXx0NdYSzGwALsvadKMCgYmaQZmqckpgLbOSnAyj8F2Bk1TAQNZ5kaJKYlJRpKMkjgMkUKt5Q0AxdkkNFY19BUhoGlpKg0VRZYO5YkyYGDCACyl2qx |
| linkProvider | Cornell University |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=A+Few+Graph-Based+Relational+Numerical+Abstract+Domains&rft.au=Min%C3%A9%2C+Antoine&rft.date=2007-03-15&rft_id=info:doi/10.48550%2Farxiv.cs%2F0703075&rft.externalDocID=cs_0703075 |