6274 search results - page 432 / 1255 » Proofs, Programs, Processes |
210
click to vote
MPC
2010
Springer
15 years 11 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 ...
181
click to vote
FASE
2001
Springer
15 years 11 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 ...
163
click to vote
ISMVL
1999
IEEE
15 years 11 months ago
1999
IEEE
In the last years two automated reasoning techniques for clause normal form arose in which the use of labels are prominently featured: signed logic and annotated logic programming...
194
click to vote
LPAR
1999
Springer
15 years 11 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...
188
Voted
LCPC
1993
Springer
15 years 11 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 ...