686 search results - page 92 / 138 » Foundations for Bidirectional Programming |
117
click to vote
PLDI
2003
ACM
15 years 3 months ago
2003
ACM
This paper presents a static analysis tool that can automatically find memory leaks and deletions of dangling pointers in large C and C++ applications. We have developed a type s...
PLDI
2010
ACM
15 years 2 months ago
2010
ACM
Programming language specifications mandate static and dynamic analyses to preclude syntactic and semantic errors. Although individual languages are usually well-specified, comp...
ICS
2001
Tsinghua U.
15 years 2 months ago
2001
Tsinghua U.
This paper presents a novel technique to perform global optimization of communication and preprocessing calls in the presence of array accesses with arbitrary subscripts. Our sche...
177
click to vote
ASPLOS
2009
ACM
15 years 10 months ago
2009
ACM
For many mission-critical tasks, tight guarantees on the flow of information are desirable, for example, when handling important cryptographic keys or sensitive financial data. We...
CADE
2002
Springer
15 years 10 months ago
2002
Springer
Abstract. We investigate the combination of propositional SAT checkers with domain-specific theorem provers as a foundation for bounded model checking over infinite domains. Given ...