16 search results - page 1 / 4 » Decidability of inferring inductive invariants |
228
click to vote
ICFP
2009
ACM
16 years 1 months ago
2009
ACM
GADTs have proven to be an invaluable language extension, a.o. for ensuring data invariants and program correctness. Unfortunately, they pose a tough problem for type inference: w...
108
click to vote
LICS
2009
IEEE
15 years 7 months ago
2009
IEEE
The reachability problem for Vector Addition Systems (VASs) is a central problem of net theory. The general problem is known decidable by algorithms exclusively based on the class...
122
Voted
CSL
2005
Springer
15 years 6 months ago
2005
Springer
Since Val Tannen's pioneering work on the combination of simply-typed λ-calculus and rst-order rewriting [11], many authors have contributed to this subject by extending it ...
100
Voted
APLAS
2009
ACM
15 years 7 months ago
2009
ACM
We describe an algorithm for synthesizing resource invariants that are used in the verification of concurrent programs. This synthesis employs bi-abductive inference to identify t...
103
Voted
IPPS
2008
IEEE
15 years 7 months ago
2008
IEEE
In this paper, we identify that protocol verification using invariants have significant limitations such as inapplicability to some protocols, non-standard attacker inferences a...