Welcome to the InfoSci Platform
A Formal Language for XML Authorisations Based on Answer Set Programming and Temporal Interval Logic Constraints

A Formal Language for XML Authorisations Based on Answer Set Programming and Temporal Interval Logic Constraints

Sean Policarpio, Yan Zhang
Copyright: © 2011 |Volume: 2 |Issue: 1 |Pages: 18
ISSN: 1947-3036|EISSN: 1947-3044|EISBN13: 9781613508954|DOI: 10.4018/jsse.2011010102
Cite Article Cite Article

MLA

Policarpio, Sean, and Yan Zhang. "A Formal Language for XML Authorisations Based on Answer Set Programming and Temporal Interval Logic Constraints." IJSSE vol.2, no.1 2011: pp.22-39. http://doi.org/10.4018/jsse.2011010102

APA

Policarpio, S. & Zhang, Y. (2011). A Formal Language for XML Authorisations Based on Answer Set Programming and Temporal Interval Logic Constraints. International Journal of Secure Software Engineering (IJSSE), 2(1), 22-39. http://doi.org/10.4018/jsse.2011010102

Chicago

Policarpio, Sean, and Yan Zhang. "A Formal Language for XML Authorisations Based on Answer Set Programming and Temporal Interval Logic Constraints," International Journal of Secure Software Engineering (IJSSE) 2, no.1: 22-39. http://doi.org/10.4018/jsse.2011010102

Export Reference

Mendeley
Favorite Full-Issue Download

Abstract

The Extensible Markup Language is susceptible to security breaches because it does not incorporate methods to protect the information it encodes. This work focuses on the development of a formal language that can provide role-based access control to information stored in XML formatted documents. This language has the capacity to reason whether access to an XML document should be allowed. The language, Axml(T), allows for the specification of authorisations on XML documents and distinguishes itself from other research with the inclusion of temporal interval reasoning and the XPath query language.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.