507 search results - page 44 / 102 » Counterexample-Guided Abstraction Refinement |
DAC
2004
ACM
14 years 11 months ago
2004
ACM
Instances of the Boolean satisfiability problem (SAT) arise in many areas of circuit design and verification. These instances are typically constructed from some human-designed ar...
AMT
2010
Springer
13 years 11 months ago
2010
Springer
Abstract. Consistent description and representation method of user interests are required for personalized Web applications. In this paper, we provide a formal definition and the &...
NOMS
2000
IEEE
14 years 2 months ago
2000
IEEE
ot only high level description of abstract policy, but also enables such policy to be refined and eventually mapped into an appropriate configuration for controlling devices in the...
CAV
2008
Springer
13 years 11 months ago
2008
Springer
Abstract. This paper develops a local reasoning method to check lineartime temporal properties of concurrent programs. In practice, it is often infeasible to model check over the p...
ASM
2008
ASM
13 years 12 months ago
2008
ASM
A Virtual Machine (VM) is a program running on a conventional microprocessor that emulates the binary instruction set, registers, and memory space of an idealized computing machine...