A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Filters
Evaluating Call-By-Need on the Control Stack
[article]
2010
arXiv
pre-print
Preserved Fulltext
Ariola and Felleisen's call-by-need λ-calculus replaces a variable occurrence with its value at the last possible moment. ...
In particular, the machine uses the static address of a variable occurrence to extract its current value from the dynamic control stack. ...
Thanks to the anonymous reviewers for their feedback and to Daniel Brown for inspiring discussions. ...
arXiv:1009.3174v1
fatcat:p67cxyag2bhpjjc2vw5y4kkrhy
Evaluating Call-by-Need on the Control Stack
[chapter]
2011
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2010; you can also visit the original URL.
The file type is application/pdf.
Ariola and Felleisen's call-by-need λ-calculus replaces a variable occurrence with its value at the last possible moment. ...
In particular, the machine uses the static address of a variable occurrence to extract its current value from the dynamic control stack . ...
Thanks to the anonymous reviewers for their feedback and to Daniel Brown for inspiring discussions. ...
doi:10.1007/978-3-642-22941-1_1
fatcat:pj7rkyxk45c5xanbdlpy4zafhi
KRGuard: Kernel Rootkits Detection Method by Monitoring Branches Using Hardware Features
2016
2016 International Conference on Information Science and Security (ICISS)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
Since many kernel rootkits make branches that differ from the usual branches in the kernel space, KRGuard can detect these differences by using hardware features of commodity processors. ...
Attacks on an operating system kernel using kernel rootkits pose a particularly serious threat. Detecting an attack is difficult when the operating system kernel is infected with a kernel rootkit. ...
On the other hand, when a computer system is infected with kernel rootkits, the control moves from the system call handler to the malicious code prepared by the attacker before moving to each system call ...
doi:10.1109/icissec.2016.7885860
fatcat:ncbu7yrwufedllhckes22upiz4
Stackless programming in Miller
2013
Acta Universitatis Sapientiae: Informatica
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
The classical technique for fixing such stack-overflows is to write programs in stackless programming style using tail recursive calls; the method is usually realised by Continuation Passing Style. ...
In case of intensive recursive calls this is the reason of the frequent occurrences of the stack-overflow error messages. ...
We would like to thank the support of Ericsson Hungary and the grant EIT-KIC 12-1-2012-0001 that is supported by the Hungarian Government, managed by the National Development Agency, and financed by the ...
doi:10.2478/ausi-2014-0009
fatcat:gmth4tnuozhrncgfkzwm574bmu
A Rational Deconstruction of Landin's SECD Machine
[chapter]
2005
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2004; you can also visit the original URL.
The file type is application/pdf.
data stack of intermediate results, and a control delimiter. ...
Each of the components of the SECD machine (stack, environment, control, and dump) is therefore rationalized and so are its transitions. ...
Acknowledgments The rational deconstruction presented here arose because of a discussion with Mayer Goldberg in July 2002, at the occasion of our joint work on compilation and decompilation [3] . ...
doi:10.1007/11431664_4
fatcat:5pm6mgbdsbdunlypm4aneygeoa
A Principled Approach for ROP Defense
2015
Proceedings of the 31st Annual Computer Security Applications Conference on - ACSAC 2015
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit the original URL.
The file type is application/pdf.
Several defense mechanisms have been proposed to counter ROP by enforcing policies on the targets of return instructions, and/or their frequency. ...
On SPEC 2006 benchmark program, it adds just 4% overhead above the base overhead of 13% imposed by PSI, the platform used in our implementation. * This work was completed when he was at Stony Brook University ...
This is because, (a) fake return addresses need to be prepared on stack so that control flow can be repeatedly redirected in the manner chosen by the attacker, and (b) the stack supplies the data used ...
doi:10.1145/2818000.2818021
dblp:conf/acsac/QiaoZS15
fatcat:3frefhwfabgurdttmxdoiqsvee
Kernel Rootkits Detection Method by Monitoring Branches Using Hardware Features
2017
IEICE transactions on information and systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
Our evaluation shows that KRGuard can detect kernel rootkits that involve new branches in the system call handler processing with small overhead. key words: kernel rootkit detection, last branch record ...
Since many kernel rootkits make branches that differ from the usual branches in the kernel space, KRGuard can detect these differences by using the hardware features of commodity processors. ...
On the other hand, when a computer system is infected with kernel rootkits, the control moves from the system call handler to the malicious code prepared by the attacker before moving to each system call ...
doi:10.1587/transinf.2016inl0003
fatcat:vwvovpa4vzf67hv63x7qbcjaga
Efficient organization of control structures in distributed implementations
[chapter]
1994
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
element, are stored in an interleaved manner on a single physical stack (within each processor element), called the meshed stack. ...
Instead of storing the runtime stacks of parallel processes as ]inked lists of activation blocks in a heap structure, the local stacks of several parnile] processes, which are executed on the same processor ...
Such calls lead to the allocation of control information (activation blocks) on top of the stack. ...
doi:10.1007/3-540-57877-3_7
fatcat:zwbemahg7jgxzcy47vsqd3z7f4
Final shift for call/cc:
2002
Proceedings of the seventh ACM SIGPLAN international conference on Functional programming - ICFP '02
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2006; you can also visit the original URL.
The file type is application/pdf.
We present a direct implementation of the shift and reset control operators in the Scheme 48 system. ...
The new implementation improves upon the traditional technique of simulating shift and reset via call/cc. ...
Richard Kelsey always kept us supplied with the latest development releases of Scheme 48. ...
doi:10.1145/581478.581504
dblp:conf/icfp/GasbichlerS02
fatcat:yz5xdfdrqzetrjf5epchdzg6ae
Final shift for call/cc:
2002
SIGPLAN notices
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2006; you can also visit the original URL.
The file type is application/pdf.
We present a direct implementation of the shift and reset control operators in the Scheme 48 system. ...
The new implementation improves upon the traditional technique of simulating shift and reset via call/cc. ...
Richard Kelsey always kept us supplied with the latest development releases of Scheme 48. ...
doi:10.1145/583852.581504
fatcat:tvpf5d2ekjetdpatia7nghtdwy
There Is Safety in Numbers: Preventing Control-Flow Hijacking by Duplication
[chapter]
2012
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit the original URL.
The file type is application/pdf.
First, we use the duplication of functions to eliminate the need of return addresses and thus provide complete protection against attacks targeting a function's return address. ...
The problem with existing solutions is that they either provide incomplete probabilistic protection (e.g., stack canaries) or impose a high runtime overhead (e.g., bounds checking). ...
This research was done with the financial support from the Prevention against Crime Programme of the European Union, the IBBT, the IWT, the Research Fund KU Leuven, and the EU-funded FP7 project NESSoS ...
doi:10.1007/978-3-642-34210-3_8
fatcat:aw4e24rf4vhqleghcxybsqnpzy
Stack-Summarizing Control-Flow Analysis of Higher-Order Programs
[article]
2010
arXiv
pre-print
Preserved Fulltext
The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf.
collection needs to see the entire stack during a collection. ...
To make the direct product computable, we develop "stack summaries," a method for tracking stack properties at each control state in a pushdown analysis of higher-order programs. ...
The first rule handles tail calls by evaluating the function into a closure, evaluating the argument into a value and then moving to the body of the λ-term within the closure: c = ( ς ([[(f ae)]], ρ, σ ...
arXiv:1009.1560v1
fatcat:yp23cahyavhw7bhk5vctlb352q
A method for detecting obfuscated calls in malicious binaries
2005
IEEE Transactions on Software Engineering
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2006; you can also visit the original URL.
The file type is application/pdf.
Methods for using the abstract stack graph are shown to detect eight different obfuscations. The technique is demonstrated by implementing a prototype tool called DOC (Detector for Obfuscated Calls). ...
These violations can be detected by what is called an abstract stack graph. An abstract stack graph is a concise representation of all potential abstract stacks at every point in a program. ...
This value is pushed on the stack and control is transferred to this kernel function by executing a ret instruction (instruction at 0040156A). ...
doi:10.1109/tse.2005.120
fatcat:v3mvxrquqvcexdzj4gnehtlzda
Partial memoization for obtaining linear time behavior of a 2DPDA
1992
Theoretical Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
The purpose of this note is to show how this result can be obtained by means of a generalization of the well-known concept of memoization. ...
This clever evaluation strategy will be termed partial memoization. ...
Acknowledgment This paper grew out of the authors Master's Thesis, supervised by Neil D. Jones at the University of Copenhagen. ...
doi:10.1016/0304-3975(92)90008-4
fatcat:mqu7ajmttneitbkq2cigyfgos4
The compiler as a validation and evaluation tool
2004
Electronical Notes in Theoretical Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Using Itanium as a specific example, the paper explains why the register stack engine (RSE), the large register file, or control-and data speculation can potentially expose bugs in poorly written or compiled ...
We demonstrate our validation and evaluation techniques on code examples and provide run-time data to indicate the cost of some of our methods. ...
Acknowledgements Thanks to the anonymous software vendors for using our compiler and making us aware of the methods discussed in the paper. ...
doi:10.1016/s1571-0661(05)82602-7
fatcat:kok5mbphhnhcjc6lby65zxu3pa
« Previous
Showing results 1 — 15 out of 242,016 results