Sciweavers

395 search results - page 41 / 79
» Predicate Abstraction with Minimum Predicates
Sort
View
ENTCS
2000
112views more  ENTCS 2000»
13 years 9 months ago
Typed Multiset Rewriting Specifications of Security Protocols
The language MSR has successfully been used in the past to prove undecidability about security protocols modeled according to the Dolev-Yao abstraction. In this paper, we revise t...
Iliano Cervesato
CORR
2011
Springer
165views Education» more  CORR 2011»
13 years 4 months ago
From IF to BI: a tale of dependence and separation
We take a fresh look at the logics of informational dependence and independence of Hintikka and Sandu and V¨a¨an¨anen, and their compositional semantics due to Hodges. We show h...
Samson Abramsky, Jouko A. Väänänen
HYBRID
2003
Springer
14 years 3 months ago
Automated Symbolic Reachability Analysis; with Application to Delta-Notch Signaling Automata
Abstract. This paper describes the implementation of predicate abstraction techniques to automatically compute symbolic backward reachable sets of high dimensional piecewise affine...
Ronojoy Ghosh, Ashish Tiwari, Claire Tomlin
CORR
2010
Springer
127views Education» more  CORR 2010»
13 years 4 months ago
Complexity of Data Dependence problems for Program Schemas with Concurrency
am analysis and has been widely studied. In this paper we consider this problem at the abstraction level of program schemas in which computations occur in the Herbrand domain of te...
Sebastian Danicic, Robert M. Hierons, Michael R. L...
TACAS
2010
Springer
181views Algorithms» more  TACAS 2010»
14 years 4 months ago
Boom: Taking Boolean Program Model Checking One Step Further
Abstract. We present Boom, a comprehensive analysis tool for Boolean programs. We focus in this paper on model-checking non-recursive concurrent programs. Boom implements a recent ...
Gérard Basler, Matthew Hague, Daniel Kroeni...