2137 search results - page 48 / 428 » Proving Abstract Non-interference |
CADE
2012
Springer
13 years 11 days ago
2012
Springer
Abstract. Reachability and LTL model-checking problems for flat counter systems are known to be decidable but whereas the reachability problem can be shown in NP, the best known c...
CONCUR
2012
Springer
13 years 11 days ago
2012
Springer
Abstract. Multi-threaded programs with recursion are naturally modeled as multi-pushdown systems. The behaviors are represented as multiply nested words (MNWs), which are words enr...
192
click to vote
POPL
2009
ACM
15 years 10 months ago
2009
ACM
ibe an abstract interpretation based framework for proving relationships between sizes of memory partitions. Instances of this framework can prove traditional properties such as m...
ECAI
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. In argumentation theory, Dung’s abstract framework provides a unifying view of several alternative semantics based on the notion of extension. Recently, a new semantics...
CAV
2006
Springer
15 years 1 months ago
2006
Springer
Previous symbolic software model checkers (i.e., program analysis tools based on predicate abstraction, pushdown model checkiterative counterexample-guided abstraction refinement, ...