3909 search results - page 211 / 782 » Extreme Model Checking |
172
click to vote
TACAS
2000
Springer
15 years 6 months ago
2000
Springer
Salsa is an invariant checker for speci cations in SAL the SCR Abstract Language. To establish a formula as an invariant without any user guidance Salsa carries out an induction pr...
135
click to vote
KBSE
2005
IEEE
15 years 8 months ago
2005
IEEE
We present a new model checking algorithm for verifying computation tree logic (CTL) properties. Our technique is based on using language inference to learn the fixpoints necessar...
124
click to vote
ENTCS
2007
15 years 3 months ago
2007
Symbolic model checking is PSPACE complete. Since QBF is the standard PSPACE complete problem, it is most natural to encode symbolic model checking problems as QBF formulas and th...
134
click to vote
ER
2005
Springer
15 years 8 months ago
2005
Springer
In this paper a novel approach for the tool–based quality assurance of models is presented. The approach provides a meta model framework for domain specific and tool–independe...
135
click to vote
ECOOPW
1999
Springer
15 years 7 months ago
1999
Springer
The model checking of applications of aspects is explained, by showing the stages and proof obligations when a collection of generic aspects (called a superimposition) is combined...