1452 search results - page 75 / 291 » Algorithmic Analysis of Array-Accessing Programs |
96
Voted
PPDP
2005
Springer
15 years 5 months ago
2005
Springer
fects are statically generated program abstractions, that can be model checked for verification of assertions in a temporal program logic. In this paper we develop a type and eff...
106
Voted
CIARP
2006
Springer
15 years 4 months ago
2006
Springer
Parallel text alignment is a special type of pattern recognition task aimed to discover the similarity between two sequences of symbols. Given the same text in two different langua...
112
Voted
SIGSOFT
2005
ACM
16 years 29 days ago
2005
ACM
We develop a method for matching dynamic histories of program executions of two program versions. The matches produced can be useful in many applications including software piracy...
SODA
2010
ACM
14 years 10 months ago
2010
ACM
Star-shaped bodies are an important nonconvex generalization of convex bodies (e.g., linear programming with violations). Here we present an efficient algorithm for sampling a giv...
111
Voted
PLDI
2003
ACM
15 years 5 months ago
2003
ACM
This paper reports on a new approach to solving a subset-based points-to analysis for Java using Binary Decision Diagrams (BDDs). In the model checking community, BDDs have been s...