16 papers:
CASE-2013-LaLBGYMRP #evaluation- Autonomous robotic system for high-efficiency non-destructive bridge deck inspection and evaluation (HML, RSL, BB, NG, JY, AM, FAR, HP), pp. 1053–1058.
POPL-2012-RamananandroRL #c++ #resource management #semantics- A mechanized semantics for C++ object construction and destruction, with applications to resource management (TR, GDR, XL), pp. 521–532.
PLDI-2010-FlanaganF #detection #memory management- Adversarial memory for detecting destructive races (CF, SNF), pp. 244–254.
KDD-2008-BrickellS #cost analysis #privacy- The cost of privacy: destruction of data-mining utility in anonymized data publishing (JB, VS), pp. 70–78.
LOPSTR-2008-MontenegroPS #algorithm- An Inference Algorithm for Guaranteeing Safe Destruction (MM, RPM, CS), pp. 135–151.
ISSTA-2007-EnglerD #automation #execution #scalability- Under-constrained execution: making automatic code destruction easy and scalable (DRE, DD), pp. 1–4.
ICFP-2003-BiermanHSSW #question- Dynamic rebinding for marshalling and update, with destruct-time? (GMB, MWH, PS, GS, KW), pp. 99–110.
LOPSTR-2001-Shankar #functional #static analysis- Static Analysis for Safe Destructive Updates in a Functional Language (NS), pp. 1–24.
ICPR-v4-2000-MatsumotoOHT #3d #fuzzy #image #logic #testing- Three-Dimensional Image Construction for Non-Destructive Testing Aided by Fuzzy Logic (TM, KO, YH, KT), pp. 4603–4606.
HPCA-2000-PatilE #alias #branch #predict- Combining Static and Dynamic Branch Prediction to Reduce Destructive Aliasing (HP, JSE), pp. 251–262.
POPL-1996-SagivRW #problem- Solving Shape-Analysis Problems in Languages with Destructive Updating (SS, TWR, RW), pp. 16–31.
LFP-1994-SastryC #functional #parallel #strict- Parallel Destructive Updating in Strict Functional Languages (AVSS, WDC), pp. 263–272.
SEKE-1994-MiyakawaY #logic- Temporal logic extended with object creation and destruction (SM, NY), pp. 156–163.
FPCA-1993-SastryCA #analysis #functional #strict- Order-of-evaluation Analysis for Destructive Updates in Strict Functional Languages with Flat Aggregates (AVSS, WDC, ZMA), pp. 266–275.
POPL-1991-Odersky #how- How to Make Destructive Updates Less Destructive (MO), pp. 25–36.
LICS-1986-Mason #equivalence #first-order #lisp #proving #source code- Equivalence of First Order LISP Programs. Proving Properties of Destructive Programs via Transformation (IAM), pp. 105–117.