From CTL to datalog

Authors:
Foto Afrati;Theodore Andronikos;Vassia Pavlaki;Eugenie Foustoucos;Irène Guessarian
Affiliations:
N.T.U.A., Athens, Greece;N.T.U.A., Athens, Greece;N.T.U.A., Athens, Greece;N.T.U.A., Athens, Greece;Université Paris 6, 4 Place Jussieu, 75252 Paris Cedex 5
Venue:
PCK50 Proceedings of the Paris C. Kanellakis memorial workshop on Principles of computing & knowledge: Paris C. Kanellakis memorial workshop on the occasion of his 50th birthday
Year:
2003

Citing 16
Cited 0

“Sometimes” and “not never” revisited: on branching versus linear time temporal logic

Journal of the ACM (JACM) - The MIT Press scientific computation series
Automatic verification of finite-state concurrent systems using temporal logic specifications

ACM Transactions on Programming Languages and Systems (TOPLAS)
An amateur's introduction to recursive query processing strategies

SIGMOD '86 Proceedings of the 1986 ACM SIGMOD international conference on Management of data
Principles of database and knowledge-base systems, Vol. I

Principles of database and knowledge-base systems, Vol. I
CCS expressions finite state processes, and three problems of equivalence

Information and Computation
Logic programming and databases

Logic programming and databases
An automata-theoretic approach to linear temporal logic

Proceedings of the VIII Banff Higher order workshop conference on Logics for concurrency : structure versus automata: structure versus automata
An automata-theoretic approach to branching-time model checking

Journal of the ACM (JACM)
Handbook of Theoretical Computer Science

Handbook of Theoretical Computer Science
"Sometime" is sometimes "not never": on the temporal logic of programs

POPL '80 Proceedings of the 7th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Set-Based Analysis of Reactive Infinite-State Systems

TACAS '98 Proceedings of the 4th International Conference on Tools and Algorithms for Construction and Analysis of Systems
Logic Programming and Model Checking

PLILP '98/ALP '98 Proceedings of the 10th International Symposium on Principles of Declarative Programming
Efficient Model Checking Using Tabled Resolution

CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification
Model Checking and Transitive-Closure Logic

CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification
On the Expressive Power of CTL

LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
CCS expressions, finite state processes, and three problems of equivalence

PODC '83 Proceedings of the second annual ACM symposium on Principles of distributed computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We provide a translation from CTL to DatalogSucc. The translation has the following advantages: a) It is natural. b) It provides intuition to the expressive power of CTL and its various fragments. c) It uses a fragment of DatalogSucc which is close to the expressive power of CTL.