2009
DOI: 10.1007/978-3-642-00593-0_32
|View full text |Cite
|
Sign up to set email alerts
|

Abstract: Abstract. Model checking tools based on the iterative refinement of predicate abstraction (e.g., Slam and Blast) often feature a specification language for expressing complex behavior rules. The source code under verification is instrumented by artificial variables and statements in order to transform the problem of checking such a rule into the problem of program location reachability. This way, the source code get bloated and additional predicates have to be discovered and tracked during the verification. We… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
6
0

Year Published

2009
2009
2020
2020

Publication Types

Select...
6
1

Relationship

0
7

Authors

Journals

citations
Cited by 14 publications
(6 citation statements)
references
References 20 publications
0
6
0
Order By: Relevance
“…Safety properties and security aspects [42] can be modeled using finite observer automata (also called 'monitor automata') that run in parallel to the system to be verified and 'observe' the behavior of the system without influencing it. Observer automata are an established concept for providing a formal specification [3,7,14,43]. Separating specification from implementation supports the idea of separation of concerns; tools can support the user in providing and maintaining the specification.…”
Section: Protocol Automatamentioning
confidence: 99%
See 1 more Smart Citation
“…Safety properties and security aspects [42] can be modeled using finite observer automata (also called 'monitor automata') that run in parallel to the system to be verified and 'observe' the behavior of the system without influencing it. Observer automata are an established concept for providing a formal specification [3,7,14,43]. Separating specification from implementation supports the idea of separation of concerns; tools can support the user in providing and maintaining the specification.…”
Section: Protocol Automatamentioning
confidence: 99%
“…Slic [3] and Blast [7]), or checked on-the-fly in parallel to the program (cf. Blastcpa [43], CPAchecker [14], Orion [29]). A set of properties can be checked simultaneously within one run of a verifier.…”
Section: Protocol Automatamentioning
confidence: 99%
“…There were also attempts to support the splitting of specifications and programs into modular parts, in order to make the verification task for the model checkers easier, such as in the Blast query language [10,87]. There are also testing and analysis tools which ask the user for help [98].…”
Section: Information From Machinesmentioning
confidence: 99%
“…4 A transition label is a pair that consists of a subset of control-flow edges and a predicate over the program variables V to represent the guard condition for the transition to be taken. An observer automaton [11,13,32,34,36] is a protocol automaton that does not restrict the state space, i.e., if for each state q ∈ Q the disjunction of the guard conditions of all outgoing transitions is a tautology. Violation witnesses are represented by protocol automata in which all state invariants are true.…”
Section: Preliminariesmentioning
confidence: 99%