Sciweavers

2137 search results - page 48 / 428
» Proving Abstract Non-interference
Sort
View
142
Voted
CADE
2012
Springer
13 years 5 months ago
Taming Past LTL and Flat Counter Systems
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...
Stéphane Demri, Amit Kumar Dhar, Arnaud San...
131
Voted
CONCUR
2012
Springer
13 years 5 months ago
MSO Decidability of Multi-Pushdown Systems via Split-Width
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...
Aiswarya Cyriac, Paul Gastin, K. Narayan Kumar
247
Voted
POPL
2009
ACM
16 years 3 months ago
A combination framework for tracking partition sizes
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...
Sumit Gulwani, Tal Lev-Ami, Mooly Sagiv
97
Voted
ECAI
2004
Springer
15 years 8 months ago
A General Recursive Schema for Argumentation Semantics
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...
Pietro Baroni, Massimiliano Giacomin
CAV
2006
Springer
101views Hardware» more  CAV 2006»
15 years 6 months ago
Terminator: Beyond Safety
Previous symbolic software model checkers (i.e., program analysis tools based on predicate abstraction, pushdown model checkiterative counterexample-guided abstraction refinement, ...
Byron Cook, Andreas Podelski, Andrey Rybalchenko