899 search results - page 81 / 180 » A CTL-Based Logic for Program Abstractions |
100
Voted
CADE
2000
Springer
15 years 5 months ago
2000
Springer
Abstract. The Nuprl system is a framework for reasoning about mathematics and programming. Over the years its design has been substantially improved to meet the demands of large-sc...
121
Voted
ICALP
2000
Springer
15 years 4 months ago
2000
Springer
Abstract. Tree-walking automata (TWAs) recently received new attention in the fields of formal languages and databases. Towards a better understanding of their expressiveness, we c...
113
Voted
APLAS
2006
ACM
15 years 4 months ago
2006
ACM
Abstract. Static analyses calculate abstract states, and their logics validate properties of the abstract states. We place into perspective the variety of forwards, backwards, func...
117
click to vote
ICFP
2003
ACM
16 years 16 days ago
2003
ACM
The task of designing and implementing a compiler can be a difficult and error-prone process. In this paper, we present proach based on the use of higher-order abstract syntax and...
88
Voted
POPL
2000
ACM
15 years 5 months ago
2000
ACM
In 1998 Asperti and Mairson proved that the cost of reducing a lambda-term using an optimal lambda-reducer (a la L´evy) cannot be bound by any elementary function in the number o...