Sciweavers

797 search results - page 78 / 160
» Eliminating Proofs from Programs
Sort
View
APLAS
2003
ACM
14 years 2 months ago
Executing Verified Compiler Specification
Abstract. Much work has been done in verifying a compiler specification, both in hand-written and mechanical proofs. However, there is still a gap between a correct compiler specif...
Koji Okuma, Yasuhiko Minamide
PPDP
2000
Springer
14 years 2 months ago
A model for comparing the space usage of lazy evaluators
Identifying the source of space faults in functional programs is hard. The problem is compoundedas space usage can vary enormously from one implementation to another. We use a ter...
Adam Bakewell, Colin Runciman
TOOLS
1999
IEEE
14 years 3 months ago
Associations as a Language Construct
stone in the object-oriented paradigm is the abstraction mechanisms transcending analysis, design, and implementation. The notions of class, object, behaviour, and inheritance are...
Kasper Østerbye
ICFP
2007
ACM
14 years 11 months ago
Relating complexity and precision in control flow analysis
We analyze the computational complexity of kCFA, a hierarchy of control flow analyses that determine which functions may be applied at a given call-site. This hierarchy specifies ...
David Van Horn, Harry G. Mairson
DBPL
1993
Springer
89views Database» more  DBPL 1993»
14 years 3 months ago
Database Programming in Transaction Logic
This paper presents database applications of the recently proposed Transaction Logic—an extension of classical predicate logic that accounts in a clean and declarative fashion f...
Anthony J. Bonner, Michael Kifer, Mariano P. Conse...