Transforming semantics by abstract interpretation (Q557807): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / Wikidata QID
 
Property / Wikidata QID: Q62046240 / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2004.12.021 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2069431698 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4843177 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognizing safety and liveness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Countable nondeterminism and random assignment / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5331549 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A compositional semantics for logic programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4222883 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructive design of a hierarchy of semantics of a transition system by abstract interpretation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructive versions of Tarski's fixed point theorems / rank
 
Normal rank
Property / cites work
 
Property / cites work: ``A la Burstall'' intermittent assertions induction principles for proving inevitability properties of programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Abstract interpretation and application to logic programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2767186 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Guarded commands, nondeterminacy and formal derivation of programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4144755 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5829077 / rank
 
Normal rank
Property / cites work
 
Property / cites work: “Optimal” collecting semantics for analysis in a hierarchy of logic program semantics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-standard semantics for program slicing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weak relative pseudo-complements of closure operators / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complementing logic program semantics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Refining and compressing abstract domains / rank
 
Normal rank
Property / cites work
 
Property / cites work: The reduced relative power operation on abstract domains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4217930 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5616133 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Design, implementation, and evaluation of the constraint language cc(FD) / rank
 
Normal rank
Property / cites work
 
Property / cites work: An axiomatic basis for computer programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3294260 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3713564 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3996704 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logical optimality of groundness analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: The structure of Galois connections / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 13:07, 10 June 2024

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
    0 references
    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
    0 references
    0 references
    abstract interpretation
    0 references
    comparative semantics
    0 references
    compositionality
    0 references
    constraint programming
    0 references
    domain theory
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references