Programming Languages and Systems
From MaRDI portal
Publication:5308686
Recommendations
- Generalized Strong Preservation by Abstract Interpretation
- Tools and Algorithms for the Construction and Analysis of Systems
- On the strong semantical completeness of the intuitionistic predicate calculus
- Verification, Model Checking, and Abstract Interpretation
- Completeness in Proof-Theoretic Semantics
- On completeness of reducibility candidates as a semantics of strong normalization
- Strong Completeness of a Pure Free Logic
- scientific article; zbMATH DE number 475195
- scientific article; zbMATH DE number 1497801
- Observational completeness on abstract interpretation
Cited in
(17)- Correctness kernels of abstract interpretations
- scientific article; zbMATH DE number 1759702 (Why is no real title available?)
- 3-valued abstraction: More precision at less cost
- Extracting program logics from abstract interpretations defined by logical relations
- scientific article; zbMATH DE number 530057 (Why is no real title available?)
- Internal and External Logics of Abstract Interpretations
- Inverse-limit and topological aspects of abstract interpretation
- Generalized Strong Preservation by Abstract Interpretation
- scientific article; zbMATH DE number 1953281 (Why is no real title available?)
- Observational Completeness on Abstract Interpretation
- Deriving Bisimulations by Simplifying Partitions
- Incompleteness of states w.r.t. traces in model checking
- Verification, Model Checking, and Abstract Interpretation
- scientific article; zbMATH DE number 1948410 (Why is no real title available?)
- Generalizing the Paige-Tarjan algorithm by abstract interpretation
- Tools and Algorithms for the Construction and Analysis of Systems
- Observational completeness on abstract interpretation
This page was built for publication: Programming Languages and Systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5308686)
