1391 search results - page 229 / 279 » Completeness of Neighbourhood Logic |
229
click to vote
SOFSEM
2009
Springer
16 years 3 months ago
2009
Springer
Abstract. Constraint Handling Rules (CHR) is a general purpose, committedchoice declarative language which, differently from other similar languages, uses multi-headed (guarded) ru...
175
click to vote
VMCAI
2009
Springer
16 years 27 days ago
2009
Springer
Given a 3-valued abstraction of a program (possibly generated using rogram analysis and predicate abstraction) and a temporal logic formula, generalized model checking (GMC) checks...
176
click to vote
GLVLSI
2009
IEEE
16 years 26 days ago
2009
IEEE
The sequential depth determines the completeness of bounded model checking in design verification. Recently, a SATbased method is proposed to compute the sequential depth of a de...
186
click to vote
TIME
2009
IEEE
16 years 26 days ago
2009
IEEE
The model checking problem for CTL is known to be P-complete (Clarke, Emerson, and Sistla (1986), see Schnoebelen (2002)). We consider fragments of CTL obtained by restricting the...
157
click to vote
CSL
2009
Springer
16 years 21 days ago
2009
Springer
We define an “enriched effect calculus” by extending a type theory for computational effects with primitives from linear logic. The new calculus, which generalises intuitionis...