A model checker for verifying ConGolog programs

Authors:
Leila Kalantari;Eugenia Ternovska
Affiliations:
Department of Computing Science, Simon Fraser University, Burnaby, BC, Canada, V5A 1S6;Department of Computing Science, Simon Fraser University, Burnaby, BC, Canada, V5A 1S6
Venue:
Eighteenth national conference on Artificial intelligence
Year:
2002

Citing 6
Cited 2

Temporal and modal logic

Handbook of theoretical computer science (vol. B)
Model checking

Model checking
ConGolog, a concurrent programming language based on the situation calculus

Artificial Intelligence
Knowlege in action: logical foundations for specifying and implementing dynamical systems

Knowlege in action: logical foundations for specifying and implementing dynamical systems
Handbook of Process Algebra

Handbook of Process Algebra
Efficient Model Checking Using Tabled Resolution

CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification

Property persistence in the situation calculus

Artificial Intelligence
Xsb: Extending prolog with tabled logic programming

Theory and Practice of Logic Programming - Prolog Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

We describe our work in progress on a model checker for verifying ConGolog programs. ConGolog is a novel high-level programming language for robot control which incorporates a rich account of concurrency, prioritized execution, interrupts, and changes in the world that are beyond robot's control. The novelty of this language requires new methods of proving correctness. We apply the techniques from XSB tabling and the µ-calculus, to overcome the challenge of verifying complex non-terminating programs, in a terminating time.