6274 search results - page 211 / 1255 » Proofs, Programs, Processes |
234
click to vote
PROCEDIA
2010
15 years 4 months ago
2010
We describe a new course designed to introduce engineering students to computational thinking. One of the most significant challenges in teaching an introductory-level applied co...
189
click to vote
ENGL
2007
15 years 6 months ago
2007
—The benefits of collaborative manufacturing are widely recognized both by the industry and the academic world. However, the engagement of collaborative manufacturing for Small a...
189
click to vote
RTA
2007
Springer
16 years 17 days ago
2007
Springer
This paper shows how to construct static analyzers using tree automata and rewriting techniques. Starting from a term rewriting system representing the operational semantics of the...
173
click to vote
CCS
2006
ACM
15 years 10 months ago
2006
ACM
Type systems for secure information flow aim to prevent a program from leaking information from variables classified as H to variables classified as L. In this work we extend such...
151
click to vote
ENTCS
2007
15 years 6 months ago
2007
A compiler optimization is sound if the optimized program that it produces is semantically equivalent to the input program. The proofs of semantic equivalence are usually tedious....