1226 search results - page 110 / 246 » Proofs, Programs and Abstract Complexity |
CODAS
1996
15 years 4 months ago
1996
ntic abstractions classification, aggregation and generalization are extremely useful for modeling complex situations containing time-independent events. This paper shows that the...
106
Voted
SENSYS
2006
ACM
15 years 9 months ago
2006
ACM
Event-driven programming is a popular model for writing programs for tiny embedded systems and sensor network nodes. While event-driven programming can keep the memory overhead do...
165
Voted
IWPC
2003
IEEE
15 years 8 months ago
2003
IEEE
Program comprehension is an important part of software maintenance, especially when program structure is complex and documentation is unavailable or outdated. Data mining can prod...
131
click to vote
CHI
2006
ACM
16 years 3 months ago
2006
ACM
icians or philosophers use abstract symbols to derive formulas or form proofs. Indeed, these sketches are structural geometric proofs, consistent with Plato's supposition that...
130
Voted
EMSOFT
2007
Springer
15 years 9 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...