3224 search results - page 466 / 645 » On Checking Model Checkers |
168
click to vote
FSTTCS
2004
Springer
15 years 12 months ago
2004
Springer
We consider the problem of symbolic reachability analysis of higher-order context-free processes. These models are generalizations of the context-free processes (also called BPA pr...
144
click to vote
TACAS
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. The methods of Invisible Invariants and Invisible Ranking were developed originally in order to verify temporal properties of parameterized systems in a fully automatic m...
181
click to vote
LICS
2003
IEEE
15 years 11 months ago
2003
IEEE
We define the class of micro-macro stack graphs, a new class of graphs modeling infinite-state sequential systems with a decidable model-checking problem. Micro-macro stack grap...
163
click to vote
CIA
2003
Springer
15 years 11 months ago
2003
Springer
Abstract For an information-agent-based system to support virtual (Internet-supported) organisations, changes in environmental conditions often demand changes in organisational beh...
173
click to vote
ECOOP
2003
Springer
15 years 11 months ago
2003
Springer
We design and study νObj, a calculus and dependent type system for objects and classes which can have types as members. Type can be aliases, abstract types, or new types. The type...