Transforming semantics by abstract interpretation (Q557807): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
Property / review text | |||
The most well-known structural properties of semantics, such as their precision, compositionality, and relation between complementary observables, by using standard abstract interpretation techniques are analyzed. It is proved that most of these properties can be characterized in terms of properties of the corresponding abstractions. This is achieved by isolating a suitable set of abstract domain transformers which allows one to design abstractions accordingly, providing a characterization of semantics of programming languages as solutions of simple abstract domain equations, involving both some basic observable property which has to be observed by the semantics and the abstract domain transformers necessary in order to achieve a suitable structural property. | |||
Property / review text: The most well-known structural properties of semantics, such as their precision, compositionality, and relation between complementary observables, by using standard abstract interpretation techniques are analyzed. It is proved that most of these properties can be characterized in terms of properties of the corresponding abstractions. This is achieved by isolating a suitable set of abstract domain transformers which allows one to design abstractions accordingly, providing a characterization of semantics of programming languages as solutions of simple abstract domain equations, involving both some basic observable property which has to be observed by the semantics and the abstract domain transformers necessary in order to achieve a suitable structural property. / rank | |||
Normal rank | |||
Property / reviewed by | |||
Property / reviewed by: Damas Gruska / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 68Q55 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 06B35 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 2184046 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
abstract interpretation | |||
Property / zbMATH Keywords: abstract interpretation / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
comparative semantics | |||
Property / zbMATH Keywords: comparative semantics / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
compositionality | |||
Property / zbMATH Keywords: compositionality / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
constraint programming | |||
Property / zbMATH Keywords: constraint programming / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
domain theory | |||
Property / zbMATH Keywords: domain theory / rank | |||
Normal rank |
Revision as of 15:09, 1 July 2023
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Transforming semantics by abstract interpretation |
scientific article |
Statements
Transforming semantics by abstract interpretation (English)
0 references
30 June 2005
0 references
The most well-known structural properties of semantics, such as their precision, compositionality, and relation between complementary observables, by using standard abstract interpretation techniques are analyzed. It is proved that most of these properties can be characterized in terms of properties of the corresponding abstractions. This is achieved by isolating a suitable set of abstract domain transformers which allows one to design abstractions accordingly, providing a characterization of semantics of programming languages as solutions of simple abstract domain equations, involving both some basic observable property which has to be observed by the semantics and the abstract domain transformers necessary in order to achieve a suitable structural property.
0 references
abstract interpretation
0 references
comparative semantics
0 references
compositionality
0 references
constraint programming
0 references
domain theory
0 references