A Fragment of ML Decidable by Visibly Pushdown Automata.

David Hopkins Andrzej S. Murawski C.-H. Luke Ong

Published in: ICALP (2) (2011)

Keyphrases

automata theoretic
temporal logic
model checking
maximum likelihood
regular path queries
modal logic
computation tree logic
finite state
satisfiability problem
regular expressions
decision trees
logic programming
query containment