447 search results - page 7 / 90 » Bounded Model Checking with Parametric Data Structures |
ECML
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. Clustering has recently enjoyed progress via spectral methods which group data using only pairwise affinities and avoid parametric assumptions. While spectral clustering ...
ERSHOV
2006
Springer
13 years 9 months ago
2006
Springer
Abstract. We address model checking problem for combination of Computation Tree Logic (CTL) and Propositional Logic of Knowledge (PLK) in finite systems with the perfect recall syn...
ISSTA
2010
ACM
13 years 9 months ago
2010
ACM
SAT-based bounded verification of annotated code consists of translating the code together with the annotations to a propositional formula, and analyzing the formula for specifica...
ISAAC
2007
Springer
14 years 1 months ago
2007
Springer
Checking value-sensitive data structures in sublinear space has been an open problem for over a decade. In this paper, we suggest a novel approach to solving it. We show that, in c...
KBSE
2005
IEEE
14 years 1 months ago
2005
IEEE
Software verification using model checking often translates programs into corresponding transition systems that model the program behavior. As software systems continue to grow i...