846 search results - page 126 / 170 » On the Computational Complexity of Spatio-Temporal Logics |
CHI
2007
ACM
15 years 11 months ago
2007
ACM
It is difficult to design and test location-enhanced applications. A large part of this difficulty is due to the added complexity of supporting location. Wizard of Oz (WOz) has be...
LPNMR
2004
Springer
15 years 4 months ago
2004
Springer
Abstract. This paper studies computational issues related to the problem of reasoning about actions and change (RAC) by exploiting its link with the Answer Set Programming paradigm...
100
Voted
ICALP
2009
Springer
15 years 11 months ago
2009
Springer
We present an AC1 (logDCFL) algorithm for checking LTL formulas over finite paths, thus establishing that the problem can be efficiently parallelized. Our construction provides a f...
103
click to vote
PLDI
2004
ACM
15 years 4 months ago
2004
ACM
The design of concurrent programs is error-prone due to the interaction between concurrently executing threads. Traditional automated techniques for finding errors in concurrent ...
149
click to vote
CF
2011
ACM
13 years 11 months ago
2011
ACM
Dynamic Information Flow Tracking (DIFT) is a powerful technique that can protect unmodified binaries from a broad range of vulnerabilities such as buffer overflow and code inj...