Sciweavers

855 search results - page 170 / 171
» Using First-Order Logic to Reason about Policies
Sort
View
ICFP
2005
ACM
14 years 5 months ago
Modular verification of concurrent assembly code with dynamic thread creation and termination
Proof-carrying code (PCC) is a general framework that can, in principle, verify safety properties of arbitrary machine-language programs. Existing PCC systems and typed assembly l...
Xinyu Feng, Zhong Shao
PLDI
2005
ACM
13 years 11 months ago
DART: directed automated random testing
We present a new tool, named DART, for automatically testing software that combines three main techniques: (1) automated extraction of the interface of a program with its external...
Patrice Godefroid, Nils Klarlund, Koushik Sen
LCTRTS
2005
Springer
13 years 11 months ago
Preventing interrupt overload
Performance guarantees can be given to tasks in an embedded system by ensuring that access to each shared resource is mediated by an appropriate scheduler. However, almost all pre...
John Regehr, Usit Duongsaa
OOPSLA
2005
Springer
13 years 11 months ago
Javari: adding reference immutability to Java
This paper describes a type system that is capable of expressing and enforcing immutability constraints. The speonstraint expressed is that the abstract state of the object to whi...
Matthew S. Tschantz, Michael D. Ernst
PLDI
2003
ACM
13 years 11 months ago
A provably sound TAL for back-end optimization
Typed assembly languages provide a way to generate machinecheckable safety proofs for machine-language programs. But the soundness proofs of most existing typed assembly languages...
Juan Chen, Dinghao Wu, Andrew W. Appel, Hai Fang