481 search results - page 33 / 97 » Model Checking Abstract State Machines and Beyond |
110
click to vote
CSCLP
2006
Springer
15 years 5 months ago
2006
Springer
Abstract. Traditional resources in scheduling are simple machines where a capacity is the main restriction. However, in practice there frequently appear resources with more complex...
119
click to vote
ICTAC
2009
Springer
15 years 8 months ago
2009
Springer
Abstract. Model programs are used as high-level behavioral specifications typically representing abstract state machines. For modeling reactive systems, one uses input-output mode...
PEPM
2009
ACM
15 years 10 months ago
2009
ACM
Exhaustive model checking search techniques are ineffective for error discovery in large and complex multi-threaded software systems. Distance estimate heuristics guide the concre...
122
click to vote
DAC
2008
ACM
16 years 2 months ago
2008
ACM
ng Automatic Abstraction Refinement for Generalized Symbolic Trajectory Evaluation Yan Chen Dept. of Computer Science Portland State University Portland, OR, 97207 chenyan@cs.pdx.e...
150
click to vote
CONCUR
2006
Springer
15 years 3 months ago
2006
Springer
Propositional temporal logic is not suitable for expressing properties on the evolution of dynamically allocated entities over time. In particular, it is not possible to trace such...