Sciweavers

4719 search results - page 410 / 944
» Newtonian program analysis
Sort
View
ENTCS
2007
124views more  ENTCS 2007»
15 years 6 months ago
Structuring Optimizing Transformations and Proving Them Sound
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....
Aditya Kanade, Amitabha Sanyal, Uday P. Khedker
VLC
2008
88views more  VLC 2008»
15 years 6 months ago
Towards a specification of the ToonTalk language
ToonTalk is a child-oriented programming language whose environment is an animated virtual world, with objects that children can pick up and use as in a game, such as birds, truck...
Leonel Morgado, Ken Kahn
TPDS
1998
114views more  TPDS 1998»
15 years 6 months ago
On the Automatic Parallelization of the Perfect Benchmarks
We present a set of advanced program parallelization techniques that are able to signi cantly improve the performance of application programs. We present evidence for this improve...
Rudolf Eigenmann, Jay Hoeflinger, David A. Padua
OSDI
2006
ACM
16 years 7 months ago
Securing Software by Enforcing Data-flow Integrity
Software attacks often subvert the intended data-flow in a vulnerable program. For example, attackers exploit buffer overflows and format string vulnerabilities to write data to u...
Manuel Costa, Miguel Castro, Timothy L. Harris
FOSSACS
2007
Springer
16 years 27 days ago
Polynomial Constraints for Sets with Cardinality Bounds
Abstract. Logics that can reason about sets and their cardinality bounds are useful in program analysis, program verification, databases, and knowledge bases. This paper presents ...
Bruno Marnette, Viktor Kuncak, Martin C. Rinard