Sciweavers

632 search results - page 84 / 127
» Proving Invariants of Functional Programs
Sort
View
170
Voted
IFM
2010
Springer
183views Formal Methods» more  IFM 2010»
14 years 10 months ago
Certified Absence of Dangling Pointers in a Language with Explicit Deallocation
Safe is a first-order eager functional language with facilities for programmer controlled destruction and copying of data structures. It provides also regions, i.e. disjoint parts...
Javier de Dios, Manuel Montenegro, Ricardo Pe&ntil...
COOPIS
2003
IEEE
15 years 5 months ago
Re-factoring Middleware Systems: A Case Study
Abstract. Aspect oriented programming brings us new design perspectives since it permits the superimpositions of multiple abstraction models on top of one another. It is a very pow...
Charles Zhang, Hans-Arno Jacobsen
97
Voted
PPDP
2007
Springer
15 years 6 months ago
A simple rewrite notion for call-time choice semantics
Non-confluent and non-terminating rewrite systems are interesting from the point of view of programming. In particular, existing functional logic languages use such kind of rewri...
Francisco Javier López-Fraguas, Juan Rodr&i...
82
Voted
POPL
2012
ACM
13 years 8 months ago
Recursive proofs for inductive tree data-structures
We develop logical mechanisms and decision procedures to facilitate the verification of full functional properties of inductive tree data-structures using recursion that are soun...
Parthasarathy Madhusudan, Xiaokang Qiu, Andrei Ste...
207
Voted
POPL
2006
ACM
16 years 25 days ago
Fast and loose reasoning is morally correct
Functional programmers often reason about programs as if they were written in a total language, expecting the results to carry over to non-total (partial) languages. We justify su...
Nils Anders Danielsson, John Hughes, Patrik Jansso...