An Abstract Separation Logic for Interlinked Extensible Records - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2016

An Abstract Separation Logic for Interlinked Extensible Records

Résumé

The memory manipulated by JavaScript programs can be seen as a heap of extensible records storing values and pointers. We define a separation logic for describing such structures. In order to scale up to full-fledged languages such as JavaScript, this logic must be integrated with existing abstract domains from abstract interpretation. However, the frame rule—which is a central notion in separation logic—does not easily mix with abstract interpretation. We present a domain of heaps of interlinked extensible records based on both separation logic and abstract interpretation. The domain features spatial conjunction and uses summary nodes from shape analyses. We show how this domain can accommodate an abstract interpretation including a frame rule.
Fichier principal
Vignette du fichier
main.pdf (186.23 Ko) Télécharger le fichier
Origine : Accord explicite pour ce dépôt

Dates et versions

hal-01333600 , version 1 (15-09-2016)

Licence

Paternité

Identifiants

  • HAL Id : hal-01333600 , version 1

Citer

Martin Bodin, Thomas Jensen, Alan Schmitt. An Abstract Separation Logic for Interlinked Extensible Records. Vingt-septièmes Journées Francophones des Langages Applicatifs (JFLA 2016), Jan 2016, Saint-Malo, France. ⟨hal-01333600⟩
448 Consultations
93 Téléchargements

Partager

Gmail Facebook X LinkedIn More