Sciweavers

364 search results - page 54 / 73
» Model checking with Boolean Satisfiability
Sort
View
ENTCS
2002
91views more  ENTCS 2002»
13 years 8 months ago
Interval Duration Logic: Expressiveness and Decidability
We investigate a variant of dense-time Duration Calculus which permits model checking using timed/hybrid automata. We define a variant of the Duration Calculus, called Interval Du...
Paritosh K. Pandya
CAV
2009
Springer
157views Hardware» more  CAV 2009»
14 years 9 months ago
Explaining Counterexamples Using Causality
Abstract. When a model does not satisfy a given specification, a counterexample is produced by the model checker to demonstrate the failure. A user must then examine the counterexa...
Ilan Beer, Shoham Ben-David, Hana Chockler, Avigai...
MODELS
2009
Springer
14 years 3 months ago
Evaluating Context Descriptions and Property Definition Patterns for Software Formal Validation
A well known challenge in the formal methods domain is to improve their integration with practical engineering methods. In the context of embedded systems, model checking requires ...
Philippe Dhaussy, Pierre Yves Pillain, Stephen Cre...
ALT
2001
Springer
14 years 1 months ago
Learning Coherent Concepts
We develop a theory for learning scenarios where multiple learners co-exist but there are mutual compatibility constraints on their outcomes. This is natural in cognitive learning...
Ashutosh Garg, Dan Roth
AGP
2003
IEEE
14 years 2 months ago
Solving Hard Disjunctive Logic Programs Faster (Sometimes)
Disjunctive Logic Programming (DLP) under the consistent answer set semantics is an advanced formalism for knowledge representation and reasoning. It is, under widely believed assu...
Gerald Pfeifer