Sciweavers

4036 search results - page 182 / 808
» Formal Methods
Sort
View
TLDI
2009
ACM
100views Formal Methods» more  TLDI 2009»
16 years 3 months ago
Typed transformations of typed abstract syntax
Syntax Arthur Baars Doaitse Swierstra Technical Report UU-CS-2008-021 July 2008 Department of Information and Computing Sciences Utrecht University, Utrecht, The Netherlands www.cs...
Arthur I. Baars, S. Doaitse Swierstra, Marcos Vier...
FMICS
2009
Springer
16 years 1 months ago
Attacking Large Industrial Code with Bi-abductive Inference
In joint work with Cristiano Calcagno, Peter O’Hearn, and Hongseok Yang, we have introduced bi-abductive inference and its use in reasoning about heap manipulating programs [5]. ...
Dino Distefano
SBMF
2009
Springer
16 years 1 months ago
A Simple and General Theoretical Account for Abstract Types
Types Hongwei Xi Boston University Work partly funded by NSF grants no. CCR-0229480 and no. CCF-0702665 and General Theoretical Account for Abstract Types – p.1/20
Hongwei Xi
MEMOCODE
2008
IEEE
16 years 26 days ago
High-throughput Pipelined Mergesort
Abstract: We present an implementation of a highthroughput cryptosorter, capable of sorting an encrypted database of eight megabytes in .15 seconds; 1102 times faster than a softwa...
Kermin Fleming, Myron King, Man Cheuk Ng, Asif Kha...
SAS
2005
Springer
127views Formal Methods» more  SAS 2005»
15 years 12 months ago
Banshee: A Scalable Constraint-Based Analysis Toolkit
Abstract. We introduce Banshee, a toolkit for constructing constraintbased analyses. Banshee’s novel features include a code generator for creating customized constraint resoluti...
John Kodumal, Alexander Aiken