Sciweavers

Share
NFM
2011
252views Formal Methods» more  NFM 2011»
8 years 2 months ago
Call Invariants
Program verifiers based on first-order theorem provers model the program heap as a collection of mutable maps. In such verifiers, preserving unmodified facts about the heap acr...
Shuvendu K. Lahiri, Shaz Qadeer
AIPS
2010
8 years 9 months ago
Shopper: A System for Executing and Simulating Expressive Plans
We present Shopper, a plan execution engine that facilitates experimental evaluation of plans and makes it easier for planning researchers to incorporate replanning. Shopper inter...
Robert P. Goldman, John Maraist
SC
1991
ACM
8 years 10 months ago
Interprocedural transformations for parallel code generation
We present a new approach that enables compiler optimization of procedure calls and loop nests containing procedure calls. We introduce two interprocedural transformationsthat mov...
Mary W. Hall, Ken Kennedy, Kathryn S. McKinley
MICRO
1997
IEEE
127views Hardware» more  MICRO 1997»
8 years 11 months ago
Exploiting Dead Value Information
We describe Dead Value Information (DVI) and introduce three new optimizations which exploit it. DVI provides assertions that certain register values are dead, meaning they will n...
Milo M. K. Martin, Amir Roth, Charles N. Fischer
POPL
2006
ACM
9 years 7 months ago
A fixpoint calculus for local and global program flows
We define a new fixpoint modal logic, the visibly pushdown ?-calculus (VP-?), as an extension of the modal ?-calculus. The models of this logic are execution trees of structured p...
Rajeev Alur, Swarat Chaudhuri, P. Madhusudan
books