Automatic verification of finite-state concurrent systems using temporal logic specifications
ACM Transactions on Programming Languages and Systems (TOPLAS)
The well-founded semantics for general logic programs
Journal of the ACM (JACM)
Tabled evaluation with delaying for general logic programs
Journal of the ACM (JACM)
Communication and Concurrency
Local Model Checking for Value-Passing Processes (Extended Abstract)
TACS '97 Proceedings of the Third International Symposium on Theoretical Aspects of Computer Software
Efficient Model Checking Using Tabled Resolution
CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification
XMC: A Logic-Programming-Based Verification Toolset
CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
CADP - A Protocol Validation and Verification Toolbox
CAV '96 Proceedings of the 8th International Conference on Computer Aided Verification
Static analysis, abstract interpretation and verification in (constraint logic) programming
A 25-year perspective on logic programming
Fast generic model-checking for data-based systems
FORTE'05 Proceedings of the 25th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems
Model checking as static analysis: revisited
IFM'12 Proceedings of the 9th international conference on Integrated Formal Methods
Model checking with probabilistic tabled logic programming
Theory and Practice of Logic Programming
| Hi-index | 0.01 |
Recent advances in logic programming have been successfully used to build practical verification toolsets, as evidenced by the XMC system. Thus far, XMC has supported value-passing process languages, but has been limited to using the propositional fragment of modal mucalculus as the property specification logic. In this paper, we explore the use of data variables in the property logic. In particular, we present value-passing modal mu-calculus, its formal semantics and describe a natural implementation of this semantics as a logic program. Since logic programs naturally deal with variables and substitutions, such an implementation need not pay any additional price-- either in terms of performance, or in complexity of implementation-- for having the added flexibility of data variables in the property logic. Our preliminary implementation supports this expectation.