Applying the Lessons of RESOLVE to a Functional Programming Language

One fundamental, yet insufficiently-investigated question in the study of software verification is: "How does the nature of a programming language impact its prospects for verifiability?" In some situations the answer is clear, e.g., a language with reference semantics is harder to reason about than one with value semantics, but in general the ramifications of programming language design on verifiability are subtle, and demand further research. Putting one's self in the shoes of a language designer who seeks to facilitate both verifiability and elegant code, a pure functional language seems like a natural choice.

Provided by: Clemson University Topic: Software Date Added: May 2010 Format: PDF

Find By Topic