778 search results - page 63 / 156 » Expressiveness and complexity of graph logic |
FORTE
2004
15 years 1 months 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...
106
Voted
ICRA
2007
IEEE
15 years 6 months ago
2007
IEEE
— Given a robot model and a class of admissible environments, this paper provides a framework for automatically and verifiably composing controllers that satisfy high level task...
133
Voted
PLANX
2007
15 years 1 months ago
2007
We present an algorithm to solve XPath decision problems under regular tree type constraints and show its use to statically typecheck XPath queries. To this end, we prove the deci...
113
click to vote
CORR
2010
Springer
15 years 19 days ago
2010
Springer
Refinement types sharpen systems of simple and dependent types by offering expressive means to more precisely classify well-typed terms. We present a system of refinement types for...
90
Voted
ICCAD
2002
IEEE
15 years 5 months ago
2002
IEEE
The ultimate goal of logic synthesis is to explore implementation flexibility toward meeting design targets, such as area, power, and delay. Traditionally, such flexibility is exp...