Sciweavers

678 search results - page 35 / 136
» Dependent Types for Program Understanding
Sort
View
ENTCS
2002
134views more  ENTCS 2002»
13 years 9 months ago
Implementing Compositional Analysis Using Intersection Types With Expansion Variables
A program analysis is compositional when the analysis result for a particular program fragment is obtained solely from the results for its immediate subfragments via some composit...
Assaf J. Kfoury, Geoffrey Washburn, Joe Wells
JUCS
2007
80views more  JUCS 2007»
13 years 9 months ago
Higher-Order Lazy Functional Slicing
: Program slicing is a well known family of techniques intended to identify and isolate code fragments which depend on, or are depended upon, specific program entities. This is pa...
Nuno F. Rodrigues, Luís Soares Barbosa
POPL
2012
ACM
12 years 4 months ago
A type system for borrowing permissions
In object-oriented programming, unique permissions to object references are useful for checking correctness properties such as consistency of typestate and noninterference of conc...
Karl Naden, Robert Bocchino, Jonathan Aldrich, Kev...
ICFP
2006
ACM
14 years 9 months ago
Modular development of certified program verifiers with a proof assistant
I report on an experience using the Coq proof assistant to develop a program verification tool with a machine-checkable proof of full correctness. The verifier is able to prove me...
Adam J. Chlipala
HICSS
2005
IEEE
95views Biometrics» more  HICSS 2005»
14 years 2 months ago
Understanding the Effect of Risk Aversion on Risk
As we progress, society must intelligently address the following question: How much risk is acceptable? How we answer this question could have important consequences for the futur...
U. S. Bhatt, David E. Newman, Benjamin A. Carreras...