CPL - Chalmers Publication Library
| Utbildning | Forskning | Styrkeområden | Om Chalmers | In English In English Ej inloggad.

HALO: Haskell to logic through denotational semantics

Dimitrios Vytiniotis ; Simon L. Peyton-Jones ; Dan Rosén (Institutionen för data- och informationsteknik, Programvaruteknik (Chalmers)) ; Koen Claessen (Institutionen för data- och informationsteknik, Programvaruteknik (Chalmers))
Conference Record of the Annual ACM Symposium on Principles of Programming Languages (0730-8566). p. 431-442. (2013)
[Konferensbidrag, refereegranskat]

Even well-typed programs can go wrong in modern functional languages, by encountering a pattern-match failure, or simply returning the wrong answer. An increasingly-popular response is to allow programmers to write contracts that express semantic properties, such as crash-freedom or some useful post-condition. We study the static verification of such contracts. Our main contribution is a novel translation to first-order logic of both Haskell programs, and contracts written in Haskell, all justified by denotational semantics. This translation enables us to prove that functions satisfy their contracts using an off-the-shelf first-order logic theorem prover.

Nyckelord: first-order logic, static contract checking

Denna post skapades 2013-11-26. Senast ändrad 2016-04-15.
CPL Pubid: 187462


Läs direkt!

Länk till annan sajt (kan kräva inloggning)

Institutioner (Chalmers)

Institutionen för data- och informationsteknik, Programvaruteknik (Chalmers)



Chalmers infrastruktur