Sciweavers

54 search results - page 5 / 11
» Checking Memory Safety with Blast
Sort
View
ENTCS
2006
134views more  ENTCS 2006»
13 years 7 months ago
Computing Over-Approximations with Bounded Model Checking
Bounded Model Checking (BMC) searches for counterexamples to a property with a bounded length k. If no such counterexample is found, k is increased. This process terminates when ...
Daniel Kroening
IPPS
1999
IEEE
13 years 11 months ago
Mechanical Verification of a Garbage Collector
Abstract. We describe how the PVS verification system has been used to verify a safety property of a garbage collection algorithm, originally suggested by Ben-Ari. The safety prope...
Klaus Havelund
CCS
2006
ACM
13 years 11 months ago
Safety and consistency in policy-based authorization systems
In trust negotiation and other distributed proving systems, networked entities cooperate to form proofs that are justified by collections of certified attributes. These attributes...
Adam J. Lee, Marianne Winslett
PLDI
2003
ACM
14 years 22 days ago
Ownership types for safe region-based memory management in real-time Java
The Real-Time Specification for Java (RTSJ) allows a program to create real-time threads with hard real-time constraints. Real-time threads use region-based memory management to ...
Chandrasekhar Boyapati, Alexandru Salcianu, Willia...
ECRTS
2003
IEEE
14 years 23 days ago
Hardware-Based Solution Detecting Illegal References in Real-Time Java
The memory model used in the Real-Time Specification for Java (RTSJ) imposes strict assignment rules to or from memory areas preventing the creation of dangling pointers, and thus...
M. Teresa Higuera-Toledano