Stack-based - Factbites

Stack-based - Factbites
Where results make sense
About us | Why use us? | Reviews | PR | Contact us

Topic: Stack-based

Note: these results are not from the primary (high quality) database.

In the News (Fri 25 Dec 09)

Northern Trust

Marvin Harrison

Peter Chernin

Gary Locke

Match Play

Penelope Cruz

Mickey Rourke

AR Rahman

Danny Boyle

Hugh Jackman

	Stack (computing) - Wikipedia, the free encyclopedia
		The use of a return stack is extremely commonplace, but the somewhat unusual use of an argument stack for a human-readable programming language is the reason Forth is referred to as a stack-based language.
		A stack-based computer system is one that is based on the use of stacks, rather than being register based.
		Stacks are either visualised growing from the bottom up (like real-world stacks, see image, or, with the top of the stack in a fixed position, a coin holder [1]) or growing from left to right, so that "topmost" becomes "rightmost".
	en.wikipedia.org /wiki/Stack_(computing) (787 words)

	Encyclopedia: Stack-based
		Since the stack is the key means of data manipulation in a stack-oriented programming language, often these languages provide some sort of stack manipulation operators.
		A stack oriented programming language behaves by operations upon one or many stacks, which may serve different purposes.
		stack: 4 dup stack: 4 4 dup stack: 4 4 4 1 eq stack: false 4 4 exch stack: 4 false 4 0 eq stack: false false 4 or stack: false 4 not stack: true 4
	www.nationmaster.com /encyclopedia/Stack_based (1581 words)

	World Intellectual Property Organization
		A stack processor for processing data as recited in claim 14, wherein the output multiplexer is located proximately to the operand stack the arithmetic logic unit.
		A stack processor for processing data as recited in claim 10, wherein the operand stack is divided into a plurality of banks, with each of the plurality of banks having a 32 bit word width.
		A method for processing data through a stack processor as recited in claim 1, wherein the operand stack is divided into a plurality of banks, and each of the plurality of banks having a 32 bit word width.
	www.wipo.int /ipdl/IPDL-CIMAGES/view/pct/getbykey5?KEY=01/84305.011108&ELEMENT_SET=DECL (4412 words)

	Stack Computers: Appendix A -- A Survey of Computers with Hardware Stack Support
		The R65F11, based on the 6502 processor, and the F68K processor, based on the 68200 microcontroller of the 68000 processor family, are general purpose microcontrollers that come with preprogrammed Forth primitives.
		While the stack implementation was not specified, Mesa follows the general pattern of machines with a small stack buffer and the bulk of the stack in program memory.
		However, since the C language uses stacks to allocate storage for local parameters, most of the operand data references are to memory locations relative to a stack pointer register.
	www.ece.cmu.edu /~koopman/stack_computers/appa.html (6275 words)

	Stack-Based Typed Assembly Language
		However, most compilers are based on stack allocation.
		This paper presents STAL, an extension of TAL with stack constructs and stack types to support the stack allocation style.
		TAL is sufficiently expressive to serve as a target language for compilers of high-level languages such as ML.
	www.cs.cornell.edu /talc/papers/stal-tic-abstract.html (144 words)

	message_view-2.aspx?thread_id=9491
		Verifying the safety of stack based code is much easier than verifying register based code, primarily because you know exactly where your arguments are coming from and what their types might be during static analysis.
		Instead of having the stack like code,can't we have the intermediate language itself to be of type quads so that some time is conserved converting from stack based code to quads.
		The stack is used so that the MSIL is independent of any intel or motorolla etx system...if you use registers the size of them vary from each intel and motorolla but if u use stack they are all provided for.....I got this info first hand today from a PM at the CLR.
	www.devhood.com /messages/message_view-2.aspx?thread_id=9491 (1287 words)

	CUV Limitations
		In general, CUV does not track or validate data structures that are located on the stack, because stack-based variables are valid only within the scope of the current function.
		However, due to the way Windows manages stacks in deferred procedure calls (DPCs) and interrupt service routines (ISRs), CUV might incorrectly identify stack-based variables used by these routines as not being on the stack.
		CUV does not consider the stack to be a valid storage location for structures that must reside in nonpaged memory.
	www.osronline.com /ddkx/ddtools/cuv_2dmb.htm (385 words)

	Stack Machine
		The advantage of a stack based instruction set architecture on a Von Neumann machine is that the instruction size decreases, since there is no need to specify operand addresses.
		In the latter case, the two stacks are usually the data stack and the return stack, the former being used for operations on data and the latter for procedure calls.
		Thus, stack machines are either restricted doing simple computations (such as arithmetic calculations in postfix notation) or must have two stacks.
	www.wikiverse.org /stack-machine (590 words)

	htce.txt
		Stack based are relatively simple in terms of concept, these include functions such as: strcat(), sprint(), strcpy(), gets(), etc. - anywhere where unchecked variables are placed into a buffer of fixed length.
		Unlike the stack, the heap grows upwards on most systems; that is, new variables created on the heap are located at higher memory addresses than older ones.
		A value that is PUSH'ed on to the stack is copied into the memory location (exact reference) and is pointed to as execution occurs by the stack pointer (sp).
	www.groar.org /expl/beginner/htce.txt (1082 words)

	www.phrack.org
		The stack is also used to dynamically allocate the local variables used in functions, to pass parameters to the functions, and to return values from the function.
		In addition to the stack pointer, which points to the top of the stack (lowest numerical address), it is often convenient to have a frame pointer (FP) which points to a fixed location within a frame.
		Variants include trash the stack, scribble the stack, mangle the stack; the term mung the stack is not used, as this is never done intentionally.
	www.phrack.org /show.php?p=49&a=14 (4277 words)

	A Construtivist Stack-Based Learning Environment
		The main advantage of using a stack of numbers is that the concept of stack is present in concrete situations.
		The other element (that differentiates AABC from LOGO) is the stack of numbers used in place of the notion of memory cells, assignment and parameter passing.
		In a similar way, the first element popped from the stack must be the element on the top.
	www.inf.ufsc.br /~raul/publica/singapur.htm (398 words)

	Functions and storage organisation - The Stack
		Static and extern storage class variables are not stack based.
		The stack frame will include the return address from the function, the machine state on entry to the function, copies of the actual parameters and space for all the function's local variables.
		Each time a function is called a stack frame is built and when the function exits the stack frame is released.
	www.scit.wlv.ac.uk /cbook/chap7.stack.html (243 words)

	Citations: Implementation of Stack-Based Languages on Register Machines - Ertl (ResearchIndex)
		Translating the stack operations to native code is done by translating the operations back to expressions represented as directed acyclic graphs as an intermediate step.
		The problems of compiling a stack oriented abstract machine code to native code are well known from the programming language Forth.
		....a stack machine called Dcode [8] Dcode was influenced by Pascal P code.
	citeseer.ist.psu.edu /context/888866/21389 (163 words)

	Stack Configuration
		3/ Equalize Stack based on Current Layer allows the full stack to be processed based on the pixel data of the current image.
		The dynamic range of each image in the stack is the basis for processing that layer.
		An example would be if you use Auto Equalize processing function (see AutoEqualize) with Full stack processing enabled, all of the images in the stack would be equalized, otherwise only the current layer is equalized.
	www.empix.com /NE%20HELP/functions/stack_config.htm (214 words)

	Stack Computers & Forth
		Performance of the Harris RTX 2000 stack architecture versus the Sun 4 Sparc and the Sun 3 M68020 architectures, June 1992.
		Real-Time Performance of the Harris RTX 2000 Stack Architecture versus the Sun 4 SPARC and the Sun 3 M68020 Architectures with a Proposed Real-Time Performance Benchmark, May 1992.
		Yuen Chung Kwong's ideas on stack computer architecture; the second paper discusses superscalar stack computer techniques using a reorder buffer.
	www.ece.cmu.edu /~koopman/stack.html (305 words)

	w00w00-heap-overflows.txt
		With the stack method, the advantage is that we can do whatever we want, and we don't require compatible function pointers (i.e., char (funcptr)(int a) and void (funcptr)() would work the same).
		An attack that can beat Solar Designer's non-executable stack, but is caught by StackGuard, is to use two buffers: inject the attack code into the heap or static data areas, and use a classic stack smash to point the return address at the heap or static buffer.
		The classic stack smash uses a single buffer, overflows it to corrupt the adjacent activation record, and simultaneously injects the attack code.
	packetstormsecurity.nl /docs/infosec/buffer-overflows/w00w00-heap-overflows.txt (4942 words)

	The Caml Virtual Machine
		A stack-based virtual machine is made of a program (a list of instructions) and a stack which holds values.
		This a-stack behaves like an ordinary stack, however the first element of the stack (on top) is held in the accumulator, and the other elements are kept in a real stack
		Stack and a-stack of the CVM (Caml Virtual Machine).
	pauillac.inria.fr /~lebotlan/docaml_html/english/english003.html (1468 words)

	PX3230S Protocol Stack
		This stack is also an implementation of the H.323 standard and is similar in features to the EX3230S embedded stack.
		This implementation is unique, in that it provides the application developer two different multi-threaded architectures: (1) a pool-based architecture for a programmable number of threads per connection, or (2) a connection-based architecture for a single thread per connection architecture.
		This stack consists of an object oriented, highly flexible, high-level API written in the "C++" programming language.
	www.agoralabs.com /pPx3230s.html (165 words)

	Lambda-superposition of Stack Languages (ResearchIndex)
		This is one alternative method to de ne the syntax of a stack based language, the...
		Abstract: There exists a class of widespread languages that use stack machines for interpretation of programs, the so called stack based languages (Java virtual machine language, Forth, Postscript, several intermediate program representation languages and low level languages in some embedded systems).
		Semantics of stack operations determines the language of correct programs in sense of parameter passing through the stack.
	citeseer.ist.psu.edu /620770.html (338 words)

	Bug Check 0xF7: DRIVER_OVERRAN_STACK_BUFFER
		The last routine on the stack before the buffer overrun handlers and bug check call is the one that overran its local variable.
		Use the KB (Display Stack Backtrace) debugger command to get a stack trace.
		The system has been brought down to prevent a malicious user from gaining complete control of it.
	www.osronline.com /ddkx/ddtools/bccodes_8ko7.htm (111 words)

	2002-July.txt
		Stack based register allocation would trivially assign three registers to that expression (one for each of the adds and the mul).
		One reason for this is that the stack manipulation in the bytecode has lots of implicit information in it (e.g., lifetimes) that would be missing in register-based code.
		As I see it, optimizing a stack machine is effectively equivalent to optimizing an AST based representation, which is possible, but very painful.
	lists.tunes.org /archives/virtmach/2002-July.txt (4409 words)

	SecuriTeam.com ™ - Defeating the Stack Based Buffer Overflow Prevention Mechanism of Microsoft Windows 2003 Server
		As part of the security in depth model adopted by Microsoft for their latest Windows version a new stack protection mechanism was incorporated into their compiler that was intended to help mitigate the risk posed by stack based buffer overflow vulnerabilities by attempting to prevent their exploitation.
		Acknowledging that there have been holes found and that, yes, more will come to light in the future this paper is going to look at how, currently, the stack based protection built into Windows 2003 Server to protect against buffer overflow vulnerability exploitation can be bypassed.
		Other methods of defeating stack protection are available, but these are dependent upon the code of the vulnerable function and involve overwriting the parameters passed to the function.
	www.securiteam.com /securityreviews/5IP0J15B5Y.html (663 words)

	Stack-Based Approach
		The idea of the Stack-Based Approach to query languages is that some query operators (called non-algebraic) act on ES in a way similar to invocations of program blocks.
		The last added stack section is the first visited during binding, and objects from some sections remain invisible for the binding (for so-called lexical scoping).
		The stack is responsible for the scope control and binding names occurring in a program.
	www.ipipan.waw.pl /~jpl/sba/sba.html (1016 words)

	The name_stack Class
		is a stack based string class used to build names during elaboration.
		New name parts may be stored on top of the stack via a push operation.
		With a subsequent pop operation the last stored name is removed from the stack.
	www.freehdl.seul.org /code/node8.html (78 words)

	Sense of Wonder The demise of stack based buffer overflow exploits?
		This and the.NET platform will deter hackers to exploit stack based buffer overflows but, without quantitative data of the number and percentage of these exploits over time, which I’ve been unable to find and I'm almost sure that it doesn't exist, nothing will be learned from the impact of these security technologies.
		Some argue that all the previous protections deplete resources and can easily be bypassed("Defeating the Stack Based Buffer Overflow Prevention Mechanism of Microsoft Windows 2003 Server", "Bypassing StackGuard and StackShield"), but the real goal is to prevent the exploitation with cutandpaste shellcodes and make it harder to exploit stack based buffer overflows.
		Thu 12-02-2004 09:14 PM The demise of stack based buffer overflow exploits?
	www.cerezo.name /archives/000015.html (233 words)

	Stack-based offenses
		Stack sets up on the sidelines, half on one side and half on the other.
		To accomplish this, the stack takes a few steps over to the break side, creating more space on the open side for the cutter.
		A lot of times, the play is thrower-initiated rather than cutter-initiated, meaning that the thrower sometimes puts up a throw and anticipates that the cutter will be able to chase it down before his defender can react.
	www.math.harvard.edu /~lee/offense.html (254 words)

	(WO 01/84305) PROCESSOR ARCHITECTURE HAVING AN ALU, A JAVA STACK AND MULTIPLE SATCKPOINTERS
		The selected data is transferred from the operand stack to an arithmetic logic unit for processing in accordance with instructions defined by the function code.
		The location of the data within the operand stack is identified using stackpointers that are contained in a stack/ALU controller of the stack processor.
		After the location of the data is identified, a parallel transfer of data selected using the stackpointers and a function code is generated.
	wipo.int /ipdl/IPDL-CIMAGES/view/pct/getbykey5?KEY=01/84305.011108&... (298 words)

	SA National Bioinformatics Institute
		The STACK project aims to generate a comprehensive representation of the sequence of each of the expressed genes in the human genome by extensive processing of gene fragments to make accurate alignments, highlight diversity and provide a carefully joined set of consensus sequences for each gene.
		The STACK project is comprised of the STACKdb
	www.sanbi.ac.za /Dbases.html (402 words)

	L-C Based Tone Stack
		It describes an L-C based tone stack, and illustrates the use of sub-minature "hearing aid" type tubes.
		The tone stack has bass mid and treble controls, the mid control provides true boost and cut of mid frequencies and additionally has a selector switch to change the center of the mid control from 440Hz to 262Hz.
		Of course, you may wish to experiment with the sub-minature tubes without using the tone stack or experiment with the tone stack without using the sub-minature tubes.
	members.aol.com /sbench101/BatteryPoweredAmps/tonestac.html (794 words)

	Windows 2003 Server Buffer Overflow Protection Mechanism Bypass
		The problem is that it is possible to cause stack based buffer overflows without overwriting the canary or cookie placed on the stack to detect possible exploitation.
		A security issue has been identified in Windows 2003 Server, which can be exploited to bypass the security mechanism included for detecting and protecting against exploitation of stack based buffer overflows.
		Don't rely solely on the protection mechanism to prevent exploitation of stack based buffer overflows.
	www.secunia.com /advisories/9720/print (121 words)

Try your search on: Qwika (all wikis)

Topic: Stack-based

Ads by Google

In the News (Fri 25 Dec 09)