Skip to search formSkip to main contentSkip to account menu

Stack (abstract data type)

Known as: Stack (programming), Pushing and popping, Push and pop 
In computer science, a stack is an abstract data type that serves as a collection of elements, with two principal operations: push, which adds an… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2011
2011
We study the first-order model checking problem on two generalisations of pushdown graphs. The first class is the class of nested… 
2006
2006
This paper presents a novel method to determine the maximum stack memory used in preemptive, shared stack, real-time systems. We… 
2004
2004
The XML community generally takes trees and hedges as the model for XML document instances and element content. In contrast… 
2001
2001
  • P. Sarkar
  • 2001
  • Corpus ID: 41469463
Review
1994
Review
1994
This paper presents a novel approach to unit testing of software components. This approach uses the specification language ADL… 
1978
1978
An approach to automating the selection of implementations for the data representations used in a program is presented… 
1972
1972
We attempt to characterize classes of schemes allowing pushdown stores, building on an earlier work by Constable and Gries [1… 
1971
1971
The high level languages here are simplified programming languages focussing attention on various facilities such as recursion… 
1968
1968
The model of an online multitape Turing machine is generalized by adding a bounded number of repositioning operations to the…