Results 301 to 310 of about 1,002,308 (341)
Some of the next articles are maybe not open access.
Journal of Logic, Language and Information, 2000
The development of the dynamic semantics of natural language has put issues of variable control on the agenda of formal semantics. In this paper we regard variables as names for stacks of values and make explicit several control actions as push and pop actions on stacks.
openaire +1 more source
The development of the dynamic semantics of natural language has put issues of variable control on the agenda of formal semantics. In this paper we regard variables as names for stacks of values and make explicit several control actions as push and pop actions on stacks.
openaire +1 more source
IEEE Design & Test of Computers, 2009
The impending doom of CMOS scaling has semiconductor mavericks scrambling for alternative solutions to continue increasing the device density per chip. One serious candidate is 3D integration in which the planar manufacturing technology extends skyward into the third dimension, much like skyscrapers.
openaire +1 more source
The impending doom of CMOS scaling has semiconductor mavericks scrambling for alternative solutions to continue increasing the device density per chip. One serious candidate is 3D integration in which the planar manufacturing technology extends skyward into the third dimension, much like skyscrapers.
openaire +1 more source
2019
A concurrent algorithm exhibits helping when one process performs work on behalf of other processes. More formally, helping is observed when the order of some operation in a linearization is fixed by a step of another process. In this paper, we show that no wait-free linearizable implementation of a stack using read, write, compare&swap and fetch&add ...
Vitaly Aksenov +2 more
openaire +1 more source
A concurrent algorithm exhibits helping when one process performs work on behalf of other processes. More formally, helping is observed when the order of some operation in a linearization is fixed by a step of another process. In this paper, we show that no wait-free linearizable implementation of a stack using read, write, compare&swap and fetch&add ...
Vitaly Aksenov +2 more
openaire +1 more source
Stack Alignment and Stack Frame
2019When your main program calls a function, it will push an 8-byte return address on the stack. That 8-byte address is the address of the instruction to be executed after the function. So, when the function ends, the program execution will find the return address from the stack and continue operation after the function call.
openaire +1 more source
IEEE Transactions on Acoustics, Speech, and Signal Processing, 1986
Peter D. Wendt +2 more
openaire +1 more source
Peter D. Wendt +2 more
openaire +1 more source