160 search results - page 27 / 32 » Structuring the verification of heap-manipulating programs |
POPL
2006
ACM
14 years 10 months ago
2006
ACM
Web applications typically interact with a back-end database to retrieve persistent data and then present the data to the user as dynamically generated output, such as HTML web pa...
DC
2010
13 years 10 months ago
2010
Model checking software transactional memories (STMs) is difficult because of the unbounded number, length, and delay of concurrent transactions and the unbounded size of the memo...
CORR
2004
Springer
13 years 9 months ago
2004
Springer
We present role logic, a notation for describing properties of relational structures in shape analysis, databases, and knowledge bases. We construct role logic using the ideas of ...
CADE
2007
Springer
14 years 10 months ago
2007
Springer
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...
POPL
2009
ACM
14 years 10 months ago
2009
ACM
This paper presents a type-based solution to the long-standing problem of object initialization. Constructors, the conventional mechanism for object initialization, have semantics...