Sciweavers

322 search results - page 45 / 65
» Developing and Reasoning About Probabilistic Programs in pGC...
Sort
View
FAST
2008
14 years 12 months ago
Portably Solving File TOCTTOU Races with Hardness Amplification
The file-system API of contemporary systems makes programs vulnerable to TOCTTOU (time of check to time of use) race conditions. Existing solutions either help users to detect the...
Dan Tsafrir, Tomer Hertz, David Wagner, Dilma Da S...
78
Voted
ITICSE
2003
ACM
15 years 2 months ago
Studying program correctness by constructing contracts
Because the concept of program correctness is generally taught as an activity independent of the programming process, most introductory computer science (CS) students perceive it ...
Timothy S. Gegg-Harrison, Gary R. Bunce, Rebecca D...
ICFP
2008
ACM
15 years 9 months ago
A functional model-view-controller software architecture for command-oriented programs
Command-oriented functional programs are currently structured in an ad hoc way that makes the development of multiple userinterfaces difficult and error prone, and makes it diffic...
Alley Stoughton
SIGSOFT
2007
ACM
15 years 10 months ago
Programming asynchronous layers with CLARITY
Asynchronous systems components are hard to write, hard to reason about, and (not coincidentally) hard to mechanically verify. In order to achieve high performance, asynchronous c...
Prakash Chandrasekaran, Christopher L. Conway, Jos...
POPL
2009
ACM
15 years 10 months ago
A cost semantics for self-adjusting computation
Self-adjusting computation is an evaluation model in which programs can respond efficiently to small changes to their input data by using a change-propagation mechanism that updat...
Ruy Ley-Wild, Umut A. Acar, Matthew Fluet