Sciweavers

2947 search results - page 290 / 590
» Analyzing Program Analyses
Sort
View
ICSE
2007
IEEE-ACM
16 years 6 months ago
Path-Sensitive Inference of Function Precedence Protocols
Function precedence protocols define ordering relations among function calls in a program. In some instances, precedence protocols are well-understood (e.g., a call to pthread mut...
Murali Krishna Ramanathan, Ananth Grama, Suresh Ja...
CC
2010
Springer
150views System Software» more  CC 2010»
16 years 1 months ago
Practical Extensions to the IFDS Algorithm
Abstract. This paper presents four extensions to the Interprocedural Finite Distributive Subset (IFDS) algorithm that make it applicable to a wider class of analysis problems. IFDS...
Nomair A. Naeem, Ondrej Lhoták, Jonathan Ro...
ICFP
2009
ACM
16 years 1 months ago
Finding race conditions in Erlang with QuickCheck and PULSE
We address the problem of testing and debugging concurrent, distributed Erlang applications. In concurrent programs, race conditions are a common class of bugs and are very hard t...
Koen Claessen, Michal Palka, Nicholas Smallbone, J...
VL
2009
IEEE
131views Visual Languages» more  VL 2009»
16 years 1 months ago
Attitudes and self-efficacy in young adults' computing autobiographies
Little is known about the formation of people’s first perceptions about computers and computer code, yet it is likely that these impressions have a lasting effect on peoples’ ...
Andrew J. Ko
ISSTA
2006
ACM
16 years 19 days ago
DSD-Crasher: a hybrid analysis tool for bug finding
DSD-Crasher is a bug finding tool that follows a three-step approach to program analysis: D. Capture the program’s intended execution behavior with dynamic invariant detection....
Christoph Csallner, Yannis Smaragdakis