846 search results - page 123 / 170 » On the Computational Complexity of Spatio-Temporal Logics |
ICFP
2008
ACM
15 years 11 months ago
2008
ACM
We describe an axiomatic extension to the Coq proof assistant, that supports writing, reasoning about, and extracting higher-order, dependently-typed programs with side-effects. C...
112
click to vote
KBSE
2000
IEEE
15 years 2 months ago
2000
IEEE
c specifications provide a powerful method for the specification of abstract data types in programming languages and software systems. Completeness and ground confluence are fundam...
AI
2008
Springer
14 years 11 months ago
2008
Springer
The notion of maintenance often appears in the AI literature in the context of agent behavior and planning. In this paper, we argue that earlier characterizations of the notion of...
103
click to vote
ICFEM
2009
Springer
14 years 9 months ago
2009
Springer
In this paper we continue the study of a strict extension of the Computation Tree Logic, called graded-CTL, recently introduced by the same authors. This new logic augments the sta...
103
click to vote
DAC
2006
ACM
16 years 3 days ago
2006
ACM
With increasing aggregate off-chip bandwidths exceeding terabits/second (Tb/s), the power dissipation is a serious design consideration. Additionally, design of I/O links is const...