10870 search results - page 313 / 2174 » Model Checking Programs |
160
click to vote
ICLP
1987
Springer
15 years 10 months ago
1987
Springer
The Near-Horn Prolog procedures have been proposed as e ective procedures in the area of disjunctive logic programming, an extension of logic programming to the ( rstorder) non-Ho...
190
click to vote
ICALP
2010
Springer
15 years 8 months ago
2010
Springer
Guided Abstraction Simplification Roberto Giacobazzi1 and Francesco Ranzato2 1 University of Verona, Italy 2 University of Padova, Italy Abstract. In static analysis, approximation...
229
click to vote
TACAS
2000
Springer
15 years 10 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...
192
click to vote
KBSE
2005
IEEE
16 years 9 days 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...
168
click to vote
ENTCS
2007
15 years 6 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...