4224 search results - page 279 / 845 » Reasoning about Choice |
209
click to vote
VMCAI
2010
Springer
16 years 4 months ago
2010
Springer
Abstract. Logics that involve collections (sets, multisets), and cardinality constraints are useful for reasoning about unbounded data structures and concurrent processes. To make ...
172
click to vote
VMCAI
2010
Springer
16 years 4 months ago
2010
Springer
We present an automatic verification procedure based on RGSep that is suitable for reasoning about fine-grained concurrent heapmanipulating programs. The procedure computes a set o...
187
click to vote
AINA
2009
IEEE
16 years 2 months ago
2009
IEEE
—This paper makes two contributions towards the logical modelling of inhibition in metabolic networks. First it exposes the logical inconsistency of an existing state-of-the-art ...
170
click to vote
FMICS
2009
Springer
16 years 1 months ago
2009
Springer
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]. ...
187
click to vote
FOSSACS
2007
Springer
16 years 1 months ago
2007
Springer
Abstract. Separation logic is a recent extension of Hoare logic for reasoning about programs with references to shared mutable data structures. In this paper, we provide a new inte...