Question

Per their Gödel prize citation, Brooks and O’Hearn simultaneously solved the two major challenges of handling this data type and concurrency by developing CSL. In separation logic, the right arrow binary operator makes an assertion about an object with this data type; more generally, separation logic was created to improve on Hoare logic’s difficulty with manipulating and reasoning about (15[1])this data type. Reasoning about data structures is aided by diagrams consisting of pairs of squares called “box-and-[this word] diagrams”. (-5[1])Formal verification of programs using this data type is harder because of (*) aliasing, a phenomenon where two objects of this type (10[1])overlap. (10[1])Every individual node in a linked list contains some data along with an object of this type. For 10 points, (10[1])dynamic memory allocation returns an object of what data type that references a location in the heap? ■END■ (10[1])

ANSWER: pointers [accept references before read; accept addresses; accept heap pointers; prompt on “mutable data types”; reject “heap”]
<BC and AW>
= Average correct buzz position
Conv. %Power %Average Buzz
100%20%103.00

Back to tossups

Buzzes

PlayerTeamOpponentBuzz PositionValue
Michał GerasimiukWhy does ACF have electrons do its work?A TV Guide for Netheads5815
Luke Van De WegheTheComputer Science: Going Outside78-5
Sam BraunfeldfooCarnegie Lemons9910
Liam KusalikI Paused My Unique Game to Be HereI thought this was a Counter-Strike themed tournament10010
Kenny ZhangJAX guide -league -of -legends -lol -mortal -kombatEventually Munches All Computer Storage12010
Anish JindalComputer Science: Going OutsideThe13810