272 search results - page 30 / 55 » Programming languages capturing complexity classes |
161
Voted
CPE
1994
Springer
15 years 4 months ago
1994
Springer
When implementingparallel programs forparallel computer systems the performancescalability of these programs should be tested and analyzed on different computer configurations and...
110
click to vote
ESOP
2009
Springer
15 years 4 months ago
2009
Springer
The context-free language (CFL) reachability problem is well known and studied in computer science, as a fundamental problem underlying many important static analyses such as point...
114
click to vote
IWPC
2000
IEEE
15 years 5 months ago
2000
IEEE
Software system documentation is almost always expressed informally, in natural language and free text. Examples include requirement specifications, design documents, manual page...
95
Voted
WCRE
1999
IEEE
15 years 5 months ago
1999
IEEE
Software system documentation is almost always expressed informally, in natural language and free text. Examples include requirement specifications, design documents, manual pages...
108
click to vote
LATIN
2004
Springer
15 years 6 months ago
2004
Springer
Abstract. We present a probability logic (essentially a first order language extended with quantifiers that count the fraction of elements in a model that satisfy a first order ...