Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 234,329,401 papers from all fields of science
Search
Sign In
Create Free Account
Stack (abstract data type)
Known as:
Stack (programming)
, Pushing and popping
, Push and pop
Expand
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
50 relations
AMD Am29000
Abstract data type
Array data structure
Association list
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2011
2011
First-Order Model Checking on Generalisations of Pushdown Graphs
Alexander Kartzow
arXiv.org
2011
Corpus ID: 19615184
We study the first-order model checking problem on two generalisations of pushdown graphs. The first class is the class of nested…
Expand
2006
2006
Determining Maximum Stack Usage in Preemptive Shared Stack Systems
Kaj Hänninen
,
Jukka Mäki-Turja
,
M. Bohlin
,
Jan Carlson
,
Mikael Nolin
IEEE Real-Time Systems Symposium
2006
Corpus ID: 12338227
This paper presents a novel method to determine the maximum stack memory used in preemptive, shared stack, real-time systems. We…
Expand
2001
2001
Pushdown Automaton with the Ability to Flip its Stack
P. Sarkar
Electron. Colloquium Comput. Complex.
2001
Corpus ID: 41469463
Review
1994
Review
1994
Specifying and Testing Software Components using ADL
R. Hayes
,
S. Sankar
1994
Corpus ID: 16317461
This paper presents a novel approach to unit testing of software components. This approach uses the specification language ADL…
Expand
1993
1993
Code generation for the attribute evaluator of the protocol engine grammar processor unit
Rhj Rudi Bloks
1993
Corpus ID: 60457661
report is one of the results of the protocol engine research project, which is targeted towards the automatic generation of…
Expand
1988
1988
Using Prolog to present abstract machines
D. Crookes
SGCS
1988
Corpus ID: 14791373
Introductory courses in Theory of Computation usually include a study of abstract machines such as finite state machines and…
Expand
Highly Cited
1982
Highly Cited
1982
Scheduling of Parallel Computation for a Computer-Controlled Mechanical Manipulator
J. Luh
,
C. Lin
IEEE Transactions on Systems, Man and Cybernetics
1982
Corpus ID: 206788468
The physical compactness of the microcomputer has made it feasible to mount the controller and the mechanical manipulator…
Expand
1976
1976
Storage Management Operations in Linked Uniform Shift Register Loops
T. C. Chen
,
C. Tung
IBM Journal of Research and Development
1976
Corpus ID: 9745528
A new storage structure, called a uniform ladder, consists of a linear array of equal shift-register loops, each holding one…
Expand
1972
1972
Program Schemes with Pushdown Stores
Steven Brown
,
D. Gries
,
T. G. Szymanski
SIAM journal on computing (Print)
1972
Corpus ID: 30616660
We attempt to characterize classes of schemes allowing pushdown stores, building on an earlier work by Constable and Gries [1…
Expand
1971
1971
High Level Languages of Maximum Power
H. Strong
Scandinavian Workshop on Algorithm Theory
1971
Corpus ID: 39751540
The high level languages here are simplified programming languages focussing attention on various facilities such as recursion…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE