Sciweavers

230 search results - page 36 / 46
» Automation for Dependently Typed Functional Programming
Sort
View
FLOPS
2006
Springer
13 years 11 months ago
Contracts as Pairs of Projections
Abstract. Assertion-based contracts provide a powerful mechanism for stating invariants at module boundaries and for enforcing them uniformly. In 2002, Findler and Felleisen showed...
Robert Bruce Findler, Matthias Blume
VMCAI
2010
Springer
14 years 4 months ago
Building a Calculus of Data Structures
Abstract. Techniques such as verification condition generation, preditraction, and expressive type systems reduce software verification to proving formulas in expressive logics. Pr...
Viktor Kuncak, Ruzica Piskac, Philippe Suter, Thom...
SIGSOFT
2007
ACM
14 years 8 months ago
Recovering and using use-case-diagram-to-source-code traceability links
Use case diagrams (UCDs) are widely used to describe requirements and desired functionality of software products. However, UCDs are loosely linked to source code, and maintaining ...
Mark Grechanik, Kathryn S. McKinley, Dewayne E. Pe...
POPL
2002
ACM
14 years 8 months ago
Mining specifications
Program verification is a promising approach to improving program quality, because it can search all possible program executions for specific errors. However, the need to formally...
Glenn Ammons, James R. Larus, Rastislav Bodí...
TACS
1994
Springer
13 years 11 months ago
A Semantic Theory for Concurrent ML
In this paper we present a semantic theory for Concurrent ML. It consists of a new effect-based type system and a denotational model. The new type system is based on an extension o...
Dominique Bolignano, Mourad Debbabi