972 search results - page 67 / 195 » Reasoning with Conditional Time-Intervals |
ENTCS
2007
13 years 7 months ago
2007
Bounded Model Checking (BMC) is one of the most paradigmatic practical applications of Boolean Satisfiability (SAT). The utilization of SAT in model checking has allowed signifi...
MFCS
2010
Springer
13 years 6 months ago
2010
Springer
We address the strategy problem for ω-regular two-player games with partial information, played on finite game graphs. We consider two different kinds of observability on a gene...
VSTTE
2012
Springer
12 years 3 months ago
2012
Springer
Motivated by the problem of deciding verification conditions for the verification of functional programs, we present new decision procedures for automated reasoning about functio...
ELP
1991
13 years 11 months ago
1991
Operational semantics provide a simple, high-level and elegant means of specifying interpreters for programming languages. In natural semantics, a form of operational semantics, p...
EWCBR
2008
Springer
13 years 9 months ago
2008
Springer
In this paper we propose an approach to address the old problem of identifying the feature conditions under which a gaming strategy can be effective. For doing this, we will build ...