Sciweavers

583 search results - page 116 / 117
» Reasoning in Logic about Continuous Systems
Sort
View
PLDI
2003
ACM
14 years 19 days 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
POPL
2005
ACM
14 years 7 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
ICSE
2005
IEEE-ACM
14 years 7 months ago
Verifying safety policies with size properties and alias controls
Many software properties can be analysed through a relational size analysis on each function's inputs and outputs. Such relational analysis (through a form of dependent typin...
Wei-Ngan Chin, Siau-Cheng Khoo, Shengchao Qin, Cor...
PLDI
2010
ACM
14 years 14 days ago
Adversarial memory for detecting destructive races
Multithreaded programs are notoriously prone to race conditions, a problem exacerbated by the widespread adoption of multi-core processors with complex memory models and cache coh...
Cormac Flanagan, Stephen N. Freund
OOPSLA
2010
Springer
13 years 5 months ago
Efficient modular glass box software model checking
Glass box software model checking incorporates novel techniques to identify similarities in the state space of a model checker and safely prune large numbers of redundant states w...
Michael Roberson, Chandrasekhar Boyapati