6608 search results - page 162 / 1322 » On the Completeness of Model Checking |
131
Voted
CSL
2006
Springer
15 years 8 months ago
2006
Springer
Game quantification is an expressive concept and has been studied in model theory and descriptive set theory, especially in relation to infinitary logics. Automatic structures on t...
164
click to vote
TLDI
2005
ACM
15 years 10 months ago
2005
ACM
Completely annotated lambda terms (such as are arrived at via the straightforward encodings of various types from System F) contain much redundant type information. Consequently, ...
128
click to vote
ISW
2005
Springer
15 years 10 months ago
2005
Springer
We present a model-checking algorithm which can be used to evaluate access control policies, and a tool which implements it. The evaluation includes not only assessing whether the ...
120
click to vote
HYBRID
2007
Springer
15 years 10 months ago
2007
Springer
The lack of precise numerical information for the values of biological parameters severely limits the development and analysis of models of genetic regulatory networks. To deal wit...
137
click to vote
PVM
2007
Springer
15 years 10 months ago
2007
Springer
Formal program verification often requires creating a model of the program and running it through a model-checking tool. However, this model-creation step is itself error prone, t...