1452 search results - page 113 / 291 » Algorithmic Analysis of Array-Accessing Programs |
107
click to vote
GI
2007
Springer
15 years 6 months ago
2007
Springer
: In this article we advocate an integrated approach for the automation of module or software integration testing and static analysis. It is illustrated how funmethods of static an...
99
Voted
PEPM
1994
ACM
15 years 4 months ago
1994
ACM
We present an efficient base algorithm for binding-time analysis based on constraint solving and the union-find algorithm. In practice it has been used to handle all of Standard M...
101
Voted
WCET
2007
15 years 1 months ago
2007
Worst-case execution time (WCET) analysis is indispensable for the successful design and development of systems, which, in addition to their functional constraints, have to satisf...
105
click to vote
PACT
2005
Springer
15 years 6 months ago
2005
Springer
We describe a fragment of the hardware description language VHDL that is suitable for implementing the Advanced Encryption Standard algorithm. We then define an Information Flow a...
FM
2009
Springer
15 years 7 months ago
2009
Springer
Abstract. We present a new domain for analyzing must-equalities between address expressions. The domain is a smooth combination of Herbrand and affine equalities which enables us t...