3552 search results - page 363 / 711 » Proof theory in the abstract |
193
click to vote
DBPL
1997
Springer
15 years 11 months ago
1997
Springer
Abstract. In the context of the object-oriented data model, a compiletime approach is given that provides for a significant reduction of the amount of run-time transaction overhead...
174
click to vote
TACAS
1997
Springer
15 years 11 months ago
1997
Springer
Abstract. We have argued previously that the e ectiveness of a veri cation system derives not only from the power of its individual features for expression and deduction, but from ...
188
Voted
LCPC
1993
Springer
15 years 11 months ago
1993
Springer
Abstract. Loop fusion is a program transformation that merges multiple loops into one. It is e ective for reducing the synchronization overhead of parallel loops and for improving ...
181
Voted
CRYPTO
1989
Springer
15 years 11 months ago
1989
Springer
Abstract. In this paper, we provide a new approach to study undeniable signatures by translating secure digital signatures to secure undeniable signatures so that the existing algo...
191
click to vote
ANTS
2010
Springer
15 years 10 months ago
2010
Springer
Abstract. We answer a question asked by Hajdu and Tengely: The only arithmetic progression in coprime integers of the form (a2 , b2 , c2 , d5 ) is (1, 1, 1, 1). For the proof, we ï...