Search
Now showing items 1-3 of 3
Memory Usage Inference for Object-Oriented Programs
(2005-01)
We present a type-based approach to statically derive symbolic closed-form formulae that characterize the bounds of heap memory usages of programs written in object-oriented languages. Given a program with size and alias ...
Incremental Verification of Timing Constraints for Real-Time Systems
(2005-01)
Testing constraints for real-time systems are usually verified through the satisfiability of propositional formulae. In this paper, we propose an alternative where the verification of timing constraints can be done by ...
Failure-Oblivious Computing and Boundless Memory Blocks
(2005-01)
Memory errors are a common cause of incorrect software execution and security vulnerabilities. We have developed two new techniques that help software continue to execute successfully through memory errors: failure-oblivious ...