632 search results - page 7 / 127 » Proving Invariants of Functional Programs |
EMSOFT
2007
Springer
15 years 6 months ago
2007
Springer
We explain the design of the interpretation-based static analyzer Astr´ee and its use to prove the absence of run-time errors in safety-critical codes. Categories and Subject Des...
80
Voted
PLPV
2009
ACM
15 years 9 months ago
2009
ACM
Haskell’s multi-parameter type classes, together with functional dependencies, allow the specification of complex type-level opera
117
Voted
MPC
2010
Springer
15 years 5 months ago
2010
Springer
Parser combinators are a popular tool for designing parsers in functional programming languages. If such combinators generate an abstract representation of the grammar as an interm...
136
Voted
FOSSACS
2004
Springer
15 years 5 months ago
2004
Springer
Abstract. We show how to generate well-founded and stable term orderings based on polynomial interpretations over the real numbers. Monotonicity (another usual requirement in termi...
125
Voted
CORR
2010
Springer
14 years 9 months ago
2010
Springer
The structural properties of graphs are usually characterized in terms of invariants, which are functions of graphs that do not depend on the labeling of the nodes. In this paper ...