90 search results - page 7 / 18 » On the Decidability of the Equivalence Problem for Monadic R... |
PODS
2007
ACM
14 years 7 months ago
2007
ACM
Bounded treewidth and Monadic Second Order (MSO) logic have proved to be key concepts in establishing fixed-parameter tractability results. Indeed, by Courcelle's Theorem we ...
ICLP
2003
Springer
14 years 23 days ago
2003
Springer
Abstract The ntcc process calculus is a timed concurrent constraint programming (ccp) model equipped with a first-order linear-temporal logic (LTL) for expressing process specifi...
CCS
2005
ACM
14 years 1 months ago
2005
ACM
We provide an effective procedure for deciding the existence of off-line guessing attacks on security protocols, for a bounded number of sessions. The procedure consists of a co...
INFORMATICALT
2000
13 years 7 months ago
2000
Abstract. We consider in this paper so called simple bracketed languages having special limitations. They are sometimes used for the definitions of some grammatical structures of p...
FOSSACS
2010
Springer
13 years 11 months ago
2010
Springer
A new framework for higher-order program verification has been recently proposed, in which higher-order functional programs are modelled as higher-order recursion schemes and then ...