TOPLAS 2007
45 papers
- A constraint-based approach to guarded algebraic data types
- A deterministic logical semantics for pure Esterel
- A new foundation for control dependence and slicing for modern program structures
- A practical interprocedural dominance algorithm
- A proof theory for machine code
- A provenly correct translation of Fickle into Java
- A static type system for JVM access control
- A step towards unifying schedule and storage optimization
- A type discipline for authorization policies
- A uniform type structure for secure information flow
- Allocating architected registers through differential encoding
- An efficient on-the-fly cycle collection
- An improved bound for call strings based interprocedural analysis of bit vector frameworks
- Analysis of modular arithmetic
- BI-hyperdoctrines, higher-order separation logic, and abstraction
- Combinators for bidirectional tree transformations: A linguistic approach to the view-update problem
- Design, implementation, and evaluation of a compilation server
- Dynamic graph-based software fingerprinting
- Editorial
- Editorial: A changing of the guard
- Efficient dynamic dispatching with type slicing
- Efficient field-sensitive pointer analysis of C
- Empirical study of optimization techniques for massive slicing
- Encapsulating objects with confined types
- Enforcing resource bounds via static verification of dynamic checks
- Fast online pointer analysis
- Forma: A framework for safe automatic array reshaping
- Goal-directed weakening of abstract interpretation results
- Heap reference analysis using access graphs
- Introduction to special ESOP'05 issue
- METRIC: Memory tracing via dynamic binary rewriting to identify cache inefficiencies
- Mutatis Mutandis: Safe and predictable dynamic software updating
- Optimizing indirect branch prediction accuracy in virtual machine interpreters
- PPMexe: Program compression
- Profile-based pretenuring
- Program termination analysis in polynomial time
- Run-time principals in information-flow type systems
- Saturn: A scalable framework for error detection using Boolean satisfiability
- Slicing as a program transformation
- Static validation of XSL transformations
- Termination analysis of logic programs through combination of type-based norms
- The embedded machine: Predictable, portable real-time code
- The trace partitioning abstract domain
- Transition predicate abstraction and fair termination
- Type-based publish/subscribe: Concepts and experiences