Principles of abstract interpretation
From MaRDI portal
Recommendations
Cited in
(22)- Intensional Kleene and Rice theorems for abstract program semantics
- Separability and non-determinizability of WSTS
- Limits and difficulties in the design of under-approximation abstract domains
- Abstract interpretation
- An input-output relational domain for algebraic data types and functional arrays
- Cone-based abstract interpretation for nonlinear positive invariant synthesis
- Memory-efficient fixpoint computation
- Lifting numeric relational domains to algebraic data types
- A correctness and incorrectness program logic
- Deciding program properties via complete abstractions on bounded domains
- Canonical forms and widening for two variables per inequality systems
- Logics for extensional, locally complete analysis via domain refinements
- scientific article; zbMATH DE number 2087617 (Why is no real title available?)
- Structural-Abstraction Principles
- Abstract interpretation of recursive logic definitions for efficient runtime assertion checking
- Refining abstract interpretations
- Sweeping in Abstract Interpretation
- Exploiting Modularity of SOS Semantics to Define Quantitative Extensions of Reaction Systems
- String abstract domains and their combination
- Broadening the applicability of local completeness analysis with intensional and extensional guarantees
- Asynchronous correspondences between hybrid trajectory semantics
- Exploiting adjoints in property directed reachability analysis
This page was built for publication: Principles of abstract interpretation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5857678)