1418 search results - page 160 / 284 » The Dynamic Complexity of Formal Languages |
136
Voted
SBMF
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. This paper presents a case study on retrospective veri cation of the Linux Virtual File System (VFS), which is aimed at checking for violations of API usage rules and mem...
169
click to vote
STEP
2003
IEEE
15 years 10 months ago
2003
IEEE
Software patterns are a new design paradigm used to solve problems that arise when developing software within a particular context. Patterns capture the static and dynamic structu...
193
Voted
TEC
2012
13 years 7 months ago
2012
—This paper presents a new cooperative coevolving particle swarm optimization (CCPSO) algorithm in an attempt to address the issue of scaling up particle swarm optimization (PSO)...
198
click to vote
POPL
2000
ACM
15 years 9 months ago
2000
ACM
We propose an automatic method to enforce trace properties on programs. The programmer specifies the property separately from the program; a program transformer takes the program...
143
click to vote
STOC
2004
ACM
16 years 4 months ago
2004
ACM
We prove an (lg n) cell-probe lower bound on maintaining connectivity in dynamic graphs, as well as a more general trade-off between updates and queries. Our bound holds even if t...