481 search results - page 27 / 97 » Model Checking Abstract State Machines and Beyond |
106
click to vote
VMCAI
2005
Springer
15 years 7 months ago
2005
Springer
Abstract. The paper presents methods for model checking a class of possibly infinite state concurrent programs using various types of bi-simulation reductions. The proposed method...
100
click to vote
EWSA
2004
Springer
15 years 7 months ago
2004
Springer
Abstract. Software architectures are engineering artifacts which provide high-level descriptions of complex systems. Certain recent architecture description languages (Adls) allow ...
131
click to vote
CAV
2008
Springer
15 years 3 months ago
2008
Springer
Abstract. This paper develops a local reasoning method to check lineartime temporal properties of concurrent programs. In practice, it is often infeasible to model check over the p...
124
click to vote
ICTAC
2005
Springer
15 years 7 months ago
2005
Springer
Abstract. This paper introduces the notion of finite precision timed automata (FPTAs) and proposes a data structure to represent its symbolic states. To reduce the state space, FP...
133
click to vote
LPNMR
2004
Springer
15 years 7 months ago
2004
Springer
Abstract. Many NP-complete problems can be encoded in the answer set semantics of logic programs in a very concise way, where the encoding reflects the typical “guess and check...