632 search results - page 69 / 127 » Proving Invariants of Functional Programs |
112
click to vote
CADE
2005
Springer
16 years 26 days ago
2005
Springer
We describe an algorithm for deciding the first-order multisorted theory BAPA, which combines 1) Boolean algebras of sets of uninterpreted elements (BA) and 2) Presburger arithmeti...
TCS
2002
15 years 6 days ago
2002
In this paper we present two non-standard-type inference systems for conjunctive strictness and totality analyses of higher-order-typed functional programs and prove completeness ...
129
Voted
ASIACRYPT
2010
Springer
14 years 10 months ago
2010
Springer
This paper investigates the Random Oracle Model (ROM) feature known as programmability, which allows security reductions in the ROM to dynamically choose the range points of an ide...
ICFP
2001
ACM
16 years 15 days ago
2001
ACM
This paper presents a new implementation technique for priority search queues. This abstract data type is an amazing blend of finite maps and priority queues. Our implementation s...
105
Voted
CORR
2010
Springer
14 years 7 months ago
2010
Springer
am analysis and has been widely studied. In this paper we consider this problem at the abstraction level of program schemas in which computations occur in the Herbrand domain of te...