Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
The Logical Approach to Stack Typing Amal Ahmed David Walker
 

Summary: The Logical Approach to Stack Typing
Amal Ahmed David Walker
Department of Computer Science, Princeton University
35 Olden Street, Princeton, NJ 08544
{amal,dpw}@cs.princeton.edu
ABSTRACT
We develop a logic for reasoning about adjacency and sepa-
ration of memory blocks, as well as aliasing of pointers. We
provide a memory model for our logic and present a sound
set of natural deduction-style inference rules. We deploy
the logic in a simple type system for a stack-based assembly
language. The connectives for the logic provide a flexible
yet concise mechanism for controlling allocation, dealloca-
tion and access to both heap-allocated and stack-allocated
data.
Categories and Subject Descriptors
D.3.1 [Programming Languages]: Formal Definitions and
Theory; F.3.1 [Logics and Meanings of Programs]: Spec-
ifying and Reasoning about Programs; F.3.2 [Logics and
Meanings of Programs]: Semantics of Programming Lan-

  

Source: Ahmed, Amal - School of Informatics, Indiana University
Princeton University, Department of Computer Science, Secure Internet Programming,
Walker, David - Department of Computer Science, Princeton University

 

Collections: Computer Technologies and Information Sciences