2878 search results - page 357 / 576 » Model Checking FTA |
146
click to vote
SIGSOFT
2003
ACM
16 years 7 months ago
2003
ACM
This paper describes a compositional proof strategy for verifying properties of requirements specifications. The proof strategy, which may be applied using either a model checker ...
173
click to vote
PEPM
2010
ACM
16 years 3 months ago
2010
ACM
Pushdown systems are well understood as abstract models of programs with (recursive) procedures. Reps et al. recently extended pushdown systems into weighted pushdown systems, whi...
224
click to vote
FOSSACS
2001
Springer
15 years 11 months ago
2001
Springer
Hierarchical Message Sequence Charts are a well-established formalism to specify telecommunication protocols. In this model, numerous undecidability results were obtained recently ...
170
click to vote
GECCO
2008
Springer
15 years 7 months ago
2008
Springer
Liveness properties in concurrent systems are, informally, those properties that stipulate that something good eventually happens during execution. In order to prove that a given ...
154
click to vote
SIGSOFT
2009
ACM
16 years 7 months ago
2009
ACM
We propose a new algorithm for verifying concurrent programs, which uses concrete executions to partition the program into a set of lean partitions called concurrent trace program...