Please use this identifier to cite or link to this item:
|Title:||Constraint-based automatic symmetry detection||Authors:||Zhang, S.J.
|Issue Date:||2013||Citation:||Zhang, S.J.,Sun, J.,Sun, C.,Liu, Y.,Ma, J.,Dong, J.S. (2013). Constraint-based automatic symmetry detection. 2013 28th IEEE/ACM International Conference on Automated Software Engineering, ASE 2013 - Proceedings : 15-25. ScholarBank@NUS Repository. https://doi.org/10.1109/ASE.2013.6693062||Abstract:||We present an automatic approach to detecting symmetry relations for general concurrent models. Despite the success of symmetry reduction in mitigating state explosion problem, one essential step towards its soundness and effectiveness, i.e., how to discover sufficient symmetries with least human efforts, is often either overlooked or oversimplified. In this work, we show how a concurrent model can be viewed as a constraint satisfaction problem (CSP), and present an algorithm capable of detecting symmetries arising from the CSP which induce automorphisms of the model. To the best of our knowledge, our method is the first approach that can automatically detect both process and data symmetries as demonstrated via a number of systems. © 2013 IEEE.||Source Title:||2013 28th IEEE/ACM International Conference on Automated Software Engineering, ASE 2013 - Proceedings||URI:||http://scholarbank.nus.edu.sg/handle/10635/78066||ISBN:||9781479902156||DOI:||10.1109/ASE.2013.6693062|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Mar 30, 2020
checked on Mar 29, 2020
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.