5084 search results - page 306 / 1017 » Proving Possibility Properties |
187
click to vote
IFM
2007
Springer
16 years 1 months ago
2007
Springer
Abstract. Event-B is a notation and method for discrete systems modelling by refinement. We introduce a small but very useful construction: qualitative probabilistic choice. It ex...
174
click to vote
SAS
2007
Springer
16 years 1 months ago
2007
Springer
Abstract. Shape analyses are often imprecise in their numerical reasoning, whereas numerical static analyses are often largely unaware of the shape of a program’s heap. In this p...
199
click to vote
TABLEAUX
2007
Springer
16 years 1 months ago
2007
Springer
We construct a sound, complete, and terminating tableau system for the interval temporal logic D · interpreted in interval structures over dense linear orderings endowed with stri...
174
click to vote
TAMC
2007
Springer
16 years 1 months ago
2007
Springer
For generalized Reed-Solomon codes, it has been proved [7] that the problem of determining if a received word is a deep hole is coNP-complete. The reduction relies on the fact that...
154
click to vote
TCC
2007
Springer
16 years 1 months ago
2007
Springer
Abstract. This paper presents a very simple and efficient adaptivelysound perfect NIZK argument system for any NP-language. In contrast to recently proposed schemes by Groth, Ostro...