Please use this identifier to cite or link to this item: https://scholarbank.nus.edu.sg/handle/10635/40122
DC FieldValue
dc.titleRelative safety
dc.contributor.authorJaffar, J.
dc.contributor.authorSantosa, A.E.
dc.contributor.authorVoicu, R.
dc.date.accessioned2013-07-04T07:57:09Z
dc.date.available2013-07-04T07:57:09Z
dc.date.issued2006
dc.identifier.citationJaffar, J.,Santosa, A.E.,Voicu, R. (2006). Relative safety. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 3855 LNCS : 282-297. ScholarBank@NUS Repository.
dc.identifier.isbn3540311394
dc.identifier.issn03029743
dc.identifier.urihttp://scholarbank.nus.edu.sg/handle/10635/40122
dc.description.abstractA 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.
dc.sourceScopus
dc.typeConference Paper
dc.contributor.departmentCOMPUTER SCIENCE
dc.description.sourcetitleLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
dc.description.volume3855 LNCS
dc.description.page282-297
dc.identifier.isiutNOT_IN_WOS
Appears in Collections:Staff Publications

Show simple item record
Files in This Item:
There are no files associated with this item.

Page view(s)

69
checked on Mar 31, 2020

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.