Export Citations
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
- research-articleJune 2008
Model checking transactional memories
PLDI '08: Proceedings of the 29th ACM SIGPLAN Conference on Programming Language Design and ImplementationJune 2008, Pages 372–382https://doi.org/10.1145/1375581.1375626Model checking software transactional memories (STMs) is difficult because of the unbounded number, length, and delay of concurrent transactions and the unbounded size of the memory. We show that, under certain conditions, the verification problem can ...
Also Published in:
ACM SIGPLAN Notices: Volume 43 Issue 6, June 2008 - research-articleJune 2008
Discovering properties about arrays in simple programs
PLDI '08: Proceedings of the 29th ACM SIGPLAN Conference on Programming Language Design and ImplementationJune 2008, Pages 339–348https://doi.org/10.1145/1375581.1375623Array bound checking and array dependency analysis (for parallelization) have been widely studied. However, there are much less results about analyzing properties of array contents. In this paper, we propose a way of using abstract interpretation for ...
Also Published in:
ACM SIGPLAN Notices: Volume 43 Issue 6, June 2008 - research-articleJune 2008
Program analysis as constraint solving
PLDI '08: Proceedings of the 29th ACM SIGPLAN Conference on Programming Language Design and ImplementationJune 2008, Pages 281–292https://doi.org/10.1145/1375581.1375616A constraint-based approach to invariant generation in programs translates a program into constraints that are solved using off-the-shelf constraint solvers to yield desired program invariants.
In this paper we show how the constraint-based approach can ...
Also Published in:
ACM SIGPLAN Notices: Volume 43 Issue 6, June 2008 - research-articleJune 2008
Quantitative information flow as network flow capacity
PLDI '08: Proceedings of the 29th ACM SIGPLAN Conference on Programming Language Design and ImplementationJune 2008, Pages 193–205https://doi.org/10.1145/1375581.1375606We present a new technique for determining how much information about a program's secret inputs is revealed by its public outputs. In contrast to previous techniques based on reachability from secret inputs (tainting), it achieves a more precise ...
Also Published in:
ACM SIGPLAN Notices: Volume 43 Issue 6, June 2008 - research-articleJune 2008
Liquid types
PLDI '08: Proceedings of the 29th ACM SIGPLAN Conference on Programming Language Design and ImplementationJune 2008, Pages 159–169https://doi.org/10.1145/1375581.1375602We present Logically Qualified Data Types, abbreviated to Liquid Types, a system that combines Hindley-Milner type inference with Predicate Abstraction to automatically infer dependent types precise enough to prove a variety of safety properties. Liquid ...
Also Published in:
ACM SIGPLAN Notices: Volume 43 Issue 6, June 2008