160 search results - page 26 / 32 » Structuring the verification of heap-manipulating programs |
POPL
2010
ACM
14 years 7 months ago
2010
ACM
We report on our experience implementing a lightweight, fully verified relational database management system (RDBMS). The functional specification of RDBMS behavior, RDBMS impleme...
CCS
2008
ACM
13 years 12 months ago
2008
ACM
As cryptographic protocols execute they accumulate information such as values and keys, and evidence of properties about this information. As execution proceeds, new information b...
POPL
2004
ACM
14 years 10 months ago
2004
ACM
We prove the decidability of the quantifier-free, static fragment of ambient logic, with composition adjunct and iteration, which corresponds to a kind of regular expression langu...
FPGA
1999
ACM
14 years 2 months ago
1999
ACM
Multi-FPGA systems are used as custom computing machines to solve compute intensive problems and also in the verification and prototyping of large circuits. In this paper, we addr...
CSL
2006
Springer
14 years 1 months ago
2006
Springer
Separation Logic is a sub-structural logic that supports local reasoning for imperative programs. It is designed to elegantly describe sharing and aliasing properties of heap struc...