http://se.cs.toronto.edu/index.php?title=ReadingGroup&feed=atom&action=historyReadingGroup - Revision history2019-10-22T09:57:15ZRevision history for this page on the wikiMediaWiki 1.22.2http://se.cs.toronto.edu/index.php?title=ReadingGroup&diff=119&oldid=prev128.100.4.130 at 20:36, 22 December 20102010-12-22T20:36:44Z<p></p>
<p><b>New page</b></p><div>Our Reading Group meets each week to discuss papers suggested by our members. Attendance is open to '''everybody'''. Feel free to add paper suggestions to our paper queue. Occasionally, members give practice talks. Contact Zak to arrange a talk. <br />
<br />
* When: Wednesdays at noon<br />
* Where: SE Debugging Room (BA3234)<br />
<br />
==Current session (2010)==<br />
<br />
===Timeline===<br />
* '''Oct 27''' Impressions of FLoC<br />
<br />
===Topic Lists===<br />
<br />
====Ordered Topics====<br />
*Overview of the different projects that have been/are being carried out by the group.<br />
*Read survey paper on static analysis techniques<br />
::Title: A Survey of Automated Techniques for Formal Software Verification<br />
::Authors: D'Silva, Kroening, Weissenbacher<br />
::This paper appears in: [http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=4544862]<br />
*Abstract Interpretation - foundations, applications. Probably will start by going through existing slides on the topic, then looking at papers.<br />
*Model Checking, CEGAR<br />
*Terminator<br />
*Category Theory: Steve's slides, youtube lectures<br />
*Model Fusion work<br />
*Type Theory, Partial Evaluation<br />
<br />
====Other topics (not yet ordered)====<br />
*Carolyn offered to give a talk at some point on her work on subway systems<br />
*Pi-calculus<br />
*Recovery<br />
*Concurrency<br />
*Hybrid Model Checking<br />
*Term Rewriting<br />
*Contracts and concurrency<br />
<br />
==Previous Sessions==<br />
<br />
===2009===<br />
* '''Oct 8, 15, 22''' David Barton, ''Notations for systems design''<br />
* '''Oct 1''' Shoham Ben-David, ''Applications of Description Logic and Causality in Model Checking''<br />
* '''Sep 17''' Prof. Rick Hehner, ''a Probability Perspective''<br />
* '''Sep 10''' Prof. Rick Hehner, ''from Boolean Algebra to Unified Algebra''<br />
* '''Sep 3''' Aws Albarghouthi, ''Abstract analysis of concrete execution''<br />
* '''Sep 2''' Anya Tafliovich, ''Predicative Quantum Programming''<br />
* '''Aug 27''' [http://berkeley.intel-research.net/dgay/pubs/09-icse-deadlock.pdf Effective Static Deadlock Detection (Mayur Naik, Chang-Seo Park, Koushik Sen, David Gay) Winner of ACM SIGSOFT Distinguished Papers Award]<br />
* '''Aug 20''' Jianwei Niu, ''Formal Models for Group-Centric Secure Information Sharing''<br />
* '''Aug 13''' Arie Gurfinkel, ''Decision Diagrams for Linear Arithmetic''<br />
* '''Aug 5''' Marsha, ''partial behavioral models''<br />
* '''July 30''' Shoham Ben-David, ''Explaining Counterexamples Using Causality''<br />
* '''July 23''' Aws, ''On the Use of Planning Technology for Verification''<br />
* '''July 10''' Borys Bradel's practice talk, ''Extending Goal Models with a Probability Model and using Bayesian Networks''<br />
* '''June 26, July 3''' Ou went over the slides about abstraction in software model checking that Marsha and Arie presented in the tutorial at FM 2006: [http://fm06.mcmaster.ca/FMTutorial06-handout.pdf Model-Checking: From Hardware to Software]<br />
* '''June 5, 19''' Talks by Albert: ''a Practical Theory of Programming'', ''Alternatives to Prof. Hehner's theory''<br />
* '''May 1,8, 29''' Byron Cook's TERMINATOR [http://www.dcs.qmul.ac.uk/~byron/berk1.pdf part 1] [http://www.dcs.qmul.ac.uk/~byron/berk2.pdf part 2] [http://www.dcs.qmul.ac.uk/~byron/berk3.pdf part 3] [http://byroncook.blogspot.com/ Byron Cook's blog]<br />
* '''Apr 17''' [http://research.microsoft.com/en-us/um/cambridge/projects/terminator/binreach.pdf Termination Proofs for Systems Code]<br />
* '''Apr 3''' [http://www.springerlink.com/content/v36q54n726773812/fulltext.pdf Model Checking Programs]<br />
* '''Mar 27''' We will continue our review of the Abstract Interpretation slides located at: [http://web.mit.edu/afs/athena.mit.edu/course/16/16.399/www/ link]<br />
* '''Mar 20''' Practice talk by Anya Tafliovich, ''Programming with Quantum Communication''<br />
* '''Mar 13''' [http://www.di.ens.fr/~cousot/publications.www/Cousot-LNCS2000-sv-sb.pdf Abstract Interpretation Based Formal Methods and Future Challenges] [http://www.di.ens.fr/~cousot/publications.www/Top4-Abst-Int-1-PC-RC.pdf Basic Concepts of Abstract Interpretation]<br />
* '''Mar 6''' [http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=4544862 A Survey of Automated Techniques for Formal Software Verification].<br />
* '''Feb 13''' Jordi Cabot, ''Verifying UML/OCL Operation Contracts''<br />
<br />
===2008===<br />
* '''Jun 10''' Albert Lai talked about operational semantics, soundness of refinements, and lazy evaluation. [http://www.cs.toronto.edu/~trebla/talk-jun-10-2008.pdf slides]<br />
* '''May 29''' Albert Lai talked about a theorem on loop invariants. [http://www.cs.toronto.edu/~trebla/loop-talk-may-25-2008.pdf slides]<br />
* '''Jan 15''' Jocelyn Simmonds talked about using SAT solvers in practice and SAT competitions (using N. Een's FMCAD '07 tutorial slides)<br />
* '''Jan 8''' Jocelyn Simmonds talked about SAT solvers (using N. Een's FMCAD '07 tutorial slides)<br />
<br />
===2007===<br />
* '''Dec 11''' Robert Will talked briefly about Paramodulation<br />
* '''Dec 4''' Albert Lai talked about Rewriting.<br />
* '''Nov 27''' Robert Will described window inference and gave a demo of the Ergo theorem prover.<br />
* '''Nov 20''' Anya Tafliovich described tableaux and model elimination.<br />
* '''Nov 13''' Ric Hehner described resolution.<br />
* '''Nov 6''' Bowen, J.P., Hinchey, M.G. "Ten commandments of formal methods... ten years later", IEEE Computer, Jan. 2006, pp. 40-48.<br />
* '''Nov 2''' Jocelyn Simmonds, "Exploiting Resolution Proofs to Speed Up LTL Vacuity Detection for BMC" (practice talk for FMCAD), Planning session for Reading Group (see [[ReadingGroup#Topic Lists]])<br />
* '''Oct 16''' Continued discussing the previous paper (Oct 2)<br />
* '''Oct 2''' O. Grumberg, A. Schuster, A. Yadgar. "3-Valued Circuit SAT for STE with Automatic Refinement", 5th International Symposium on Automated Technology for Verification and Analysis (ATVA'07), Tokyo, October 2007. [http://www.cs.technion.ac.il/users/orna/Yadgar-atva07.pdf Paper]<br />
* '''Sept 25''' A. Datta, A. Derek, J.C. Mitchell, V. Shmatikov, and M. Turuani, "Probabilistic polynomial-time semantics for a protocol security logic" (invited), 32nd International Colloquium on Automata, Languages and Programming (ICALP '05), Lisbon, July, 2005.<br />
* '''Sept 18''' Jayadev Misra, "Powerlist: A Structure for Parallel Recursion", TOPLAS, Vol. 16, No. 6, pp. 1737-1767, November 1994 '''(talk)'''<br />
* '''Sept 13''' Naghmeh Ghafari, "Algorithmic Analysis of Piecewise FIFO Systems" '''(talk)'''<br />
* '''May 9''' Kelvin Ku, "Software Model-Checking for Buffer Overflow Analysis: Benchmarking as an Aid to Tool Development" '''(talk)'''<br />
* '''Apr 25''' B. Gulavani, T. Henzinger, Y. Kannan, A. Nori and S. Rajamani. "SYNERGY: a new algorithm for property checking", SIGSOFT '06/FSE-14: Proceedings of the 14th ACM SIGSOFT International Symposium on Foundations of Software Engineering<br />
* '''Apr 4''' Mihaela Bobaru, "Finding Environment Guarantees", FASE '07 presentation '''(talk)'''. We also read the following paper: Marcelo F. Frias, Carlos G. Lopez Pombo, and Mariano M. Moscato, "Alloy Analyzer+PVS in the Analysis and Verification of Alloy Specifications", TACAS '07, Best paper award<br />
* '''Mar 28''' Orna Kupferman and Sarai Sheinvald-Faragy, "Finding Shortest Witnesses to the Nonemptiness of Automata on Infinite Words", CONCUR '06<br />
* '''Mar 21''' K. McMillan, "Lazy Abstraction with Interpolants", CAV'06<br />
* '''Mar 14''' Ranjit Jhala and Kenneth L. McMillan. "A practical and complete approach to predicate refinement". In TACAS, pages 459-473, 2006<br />
* '''Mar 7''' Ranjit Jhala, Rupak Majumdar, and Ru-Gang Xu, "State of the Union: Type Inference via Craig Interpolation", TACAS '07<br />
* '''Feb 28''' Niklaus Wirth. "Good Ideas, Through the Looking Glass", IEEE Computer, Jan. 2006, pp. 56-68<br />
* '''Feb 14''' (Presented by Kelvin Ku) Himanshu Jain, Franjo Ivancic, Aarti Gupta, Ilya Shlyakhter, Chao Wang. "Using Statically Computed Invariants inside the Predicate Abstraction and Refinement Loop", CAV '06<br />
* '''Feb 7''' Continued discussing the previous paper (Jan 31). Anya voluteered to look up SERE/PSL, Jocelyn tried to explain LTL testers, and Mihaela looked into tester composition.<br />
* '''Jan 31''' A. Zaks and A. Pnueli, "PSL Model Checking and Run-time Verification via Testers", FM 06.<br />
* '''Jan 24''' Continued discussing the previous paper (Jan 17)<br />
* '''Jan 17''' Yifeng Chen, "Semantic Inheritance in Unifying Theories of Programming" (referee: Ric)<br />
* '''Jan 10''' Greta Yorsh, Thomas Ball, and Mooly Sagiv, "Testing, Abstraction, Theorem Proving: Better Together!", International Symposium on Software Testing and Analysis, 2006<br />
<br />
===2006===<br />
<br />
* '''Dec 13''' Continued discussing the previous paper (Dec 6)<br />
* '''Dec 6''' Carroll Morgan, "The Shadow Knows: Refinement of Ignorance in Sequential Programs", MPC 2006<br />
* '''Nov 29''' Caires and Cardelli, "A Spatial Logic for Concurrency (Part I)"<br />
* '''Nov 22''' Lori Clarke and David Rosenblum, "A Historical Perspective on Runtime Assertion Checking in Software Development", ACM SIGSOFT Software Engineering Notes, May 2006<br />
* '''Nov 15''' Dershowitz, Hanna, Nadel, "A Scalable Algorithm for Minimal Unsatisfiable Core Extraction", SAT'06<br />
* '''Nov 8''' Rajeev Alur and P. Madhusudan, "Adding Nesting Structure to Words", Tenth International Conference on Developments in Language Theory (DLT06) (Invited paper)<br />
* '''Nov 1''' Shiva Nejati, "Thorough Checking Revisited" '''(practice talk for FMCAD)''', Yuan Gan, "Runtime Monitoring for Web Services" '''(talk)'''<br />
* '''Oct 25''' Beyer, Henzinger and Theoduloz, "Lazy Shape Analysis", CAV 06<br />
* '''Oct 11''' Wonhong Nam and Rajeev Alur, "Learning-based Symbolic Assume-guarantee Reasoning with Automatic Decomposition", Fourth International Symposium on Automated Technology for Verification and Analysis (ATVA06)<br />
* '''Oct 4''' Larsen, Nyman, Wasowski, "Interface Input/Output Automata", FM06<br />
* '''Sept 27''' E.C.R Hehner, "Unified Algebra" '''(talk)'''<br />
* '''Sept 14''' Mihaela Bobaru talked about the work she did during her summer internship at NASA<br />
* '''Jul 20''' Kelvin Ku, "Planning under Uncertainty: A Model Based Approach" '''(talk)'''<br />
* '''Jul 13''' Steve Easterbrook, "Introduction to Category Theory" '''(talk)'''. Rick Salay, "Theory of Institutions and Its Applications in Software Engineering" '''(talk)'''<br />
* '''Jul 6''' T. Legall, B. Jeannet, and T. Jron, "Verification of Communication Protocols using Abstract Interpretation of FIFO Queues", from AMAST 06<br />
* '''Jun 29''' Ji Zhang and Betty Cheng, "Model-Based Development of Dynamically Adaptive Software", (Best paper of ICSE 2006)<br />
* '''Jun 22''' Junfeng Yang, Can Sar, Paul Twohey, Cristian Cadar, and Dawson Engler, "Automatically generating malicious disks using symbolic execution" from IEEE Security and Privacy 2006<br />
* '''Jun 15''' Anya Tafliovich, "Predicative Quantum Programming", MPC 2006<br />
* '''Jun 8''' Henk Barendregt, "Introduction to Generalized Type Systems", Journal of Functional Programming, 1(2):124-154, 1991<br />
* '''Jun 1''' David Harel and Bernhard Rumpe, "Meaningful Modeling: What's the Semantics of "Semantics"?", in IEEE Computer, Oct. 2004<br />
* '''May 25''' Corina Pasareanu and Willem Visser, "Verification of Java Programs Using Symbolic Execution and Invariant Generation", SPIN 2004<br />
* '''May 9''' Continued discussing the previous paper (May 2)<br />
* '''May 2''' Ioannis T. Kassios, "Dynamic Frames: Support for Framing, Dependencies and Sharing without Restrictions". In J. Misra, T. Nipkow, E. Sekerinski (eds.) Formal Methods 2006, vol. 4085 of Lecture Notes in Computer Science, pages 268-283. Springer-Verlag, 2006. Best paper award.<br />
* '''Apr 25''' Continued discussing the previous paper (Apr 18) <br />
* '''Apr 18''' Peter W. O'Hearn, John C. Reynolds, and Hongseok Yang, "Local Reasoning about Programs that Alter Data Structures" in CSL 2001<br />
* '''Apr 11''' Dino Distefano, Peter W. O'Hearn, Hongseok Yang, "A Local Shape Analysis Based on Separation Logic", TACAS 2006<br />
* '''Apr 4''' Marsha Chechik and Arie Gurfinkel discussed their experiences at ETAPS '06. We also read the following paper: Bhargav S. Gulavani, Sriram K. Rajamani, "Counterexample Driven Refinement for Abstract Interpretation", TACAS 2006<br />
* '''Mar 21''' Arie Gurfinkel, "Why Waste a Perfectly Good Abstraction?" '''(practice talk for TACAS '06)'''<br />
* '''Mar 14''' R. Alur, P. Madhusudan, and Wonhong Nam, "Symbolic Compositional Verification by Learning Assumptions", CAV 2005<br />
* '''Mar 7''' Tamarah Arons, Elad Elster et al, "Formal Verification of Backward Compatibility of Microcode" CAV 2005<br />
* '''Feb 28''' Paper: "Angelic Nondeterminacy as External Choice in CSP" (need more info)<br />
* '''Feb 21''' Arie Gurfinkel, "Supporting Construction, Analysis, and Understanding of Software Models" '''(talk)'''<br />
* '''Feb 14''' Edmund Clarke, Muralidhar Talupur, Helmut Veith, "Environment Abstraction for Parameterized Verification", VMCAI 2006<br />
* '''Jan 31''' E.C.R Hehner, "Retrospective and Prospective for Unifying Theories of Programming" '''(talk)'''<br />
* '''Jan 24''' Xavier Leroy, "Formal Certification of a Compiler Back-end, or Programming a Compiler with a Proof Assistant", POPL 06<br />
* '''Jan 17''' Corina S. Psreanu, Radek Pelnek and Willem Visser, "Concrete Model Checking with Abstract Matching and Refinement", CAV 2005<br />
* '''Jan 12''' Naghmeh Ghafari and Richard Trefler, "Piecewise FIFO Channels Are Analyzable", VMCAI 2006<br />
* '''Jan 5''' Arie Gurfinkel, "Systematic Construction of Abstractions for Model-Checking" '''(practice talk for VMCAI 2006)'''<br />
<br />
===2005===<br />
<br />
* '''Dec 15''' Jonathan Amir, "Verification of Web Services" '''(talk)'''<br />
* '''Dec 7''' Aysu Betin-Can and Tevfik Bultan, "Interface-based specification and verification of concurrency controllers", SoftMC 2003<br />
* '''Dec 1''' T. Henzinger, R. Jhala, R. Majumdar, "Permissive Interfaces", FSE 2005<br />
* '''Nov 23''' Continued reading a previous paper (Nov 18)<br />
* '''Nov 18''' B. Cook, A. Podelski, and A. Rybalchenko, "Abstraction Refinement for Termination", SAS 05. Shiva Nejati, Justin Ward and Jocelyn Simmonds discussed their experiences at ASE '05.<br />
* '''Nov 10''' O. Grumberg, O, Strichman, F. Lerda, and M. Theobald, "Proof-Guided Underapproximation-Widening for Multi-Process Systems", POPL 2005<br />
* '''Nov 3''' Shiva Nejati and Justin Ward gave practice talks for ASE '05 '''(talk)'''<br />
* '''Oct 26''' Leslie Lamport, "Real-time model checking is really simple", CHARME 2005<br />
* '''Oct 20''' Jocelyn Simmonds, practice talk for ASE '05 '''(talk)'''<br />
* '''Oct 12''' W.J. Fokkink, J.F. Groote and M.A. Reniers, "Process algebra needs proof methodology", from The Concurrency Column, Bulletin of the EATCS, February 2004<br />
* '''Oct 6''' Cindy Eisner, Dana Fisman, and John Havlicek, "A Topological Characterization of Weakness", PODC 2005<br />
* '''Sept 29''' Patrick Maier, "Compositional Circular Assume-Guarantee Rules Cannot Be Sound and Complete", FoSSaCS 2003<br />
<br />
==Paper Queue==<br />
<br />
Papers are not listed in any particular order. Feel free to add/remove papers/categories.<br />
<br />
===General SE===<br />
* E. M. Clarke Jr. "Programming language constructs for which it is impossible to obtain good Hoare axiom systems", in Journal of the ACM v26 #1 p129-147, January 1979 (earlier POPL'77) [http://www.cs.utoronto.ca/~trebla/tmp/p129-clarke.pdf PDF]<br />
* B. Moller, "The Linear Algebra of UTP"<br />
<br />
===Abstraction===<br />
* Thomas Ball, Byron Cook, Shuvendu K. Lahiri, and Lintao Zhang. "Zapato: Automatic theorem proving for predicate abstraction refinement", in CAV, pages 457-461, 2004<br />
* Arie Gurfinkel and Marsha Chechik. "Why waste a perfectly good abstraction?". In TACAS, pages 212-226, 2006<br />
* Shuvendu K. Lahiri, Randal E. Bryant, and Byron Cook. "A symbolic approach to predicate abstraction". In CAV, pages 141-153, 2003.<br />
* Thomas A. Henzinger, Ranjit Jhala, Rupak Majumdar, and Kenneth L. McMillan. "Abstractions from proofs". In POPL, pages 232-244, 2004.<br />
* Ranjit Jhala and Kenneth L. McMillan. "A practical and complete approach to predicate refinement". In TACAS, pages 459-473, 2006.<br />
* Daniel Kroening and Georg Weissenbacher. "Counterexamples with loops for predicate abstraction". In CAV, pages 152-165, 2006.<br />
<br />
===Alias Analysis===<br />
* Dzintars Avots, Michael Dalton, V. Benjamin Livshits, and Monica S. Lam. "Improving software security with a C pointer analysis". In ICSE, pages 332-341, 2005.<br />
* Manuvir Das, Ben Liblit, Manuel Fähndrich, and Jakob Rehof. "Estimating the impact of scalable pointer analysis on optimization". In SAS, pages 260-278, 2001.<br />
<br />
===Static Analysis===<br />
* Yichen Xie, Andy Chou, and Dawson R. Engler. "Archer: using symbolic, path-sensitive analysis to detect memory access errors". In ESEC / SIGSOFT FSE, pages 327-336, 2003.<br />
* Bruno Blanchet, Patrick Cousot, Radhia Cousot, Jérôme Feret, Laurent Mauborgne, Antoine Miné, David Monniaux, and Xavier Rival. "A static analyzer for large safety-critical software". In PLDI, pages 196-207, 2003.<br />
* Patrick Cousot, Radhia Cousot, Jérôme Feret, Laurent Mauborgne, Antoine Miné, David Monniaux, and Xavier Rival. "The astreé analyzer". In ESOP, pages 21-30, 2005.<br />
* Patrick Cousot and Nicolas Halbwachs. "Automatic discovery of linear restraints among variables of a program". In POPL, pages 84-96, 1978.<br />
* Nurit Dor, Michael Rodeh, and Shmuel Sagiv. "CSSV: towards a realistic tool for statically detecting all buffer overflows in C". In PLDI, pages 155-167, 2003.<br />
* Vinod Ganapathy, Somesh Jha, David Chandler, David Melski, and David Vitek. "Buffer overrun detection using linear programming and static analysis". In ACM Conference on Computer and Communications Security, pages 345-354, 2003.<br />
* Brian Hackett, Manuvir Das, Daniel Wang, and Zhe Yang. "Modular checking for buffer overflows in the large". In ICSE '06: Proceeding of the 28th international conference on Software engineering, pages 232-241, New York, NY, USA, 2006. ACM Press.<br />
* Antoine Miné. "The octagon abstract domain". In WCRE, pages 310-, 2001.<br />
<br />
===Tool Comparisons===<br />
* John Wilander and Mariam Kamkar. "A comparison of publicly available tools for static intrusion prevention". In Proceedings of the 7th Nordic Workshop on Secure IT Systems, pages 68-84, Karlstad, Sweden, November 2002.<br />
<br />
===Lazy Abstraction and Refinement (BLAST)===<br />
* Ranjit Jhala. "Program Verification by Lazy Abstraction". PhD thesis, University of California at Berkeley, 2004.<br />
<br />
===Program Derivation===<br />
* Andy Gill and Graham Hutton. "The worker/wrapper transformation". In preparation for submission to the Journal of Functional Programming, December 2007. [http://www.cs.nott.ac.uk/~gmh/bib.html#wrapper Abstract and PDF]<br />
* José Bacelar Almeida and Jorge Sousa Pinto. "Deriving Sorting Algorithms". Tech Report at Universidade do Minho, Portugal, April 2006. 27 pages. [http://arxiv.org/abs/0802.3881 arXiv record]<br />
<br />
===Miscellaneous===<br />
* Sumit Nain and Moshe Vardi. "Branching vs. Linear Time: Semantical Perspective". ATVA'07 invited paper. [http://www.cs.rice.edu/~vardi/papers/atva0711.pdf paper PDF] and [http://www.cs.rice.edu/~vardi/papers/atva07tk.pdf slides PDF]<br />
* Hongwei Xi et al. The [http://www.ats-lang.org/ ATS] dependently-typed programming and proving language. (To be refined to a paper citation or a demo.)<br />
* Leslie Lamport. "The PlusCal Algorithm Language". 2009. [http://research.microsoft.com/en-us/um/people/lamport/pubs/pubs.html#pluscal Abstract and PDF]<br />
* Himanshu Jain, Franjo Ivancic, Aarti Gupta, Ilya Shlyakhter, and Chao Wang. "Using statically computed invariants inside the predicate abstraction and refinement loop". In CAV, pages 137-151, 2006.<br />
* Himanshu Jain, Franjo Ivancic, Aarti Gupta, and Malay K. Ganai. "Localization and register sharing for predicate abstraction". In TACAS, pages 397-412, 2005.<br />
* Franjo Ivancic, Ilya Shlyakhter, Aarti Gupta, and Malay K. Ganai. "Model checking c programs using f-soft". In ICCD, pages 297-308, 2005.<br />
* Daniel Kroening, Alex Groce, and Edmund M. Clarke. "Counterexample guided abstraction refinement via program execution. In Davies et al. [DSB04], pages 224-238. Formal Methods and Software Engineering, 6th International Conference on Formal Engineering Methods, ICFEM 2004, Seattle, WA, USA, November 8-12, 2004, Proceedings, volume 3308 of Lecture Notes in Computer Science. Springer, 2004.<br />
* Sagar Chaki and Scott Hissam. "Certifying the absence of buffer overflows". Technical Report CMU/SEI-2006-TN-030, Software Engineering Institute, Carnegie Mellon University, September 2006.<br />
* Shaunak Chatterjee, Shuvendu K. Lahiri, Shaz Qadeer, and Zvonimir Rakamaric, "A Reachability Predicate for Analyzing Low-Level Software", in TACAS '07<br />
* Muhammad Zubair Malik, Aman Pervaiz, and Sarfraz Khurshid, "Generating Representation Invariants of Structurally Complex Data", in TACAS '07</div>128.100.4.130