Sciweavers

1702 search results - page 128 / 341
» Doomed program points
Sort
View
TAPSOFT
1997
Springer
15 years 9 months ago
On the Complexity of Function Pointer May-Alias Analysis
This paper considers the complexity of interprocedural function pointer may-alias analysis, i.e., determining the set of functions that a function pointer (in a language such as C...
Robert Muth, Saumya K. Debray
ICALP
1992
Springer
15 years 9 months ago
What Good Are Digital Clocks?
Real-time systems operate in \real," continuous time and state changes may occur at any real-numbered time point. Yet many veri cation methods are based on the assumption that...
Thomas A. Henzinger, Zohar Manna, Amir Pnueli
AUTOMATICA
2002
104views more  AUTOMATICA 2002»
15 years 4 months ago
Who needs QP for linear MPC anyway?
Conventional MPC uses quadratic programming (QP) to minimise, on-line, a cost over n linearly constrained control moves. However, stability constraints often require the use of la...
Basil Kouvaritakis, Mark Cannon, J. Anthony Rossit...
GPCE
2009
Springer
15 years 9 months ago
Extending AspectJ for separating regions
Synchronization is a good candidate for an aspect in aspectoriented programming (AOP) since programmers have to choose the best granularity of synchronization for the underlying h...
Shumpei Akai, Shigeru Chiba
SCESM
2006
ACM
239views Algorithms» more  SCESM 2006»
15 years 11 months ago
Aspect-oriented software design with a variant of UML/STD
The notion of aspect is important as a systematic approach to the representation of cross-cutting concerns and the incremental additions of new functionalities to an existing syst...
Shin Nakajima, Tetsuo Tamai