Extending model checking to data-aware temporal properties of web services
WS-FM'07 Proceedings of the 4th international conference on Web services and formal methods
Alternating automata on data trees and XPath satisfiability
ACM Transactions on Computational Logic (TOCL)
Self-configuration of network devices with configuration logic
AN'06 Proceedings of the First IFIP TC6 international conference on Autonomic Networking
| Hi-index | 0.00 |
Querying and efficiently validating properties on labelled tree structures has become an important part of research in numerous domains. In this paper, we show how a fragment of XPath called Configuration Logic (CL) can be embedded into Computation Tree Logic. This framework embeds into CTL a larger subset of XPath than previous work and in particular allows universally and existentially quantified variables in formulas. Finally, we show how the variable binding mechanism of CL can be seen as a branching-time equivalent of the "freeze" quantifier.