Sciweavers

678 search results - page 51 / 136
» Dependent Types for Program Understanding
Sort
View
ITICSE
1996
ACM
14 years 1 months ago
Integrating animations into courses
This paper describes two ways we have integrated algorithm animations into several computer science courses. First, we use previously existing animations during lectures to aid in...
Susan H. Rodger
FAC
2008
100views more  FAC 2008»
13 years 9 months ago
Slicing communicating automata specifications: polynomial algorithms for model reduction
Abstract. Slicing is a program analysis technique that was originally introduced to improve program debugging and understanding. The purpose of a slicing algorithm is to remove the...
Sébastien Labbé, Jean-Pierre Gallois
UM
2007
Springer
14 years 3 months ago
Encouraging Contributions to Online Communities with Personalization and Incentives
Increasingly, online systems depend on user contributions such as posts, ratings, tags, and comments. Many of these systems wish to encourage broader participation or the contribut...
F. Maxwell Harper
ICSE
2001
IEEE-ACM
14 years 1 months ago
Encoding Program Executions
Dynamic analysis is based on collecting data as the program runs. However, raw traces tend to be too voluminous and too unstructured to be used directly for visualization and unde...
Steven P. Reiss, Manos Renieris
TLDI
2009
ACM
122views Formal Methods» more  TLDI 2009»
14 years 6 months ago
Towards type-theoretic semantics for transactional concurrency
We propose a dependent type theory that integrates programming, specifications, and reasoning about higher-order concurrent programs with shared transactional memory. The design ...
Aleksandar Nanevski, Paul Govereau, Greg Morrisett