Searching for authors named Christopher Colby – sorted by Relevance.
-
Analysis of Synchronization and Aliasing with Abstract Interpretation
- We present a framework for the automatic determination of synchronization and aliasing properties of a functional language extended with concurrency constructs (a subset of Concurrent ML). Synchronization properties state which processes, and at what process histories, may be simultaneously active d
- Cited by 5 (3 self) – Add To MetaCart
-
Determining Storage Properties of Sequential and Concurrent Programs with Assignment and Structured Data
- . Determination of storage properties (e.g., aliasing, def-use chains, liveness, etc.) is one of the primary concerns in the implementation of any programming language. We present a new semantic framework and analysis basedon operational traces that subsumes and improves upon most existing work in t
- Cited by 4 (2 self) – Add To MetaCart
-
Symbolic Safety Analysis of Memory Accesses Within Loops
- One of the biggest challenges in operating systems, distributed systems, and mobile code is how to ensure safety of untrusted code. Two recent proposals are Software Fault Isolation (SFI) and Proof-Carrying Code (PCC). A difficult challenge is how to deal with memory accesses within loops. SFI gener
- Add To MetaCart
-
Analyzing the Communication Topology of Concurrent Programs
- Concurrent languages present complex problems for program analysis. Existing analyses are either imprecise, exponential, or apply only to languages with statically-allocated processes and channels. We present a new polynomial-time analysis using abstract interpretation that addresses the general pro
- Cited by 23 (4 self) – Add To MetaCart
-
A Modular Implementation of Partial Evaluation
- Charles Consel and Siau Cheng Khoo have developed a technique for parameterizing partial evaluation and binding-time analysis with respect to abstract domains [5]. We have found the modules system of Standard ML [12, 15] to be a useful vehicle for implementing a similar parameterization technique. F
- Cited by 3 (0 self) – Add To MetaCart
-
Semantics-based Program Analysis via Symbolic Composition of Transfer Relations
- The goal of program analysis is to determine automatically properties of the run-time behavior of a program. Tools of software development, such as compilers, program-verification systems, and program-comprehension systems, are in large part based on program analyses. Most semantics-based program an
- Cited by 5 (2 self) – Add To MetaCart
-
Trace-based Program Analysis
- We present trace-based program analysis, a semantics-based framework for statically analyzing and transforming programs with loops, assignments, and nested record structures. Trace-based analyses are based on transfer transition systems, which define the small-step operational semantics of programmi
- Cited by 16 (0 self) – Add To MetaCart
-
Interaction, Concurrency, and OOP in the Curriculum: a Sophomore Course
- We argue that a computer-science curriculum should introduce the principles of concurrent programming in an integrated, coherent, and application-independent fashion early in the major. We have incorporated current research into our curriculum. We describe a sophomore-level course on the fundamental
- Cited by 1 (1 self) – Add To MetaCart
-
Automatically Closing Open Reactive Programs
- We study in this paper the problem of analyzing implementations of open systems --- systems in which only some of the components are present. We present an algorithm for automatically closing an open concurrent reactive system with its most general environment, i.e., the environment that can provide
- Add To MetaCart
-
A Proof-Carrying Code Architecture for Java
- this paper we describe a PCC architecture comprising two tools:
- Cited by 7 (0 self) – Add To MetaCart

