556 search results - page 12 / 112 » Checking Interval Properties of Computations |
WG
1992
Springer
15 years 1 months ago
1992
Springer
The recognition complexityof ordered set properties is considered, i.e.how many questions have to be asked to decide if an unknown ordered set has a prescribed property. We prove ...
103
Voted
ENTCS
2006
14 years 9 months ago
2006
Bounded Model Checking (BMC) searches for counterexamples to a property with a bounded length k. If no such counterexample is found, k is increased. This process terminates when ...
102
click to vote
AGP
2003
IEEE
15 years 2 months ago
2003
IEEE
Many NP-complete problems can be encoded in the answer set semantics of logic programs in a very concise way, where the encoding reflects the typical “guess and check” nature ...
LICS
2005
IEEE
15 years 3 months ago
2005
IEEE
Three-valued models, in which properties of a system are either true, false or unknown, have recently been advocated as a better representation for reactive program abstractions g...
HYBRID
2007
Springer
15 years 3 months ago
2007
Springer
The lack of precise numerical information for the values of biological parameters severely limits the development and analysis of models of genetic regulatory networks. To deal wit...