1226 search results - page 124 / 246 » Proofs, Programs and Abstract Complexity |
133
click to vote
MPC
2010
Springer
15 years 8 months ago
2010
Springer
Abstract. It is natural to present subtyping for recursive types coinductively. However, Gapeyev, Levin and Pierce have noted that there is a problem with coinductive definitions ...
128
Voted
FASE
2001
Springer
15 years 8 months ago
2001
Springer
Abstract. This paper describes a specialised logic for proving specifications in the Java Modeling Language (JML). JML is an interface specification language for Java. It allows ...
136
click to vote
LPAR
1999
Springer
15 years 7 months ago
1999
Springer
Abstract. Walther’s estimation calculus was designed to prove the termination of functional programs, and can also be used to solve the similar problem of proving the well-founde...
137
click to vote
LCPC
1993
Springer
15 years 7 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 ...
133
Voted
TACAS
2000
Springer
15 years 7 months ago
2000
Springer
Abstract. The Prosper (Proof and Specification Assisted Design Environments) project advocates the use of toolkits which allow existing verification tools to be adapted to a more f...