146 search results - page 10 / 30 » Modelling and solving temporal reasoning as propositional sa... |
ITS
2000
Springer
14 years 5 days ago
2000
Springer
This paper presents an approach to the design of a learning environment in a mathematical domain (elementary combinatorics) where problem solving is based more on modelling than o...
CADE
2012
Springer
11 years 11 months ago
2012
Springer
We propose a word level, bounded model checking (BMC) algorithm based on translation into the effectively propositional fragment (EPR) of firstorder logic. This approach to BMC al...
AISC
2008
Springer
13 years 10 months ago
2008
Springer
Grid computing offers a promising approach to solving challenging computational problems in an environment consisting of a large number of easily accessible resources. In this pape...
SOFSEM
2012
Springer
12 years 4 months ago
2012
Springer
In automated synthesis, we transform a specification into a system that is guaranteed to satisfy the specification against all environments. While modelchecking theory has led to...
TABLEAUX
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. Model checking is a technique for verifying that a finite-state concurrent system is correct with respect to its specification. In bounded model checking (BMC), the sys...