S. K. Lahiri and S. Qadeer. Verifying properties of well-founded linked lists. In POPL'06, 2006. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
On Field Constraint Analysis - Wies, Kuncak, Lam, Podelski, Rinard (2006) (1 citation) (Correct)
No context found.
S. K. Lahiri and S. Qadeer. Verifying properties of well-founded linked lists. In POPL'06, 2006.
A Better Logic and Decision Procedure for Predicate.. - Rakamaric, Bingham, Hu (2006) (Correct)
No context found.
S. K. Lahiri and S. Qadeer. Verifying properties of well-founded linked lists. In Symp. on Principles of Programming Languages (POPL), pages 115--126, 2006.
A Logic and Decision Procedure for Predicate Abstraction of .. - Bingham, Rakamaric (2005) (1 citation) (Correct)
No context found.
S. K. Lahiri and S. Qadeer. Verifying properties of well-founded linked lists, 2005. Microsoft Research Tech Report MSR-TR-2005-97.
An Overview of the Jahob Analysis System - Project Goals and.. - Kuncak, Rinard (Correct)
No context found.
S. K. Lahiri and S. Qadeer. Verifying properties of well-founded linked lists. In POPL'06, 2006.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC