Sciweavers

632 search results - page 47 / 127
» Proving Invariants of Functional Programs
Sort
View
ICPP
2002
IEEE
15 years 5 months ago
Region Synchronization in Message Passing Systems
The development of correct synchronization code for distributed programs is a challenging task. In this paper, we propose an aspect oriented technique for developing synchronizati...
Gurdip Singh, Ye Su
202
Voted
ICFP
2009
ACM
16 years 1 months ago
Biorthogonality, step-indexing and compiler correctness
We define logical relations between the denotational semantics of a simply typed functional language with recursion and the operational behaviour of low-level programs in a varian...
Nick Benton, Chung-Kil Hur
90
Voted
ISW
2007
Springer
15 years 6 months ago
Specifying Imperative Data Obfuscations
Abstract. An obfuscation aims to transform a program, without affecting the functionality, so that some secret information within the program can be hidden for as long as possible...
Stephen Drape, Clark D. Thomborson, Anirban Majumd...
ICFP
2010
ACM
15 years 1 months ago
Instance chains: type class programming without overlapping instances
Type classes have found a wide variety of uses in Haskell programs, from simple overloading of operators (such as equality or ordering) to complex invariants used to implement typ...
J. Garrett Morris, Mark P. Jones
99
Voted
ML
2006
ACM
103views Machine Learning» more  ML 2006»
15 years 6 months ago
Type-safe distributed programming for OCaml
Existing ML-like languages guarantee type-safety, ensuring memty and protecting the invariants of abstract types, but only within single executions of single programs. Distributed...
John Billings, Peter Sewell, Mark R. Shinwell, Rok...