571 search results - page 19 / 115 » Performing causality analysis by bounded model checking |
ICLP
2007
Springer
15 years 3 months ago
2007
Springer
We present a static analysis that infers both upper and lower bounds on the usage that a logic program makes of a set of user-definable resources. The inferred bounds will in gener...
101
click to vote
ISSTA
2010
ACM
15 years 1 months ago
2010
ACM
SAT-based bounded verification of annotated code consists of translating the code together with the annotations to a propositional formula, and analyzing the formula for specifica...
104
click to vote
MMB
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. Computing tight performance bounds in feed-forward networks under general assumptions about arrival and server models has turned out to be a challenging problem. Recently...
CNSR
2007
IEEE
15 years 1 months ago
2007
IEEE
Wireless sensor networks have mainly been designed for information-collecting purposes, such as habitat monitoring, product process tracing, battlefield surveillance, etc. In orde...
113
click to vote
FORMATS
2006
Springer
15 years 3 months ago
2006
Springer
In this paper we describe an extension of timed automata with priorities, and efficient algorithms to compute subtraction on DBMs (difference bounded matrices), needed in symbolic ...