Journal of Symbolic Computation
ACM Transactions on Programming Languages and Systems (TOPLAS)
Sequential abstract-state machines capture sequential algorithms
ACM Transactions on Computational Logic (TOCL)
Java and the Java Virtual Machine: Definition, Verification, Validation with Cdrom
Java and the Java Virtual Machine: Definition, Verification, Validation with Cdrom
On Hoare Logic and Kleene Algebra with Tests
LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
Operational semantics of transactions
ADC '03 Proceedings of the 14th Australasian database conference - Volume 17
Abstract state machines capture parallel algorithms
ACM Transactions on Computational Logic (TOCL)
Conceptual modelling of web information systems
Data & Knowledge Engineering
Personalisation of web information systems - A term rewriting approach
Data & Knowledge Engineering
Modeling information services on the basis of ASM semantics
ASM'03 Proceedings of the abstract state machines 10th international conference on Advances in theory and practice
An algorithmic approach to high-level personalisation of web information systems
WAIM'05 Proceedings of the 6th international conference on Advances in Web-Age Information Management
| Hi-index | 0.00 |
The use of conditional term rewriting on the basis of Kleene algebras with tests is investigated as an approach to high-level personalisation of Web Information Systems. The focus is on the possible action sequences that can be represented by an algebraic expression called plot. By exploiting the idea of weakest preconditions such expressions can be represented by formal power series with coefficients in a Boolean algebra. This gives rise to a sufficient condition for termination based on well-founded orders on such power series. As confluence cannot be guaranteed, the approach further proposes critical pair completion to be used in order to enforce the desirable Church-Rosser property.