Generalized Strong Preservation by Abstract Interpretation

DOI10.1093/logcom/exl035zbMath1120.68074arXivcs/0401016OpenAlexW2069150132MaRDI QIDQ3437262

Francesco Tapparo, Francesco Ranzato

Publication date: 14 May 2007

Published in: Journal of Logic and Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/cs/0401016

zbMATH Keywords

completenessrefinementbehavioural equivalenceabstract interpretationabstract model checkingstrong preservation

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items (10)

Code obfuscation against abstraction refinement attacks ⋮ Complete Abstractions and Subclassical Modal Logics ⋮ An abstract interpretation framework for genotype elimination algorithms ⋮ Bisimulation and simulation algorithms on probabilistic transition systems by abstract interpretation ⋮ Generalizing the Paige-Tarjan algorithm by abstract interpretation ⋮ Probabilistic Bisimulation and Simulation Algorithms by Abstract Interpretation ⋮ Correctness kernels of abstract interpretations ⋮ Smaller Abstractions for ∀CTL* without Next ⋮ Deriving Bisimulations by Simplifying Partitions ⋮ An efficient simulation algorithm based on abstract interpretation

This page was built for publication: Generalized Strong Preservation by Abstract Interpretation