279 search results - page 3 / 56 » Invariant Patterns for Program Reasoning |
IR
2008
13 years 5 months ago
2008
We develop efficient dynamic programming algorithms for pattern matching with general gaps and character classes. We consider patterns of the form p0g(a0, b0)p1g(a1, b1) . . . pm-1...
FAC
2007
13 years 5 months ago
2007
In object-oriented programming, reentrant method invocations and shared references make it difficult to achieve adequate encapsulation for sound modular reasoning. This tutorial p...
CONCUR
2010
Springer
13 years 6 months ago
2010
Springer
Optimistic concurrency algorithms provide good performance for parallel programs but they are extremely hard to reason about. Program logics such as concurrent separation logic and...
ICLP
2005
Springer
13 years 11 months ago
2005
Springer
FMCO
2004
Springer
13 years 11 months ago
2004
Springer
In object-oriented programming, reentrant method invocations and shared references make it difficult to achieve adequate encapsulation for sound modular reasoning. This tutorial p...