Sciweavers

726 search results - page 144 / 146
» Reasoning about Feature Models in Higher-Order Logic
Sort
View
POPL
2006
ACM
16 years 2 months ago
Decidability and proof systems for language-based noninterference relations
Noninterference is the basic semantical condition used to account for confidentiality and integrity-related properties in programming languages. There appears to be an at least im...
Mads Dam
POPL
2005
ACM
16 years 2 months ago
Transition predicate abstraction and fair termination
on Predicate Abstraction and Fair Termination Andreas Podelski Andrey Rybalchenko Max-Planck-Institut f?ur Informatik Saarbr?ucken, Germany Predicate abstraction is the basis of m...
Andreas Podelski, Andrey Rybalchenko
ICFP
2005
ACM
16 years 1 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
ISSTA
2004
ACM
15 years 7 months ago
Exploiting purity for atomicity
The notion that certain procedures are atomic is a fundamental correctness property of many multithreaded software systems. A procedure is atomic if for every execution there is a...
Cormac Flanagan, Stephen N. Freund, Shaz Qadeer
AI
2008
Springer
15 years 1 months ago
The well-designed young mathematician
This paper complements McCarthy's "The well designed child", in part by putting it in a broader context, the space of possible well designed progeny, and in part by...
Aaron Sloman