920 search results - page 106 / 184 » Generating Satisfiable Problem Instances |
139
Voted
TACAS
2010
Springer
14 years 10 months ago
2010
Springer
Abstract. We present a compositional verification technique for systems that exhibit both probabilistic and nondeterministic behaviour. We adopt an assume-guarantee approach to ver...
193
click to vote
WIRN
2005
Springer
15 years 6 months ago
2005
Springer
Abstract. This paper presents an Artificial Immune-based optimization technique for solving the economic dispatch problem in a power system. The main role of electrical power utili...
144
click to vote
ERSHOV
2009
Springer
15 years 4 months ago
2009
Springer
A term t is called a template of terms t1 and t2 iff t1 = t1 and t2 = t2, for some substitutions 1 and 2. A template t of t1 and t2 is called the most specific iff for any template...
152
Voted
HYBRID
2010
Springer
15 years 2 months ago
2010
Springer
In this paper, we describe a receding horizon scheme that satisfies a class of linear temporal logic specifications sufficient to describe a wide range of properties including saf...
119
Voted
CADE
2002
Springer
16 years 1 months ago
2002
Springer
Abstract. We investigate the combination of propositional SAT checkers with domain-specific theorem provers as a foundation for bounded model checking over infinite domains. Given ...