Sciweavers

101 search results - page 6 / 21
» Some Progress in Satisfiability Checking for Difference Logi...
Sort
View
CAV
2009
Springer
182views Hardware» more  CAV 2009»
14 years 2 months ago
Generalizing DPLL to Richer Logics
The DPLL approach to the Boolean satisfiability problem (SAT) is a combination of search for a satisfying assignment and logical deduction, in which each process guides the other....
Kenneth L. McMillan, Andreas Kuehlmann, Mooly Sagi...
CAV
2005
Springer
127views Hardware» more  CAV 2005»
14 years 28 days ago
Incremental and Complete Bounded Model Checking for Full PLTL
Bounded model checking is an efficient method for finding bugs in system designs. The major drawback of the basic method is that it cannot prove properties, only disprove them. R...
Keijo Heljanko, Tommi A. Junttila, Timo Latvala
FOIKS
2006
Springer
13 years 11 months ago
Consistency Checking Algorithms for Restricted UML Class Diagrams
Abstract. Automatic debugging of UML class diagrams helps in the visual specification of software systems because users cannot detect errors in logical inconsistency easily. This p...
Ken Kaneiwa, Ken Satoh
IJISEC
2008
101views more  IJISEC 2008»
13 years 7 months ago
SAT-based model-checking for security protocols analysis
We present a model checking technique for security protocols based on a reduction to propositional logic. At the core of our approach is a procedure that, given a description of th...
Alessandro Armando, Luca Compagna
NDJFL
2000
97views more  NDJFL 2000»
13 years 7 months ago
Neo-Fregean Foundations for Real Analysis: Some Reflections on Frege's Constraint
now of a number of ways of developing Real Analysis on a basis of abstraction principles and second-order logic. One, outlined by Shapiro in his contribution to this volume, mimic...
Crispin Wright