Sciweavers

36 search results - page 1 / 8
» A Coverage Checking Algorithm for LF
Sort
View
TPHOL
2003
IEEE
13 years 10 months ago
A Coverage Checking Algorithm for LF
Coverage checking is the problem of deciding whether any closed term of a given type is an instance of at least one of a given set of patterns. It can be used to verify if a functi...
Carsten Schürmann, Frank Pfenning
ENTCS
2008
92views more  ENTCS 2008»
13 years 4 months ago
Redundancy Elimination for LF
We present a type system extending the dependent type theory LF, whose terms are more amenable to compact representation. This is achieved by carefully omitting certain subterms w...
Jason Reed
ASPDAC
2006
ACM
113views Hardware» more  ASPDAC 2006»
13 years 10 months ago
Transition-based coverage estimation for symbolic model checking
— Lack of complete formal specification is one of the major obstacles for the deployment of model checking. Coverage estimation addresses this issue by revealing the unverified...
Xingwen Xu, Shinji Kimura, Kazunari Horikawa, Take...
TACAS
2001
Springer
125views Algorithms» more  TACAS 2001»
13 years 9 months ago
Coverage Metrics for Temporal Logic Model Checking
In formal verification, we verify that a system is correct with respect to a specification. Even when the system is proven to be correct, there is still a question of how complet...
Hana Chockler, Orna Kupferman, Moshe Y. Vardi
DAC
2010
ACM
13 years 8 months ago
Coverage in interpolation-based model checking
Coverage is a means to quantify the quality of a system specification, and is frequently applied to assess progress in system validation. Coverage is a standard measure in testin...
Hana Chockler, Daniel Kroening, Mitra Purandare