84 search results - page 8 / 17 » Recursive temporal namespaces |
CONCUR
2006
Springer
14 years 2 months ago
2006
Springer
Impossible futures equivalence is the semantic equivalence on labelled transition systems that identifies systems iff they have the same "AGEF" properties: temporal logic...
ICFP
2005
ACM
14 years 10 months ago
2005
ACM
High-level formalisms for reasoning about names and binding such uijn indices, various flavors of higher-order abstract syntax, ry of Contexts, and nominal abstract syntax address...
ICIP
1998
IEEE
15 years 12 days ago
1998
IEEE
In the paper, an automatic spatio-temporal video sequence segmentation algorithm is proposed. To address this very di cult computer vision problem, several novel algorithms have b...
FORTE
2004
14 years 8 days ago
2004
Abstract. We propose a framework for intrusion detection that is based on runtime monitoring of temporal logic specifications. We specify intrusion patterns as formulas in an expre...
LICS
2007
IEEE
14 years 5 months ago
2007
IEEE
Nested words are a structured model of execution paths in procedural programs, reflecting their call and return nesting structure. Finite nested words also capture the structure ...