3825 search results - page 273 / 765 » The Language of Time: A Reader |
200
click to vote
SDL
2001
15 years 8 months ago
2001
Abstract. We describe an approach for the verification of quantitative temporal properties of SDL specifications, which adapts techniques developed for timed automata [2]. With res...
185
click to vote
ICFP
2007
ACM
16 years 6 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 ...
278
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...
199
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...
197
click to vote
POS
1994
Springer
15 years 10 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...