Sciweavers

590 search results - page 31 / 118
» Non-Failure Analysis for Logic Programs
Sort
View
POPL
2009
ACM
14 years 8 months ago
Compositional shape analysis by means of bi-abduction
This paper describes a compositional shape analysis, where each procedure is analyzed independently of its callers. The analysis uses an abstract domain based on a restricted frag...
Cristiano Calcagno, Dino Distefano, Peter W. O'Hea...
PLDI
2004
ACM
14 years 1 months ago
Cloning-based context-sensitive pointer alias analysis using binary decision diagrams
This paper presents the first scalable context-sensitive, inclusionbased pointer alias analysis for Java programs. Our approach to context sensitivity is to create a clone of a m...
John Whaley, Monica S. Lam
SIGSOFT
2010
ACM
13 years 5 months ago
An effective dynamic analysis for detecting generalized deadlocks
We present an effective dynamic analysis for finding a broad class of deadlocks, including the well-studied lock-only deadlocks as well as the less-studied, but no less widespread...
Pallavi Joshi, Mayur Naik, Koushik Sen, David Gay
ESOP
2000
Springer
13 years 11 months ago
A Kleene Analysis of Mobile Ambients
Abstract. We show how a program analysis technique originally developed for C-like pointer structures can be adapted to analyse the hierarchical structure of processes in the ambie...
Flemming Nielson, Hanne Riis Nielson, Shmuel Sagiv
FUIN
2010
97views more  FUIN 2010»
13 years 6 months ago
Game Solution, Epistemic Dynamics and Fixed-Point Logics
Abstract. Current methods for solving games embody a form of “procedural rationality” that invites logical analysis in its own right. This paper is a brief case study of Backwa...
Johan van Benthem, Amélie Gheerbrant