319 search results - page 18 / 64 » Space-Efficient Bounded Model Checking |
ENTCS
2007
13 years 10 months ago
2007
Bounded Model Checking (BMC) is one of the most paradigmatic practical applications of Boolean Satisfiability (SAT). The utilization of SAT in model checking has allowed signifi...
SWAT
2000
Springer
14 years 1 months ago
2000
Springer
We define external memory (or I/O) models which capture space complexity and develop a general technique for deriving I/O-space trade-offs in these models from internal memory mode...
ICFEM
2007
Springer
14 years 4 months ago
2007
Springer
Bounded semantics of LTL with existential interpretation and that of ECTL (the existential fragment of CTL), and the characterization of these existentially interpreted properties ...
FAW
2008
Springer
13 years 11 months ago
2008
Springer
We prove that there exists an O(log(n))-labeling scheme for every first-order formula with free set variables in every class of graphs that is nicely locally cwd-decomposable, whic...
LMCS
2007
13 years 9 months ago
2007
Higher-Order Fixpoint Logic (HFL) is a hybrid of the simply typed λ-calculus and the modal µ-calculus. This makes it a highly expressive temporal logic that is capable of express...