10 search results - page 2 / 2 » Reusable Ada Libraries Supporting Infinite Data Structures |
PLDI
2009
ACM
14 years 6 months ago
2009
ACM
High-level languages are growing in popularity. However, decades of C software development have produced large libraries of fast, timetested, meritorious code that are impractical...
APLAS
2010
ACM
13 years 5 months ago
2010
ACM
Abstract. We propose a flexible method for verifying the security of ML programs that use cryptography and recursive data structures. Our main applications are X.509 certificate ch...
ATVA
2008
Springer
13 years 7 months ago
2008
Springer
Abstract. Non-freely generated data types are widely used in case studies carried out in the theorem prover KIV. The most common examples are stores, sets and arrays. We present an...
IJHPCA
2007
13 years 5 months ago
2007
A key characteristic of today’s high performance computing systems is a physically distributed memory, which makes the efficient management of locality essential for taking adv...
PARA
1995
Springer
13 years 8 months ago
1995
Springer
This paper describes a proposal for a set of Parallel Basic Linear Algebra Subprograms PBLAS . The PBLAS are targeted at distributed vector-vector, matrix-vector and matrixmatrix...