Constructive design of a hierarchy of semantics of a transition system by abstract interpretation
From MaRDI portal
Publication:1605224
DOI10.1016/S0304-3975(00)00313-3zbMath0996.68119MaRDI QIDQ1605224
Publication date: 15 July 2002
Published in: Theoretical Computer Science (Search for Journal in Brave)
Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Related Items
Trace-Relating Compiler Correctness and Secure Compilation ⋮ Transfinite semantics in the form of greatest fixpoint ⋮ Static analysis of embedded real-time concurrent software with dynamic priorities ⋮ Software watermarking: a semantics-based approach ⋮ Refinement to Certify Abstract Interpretations, Illustrated on Linearization for Polyhedra ⋮ Asynchronous correspondences between hybrid trajectory semantics ⋮ Property-driven code obfuscations reinterpreting Jones-optimality in abstract interpretation ⋮ Independence Abstractions and Models of Concurrency ⋮ A generic framework to coarse-grain stochastic reaction networks by abstract interpretation ⋮ Transforming Abstract Interpretations by Abstract Interpretation ⋮ Hiding Software Watermarks in Loop Structures ⋮ Semantics-based software watermarking by abstract interpretation ⋮ Comparison of Combinatorial Signatures of Global Network Dynamics Generated by Two Classes of ODE Models ⋮ Grammar semantics, analysis and parsing by abstract interpretation ⋮ An abstract interpretation-based model for safety semantics ⋮ On multi-language abstraction. Towards a static analysis of multi-language programs ⋮ Refinement to certify abstract interpretations: illustrated on linearization for polyhedra ⋮ Proving Termination by Policy Iteration ⋮ Making abstract models complete ⋮ Transforming semantics by abstract interpretation ⋮ Abstract Interpretation From a Denotational-semantics Perspective ⋮ Abstract interpretation and types for systems biology ⋮ Precondition Inference from Intermittent Assertions and Application to Contracts on Collections ⋮ Bi-inductive structural semantics ⋮ Modelling declassification policies using abstract domain completeness ⋮ Abstract interpretation of resolution-based semantics ⋮ A Hierarchy of Quantum Semantics ⋮ What You Lose is What You Leak: Information Leakage in Declassification Policies ⋮ Bi-inductive Structural Semantics
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- ``A la Burstall intermittent assertions induction principles for proving inevitability properties of programs
- On infinite computations in denotational semantics
- A simple fixpoint argument without the restriction to continuity
- A simple relation between relational and predicate transformer semantics for nondeterministic programs
- A continuous semantics for unbounded nondeterminism
- Co-induction in relational semantics
- Constructive versions of Tarski's fixed point theorems
- Metric semantics from partial order semantics
- The structure of Galois connections
- General correctness: A unification of partial and total correctness
- Axiomatic approach to total correctness of programs
- Consistent and complementary formal theories of the semantics of programming languages
- The closure operators of a lattice
- A lattice-theoretical fixpoint theorem and its applications
- Countable nondeterminism and random assignment
- Formal computations of non deterministic recursive program schemes
- Abstract interpretation and application to logic programs
- Programs, Recursion and Unbounded Choice
- Guarded commands, nondeterminacy and formal derivation of programs
- Some Properties of Predicate Transformers
- Programming as a Discipline of Mathematical Nature
- Temporal abstract interpretation
- An axiomatic basis for computer programming
- Semantical Analysis of Modal Logic I Normal Modal Propositional Calculi
