1686 search results - page 145 / 338 » Programs as polygraphs: computability and complexity |
162
click to vote
DAC
2003
ACM
16 years 4 months ago
2003
ACM
Schedulability analysis of real-time embedded systems requires worst case timing guarantees of embedded software performance. This involves not only language level program analysi...
200
Voted
DAC
2005
ACM
16 years 4 months ago
2005
ACM
Pointer analysis, a classic problem in software program analysis, has emerged as an important problem to solve in design automation, at a time when complex designs, specified in t...
242
click to vote
ICLP
2009
Springer
16 years 4 months ago
2009
Springer
We address how to write programs for distributed computing systems in which the network topology can change dynamically. Examples of such systems, which we call ensembles, include ...
117
Voted
CAV
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. A temporal interface for a software component is a finite automaton that specifies the legal sequences of calls to functions that are provided by the component. We comp...
176
Voted
POPL
1989
ACM
15 years 7 months ago
1989
ACM
raction that a programming language provides influences the structure and algorithmic complexity of the resulting programs: just imagine creating an artificial intelligence engine ...