6608 search results - page 270 / 1322 » On the Completeness of Model Checking |
123
click to vote
ATAL
2005
Springer
15 years 11 months ago
2005
Springer
We sketch how to express typical features of agent communication protocols in a simple temporal logic and show that conformance verification at runtime reduces to a generalised f...
147
click to vote
FSTTCS
2007
Springer
16 years 4 days ago
2007
Springer
We consider scheduling problems in which a job consists of components of different types to be processed on m machines. Each machine is capable of processing components of a singl...
194
click to vote
VLSID
2004
IEEE
16 years 6 months ago
2004
IEEE
This paper presents a novel technique for abstracting designs in order to increase the efficiency of formal property checking. Bounded Model Checking (BMC), using Satisfiability (...
177
click to vote
ICPADS
2005
IEEE
15 years 11 months ago
2005
IEEE
This work presents a new comparison-based diagnosis model and a new algorithm, called Hi-Dif, based on this model. The algorithm is used for checking the integrity of systems with...
148
click to vote
ASPDAC
2008
ACM
15 years 7 months ago
2008
ACM
—In this paper we describe a practical methodology to formally verify highly optimized, industrial multipliers. We a multiplier description language which abstracts from low-leve...