1138 search results - page 51 / 228 » First-Order Model Checking Problems Parameterized by the Mod... |
128
click to vote
ASM
2008
ASM
15 years 7 months ago
2008
ASM
As systems become ever more complex, verification becomes more main stream. Event-B and Alloy are two formal specification languages based on fairly different methodologies. While...
146
Voted
SPIN
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. Software model checking problems generally contain two different types of non-determinism: 1) non-deterministically chosen values; 2) the choice of interleaving among th...
142
Voted
SAT
2005
Springer
15 years 10 months ago
2005
Springer
Current algorithms for bounded model checking (BMC) use SAT methods for checking satisfiability of Boolean formulas. These BMC methods suffer from a potential memory explosion prob...
127
click to vote
KBSE
2009
IEEE
15 years 11 months ago
2009
IEEE
Abstract—Many applications are concurrent and communicate over a network. The non-determinism in the thread and communication schedules makes it desirable to model check such sys...
142
click to vote
ADVIS
2004
Springer
15 years 10 months ago
2004
Springer
Abstract. In many practical business process modelling scenarios using Petri nets, the resultant model does not have a single input place and a single output place. In particular, ...