798 search results - page 74 / 160 » Proving More Properties with Bounded Model Checking |
128
click to vote
TCS
2002
15 years 3 months ago
2002
We consider the timed automata model of [3], which allows the analysis of realtime systems expressed in terms of quantitative timing constraints. Traditional approaches to real-ti...
253
click to vote
POPL
2009
ACM
16 years 4 months ago
2009
ACM
We propose a new verification method for temporal properties of higher-order functional programs, which takes advantage of Ong's recent result on the decidability of the mode...
116
click to vote
CSL
2009
Springer
15 years 11 months ago
2009
Springer
One of Courcelle’s celebrated results states that if C is a class of graphs of bounded tree-width, then model-checking for monadic second order logic (MSO2) is fixed-parameter t...
149
click to vote
ICIP
1995
IEEE
15 years 7 months ago
1995
IEEE
This paper develops an error bound for narrow bandwidth Gabor filters synthesized using multiple stages. It is shown that the error introduced by approximating narrow bandwidth Ga...
153
click to vote
AAAI
2006
15 years 5 months ago
2006
Description Logics (DLs) are the formal foundations of the standard web ontology languages OWL-DL and OWL-Lite. In the Semantic Web and other domains, ontologies are increasingly ...