Abstract
In this paper, we propose a formal framework for checking the consistency of security policies of services using Answer Set Programming (ASP). We illustrate that the formalisation of security policies of the service providers and the service consumers in ASP is an effective way for reasoning about the compatibility of policies to enable the dynamic discovery and invocation of services.
| Original language | English |
|---|---|
| Title of host publication | Proceedings - 2014 IEEE International Conference on Services Computing, SCC 2014 |
| Editors | Elena Ferrari, Ravindran Kaliappa, Patrick C.K. Hung |
| Publisher | Institute of Electrical and Electronics Engineers Inc. |
| Pages | 857-858 |
| Number of pages | 2 |
| ISBN (Electronic) | 9781479950669 |
| DOIs | |
| Publication status | Published - 17 Oct 2014 |
| Externally published | Yes |
| Event | 11th IEEE International Conference on Services Computing, SCC 2014 - Anchorage, United States Duration: 27 Jun 2014 → 2 Jul 2014 |
Publication series
| Name | Proceedings - 2014 IEEE International Conference on Services Computing, SCC 2014 |
|---|
Conference
| Conference | 11th IEEE International Conference on Services Computing, SCC 2014 |
|---|---|
| Country/Territory | United States |
| City | Anchorage |
| Period | 27/06/14 → 2/07/14 |
Bibliographical note
Publisher Copyright:© 2014 IEEE.
Keywords
- Answer set programming
- Reasoning policy
- Security policy
- Software services