## +24 ## Security Beyond Memory Safety Using Modern C++ to Avoid Vulnerabilities by Design ## MAX HOFFMANN ## Security Beyond Memory Safety Using Modern C++ to Avoid Vulnerabilities by Design FIFTY YOURSELF IN THE FOOT WITH A RAILGUN FEBRUARY 26, 2024 # Press Release: Future Software Should Be Memory Safe ONCD BRIEFING ROOM PRESS RELEASE Leaders in Industry Support White House Call to Address Root 25 of the past 5 years Weaknesses associated with languages that do not have strong support for memory management or type enforcement. CWE-119, CWE-190, CWE-416, CWE-787, and CWE-476 are in this group

Installing Ubuntu from a USB memory stick This guide will help you install Ubuntu on your computer by using a USB memory stick. USB memory sticks are sometimes known as flash drives, memory pens or USB Mass Storage Storage devices. Installing from a memory stick is useful if you have a computer without a CD drive (like a netbook), or prefer the convenience of a memory stick. Alternative methods are available, like running Windows. ### 1. What do I need to get started? To install Ubuntu from a USB memory stick you need: - A memory stick with a capacity of at least 2GB. It will be formatted (erased) during this process

## A Relaxed Guide to memory_order_relaxed Hans Boehm Paul E. McKenney Google Facebook CPPCON 2020 ## std::atomic/std::atomic_ref and memory_order_relaxed - C++ atomic operations are sequentially consistent sacrificing the simple threads-as-interleaving semantics - by passing memory order enum values to explicit atomic operations. - In particular, memory_order_relaxed allows arbitrary visibility reordering with respect respect to accesses to other locations. ## What is Not to Like About memory order relaxed? - Just a load, just a store: Full control, excellent efficiency and scalability! ☐ Assuming aligned machine-sized

## +23 ## Object Introspection: A Revolutionary Memory Profiler for C++ Objects ## JONATHAN HASLAM & ADITYA SARWADE 20 23 October 01 - 06 ## Scene Setting “... functions then provide the basic 2d6739cbe6128deb047eb1259822d6/p4_1.jpg) ## Object Introspection (Ol) Goals - Byte level memory footprint analysis for objects • Complete object type hierarchies • Dynamic allocations and containers object hierarchy from a given root type • Understand the layout in memory of the entire hierarchy • Understand how to interpret data at memory offsets • Understand containers • Compiler generated debug information

Practical memory pool based allocators for Modern C++ ## PREVIOUSLY ON cppcon • CppCon 2019: Safe Software for Autonomous Mobility With Modern C++ by Andreas Pasternak • Quote: “Memory pools and allocators piece in (more) depth ## Memory allocations in real-time safety-critical environment • The solution should be safe and certifiable • What does it mean practically for C++ memory allocations? We asked Autosar C++ 14 Coding Guidelines regarding memory allocations” ## Autosar C++ guidelines Rule A18-5-5 (required, implementation, partially automated) Memory management functions shall ensure the following:

Methodology for Persistent Transactional Data Structures CHRISTINA PETERSON, KENNETH LAMAR 20 21 October 24-29 |Introduction|Persistent Hash Map|Persistent Transactional Data Structures|Live Demon Introduction Persistent Memory Use-Cases Pitfalls Persistent Hash Map Design Goals and Methodology Persistence Performance Results Persistent Transactional Data Structures Design Performance Results Live Demonstration ## I ntroduction |Introduction|Persistent Hash Map|Persistent Transactional Data Structures|Live Demonstration|References| |---|---|---|---|---| |0|00|00|0000|| |0000|00000|0000|||

## +23 ## C++ Memory Model: from C++11 to C++23 ## ALEX DATHSKOVSKY ## 20 23 October 01 - 06 ## About Me: SPEEDATA alex.dathskovsky@speedata.io www.linkedin.com/in/alexdathskovsky https://www.cppnext [Image](/uploads/documents/a/b/8/f/ab8f331d7156e1b708cb39698c0a1f00/p3_1.jpg) ## its a conspiracy man ## Memory Model ## I mportant Question ## Does the processor executes the program you wrote? ## The Answer executed by the functional unit - The functional unit writers the result back to the register or memory ## Branch Prediction • predicts if branch is taken • if prediction is wrong flush calculations

implemented by JndiDestinationResolver (allowing to clear the cache) * JmsTransactionManager starts the transactional Session's Connection early (at transaction begin) rather than on demand * optimized JmsTemplate's Synchronization ifc on top of a Spring TransactionSynchronization * added "timeout" attribute to Transactional annotation, allowing to specify a timeout in seconds within the annotation Package org.springframework "trackRowsAffected" property to BatchSqlUpdate, allowing to turn off the row counts list to save memory * refined JdbcBeanDefinitionReader to offer constructors with BeanDefinitionRegistry and Propert

Studio ..... 323 30.3 Converting Types ..... 324 30.4 Calling Julia Functions ..... 324 30.5 Memory Management ..... 325 30.6 Working with Arrays ..... 327 30.7 Exceptions ..... 329 31 Code Loading 32.3 Options for controlling the display of profile results 344 32.4 Configuration 346 32.5 Memory allocation analysis 346 32.6 External Profiling 346 33 Stack Traces 348 33.1 Viewing a stack 354 34.1 Avoid global variables 354 34.2 Measure performance with @time and pay attention to memory allocation 355 34.3 Tools 356 34.4 Avoid containers with abstract type parameters 356 34.5

Studio ..... 361 30.3 Converting Types ..... 362 30.4 Calling Julia Functions ..... 363 30.5 Memory Management ..... 363 30.6 Working with Arrays ..... 366 30.7 Exceptions ..... 367 31 Code Loading Options for controlling the display of profile results ..... 385 32.4 Configuration ..... 386 32.5 Memory allocation analysis ..... 386 32.6 External Profiling ..... 387 33 Stack Traces ..... 389 33 Avoid untyped global variables ..... 395 34.3 Measure performance with @time and pay attention to memory allocation ..... 396 34.4 Tools ..... 398 34.5 Avoid containers with abstract type parameters