Sciweavers

146 search results - page 28 / 30
» Local Reasoning about Programs that Alter Data Structures
Sort
View
CADE
2007
Springer
14 years 8 months ago
Towards Efficient Satisfiability Checking for Boolean Algebra with Presburger Arithmetic
Boolean Algebra with Presburger Arithmetic (BAPA) is a decidable logic that combines 1) Boolean algebra of sets of uninterpreted elements (BA) and 2) Presburger arithmetic (PA). BA...
Viktor Kuncak, Martin C. Rinard
ENTCS
2008
140views more  ENTCS 2008»
13 years 8 months ago
Higher-Order Separation Logic in Isabelle/HOLCF
We formalize higher-order separation logic for a first-order imperative language with procedures and local variables in Isabelle/HOLCF. The assertion language is modeled in such a...
Carsten Varming, Lars Birkedal
CC
2006
Springer
124views System Software» more  CC 2006»
14 years 9 days ago
Polyhedral Code Generation in the Real World
The polyhedral model is known to be a powerful framework to reason about high level loop transformations. Recent developments in optimizing compilers broke some generally accepted ...
Nicolas Vasilache, Cédric Bastoul, Albert C...
POPL
2010
ACM
14 years 6 months ago
Toward a Verified Relational Database Management System
We report on our experience implementing a lightweight, fully verified relational database management system (RDBMS). The functional specification of RDBMS behavior, RDBMS impleme...
Avraham Shinnar, Greg Morrisett, J. Gregory Malech...
BMCBI
2007
144views more  BMCBI 2007»
13 years 8 months ago
Gene analogue finder: a GRID solution for finding functionally analogous gene products
Background: To date more than 2,1 million gene products from more than 100000 different species have been described specifying their function, the processes they are involved in a...
Angelica Tulipano, Giacinto Donvito, Flavio Licciu...