Pages that link to "Item:Q4572005"
From MaRDI portal
The following pages link to Refining and compressing abstract domains (Q4572005):
Displaying 17 items.
- Bisimulation and simulation algorithms on probabilistic transition systems by abstract interpretation (Q453545) (← links)
- Maximal incompleteness as obfuscation potency (Q511013) (← links)
- Transforming semantics by abstract interpretation (Q557807) (← links)
- Deriving escape analysis by abstract interpretation (Q857916) (← links)
- Generalizing the Paige-Tarjan algorithm by abstract interpretation (Q924726) (← links)
- Uniform closures: Order-theoretically reconstructing logic program semantics and abstract domain refinements (Q1275821) (← links)
- The reduced relative power operation on abstract domains (Q1285656) (← links)
- Pair-independence and freeness analysis through linear refinement. (Q1873754) (← links)
- On multi-language abstraction. Towards a static analysis of multi-language programs (Q2233542) (← links)
- Correctness kernels of abstract interpretations (Q2252528) (← links)
- Weakening additivity in adjoining closures (Q2520722) (← links)
- An abstract interpretation-based model for safety semantics (Q2995468) (← links)
- Transforming Abstract Interpretations by Abstract Interpretation (Q3522058) (← links)
- Refining and Compressing Abstract Model Checking1 1The work is partially supported by MURST project: Certificazione automatica di programmi mediante interpretazione astratta. (Q4923520) (← links)
- Deriving Bisimulations by Simplifying Partitions (Q5452714) (← links)
- Making abstract models complete (Q5741575) (← links)
- Affine Loop Invariant Generation via Matrix Algebra (Q6487319) (← links)
