Sciweavers

981 search results - page 25 / 197
» Symbolic pointer analysis
Sort
View
151
Voted
STACS
1992
Springer
15 years 6 months ago
Speeding Up Two String-Matching Algorithms
We show how to speed up two string-matching algorithms: the Boyer-Moore algorithm (BM algorithm), and its version called here the reverse factor algorithm (RF algorithm). The RF al...
Maxime Crochemore, Thierry Lecroq, Artur Czumaj, L...
130
Voted
EMSOFT
2009
Springer
15 years 9 months ago
Implementing time-predictable load and store operations
Scratchpads have been widely proposed as an alternative to caches for embedded systems. Advantages of scratchpads include reduced energy consumption in comparison to a cache and a...
Jack Whitham, Neil C. Audsley
DATE
1999
IEEE
80views Hardware» more  DATE 1999»
15 years 7 months ago
Symbolic Reachability Analysis of Large Finite State Machines Using Don't Cares
Reachability analysis of finite state machines is essential to many computer-aided design applications. We present new techniques to improve both approximate and exact reachabilit...
Youpyo Hong, Peter A. Beerel
158
Voted
ISSTA
2012
ACM
13 years 5 months ago
Static memory leak detection using full-sparse value-flow analysis
We introduce a static detector, Saber, for detecting memory leaks in C programs. Leveraging recent advances on sparse pointer analysis, Saber is the first to use a full-sparse va...
Yulei Sui, Ding Ye, Jingling Xue
121
Voted
ICDAR
2007
IEEE
15 years 6 months ago
An Incremental On-line Parsing Algorithm for Recognizing Sketching Diagrams
This paper presents a syntactic recognition approach for on-line drawn graphical symbols. The proposed method consists in an incremental on-line predictive parser based on symbol ...
Joan Mas, Gemma Sánchez, Josep Lladó...