1018 search results - page 94 / 204 » Abstraction and Refinement in Model Checking |
TACAS
2004
Springer
14 years 1 months ago
2004
Springer
Abstract In the event that a system does not satisfy a specification, a model checker will typically automatically produce a counterexample trace that shows a particular instance ...
EDOC
2004
IEEE
13 years 11 months ago
2004
IEEE
To focus the comparison of languages for model checking and transformation on criteria that matter in practical development, there is an urgent need for more, and more realistic, ...
SPIN
2007
Springer
14 years 1 months ago
2007
Springer
Boolean programs are frequently used to model abstractions of software programs. They have the advantage that reachability properties are decidable, despite the fact that their sta...
ESAW
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. This paper surveys the state-of-the-art in developing multi-agent systems, and sets out to answer the questions: "what are the key current issues in developing multi...
AOSD
2003
ACM
14 years 1 months ago
2003
ACM
We define a generic join point model for checking the Law of Demeter (LoD). Join points are trees, pointcuts are predicates over join points, and advice is checked statically sim...