3653 search results - page 238 / 731 » On Recognizable Timed Languages |
217
click to vote
ICFP
2007
ACM
16 years 7 months ago
2007
ACM
We analyze the computational complexity of kCFA, a hierarchy of control flow analyses that determine which functions may be applied at a given call-site. This hierarchy specifies ...
303
click to vote
POPL
2008
ACM
16 years 7 months ago
2008
ACM
When scripts in untyped languages grow into large programs, maintaining them becomes difficult. A lack of types in typical scripting languages means that programmers must (re)disc...
232
click to vote
STOC
2010
ACM
16 years 4 months ago
2010
ACM
We close affirmatively a question which has been open for long time: decidability of the HOM problem. The HOM problem consists in determining, given a tree homomorphism D and a re...
217
click to vote
POS
1994
Springer
15 years 11 months ago
1994
Springer
We consider some issues in optimizing persistent programming languages. In particular, we show how to express optimizations of object residency checks in strongly typed persistent...
244
click to vote
SAC
2008
ACM
15 years 6 months ago
2008
ACM
Model-Driven Engineering (MDE) has been advocated as an effective way to deal with today's software complexity. MDE can be seen as an integrative approach combining existing ...