A case study of C source code verification: The Schorr-Waite algorithm

Proceedings - 3rd IEEE International Conference on Software Engineering and Formal Methods, SEFM 2005

Volumn , Issue , 2005, Pages 190-199

  Hubert, Thierry ^a   Marche, Claude ^a  

^a UFR 919 Laboratoire d'Informatique Pour la Mécanique et les Sciences de l'Ingénieur   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ANNOTATION LANGUAGES; FORMAL PROOFS; FORMAL REASONING; FORMAL VERIFICATIONS; POINTER PROGRAMS; SCHORR-WAITE ALGORITHM; SOURCE CODE VERIFICATION; THEOREM PROVERS;

COMPUTER PROGRAMMING LANGUAGES; EXPERIMENTS; SOFTWARE ENGINEERING; THEOREM PROVING; TOOLS;

C (PROGRAMMING LANGUAGE);

EID: 84883308102     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SEFM.2005.1     Document Type: Conference Paper

References (25)

1. The Simplify decision procedure (part of ESC/Java). http: //research. compaq. com/SRC/esc/simplify/.
2. J.-R. Abrial. Event based sequential program development: Application to constructing a pointer program. In K. Araki, S. Gnesi, and D. Mandrioli, editors, FME 2003: Formal Methods, volume 2805, pages 51-74. Springer-Verlag, 2003.
3. C. Barrett and S. Berezin. CVC Lite: A new implementation of the cooperating validity checker. In R. Alur and D. A. Peled, editors, 16th International Conference on Computer Aided Verification, volume 3114 of Lecture Notes in Computer Science, pages 515-518, Boston, MA, USA, July 2004. Springer-Verlag.
4. R. Bornat. Proving pointer programs in Hoare logic. In Mathematics of Program Construction, pages 102-126, 2000.
5. R. Bornat and B. Sufrin. Animating formal proof at the surface: The Jape proof calculator. The Computer Journal, 42(3):177-192, 1999. http://jape. org. uk.
6. R. Burstall. Some techniques for proving correctness of programs which alter data structures. Machine Intelligence, 7:23-50, 1972.
7. The Coq Proof Assistant. http://coq. inria. fr/.
8. J.-C. Filliatre, T. Hubert, and C. Marché. The Caduceus tool for the verification of C programs. http://why. lri. fr/caduceus/.
9. J.-C. Filliatre and C. Marché. Multi-prover verification of C programs. In J. Davies, W. Schulte, and M. Barnett, editors, Sixth International Conference on Formal Engineering Methods, volume 3308 of Lecture Notes in Computer Science, pages 15-29, Seattle, WA, USA, Nov. 2004. Springer-Verlag.
10. B. Kernighan and D. Ritchie. The C Programming Language (2nd Ed. ). Prentice-Hall, 1988.
11. G. T. Leavens, K. R. M. Leino, E. Poll, C. Ruby, and B. Jacobs. JML: notations and tools supporting detailed design in Java. In OOPSLA 2000 Companion, Minneapolis, Minnesota, pages 105-106, 2000.
12. C. Marché, C. Paulin-Mohring, and X. Urbain. The KRAKATOA tool for certification of JAVA/JAVACARD programs annotated in JML. Journal of Logic and Algebraic Programming, 58(1-2):89-106, 2004. http://krakatoa. lri. fr.
13. C. March and C. Paulin-Mohring. Reasoning about Java programs with aliasing and frame conditions. In J. Hurd and T. Melham, editors, 18th International Conference on Theorem Proving in Higher Order Logics, Lecture Notes in Computer Science. Springer-Verlag, Aug. 2005.
14. F. Mehta and T. Nipkow. Proving pointer programs in higherorder logic. In F. Baader, editor, 19th Conference on Automated Deduction, Lecture Notes in Computer Science. Springer-Verlag, 2003.
15. J. S. Moore and Q. Zhang. Proof pearl: Dijkstra's shortest path algorithm verified with ACL2. In J. Hurd and T. Melham, editors, 18th International Conference on Theorem Proving in Higher Order Logics, Lecture Notes in Computer Science. Springer-Verlag, Aug. 2005.
16. J. M. Morris. A proof of the Schorr-Waite algorithm. In M. Broy and G. Schmidt, editors, Theoretical Foundations of Programming Methodology, pages 25-51. Reidel, 1982. Proceedings of the 1981 Marktoberdorf summer school.
17. The PVS system. http://pvs. csl. sri. com/.
18. S. Ranise and D. Deharbe. Light-weight theorem proving for debugging and verifying units of code. In Proc. SEFM'03, Canberra, Australia, Sept. 2003. IEEE Computer Society Press. http://www. loria. fr/equipes/cassis/ softwares/haRVey/.
19. T. W. Reps, S. Sagiv, and A. Loginov. Finite differencing of logical formulas for static analysis. In P. Degano, editor, 12th European Symposium on Programming, ESOP 2003, volume 2618 of Lecture Notes in Computer Science, pages 380-398. Springer-Verlag, 2003.
20. J. C. Reynolds. Separation logic: a logic for shared mutable data structures. In 17h Annual IEEE Symposium on Logic in Computer Science. IEEE Comp. Soc. Press, 2002.
21. M. Sagiv, T. W. Reps, and R. Wilhelm. Parametric shape analysis via 3-valued logic. ACM Trans. Prog. Lang. Syst., 24(3):217-298, 2002.
22. H. Schorr and W. M. Waite. An efficient machineindependent procedure for garbage collection in various list structures. Commun. ACM, 10:501-506, 1967.
23. Sun Microsystems. The JavaCardTM application programming interface (API). http://java. sun. com/ products/javacard/.
24. R. W. Topor. The correctness of the Schorr-Waite list marking algorithm. Acta Inf., 11:211-221, 1979.
25. E. Ukkonen. On-line construction of suffix-trees. Algorithmica, 14:249-260, 1995.