2878 search results - page 391 / 576 » Model Checking FTA |
179
click to vote
PASTE
2004
ACM
16 years 14 days ago
2004
ACM
Model checking requires a specification of the target system’s desirable properties, some of which are temporal. Formulating a property of the system based on either its abstrac...
180
Voted
FSTTCS
2004
Springer
16 years 12 days 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...
156
Voted
TACAS
2004
Springer
16 years 11 days 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...
191
click to vote
LICS
2003
IEEE
16 years 9 days 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...
181
Voted
CIA
2003
Springer
16 years 8 days 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...