4513 search results - page 566 / 903 » Logic programming with satisfiability |
266
click to vote
POPL
2003
ACM
16 years 4 months ago
2003
ACM
We present a new polynomial-time randomized algorithm for discovering affine equalities involving variables in a program. The key idea of the algorithm is to execute a code fragme...
146
click to vote
ICFP
2005
ACM
16 years 4 months ago
2005
ACM
Implementing first-class continuations can pose a challenge if the target machine makes no provisions for accessing and re-installing the run-time stack. In this paper, we present...
189
click to vote
PLDI
2004
ACM
15 years 10 months ago
2004
ACM
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...
221
click to vote
SIGSOFT
2010
ACM
15 years 2 months ago
2010
ACM
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...
140
click to vote
CORR
2011
Springer
14 years 11 months ago
2011
Springer
Processes of Place/Transition Systems6 Rob van Glabbeeka,b , Ursula Goltzc , Jens-Wolfhard Schickec aNICTA, Sydney, Australia bSchool of Computer Science and Engineering, Universit...