231 search results - page 19 / 47 » Mu-calculus path checking |
CONCUR
1997
Springer
14 years 3 months ago
1997
Springer
We apply the symbolic analysis principle to pushdown systems. We represent (possibly in nite) sets of con gurations of such systems by means of nite-state automata. In order to re...
ENTCS
2007
13 years 10 months ago
2007
Symbolic model checking is PSPACE complete. Since QBF is the standard PSPACE complete problem, it is most natural to encode symbolic model checking problems as QBF formulas and th...
ERSHOV
2009
Springer
13 years 8 months ago
2009
Springer
Abstract. Historically, dynamic techniques are the pioneers of the area of information flow in the 70's. In their seminal work, Denning and Denning suggest a static alternativ...
WINET
2010
13 years 5 months ago
2010
In this paper, we consider filtering false reports in braided multipath routing sensor networks. While multipath routing provides better resilience to various faults in sensor net...
ESORICS
2012
Springer
12 years 1 months ago
2012
Springer
Tracking information flow in dynamic languages remains an open challenge. It might seem natural to address the challenge by runtime monitoring. However, there are well-known funda...