5084 search results - page 208 / 1017 » Proving Possibility Properties |
168
click to vote
FM
2005
Springer
15 years 12 months ago
2005
Springer
This paper presents an automated and compositional procedure to solve the substitutability problem in the context of evolving software systems. Our solution contributes two techniq...
157
click to vote
ICALP
2005
Springer
15 years 12 months ago
2005
Springer
Abstract. We describe a cryptographically sound formal logic for proving protocol security properties without explicitly reasoning about probability, asymptotic complexity, or the ...
193
click to vote
ICALP
2005
Springer
15 years 12 months ago
2005
Springer
Abstract. Weighted automata are used to describe quantitative properties in various areas such as probabilistic systems, image compression, speech-to-text processing. The behaviour...
193
click to vote
TABLEAUX
2005
Springer
15 years 12 months ago
2005
Springer
In description logics (DLs), concrete domains are used for defining concepts based on concrete qualities of their instances such as the weight, age, duration, and spatial extensio...
193
click to vote
WCC
2005
Springer
15 years 12 months ago
2005
Springer
Nonlinear n-stage feedback shift-register sequences over the finite field Fq of period qn − 1 are investigated under linear operations on sequences. We prove that all members o...