632 search results - page 48 / 127 » Proving Invariants of Functional Programs |
102
Voted
ICFP
1999
ACM
15 years 4 months ago
1999
ACM
Many properties of parametric, polymorphic functions can be determined simply by inspection of their types. Such results are usually proven using Reynolds's parametricity the...
133
click to vote
CADE
2009
Springer
16 years 1 months ago
2009
Springer
In recent years researchers have developed a wide range of powerful automated reasoning systems. We have leveraged these systems to build Jahob, a program specification, analysis, ...
109
Voted
FASE
2001
Springer
15 years 5 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 ...
120
click to vote
ICLP
1997
Springer
15 years 4 months ago
1997
Springer
Abstract This paper describes a general framework for automatic termination analysis of logic programs, where we understand by termination" the niteness of the LD-tree constru...
FOSSACS
2009
Springer
15 years 7 months ago
2009
Springer
Standard analysis on recursive data structures restrict their attention to shape properties (for instance, a program that manipulates a list returns a list), excluding properties t...