Sciweavers

173 search results - page 11 / 35
» Interprocedural analysis of asynchronous programs
Sort
View
101
Voted
APLAS
2010
ACM
14 years 8 months ago
Concurrency Can't Be Observed, Asynchronously
Abstract. The paper is devoted to an analysis of the concurrent features of asynchronous systems. A preliminary step is represented by the
Paolo Baldan, Filippo Bonchi, Fabio Gadducci, Giac...
CORR
2010
Springer
139views Education» more  CORR 2010»
14 years 11 months ago
Pushdown Control-Flow Analysis of Higher-Order Programs
Context-free approaches to static analysis gain precision over classical approaches by perfectly matching returns to call sites-a property that eliminates spurious interprocedural...
Christopher Earl, Matthew Might, David Van Horn
CC
2000
Springer
135views System Software» more  CC 2000»
15 years 4 months ago
Fast Escape Analysis and Stack Allocation for Object-Based Programs
A fast and scalable interprocedural escape analysis algorithm is presented. The analysis computes a description of a subset of created objects whose lifetime is bounded by the life...
David Gay, Bjarne Steensgaard
81
Voted
FSTTCS
2007
Springer
15 years 5 months ago
Program Analysis Using Weighted Pushdown Systems
Abstract. Pushdown systems (PDSs) are an automata-theoretic formalism for specifying a class of infinite-state transition systems. Infiniteness comes from the fact that each con...
Thomas W. Reps, Akash Lal, Nicholas Kidd
JSA
2006
131views more  JSA 2006»
14 years 11 months ago
Bidirectional liveness analysis, or how less than half of the Alpha's registers are used
Interprocedural data flow analyses of executable programs suffer from the conservative assumptions that need to be made because no precise control flow graph is available and beca...
Bjorn De Sutter, Bruno De Bus, Koen De Bosschere