Sciweavers

215 search results - page 27 / 43
» Verifying haskell programs using constructive type theory
Sort
View
POPL
2004
ACM
14 years 9 months ago
Formalization of generics for the .NET common language runtime
We present a formalization of the implementation of generics in the .NET Common Language Runtime (CLR), focusing on two novel aspects of the implementation: mixed specialization a...
Dachuan Yu, Andrew Kennedy, Don Syme
LICS
2002
IEEE
14 years 1 months ago
A Syntactic Approach to Foundational Proof-Carrying Code
Proof-Carrying Code (PCC) is a general framework for verifying the safety properties of machine-language programs. PCC proofs are usually written in a logic extended with language...
Nadeem Abdul Hamid, Zhong Shao, Valery Trifonov, S...
CCS
2006
ACM
14 years 22 days ago
Secure information flow with random assignment and encryption
Type systems for secure information flow aim to prevent a program from leaking information from variables classified as H to variables classified as L. In this work we extend such...
Geoffrey Smith
ICFP
2007
ACM
14 years 9 months ago
A generic usage analysis with subeffect qualifiers
Sharing analysis and uniqueness typing are static analyses that aim at determining which of a program's objects are to be used at most once. There are many commonalities betw...
Jurriaan Hage, Stefan Holdermans, Arie Middelkoop
ERLANG
2003
ACM
14 years 2 months ago
Evaluating distributed functional languages for telecommunications software
The distributed telecommunications sector not only requires minimal time to market, but also software that is reliable, available, maintainable and scalable. High level programmin...
Jan Henry Nyström, Philip W. Trinder, David J...