Search this site
Embedded Files
Skip to main content
Skip to navigation
CU: Programming Languages Group
Home
A Market-Based Approach to Software Evolution
Accessing Resources
Administrivia
Contact Information
From Tests to Proofs
Group Service
Idea Backlog
Pointer and Data Structure Analysis (Sriram, Evan, and Manu)
Quantified Program Analysis Results (Amer, Jeremy, Evan)
Web Security (Sriram, Evan, and Manu)
Language Support for Fast and Reliable Message-based Communication in Singularity OS
Learning Minimal Abstractions
Projects
Gradual Programming
Instrumentation Results
Invariant Incrementalization
Related Works
Pointer Analysis (with witnesses)
Program Analysis Visualization
Setting up Pavil
Program Analysis with Witness Generation
Program Metamorphosis
Dynamic Software Updates
Papers
PM-Wiki
Analysing Program Evolution
Progressive Program Analysis
Proofs from Tests
RegressionTestSelection
Zeno Front End GUI for Xisa
Reading Group
A Practical Automatic Polyhedral Parallelizer and Locality Optimizer
Alice, Middle Schoolers, and the Imaginary Worlds Camps
Amdahl's Law in the Multicore Era
An Input-Centric Paradigm for Program Dynamic Optimization
automating_spreadsheets
Compiler Research: The Next 50 Years
Concurrent Programming with Revisions and Isolation Types
Deny-Guarantee Reasoning
Essence of Function Programming
Formal Verification of a Realistic Compiler
GC Assertions: Using the Garbage Collector to Check Heap Properties
Grace: Safe Multithreaded Programming for C/C++
How to Choose a Good Scientific Problem
Instrumentation and Sampling Strategies for Cooperative Concurrency Bug Isolation
Languages of the Future
Learning From Mistakes -- A Comprehensive Study on real World Concurrency Bug Characteristics
Liquid Types
Mining Library Specifications using Inductive Logic Programming
On Understanding Data Abstraction, Revisited
Programming With Angelic Nondeterminism
Proving Optimizations Correct using Parameterized Program Equivalence
Scratching Middle Schoolers' Creative Itch
Snugglebug: A Powerful Approach to Weakest Preconditions
Specification and Verification: The Spec# Experience
Statistical probabilistic model checking with a focus on time-bounded properties
Stochastic Lambda Calculus and Monads of Probability Distributions
Strictly Declarative Specification of Sophisticated Points-to Analysis
Testing static analysis tools
The Singularity System
The Transactional Memory/Garbage Collection Analogy
Thorn--Robust, Concurrent, Extensible Scripting on the JVM
Trace-based Just-in-Time Type Specialization for Dynamic Languages
Type-based Data Structure Verification
What Can the GC Compute Efficiently?
Three Golden Rules for Successful Scientific Research
Travel
Tutorials
Weekly Meetings
Presentations
wc-2009-02-20
wc-2009-04-10
wc-2009-09-18
Wild and Crazy Ideas: 9/3/2010
CU: Programming Languages Group
What Can the GC Compute Efficiently?
Google Sites
Report abuse
Page details
Page updated
Google Sites
Report abuse