University of Cambridge > Talks.cam > Wednesday Seminars - Department of Computer Science and Technology > No Littering!

  Browse A-Z

Log in

University Account External (via Google)

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹ️ Information

No Littering!

Download to your calendar using vCal

If you have a question about this talk, please contact David Greaves .

Please note: Unusual day of week and time.

You can write ISO C++ programs that are statically type safe and have no resource leaks. You can do that simply, without loss of performance, and without limiting C++’s expressive power. This model for type- and resource-safe C++ has been implemented using a combination of ISO standard C++ language facilities, static analysis, and a tiny support library (written in ISO standard C++). This supports the general thesis that garbage collection is neither necessary nor sufficient for quality software. I describe the techniques used to eliminate dangling pointers and to ensure resource safety. Other aspects – also necessary for safe and effective use of C++ – have conventional solutions so they are mentioned only briefly here.

The techniques and facilities presented are supported by the Core C++ Guidelines and enforced by a static analysis tool for those.

This talk is part of the Wednesday Seminars - Department of Computer Science and Technology series.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Wolfson College, Gatsby Room Faculty of Asian & Middle Eastern Studies, Sidgwick Avenue Ray Dolby Centre Cluster Seminar Room

Other talks

Alicia Anderson discussing some exciting news about HARPS3 Directing Disturbance: Three Theatremakers in Discussion Thelocactus Title TBC Topic Film, TV shows for Medical Education, ‘The Wire’ as a case study CSAR lecture: Beyond Net Zero: Can We Repair The Climate?
 

© 2006-2025 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity