Abstract
A safety property restricts the set of reachable states. In this paper, we introduce a notion of relative safety which states that certain program states are reachable provided certain other states are. A key, but not exclusive, application of this method is in representing symmetry in a program. Here, we show that relative safety generalizes the programs that are presently accommodated by existing methods for symmetry. Finally, we provide a practical algorithm for proving relative safety. © Springer-Verlag Berlin Heidelberg 2006.
Cite
CITATION STYLE
Jaffar, J., Santosa, A. E., & Voicu, R. (2006). Relative safety. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3855 LNCS, pp. 282–297). https://doi.org/10.1007/11609773_19
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
