1418 search results - page 195 / 284 » The Dynamic Complexity of Formal Languages |
135
click to vote
STOC
2001
ACM
16 years 5 months ago
2001
ACM
Optimal program slicing determines for a statement S in a program whether or not S affects a specified set of statements, given that all conditionals in are interpreted as non-d...
143
click to vote
ICFP
2003
ACM
16 years 4 months ago
2003
ACM
A three-year study collected information bearing on the question of whether studying mathematics improves programming skills. An analysis of the data revealed significant differen...
156
click to vote
PLDI
2009
ACM
15 years 11 months ago
2009
ACM
We show that recursive programs where variables range over finite domains can be effectively and efficiently analyzed by describing the analysis algorithm using a formula in a ...
148
click to vote
EMSOFT
2007
Springer
15 years 11 months ago
2007
Springer
We explain the design of the interpretation-based static analyzer Astr´ee and its use to prove the absence of run-time errors in safety-critical codes. Categories and Subject Des...
156
click to vote
INFOCOM
2006
IEEE
15 years 11 months ago
2006
IEEE
— In this paper, we propose a simulation framework, TranSim, that reduces the rate at which packet-events are generated, in order to accelerate large-scale simulation of IP netwo...