3224 search results - page 166 / 645 » On Checking Model Checkers |
146
click to vote
CAV
2000
Springer
15 years 7 months ago
2000
Springer
In this paper we show how to do symbolic model checking using Boolean Expression Diagrams (BEDs), a non-canonical representation for Boolean formulas, instead of Binary Decision Di...
135
Voted
DAC
2006
ACM
16 years 4 months ago
2006
ACM
In this paper, we present a method that helps improve the performance of Bounded Model Checking by automatically strengthening invariants so that the termination proof may be obta...
131
Voted
SAT
2005
Springer
15 years 9 months ago
2005
Springer
Current algorithms for bounded model checking (BMC) use SAT methods for checking satisfiability of Boolean formulas. These BMC methods suffer from a potential memory explosion prob...
146
click to vote
ISSTA
2009
ACM
15 years 8 months ago
2009
ACM
This paper describes an approach for conformance testing of mobile and distributed systems. The approach is based on kiltera — a novel, high-level language supporting the descri...
153
Voted
VAMOS
2010
Springer
15 years 5 months ago
2010
Springer
Feature-Oriented Model-Driven Engineering (FOMDE) is an approach that lies at the intersection of two complementary paradigms for software construction, Model Driven Engineering (M...