105 search results - page 15 / 21 » Symbolic Model Checking of Non-regular Properties |
TSMC
2010
13 years 3 months ago
2010
Traditional planning assumes reachability goals and/or full observability. In this paper, we propose a novel solution for safety and reachability planning with partial observabilit...
CONCUR
1997
Springer
14 years 20 days 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...
SPIN
2007
Springer
14 years 2 months ago
2007
Springer
d Abstract) Luboˇs Brim and Jiˇr´ı Barnat Faculty of Informatics, Masaryk University, Brno, Czech Republic With the increase in the complexity of computer systems, it becomes e...
CCS
2008
ACM
13 years 10 months ago
2008
ACM
Attribute staleness arises due to the physical distribution of authorization information, decision and enforcement points. This is a fundamental problem in virtually any secure di...
CHARME
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. Unbounded model checking of invariant properties is typically solved using symbolic reachability. However, BDD based reachability methods suffer from lack of robustness ...