Sciweavers

5090 search results - page 527 / 1018
» Constructing Strategies for Programming
Sort
View
CCS
2004
ACM
16 years 11 days ago
Formally verifying information flow type systems for concurrent and thread systems
Information flow type systems provide an elegant means to enforce confidentiality of programs. Using the proof assistant Isabelle/HOL, we have machine-checked a recent work of B...
Gilles Barthe, Leonor Prensa Nieto
IWMM
2004
Springer
92views Hardware» more  IWMM 2004»
16 years 10 days ago
Memory accounting without partitions
Operating systems account for memory consumption and allow for termination at the level of individual processes. As a result, if one process consumes too much memory, it can be te...
Adam Wick, Matthew Flatt
LCPC
2004
Springer
16 years 10 days ago
Implementation of Parallel Numerical Algorithms Using Hierarchically Tiled Arrays
In this paper, we describe our experience in writing parallel numerical algorithms using Hierarchically Tiled Arrays (HTAs). HTAs are classes of objects that encapsulate parallelis...
Ganesh Bikshandi, Basilio B. Fraguela, Jia Guo, Ma...
PEPM
2004
ACM
16 years 9 days ago
Dynamic slicing based on redex trails
Tracing computations is a widely used methodology for program debugging. Lazy languages, in particular, pose new demands on tracing techniques since following the actual trace of ...
Claudio Ochoa, Josep Silva, Germán Vidal
SAS
2004
Springer
140views Formal Methods» more  SAS 2004»
16 years 9 days ago
Path-Sensitive Analysis for Linear Arithmetic and Uninterpreted Functions
We describe data structures and algorithms for performing a path-sensitive program analysis to discover equivalences of expressions involving linear arithmetic or uninterpreted fun...
Sumit Gulwani, George C. Necula