570 search results - page 69 / 114 » The Complexity of Reasoning with Global Constraints |
142
click to vote
POPL
2011
ACM
14 years 17 days ago
2011
ACM
We define a new logic, STRAND, that allows reasoning with heapmanipulating programs using deductive verification and SMT solvers. STRAND logic (“STRucture ANd Data” logic) f...
FDL
2008
IEEE
15 years 4 months ago
2008
IEEE
Constraint-based random simulation is state-of-the-art in verification of multi-million gate industrial designs. This method is based on stimulus generation by constraint solving...
114
click to vote
LPNMR
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. The paper presents INFOMIX a successful application of ASP technology to the domain of Data Integration. INFOMIX is a novel system which supports powerful information int...
TOOLS
2008
IEEE
15 years 4 months ago
2008
IEEE
Abstract. A popular approach to compositional verification of component-based applications is based on the assume-guarantee paradigm, where an assumption models behavior of an env...
ICFEM
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. We present a “memory-model-sensitive” approach to validating correctness properties for multithreaded programs. Our key insight is that by specifying both the inter-t...