4940 search results - page 389 / 988 » On the Complexity of Universal Programs |
177
click to vote
FM
2009
Springer
16 years 1 months ago
2009
Springer
We present a novel approach to optimize scope-bounded checking programs using a relational constraint solver. Given a program and its correctness specification, the traditional app...
174
click to vote
ICLP
2005
Springer
16 years 9 days ago
2005
Springer
Any finite tree automaton (or regular type) can be used to construct act interpretation of a logic program, by first determinising and completing the automaton to get a pre-inter...
186
Voted
POPL
2000
ACM
15 years 11 months ago
2000
ACM
Distributed-memory programs are often written using a global address space: any process can name any memory location on any processor. Some languages completely hide the distincti...
188
click to vote
POPL
1996
ACM
15 years 11 months ago
1996
ACM
Module systems are a powerful, practical tool for managing the complexity of large software systems. Previous attempts to formulate a type-theoretic foundation for modular program...
184
click to vote
ECOOP
2004
Springer
15 years 10 months ago
2004
Springer
Previous work proposed a technique for predicting problems resulting from replacing one version of a software component by another. The technique reports, before performing the rep...