2291 search results - page 158 / 459 » Logic Programming and Model Checking |
130
click to vote
DATE
2008
IEEE
15 years 11 months ago
2008
IEEE
With the advance of SAT solvers, transforming a software program to a propositional formula has generated much interest for bounded model checking of software in recent years. How...
191
click to vote
SPIN
2004
Springer
15 years 10 months ago
2004
Springer
Most approaches for model checking software are based on ration of abstract models from source code, which may greatly reduce the search space, but may also introduce errors that a...
161
Voted
STACS
2007
Springer
15 years 11 months ago
2007
Springer
Hybrid logics extend modal logics by first-order concepts, in particular they allow a limited use of variables. Unfortunately, in general, satisfiability for hybrid formulas is u...
166
click to vote
ESOP
2010
Springer
16 years 2 months ago
2010
Springer
Formal reasoning about concurrent programs is usually done with the assumption that the underlying memory model is sequentially consistent, i.e. the execution outcome is equivalen...
170
click to vote
BMCBI
2004
15 years 4 months ago
2004
Background: The protein structure prediction problem is one of the most challenging problems in biological sciences. Many approaches have been proposed using database information ...