View source for Locks-and-keys (computing)

'''Locks-and-keys''' is a solution to [[dangling pointer]]s in computer [[programming language]]s.

The locks-and-keys approach represents pointers as ordered pairs (key, address) where the key is an integer value. Heap-dynamic variables are represented as the storage for the variable plus a cell for an integer lock value. When a variable is allocated, a ''lock value'' is created and placed both into the variable's cell and into the pointer's key cell. Every access to the pointer compares these two values, and access is allowed only if the values match.

When a variable is deallocated, the key of its pointer is modified to hold a value different from the variable's cell. From then on, any attempt to dereference the pointer can be flagged as an error. Since copying a pointer also copies its cell value, changing the key of the ordered pair safely disables all copies of the pointer.<ref>{{cite book|last1=Sebesta|first1=Robert|title=Concepts of Programming Languages|date=2012|publisher=Pearson|isbn=978-0-13-139531-2|page=298|edition=10th}}</ref>

==See also==
* [[Tombstone (programming)]]
* [[Pointer_(computer_programming)#Multiple_indirection|Multiple indirection]]

==References==
{{reflist}}

{{DEFAULTSORT:Locks-And-Keys}}
[[Category:Computer programming]]


{{Compu-lang-stub}}