200 search results - page 21 / 40 » Invariant Logics |
VMCAI
2009
Springer
14 years 2 months ago
2009
Springer
We present the first shape analysis for multithreaded programs that avoids the explicit enumeration of execution-interleavings. Our approach is to automatically infer a resource ...
KBSE
2008
IEEE
14 years 1 months ago
2008
IEEE
Many approaches to software verification are currently semi-automatic: a human must provide key logical insights — e.g., loop invariants, class invariants, and frame axioms tha...
TIME
2005
IEEE
14 years 1 months ago
2005
IEEE
The language of timed µCRL is an extension of an ACP-style process algebra-based language µCRL with time-related features. In this paper we describe this language and its equati...
LPAR
2010
Springer
13 years 6 months ago
2010
Springer
Induction proofs often fail because the stated theorem is noninductive, in which case the user must strengthen the theorem or prove auxiliary properties before performing the induc...
POPL
2010
ACM
14 years 5 months ago
2010
ACM
The automated inference of quantified invariants is considered one of the next challenges in software verification. The question of the right precision-efficiency tradeoff for the...