3333 search results - page 298 / 667 » Abstract Proof Search |
188
click to vote
DBPL
1997
Springer
15 years 10 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...
172
click to vote
TACAS
1997
Springer
15 years 10 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 ...
186
click to vote
TAPSOFT
1997
Springer
15 years 10 months ago
1997
Springer
Abstract. This paper presents a formalization of nite and in nite sequences in domain theory carried out in the theorem prover Isabelle. The results are used to model the metatheor...
207
click to vote
CADE
1992
Springer
15 years 10 months ago
1992
Springer
Abstract. We exhibit a methodology for formulating and verifying metatheorems about deductive systems in the Elf language, an implementation of the LF Logical Framework with an ope...
183
click to vote
LCPC
1993
Springer
15 years 10 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 ...