Sciweavers

506 search results - page 20 / 102
» Where Is the Value in a Program Verifier
Sort
View
ICFP
2007
ACM
16 years 12 days ago
Tangible functional programming
We present a user-friendly approach to unifying program creation and execution, based on a notion of "tangible values" (TVs), which are visual and interactive manifestat...
Conal Elliott
ESOP
2010
Springer
15 years 9 months ago
Deadlock-free Channels and Locks
The combination of message passing and locking to protect shared state is a useful concurrency pattern. However, programs that employ this pattern are susceptible to deadlock. That...
Jan Smans, K. Rustan M. Leino, Peter Müller
207
Voted
POPL
2006
ACM
16 years 23 days ago
Small bisimulations for reasoning about higher-order imperative programs
We introduce a new notion of bisimulation for showing contextual equivalence of expressions in an untyped lambda-calculus with an explicit store, and in which all expressed values...
Vasileios Koutavas, Mitchell Wand
SIGSOFT
2004
ACM
16 years 1 months ago
PSE: explaining program failures via postmortem static analysis
In this paper, we describe PSE (Postmortem Symbolic Evaluation), a static analysis algorithm that can be used by programmers to diagnose software failures. The algorithm requires ...
Roman Manevich, Manu Sridharan, Stephen Adams, Man...
ICSE
2005
IEEE-ACM
16 years 16 days ago
Locating causes of program failures
Which is the defect that causes a software failure? By comparing the program states of a failing and a passing run, we can identify the state differences that cause the failure. H...
Holger Cleve, Andreas Zeller