Stem safe$ (all stems)

313 papers:

CASE-2015-RanatungaCLP #adaptation #case study

Neuroadaptive control for safe robots in human environments: A case study (IR, SC, FLL, DOP), pp. 322–327.

DATE-2015-HuangKGT #scheduling

Run and be safe: mixed-criticality scheduling with temporary processor speedup (PH, PK, GG, LT), pp. 1329–1334.

PEPM-2015-LiT #concurrent #slicing

Safe Concurrency Introduction through Slicing (HL, SJT), pp. 103–113.

PEPM-2015-LiWXH #adaptation #api #java #named #towards #type safety

SWIN: Towards Type-Safe Java Program Adaptation between APIs (JL, CW, YX, ZH), pp. 91–102.

PLDI-2015-GammieHE #garbage collection #on the fly

Relaxing safely: verified on-the-fly garbage collection for x86-TSO (PG, ALH, KE), pp. 99–109.

CSCW-2015-RinglandWDH

Making “Safe”: Community-Centered Practices in a Virtual World Dedicated to Children with Autism (KER, CTW, LD, GRH), pp. 1788–1800.

HIMI-IKC-2015-KosakaN #behaviour #education

Education Method for Safe Bicycle Riding to Evaluate Actual Cycling Behaviors When Entering an Intersection (HK, MN), pp. 225–232.

AdaEurope-2015-NelissenPP #architecture #monitoring #novel #performance #runtime

A Novel Run-Time Monitoring Architecture for Safe and Efficient Inline Monitoring (GN, DP, LMP), pp. 66–82.

AdaEurope-2015-PerezGTT #clustering #concept #manycore #safety

A Safety Concept for an IEC-61508 Compliant Fail-Safe Wind Power Mixed-Criticality System Based on Multicore and Partitioning (JP, DG, ST, TT), pp. 3–17.

ICML-2015-Bou-AmmarTE #learning #policy #sublinear

Safe Policy Search for Lifelong Reinforcement Learning with Sublinear Regret (HBA, RT, EE), pp. 2361–2369.

ICML-2015-SuiGBK #optimisation #process

Safe Exploration for Optimization with Gaussian Processes (YS, AG, JWB, AK), pp. 997–1005.

ICML-2015-WangY #learning #matrix #multi

Safe Screening for Multi-Task Feature Learning with Multiple Data Matrices (JW, JY), pp. 1747–1756.

ICML-2015-ZhouZ #problem

Safe Subspace Screening for Nuclear Norm Regularized Least Squares Problems (QZ, QZ), pp. 1103–1112.

GPCE-2015-ReyndersDP #api #bound #generative

Generating safe boundary APIs between typed EDSLs and their environments (BR, DD, FP), pp. 31–34.

POPL-2015-RastogiSFBV #performance #type system #typescript

Safe & Efficient Gradual Typing for TypeScript (AR, NS, CF, GMB, PV), pp. 167–180.

ESEC-FSE-2015-BellKMD #dependence #detection #java #performance

Efficient dependency detection for safe Java test acceleration (JB, GEK, EM, MD), pp. 770–781.

ESEC-FSE-2015-ParkEZNH #approximate #composition #named #programming

FlexJava: language support for safe and modular approximate programming (JP, HE, XZ, MN, WH), pp. 745–757.

ICSE-v1-2015-GaoXMZYZXM #c #source code

Safe Memory-Leak Fixing for C Programs (QG, YX, YM, LZ, WY, ZZ, BX, HM), pp. 459–470.

ICSE-v2-2015-Dintzner #evolution #product line

Safe Evolution Patterns for Software Product Lines (ND), pp. 875–878.

SPLC-2015-DudderRH #composition #design #staged #type safety #using

Synthesizing type-safe compositions in feature oriented software designs using staged composition (BD, JR, GTH), pp. 398–401.

SPLC-2015-TeixeiraABG #evolution #product line #reasoning

A product line of theories for reasoning about safe evolution of product lines (LT, VA, PB, RG), pp. 161–170.

SPLC-2015-TeixeiraBG #evolution #multi #product line

Safe evolution of product populations and multi product lines (LT, PB, RG), pp. 171–175.

ASPLOS-2015-ChisnallRWWVMRD #architecture #automaton #c

Beyond the PDP-11: Architectural Support for a Memory-Safe C Abstract Machine (DC, CR, RNMW, JW, MV, SWM, MR, BD, PGN), pp. 117–130.

ASPLOS-2015-MatveevS #hardware #hybrid #memory management #scalability #transaction

Reduced Hardware NOrec: A Safe and Scalable Hybrid Transactional Memory (AM, NS), pp. 59–71.

CC-2015-NgCY #code generation #protocol

Protocols by Default — Safe MPI Code Generation Based on Session Types (NN, JGdFC, NY), pp. 212–232.

HPCA-2015-KimSE #flexibility #memory management #reliability

Bamboo ECC: Strong, safe, and flexible codes for reliable computer memory (JK, MS, ME), pp. 101–112.

ISMM-2015-StancuWBLF #hybrid #java #memory management #performance

Safe and efficient hybrid memory management for Java (CS, CW, SB, PL, MF), pp. 81–92.

ICST-2015-AppeltNB #injection #question #sql

Behind an Application Firewall, Are We Safe from SQL Injection Attacks? (DA, CDN, LCB), pp. 1–10.

CBSE-2014-BuissonCDLM #component #configuration management

Coqcots & pycots: non-stopping components for safe dynamic reconfiguration (JB, EC, FD, EL, SM), pp. 85–90.

CASE-2014-LasotaRS #industrial #interactive #standard #towards

Toward safe close-proximity human-robot interaction with standard industrial robots (PAL, GFR, JAS), pp. 339–344.

DAC-2014-ZalmanM #communication #low cost

A Secure but still Safe and Low Cost Automotive Communication Technique (RZ, AM), p. 5.

DATE-2014-ChenHD #analysis #graph #modelling

May-happen-in-parallel analysis based on segment graphs for safe ESL models (WC, XH, RD), pp. 1–6.

DATE-2014-HanZLD #named #scheduling

SAFE: Security-Aware FlexRay Scheduling Engine (GH, HZ, YL, WD), pp. 1–4.

TACAS-2014-GurfinkelBM #invariant

Synthesizing Safe Bit-Precise Invariants (AG, AB, JMS), pp. 93–108.

PEPM-2014-KerneisSH #continuation #named #performance #static analysis

QEMU/CPC: static analysis and CPS conversion for safe, portable, and efficient coroutines (GK, CS, SH), pp. 83–94.

SEFM-2014-LovatoMS #diagrams #library #thread

A Thread-Safe Library for Binary Decision Diagrams (AL, DM, FS), pp. 35–49.

ICFP-2014-BreitnerEJW #haskell #low cost

Safe zero-cost coercions for Haskell (JB, RAE, SLPJ, SW), pp. 189–202.

ICFP-2014-StansiferW #flexibility #named #programming

Romeo: a system for more flexible binding-safe programming (PS, MW), pp. 53–65.

DHM-2014-IshidaSK

Safe Walker-Shoes That Alert the Wearer to a Danger (MI, HS, TK), pp. 612–619.

AdaEurope-2014-IliasovLR #approach #formal method

Practical Formal Methods in Railways — The SafeCap Approach (AI, IL, AR), pp. 177–192.

HILT-2014-Crocker #c++ #question

Can C++ be made as safe as SPARK? (DC), pp. 5–12.

HILT-2014-TaftMPM #ada #parallel #programming

Safe parallel programming in ada with language extensions (STT, BM, LMP, SM), pp. 87–96.

ICML-c2-2014-LiuZWY

Safe Screening with Variational Inequalities and Its Application to Lasso (JL, ZZ, JW, JY), pp. 289–297.

KDD-2014-ZhaoLC #performance

Safe and efficient screening for sparse support vector machine (ZZ, JL, JC), pp. 542–551.

SIGIR-2014-PetriMC #hybrid

Score-safe term-dependency processing with hybrid indexes (MP, AM, JSC), pp. 899–902.

ECOOP-2014-OmarKNCPA #composition

Safely Composable Type-Specific Languages (CO, DK, LN, BC, AP, JA), pp. 105–130.

PADL-2014-SivaramakrishnanZJ #named

RCML: A Prescription for Safely Relaxing Synchrony (KCS, LZ, SJ), pp. 1–16.

SLE-2014-PredaGLMG #adaptation #distributed #framework #named

AIOCJ: A Choreographic Framework for Safe Adaptive Distributed Applications (MDP, SG, IL, JM, MG), pp. 161–170.

HPCA-2014-PugsleyCWCSJLCB #evaluation #runtime

Sandbox Prefetching: Safe run-time evaluation of aggressive prefetchers (SHP, ZC, CW, PfC, RLS, AJ, SLL, KC, RB), pp. 626–637.

HPCA-2014-ZhaoVZLZ0 #memory management #specification

Over-clocked SSD: Safely running beyond flash memory chip I/O clock specs (KZ, KSV, XZ, JL, NZ, TZ), pp. 536–545.

LICS-CSL-2014-KatoenSZ

Probably safe or live (JPK, LS, LZ), p. 10.

PASTE-2013-DingesCA #automation #concurrent #execution #set

Automated inference of atomic sets for safe concurrent execution (PD, MC, GA), pp. 1–8.

PEPM-2013-CarbinKMR #approximate #program transformation

Verified integrity properties for safe approximate program transformations (MC, DK, SM, MCR), pp. 63–66.

PLDI-2013-DesaiGJQRZ #named #programming

P: safe asynchronous event-driven programming (AD, VG, EKJ, SQ, SKR, DZ), pp. 321–332.

IFL-2013-FowlerB #dependent type #programming #web

Dependent Types for Safe and Secure Web Programming (SF, EB), p. 49.

HCI-UC-2013-FurukawaN #navigation

A Pedestrian Navigation Method for User’s Safe and Easy Wayfinding (HF, YN), pp. 156–165.

HIMI-HSM-2013-HiraokaTK #behaviour #parametricity

Proposal of Non-dimensional Parameter Indices to Evaluate Safe Driving Behavior (TH, ST, HK), pp. 470–479.

HIMI-HSM-2013-KosakaN #behaviour #education

Pilot Experiments in Education for Safe Bicycle Riding to Evaluate Actual Cycling Behaviors When Entering an Intersection (HK, MN), pp. 515–523.

HILT-2013-Taft13a #ada #parallel #programming #set

Bringing safe, dynamic parallel programming to the spark verifiable subset of ada (STT), pp. 37–40.

ICML-c3-2013-OgawaST

Safe Screening of Non-Support Vectors in Pathwise SVM Computation (KO, YS, IT), pp. 1382–1390.

ICML-c3-2013-PirottaRPC #policy

Safe Policy Iteration (MP, MR, AP, DC), pp. 307–315.

ECOOP-2013-ServettoMPN #composition

The Billion-Dollar Fix — Safe Modular Circular Initialisation with Placeholders and Placeholder Types (MS, JM, AP, JN), pp. 205–229.

OOPSLA-2013-DeLozierENOMZ #c++ #set #type safety

Ironclad C++: a library-augmented type-safe subset of c++ (CD, RAE, SN, PMO, MMKM, SZ), pp. 287–304.

ICSE-2013-HosekC #execution #multi

Safe software updates via multi-version execution (PH, CC), pp. 612–621.

SLE-2013-AfroozehBJSV #precedence #specification

Safe Specification of Operator Precedence Rules (AA, MvdB, AJ, ES, JJV), pp. 137–156.

ASPLOS-2013-GiuffridaKT #automation #operating system

Safe and automatic live update for operating systems (CG, AK, AST), pp. 279–292.

PPoPP-2013-HeumannAW #concurrent

The tasks with effects model for safe concurrency (SH, VSA, SW), pp. 239–250.

SOSP-2013-WangZKS #behaviour #towards

Towards optimization-safe systems: analyzing the impact of undefined behavior (XW, NZ, MFK, ASL), pp. 260–275.

CIKM-2012-HuangLTF #keyword #performance #query

Efficient safe-region construction for moving top-K spatial keyword queries (WH, GL, KLT, JF), pp. 932–941.

ICML-2012-MoldovanA #markov #process

Safe Exploration in Markov Decision Processes (TMM, PA), p. 188.

ICMT-2012-GeorgeWS #domain-specific language #model transformation #scala #type safety

Type-Safe Model Transformation Languages as Internal DSLs in Scala (LG, AW, MS), pp. 160–175.

ECOOP-2012-LeeGHM #metaprogramming #named

Marco: Safe, Expressive Macros for Any Language (BL, RG, MH, KSM), pp. 589–613.

OOPSLA-2012-GordonPPBD #parallel

Uniqueness and reference immutability for safe parallelism (CSG, MJP, JP, AB, JD), pp. 21–40.

OOPSLA-2012-SreeramP #compilation #transaction

Safe compiler-driven transaction checkpointing and recovery (JS, SP), pp. 41–56.

OOPSLA-2012-SuenagaFI #concurrent #type system

Type-based safe resource deallocation for shared-memory concurrency (KS, RF, AI), pp. 1–20.

TOOLS-EUROPE-2012-NgYH #optimisation #parallel #programming

Multiparty Session C: Safe Parallel Programming with Message Optimisation (NN, NY, KH), pp. 202–218.

PADL-2012-BradyH #domain-specific language #embedded #programming

Resource-Safe Systems Programming with Embedded Domain Specific Languages (EB, KH), pp. 242–257.

SLE-2012-HillsKV #metalanguage #type safety

Meta-language Support for Type-Safe Access to External Resources (MH, PK, JJV), pp. 372–391.

ASPLOS-2012-CaulfieldMEDCS #performance

Providing safe, user space access to fast, solid state disks (AMC, TIM, LAE, AD, JC, SS), pp. 387–400.

ASPLOS-2012-CheritonFSSA #architecture #data access #named #performance

HICAMP: architectural support for efficient concurrency-safe shared structured data access (DRC, AF, AS, JPS, OA), pp. 287–300.

CC-2012-PetersenG #garbage collection #interprocedural

GC-Safe Interprocedural Unboxing (LP, NG), pp. 165–184.

OSDI-2012-BelayBMTMK #cpu #named

Dune: Safe User-level Access to Privileged CPU Features (AB, AB, AJM, DT, DM, CK), pp. 335–348.

ASE-2011-BotincanDDP #manycore #memory management

Safe asynchronous multicore memory operations (MB, MD, AFD, MJP), pp. 153–162.

SIGMOD-2011-EsmailiSFT #query

Changing flights in mid-air: a model for safely modifying continuous queries (KSE, TS, PMF, NT), pp. 613–624.

FASE-2011-CunhaVAS #evolution #spreadsheet #type safety

Type-Safe Evolution of Spreadsheets (JC, JV, TLA, JS), pp. 186–201.

PEPM-2011-PlasmeijerAKLNG #evolution #runtime #type safety #workflow

iTasks for a change: type-safe run-time change in dynamically evolving workflows (RP, PA, PWMK, BL, TvN, JHGvG), pp. 151–160.

PLDI-2011-SampsonDFGCG #approximate #data type #named #power management

EnerJ: approximate data types for safe and general low-power computation (AS, WD, EF, DG, LC, DG), pp. 164–174.

PLDI-2011-Sevcik #concurrent #optimisation #source code

Safe optimisations for shared-memory concurrent programs (JS), pp. 306–316.

FM-2011-DiosP #bound #certification #memory management #polynomial

Certification of Safe Polynomial Memory Bounds (JdD, RP), pp. 184–199.

SEFM-2011-HildebrandtMS #declarative #process

Safe Distribution of Declarative Processes (TTH, RRM, TS), pp. 237–252.

CHI-2011-BrumbyDJG #how #performance

Fast or safe?: how performance objectives determine modality output choices while interacting on the move (DPB, SCED, CPJ, JJG), pp. 473–482.

HCI-MIIE-2011-ChuC

Safe-in-Place Awareness GPS System with Distance-Based and Duration-Based Notification Control (CNC, GC), pp. 288–292.

HCI-MIIE-2011-TsaiSL #flexibility #mobile

Mobile Reminder for Flexible and Safe Medication Schedule for Home Users (PHT, CSS, JWSL), pp. 107–116.

SIGAda-2011-Moore #parallel #recursion #stack

Stack safe parallel recursion with paraffin (BJM), pp. 27–34.

ICMT-J-2010-HeidenreichKA11 #composition

Safe Composition of Transformations (FH, JK, UA), pp. 162–181.

BX-2011-Cunha #evolution #spreadsheet #type safety

Type-safe Evolution of Spreadsheets (JC), p. 55.

ECOOP-2011-BocchinoA #framework #object-oriented #parallel #programming

Types, Regions, and Effects for Safe Programming with Object-Oriented Parallel Frameworks (RLBJ, VSA), pp. 306–332.

OOPSLA-2011-KeLZBJD #dependence #parallel #programming #using

Safe parallel programming using dynamic dependence hints (CK, LL, CZ, TB, BJ, CD), pp. 243–258.

OOPSLA-2011-WurthingerABWM #aspect-oriented #evolution #java #runtime

Safe and atomic run-time code evolution for Java and its application to dynamic AOP (TW, DA, WB, CW, HM), pp. 825–844.

TOOLS-EUROPE-2011-WelschS #distributed #object-oriented #programming

Location Types for Safe Distributed Object-Oriented Programming (YW, JS), pp. 194–210.

GPCE-J-2005-HuangZS11 #generative #static typing

Statically safe program generation with SafeGen (SSH, DZ, YS), pp. 376–391.

GPCE-2011-NevesTSAKB #evolution #product line

Investigating the safe evolution of software product lines (LN, LT, DS, VA, UK, PB), pp. 33–42.

POPL-2011-BocchinoHHAAWS #nondeterminism #parallel

Safe nondeterminism in a deterministic-by-default parallel language (RLBJ, SH, NH, SVA, VSA, AW, TS), pp. 535–548.

ESEC-FSE-2011-FalessiNSBM #design #named #safety #slicing

SafeSlice: a model slicing and design safety inspection tool for SysML (DF, SN, MS, LCB, AM), pp. 460–463.

ASPLOS-2011-CoburnCAGGJS #named #performance #persistent

NV-Heaps: making persistent objects fast and safe with next-generation, non-volatile memories (JC, AMC, AA, LMG, RKG, RJ, SS), pp. 105–118.

HPCA-2011-BobbaLHW #memory management #performance

Safe and efficient supervised memory systems (JB, ML, MDH, DAW), pp. 369–380.

PPoPP-2011-KarmaniMM #concurrent #contract #parallel #thread

Thread contracts for safe parallelism (RKK, PM, BMM), pp. 125–134.

ECSA-2010-Lopez-HerrejonE #architecture #on the #product line

On the Need of Safe Software Product Line Architectures (RELH, AE), pp. 493–496.

CASE-2010-OuedraogoKMA #approach #automaton #finite

Symbolic approach to nonblocking and safe control of Extended Finite Automata (LO, RK, RM, KÅ), pp. 471–476.

DocEng-2010-QuintRSV #editing

From templates to schemas: bridging the gap between free editing and safe data processing (VQ, CR, SS, CV), pp. 61–64.

VLDB-2010-GrustRS #compilation

Avalanche-Safe LINQ Compilation (TG, JR, TS), pp. 162–172.

WRLA-2010-SunMS #architecture

A Formal Pattern Architecture for Safe Medical Systems (MS, JM, LS), pp. 157–173.

CSMR-2010-NagyPGB #dependence #towards

Towards a Safe Method for Computing Dependencies in Database-Intensive Systems (CN, JP, TG, ÁB), pp. 166–175.

SCAM-2010-SimpsonB #c #memory management #named #runtime #safety

MemSafe: Ensuring the Spatial and Temporal Memory Safety of C at Runtime (MSS, RB), pp. 199–208.

PEPM-2010-RudolphT #bytecode #code generation #named #runtime #type safety

Mnemonics: type-safe bytecode generation at run time (JR, PT), pp. 15–24.

PLDI-2010-PrabhuRV #parallel #programmable

Safe programmable speculative parallelism (PP, GR, KV), pp. 50–61.

PLDI-2010-YangH #automation #operating system #type safety #verification

Safe to the last instruction: automated verification of a type-safe operating system (JY, CH), pp. 99–110.

IFM-2010-TranS #commit #java #transaction

Safe Commits for Transactional Featherweight Java (TMTT, MS), pp. 290–304.

ICMT-2010-HeidenreichKA #composition

Safe Composition of Transformations (FH, JK, UA), pp. 108–122.

ECOOP-2010-HuKPYH #java #type safety

Type-Safe Eventful Sessions in Java (RH, DK, OP, NY, KH), pp. 329–353.

OOPSLA-2010-WegielK #type safety

Cross-language, type-safe, and transparent object sharing for co-located managed runtimes (MW, CK), pp. 223–240.

GPCE-J-2007-GilL10 #c++ #query #sql

Simple and safe SQL queries with C++ templates (JYG, KL), pp. 573–595.

GPCE-2010-LongMSR #concurrent

Implicit invocation meets safe, implicit concurrency (YL, SLM, TS, HR), pp. 63–72.

SAC-2010-FotoohiG #approach #behaviour #case study

A supervisory control approach for safe behavior of service robot case study: FRIEND (LF, AG), pp. 1305–1306.

QoSA-2009-WaignierMD #component #debugging #design #framework #modelling

A Model-Based Framework to Design and Debug Safe Component-Based Autonomic Systems (GW, AFLM, LD), pp. 1–17.

DATE-2009-GriessnigMSW #fault #novel #testing

Fault insertion testing of a novel CPLD-based fail-safe system (GG, RM, CS, RW), pp. 214–219.

DRR-2009-NonnemakerB #classification #using

Using synthetic data safely in classification (JN, HSB), pp. 1–10.

PLDI-2009-NeamtiuH #concurrent #multi #source code #thread

Safe and timely updates to multi-threaded programs (IN, MWH), pp. 13–24.

PLDI-2009-Oiwa #compilation #implementation

Implementation of the memory-safe full ANSI-C compiler (YO), pp. 259–269.

FM-2009-Eshuis #petri net

Translating Safe Petri Nets to Statecharts in a Structure-Preserving Way (RE), pp. 239–255.

ICFP-2009-SculthorpeN #dependent type #functional #programming

Safe functional reactive programming through dependent types (NS, HN), pp. 23–34.

SIGAda-2009-Mentis #ada #api #type safety

A robotics API dialect for type-safe robots: translating Myro to Ada (ASM), pp. 91–102.

CIKM-2009-ParateM #communication #framework

A framework for safely publishing communication traces (AP, GM), pp. 1469–1472.

MoDELS-2009-MussbacherAW #aspect-oriented #modelling

Refactoring-Safe Modeling of Aspect-Oriented Scenarios (GM, DA, JW), pp. 286–300.

MoDELS-2009-MussbacherAW #aspect-oriented #modelling

Refactoring-Safe Modeling of Aspect-Oriented Scenarios (GM, DA, JW), pp. 286–300.

ECOOP-2009-JacobsP #exception #named

Failboxes: Provably Safe Exception Handling (BJ, FP), pp. 470–494.

OOPSLA-2009-BergerYLN #c #c++ #named #parallel #programming #thread

Grace: safe multithreaded programming for C/C++ (EDB, TY, TL, GN), pp. 81–96.

GPCE-2009-HeidenreichJSWB #generative

Generating safe template languages (FH, JJ, MS, CW, MB), pp. 99–108.

GPCE-2009-KuhlemannBK #composition

Safe composition of non-monotonic features (MK, DSB, CK), pp. 177–186.

ESEC-FSE-2009-DelawareCB #composition

Fitting the pieces together: a machine-checked model of safe composition (BD, WRC, DSB), pp. 243–252.

ICSE-2009-WlokaRTR #analysis #development

Safe-commit analysis to facilitate team software development (JW, BGR, FT, XR), pp. 507–517.

ASPLOS-2009-MenonSZ #automation #named #network #performance

TwinDrivers: semi-automatic derivation of fast and safe hypervisor network drivers from guest OS drivers (AM, SS, WZ), pp. 301–312.

LCTES-2009-CaspiCGPR #memory management #policy #scheduling

Synchronous objects with scheduling policies: introducing safe shared memory in lustre (PC, JLC, LG, MP, PR), pp. 11–20.

PPoPP-2009-AgrawalLS #transaction

Safe open-nested transactions through ownership (KA, ITAL, JS), pp. 151–162.

TestCom-FATES-2009-BochmannJ #petri net #testing

Testing k-Safe Petri Nets (GvB, GVJ), pp. 33–48.

DATE-2008-Garcia #automation #configuration management

Safe Automatic Flight Back and Landing of Aircraft Flight Reconfiguration Function (FRF) (JAHG), pp. 280–283.

VLDB-2008-CormodeSYZ #graph #using

Anonymizing bipartite graph data using safe groupings (GC, DS, TY, QZ), pp. 833–844.

ITiCSE-2008-Fekete #education #java #student #thread

Teaching students to develop thread-safe java classes (ADF), pp. 119–123.

ESOP-2008-Boudol #type system

Typing Safe Deallocation (GB), pp. 116–130.

PASTE-2008-PamnanyJ #named #parallel

Elyze: enabling safe parallelism in event-driven servers (KP, JJ), pp. 15–21.

PLDI-2008-HuangS

Expressive and safe static reflection with MorphJ (SSH, YS), pp. 79–89.

PLDI-2008-WangXLGWZ #analysis #correlation #memory management

Conditional correlation analysis for safe region-based memory management (XW, ZX, XL, ZG, XW, ZZ), pp. 45–55.

PLDI-2008-WegielK #communication #coordination #memory management #named #type safety

XMem: type-safe, transparent, shared memory for cross-runtime communication and coordination (MW, CK), pp. 327–338.

ICALP-B-2008-Kesner #composition

Perpetuality for Full and Safe Composition (in a Constructive Setting) (DK), pp. 311–322.

FM-2008-Lecomte #framework #reliability

Safe and Reliable Metro Platform Screen Doors Control/Command Systems (TL), pp. 430–434.

IFL-2008-TellerSV #fault #lightweight #ml #performance #polymorphism #type safety

Catch Me If You Can — Looking for Type-Safe, Hierarchical, Lightweight, Polymorphic and Efficient Error Management in OCaml (DT, AS, TV), pp. 249–271.

AdaEurope-2008-AlonsoVPA #ada #modelling #state machine #thread #visual notation

StateML+s: From Graphical State Machine Models to Thread-Safe Ada Code (DA, CVC, JAP, BÁ), pp. 158–170.

AdaEurope-2008-VilloingB #database #interface #type safety

A Type-Safe Database Interface (FV, EB), pp. 144–157.

BX-2008-Wang1 #abstraction #bidirectional

Translucent Abstraction: Safe Views Through Bidirectional Transformations (MW), p. 41.

ECOOP-2008-Gray #inheritance

Safe Cross-Language Inheritance (KEG), pp. 52–75.

OOPSLA-2008-OliveiraWG #component #reuse #type safety #visitor

The visitor pattern as a reusable, generic, type-safe component (BCdSO, MW, JG), pp. 439–456.

GPCE-2008-MercadalPCL #coordination #domain-specific language #named

Pantaxou: a domain-specific language for developing safe coordination services (JM, NP, CC, JLL), pp. 149–160.

LOPSTR-2008-MontenegroPS #algorithm

An Inference Algorithm for Guaranteeing Safe Destruction (MM, RPM, CS), pp. 135–151.

PPDP-2008-MontenegroPS #correctness #memory management #proving #type system

A type system for safe memory management and its proof of correctness (MM, RP, CS), pp. 152–162.

POPL-2008-NeamtiuHFP #concurrent #programming

Contextual effects for version-consistent dynamic software updating and safe concurrent programming (IN, MH, JSF, PP), pp. 37–49.

CGO-2008-MurphyMSSA #type safety

Fault-safe code motion for type-safe languages (BRM, VM, FTS, TS, ARAT), pp. 144–154.

HPCA-2008-ChungDKK #memory management #thread #transaction #using

Thread-safe dynamic binary translation using transactional memory (JC, MD, HK, CK), pp. 279–289.

PPoPP-2008-NavabiZJ #scheduling

Quasi-static scheduling for safe futures (AN, XZ, SJ), pp. 23–32.

ICLP-2008-LeeLP #modelling

Safe Formulas in the General Theory of Stable Models (Preliminary Report) (JL, VL, RP), pp. 672–676.

CBSE-2007-PolakovicMSD #component #configuration management #embedded #experience

Experience with Safe Dynamic Reconfigurations in Component-Based Embedded Systems (JP, SM, JBS, PCD), pp. 242–257.

DAC-2007-GoldgeisserCD #hardware #modelling

Modeling Safe Operating Area in Hardware Description Languages (LBG, EC, ZD), pp. 377–382.

DATE-2007-BjerregaardSS #architecture #scalability

A scalable, timing-safe, network-on-chip architecture with an integrated clock distribution method (TB, MBS, JS), pp. 648–653.

DATE-2007-DevanathanRK #generative #interactive #testing

Interactive presentation: On power-profiling and pattern generation for power-safe scan tests (VRD, CPR, VK), pp. 534–539.

ICFP-2007-Park #higher-order #type safety

Type-safe higher-order channels in ML-like languages (SP), pp. 191–202.

SEKE-2007-ShiN #component #java #named #security #static analysis

SAFES: A Static Analysis for Field Security in Java Components (AS, GN), pp. 302–307.

ECOOP-2007-HuangZS #image #named

Morphing: Safely Shaping a Class in the Image of Others (SSH, DZ, YS), pp. 399–424.

GPCE-2007-ArnoldusBB #named

Repleo: a syntax-safe template engine (JA, JB, MvdB), pp. 25–32.

GPCE-2007-GilL #c++ #query #sql

Simple and safe SQL queries with c++ templates (JYG, KL), pp. 13–24.

GPCE-2007-ThakerBKC #composition #product line

Safe composition of product lines (ST, DSB, DK, WRC), pp. 95–104.

PPDP-2007-Skalka #data access #type safety #virtual machine

Type safe dynamic linking for JVM access control (CS), pp. 51–62.

SAC-OOPS-J-2006-LagorioZ07 #java #named

Just: Safe Unknown Types in Java-like Languages (GL, EZ), pp. 69–98.

SAC-2007-LebbahMR #constraints #implementation #performance #reduction #using

Using constraint techniques for a safe and fast implementation of optimality-based reduction (YL, CM, MR), pp. 326–331.

LDTA-J-2003-BrabrandS #parsing

The metafront system: Safe and extensible parsing and transformation (CB, MIS), pp. 2–20.

ISMM-2007-GayEB #memory management

Safe manual memory management (DG, RE, EAB), pp. 2–14.

LCTES-2007-Kastner #abstract interpretation #analysis #execution #worst-case

Safe worst-case execution time analysis by abstract interpretation of executable code (DK), p. 135.

SOSP-2007-CriswellLDA #architecture #execution #operating system

Secure virtual architecture: a safe execution environment for commodity operating systems (JC, AL, DD, VSA), pp. 351–366.

LICS-2007-Riba #interactive #normalisation

Strong Normalization as Safe Interaction (CR), pp. 13–22.

TLCA-2007-BlumO #λ-calculus

The Safe λ Calculus (WB, CHLO), pp. 39–53.

PEPM-2006-GeayYF #assurance #quality

Continuous code-quality assurance with SAFE (EG, EY, SJF), pp. 145–149.

PLDI-2006-DhurjatiKA #alias #analysis #named

SAFECode: enforcing alias analysis for weakly typed languages (DD, SK, VSA), pp. 144–157.

PLDI-2006-SpoonhowerABCG #named #programming #realtime

Eventrons: a safe programming construct for high-frequency hard real-time applications (DS, JSA, DFB, PC, DG), pp. 283–294.

FM-2006-CunhaOV #data transformation #type safety

Type-Safe Two-Level Data Transformation (AC, JNO, JV), pp. 284–299.

AdaEurope-2006-AlonsoSAP #approach

A Systematic Approach to Developing Safe Tele-operated Robots (DA, PS, BÁ, JAP), pp. 119–130.

GPCE-2006-StuckenholzO #component

Safe component updates (AS, AO), pp. 39–48.

PPDP-2006-GarraldaCD #named

BASS: boxed ambients with safe sessions (PG, ABC, MDC), pp. 61–72.

SAC-2006-Gutierrez-NolascoVT #interactive #protocol #semantics

A semantic model for safe protocol interaction (SGN, NV, CLT), pp. 1599–1600.

SAC-2006-LagorioZ #java

Introducing safe unknown types in Java-like languages (GL, EZ), pp. 1429–1434.

LCTES-2006-ProchnowTH #state machine

Synthesizing safe state machines from Esterel (SP, CT, RvH), pp. 113–124.

OSDI-2006-SivathanuSZ #type safety

Type-Safe Disks (GS, SS, EZ), pp. 15–28.

OSDI-2006-ZhouCABEHNB #named #using

SafeDrive: Safe and Recoverable Extensions Using Language-Based Techniques (FZ, JC, ZRA, IB, RE, MH, GCN, EAB), pp. 45–60.

CBSE-2005-BehrendsSD #component #concurrent #design #multi #thread

A Component-Oriented Model for the Design of Safe Multi-threaded Applications (RB, REKS, LKD), pp. 251–266.

WICSA-2005-BaraisLMD #architecture

Providing Support for Safe Software Architecture Transformations (OB, JLL, AFLM, LD), pp. 201–202.

DATE-2005-RosingerAC #agile #generative

Rapid Generation of Thermal-Safe Test Schedules (PMR, BMAH, KC), pp. 840–845.

SIGMOD-2005-BouganimCNDP #smarttech

Safe data sharing and data dissemination on smart devices (LB, CC, FDN, ND, PP), pp. 888–890.

ICSM-2005-WillmorE #testing

A Safe Regression Test Selection Technique for Database-Driven Applications (DW, SME), pp. 421–430.

PASTE-2005-CookO #component #deployment #named

MonDe: safe updating through monitored deployment of new component versions (JEC, AO), pp. 43–46.

SAS-2005-GlewPG #architecture #optimisation #plugin #type safety

Type-Safe Optimisation of Plugin Architectures (NG, JP, CG), pp. 135–154.

SEFM-2005-JacobsPLS #concurrent #invariant

Safe Concurrency for Aggregate Objects with Invariants (BJ, FP, KRML, WS), pp. 137–147.

OOPSLA-2005-WelcJH #java

Safe futures for Java (AW, SJ, ALH), pp. 439–453.

GPCE-2005-HuangZS #generative #static typing

Statically Safe Program Generation with SafeGen (SSH, DZ, YS), pp. 309–326.

PADL-2005-ZhuX #pointer #programming

Safe Programming with Pointers Through Stateful Views (DZ, HX), pp. 83–97.

POPL-2005-StoyleHBSN #predict

Mutatis mutandis: safe and predictable dynamic software updating (GS, MWH, GMB, PS, IN), pp. 183–194.

SAC-2005-BettiniBL #flexibility

Safe and flexible objects (LB, VB, SL), pp. 1258–1263.

SAC-2005-ZhangGZL #algorithm

A tabu search algorithm for the safe transportation of hazardous materials (LZ, SG, YZ, AL), pp. 940–946.

SAC-OOPS-J-2005-BettiniBL #flexibility #type system

Safe and Flexible Objects with Subtyping (LB, VB, SL), pp. 5–29.

ICSE-2005-CookR #execution #query #static typing

Safe query objects: statically typed objects as remotely executable queries (WRC, SR), pp. 97–106.

HPCA-2005-QinLZ #detection #memory management #named

SafeMem: Exploiting ECC-Memory for Detecting Memory Leaks and Memory Corruption During Production Runs (FQ, SL, YZ), pp. 291–302.

LCTES-2005-SassoneWL #dependence #embedded #performance

Static strands: safely collapsing dependence chains for increasing embedded power efficiency (PGS, DSW, GHL), pp. 127–136.

SOSP-2005-QinTSZ #debugging #named

Rx: treating bugs as allergies — a safe method to survive software failures (FQ, JT, JS, YZ), pp. 235–248.

ESOP-2004-LeviB #analysis #control flow

A Control Flow Analysis for Safe and Boxed Ambients (FL, CB), pp. 188–203.

ICSM-2004-JanssensMHV #approach #composition #configuration management

A Modular Approach Enforcing Safe Reconfiguration of Producer-Consumer Applications (NJ, SM, TH, PV), pp. 274–283.

PLDI-2004-FlattF #abstraction

Kill-safe synchronization abstractions (MF, RBF), pp. 47–58.

AFP-2004-AchtenEPW04 #agile #interactive #named #prototype #tool support #type safety

GEC: A Toolkit for Generic Rapid Prototyping of Type Safe Interactive Applications (PA, MCJDvE, RP, AvW), pp. 210–244.

KR-2004-CadoliM #automation #constraints #specification

Automated Reformulation of Specifications by Safe Delay of Constraints (MC, TM), pp. 388–398.

GPCE-2004-LawallMM #component #design #domain-specific language #independence #on the

On Designing a Target-Independent DSL for Safe OS Process-Scheduling Components (JLL, AFLM, GM), pp. 436–455.

SAC-2004-SurazhskyG #c++ #type safety

Type-safe covariance in C++ (VS, JYG), pp. 1496–1502.

FSE-2004-LevesonW #embedded #reuse

Making embedded software reuse practical and safe (NGL, KAW), pp. 171–178.

ICSE-2004-EugsterDG #development #distributed #towards

Towards Safe Distributed Application Development (PTE, CHD, RG), pp. 347–356.

ISMM-2004-HicksMGJ #experience

Experience with safe manual memory-management in cyclone (MWH, JGM, DG, TJ), pp. 73–84.

OSDI-2004-GunawiAA #network

Deploying Safe User-Level Network Services with icTCP (HSG, ACAD, RHAD), pp. 317–332.

DATE-2003-TindellKWE #development

Safe Automotive Software Development (KT, HK, FW, RE), pp. 10616–10623.

DocEng-2003-ScheffczykBRS #consistency #documentation #formal method #repository #type safety

Consistent document engineering: formalizing type-safe consistency rules for heterogeneous repositories (JS, UMB, PR, LS), pp. 140–149.

ESOP-2003-ErwigR #programming #type safety

Programming Type-Safe Program Updates (ME, DR), pp. 269–283.

ICSM-2003-BarrE

Safe Upgrading without Restarting (MB, SE), pp. 129–137.

PLDI-2003-BoyapatiSBR #java #memory management #realtime

Ownership types for safe region-based memory management in real-time Java (CB, AS, WSB, MCR), pp. 324–337.

SAS-2003-LeeYY #memory management #reuse #source code

Inserting Safe Memory Reuse Commands into ML-Like Programs (OL, HY, KY), pp. 171–188.

ICFP-2003-LeiferPSW

Global abstraction-safe marshalling with hash types (JJL, GP, PS, KW), pp. 87–98.

SOSP-2003-SekarVBBD #approach #execution

Model-carrying code: a practical approach for safe execution of untrusted applications (RS, VNV, SB, SB, DCD), pp. 15–28.

VMCAI-2003-Levi #communication #evolution

Types for Evolving Communication in Safe Ambients (FL), pp. 102–115.

FME-2002-Jorgensen #incremental

Safeness of Make-Based Incremental Recompilation (NJ), pp. 126–145.

ECOOP-2002-GlewP #type safety

Type-Safe Method Inlining (NG, JP), pp. 525–544.

ECOOP-2002-Zenger #component #evolution #prototype #type safety

Type-Safe Prototype-Based Component Evolution (MZ), pp. 470–497.

OOPSLA-2002-BoyapatiLR #programming

Ownership types for safe programming: preventing data races and deadlocks (CB, RL, MCR), pp. 211–230.

POPL-2002-MerroH #bisimulation

Bisimulation congruences in safe ambients (MM, MH), pp. 71–80.

POPL-2002-NeculaMW #legacy #named #type safety

CCured: type-safe retrofitting of legacy code (GCN, SM, WW), pp. 128–139.

ITiCSE-2001-Rosbottom #distance #education #hybrid #learning

Hybrid learning — a safe route into web-based open and distance learning for the computer science teacher (JR), pp. 89–92.

PLDI-2001-AmmeDFR #named #representation #type safety

SafeTSA: A Type Safe and Referentially Secure Mobile-Code Representation Based on Static Single Assignment Form (WA, ND, MF, JvR), pp. 137–147.

ICALP-2001-SangiorgiV #automaton #distributed

A Distributed Abstract Machine for Safe Ambients (DS, AV), pp. 408–420.

ICFP-2001-DimockWMTW #ml #standard #type safety

Functioning without Closure: Type-Safe Customized Function Representations for Standard ML (AD, IW, RM, FAT, JBW), pp. 14–25.

ICFP-2001-GanzST #generative #metaprogramming #multi #type safety

Macros as Multi-Stage Computations: Type-Safe, Generative, Binding Macros in MacroML (SEG, AS, WT), pp. 74–85.

AdaEurope-2001-Alves #ada #web #xml

Safe Web Forms and XML Processing with Ada (MAA), pp. 349–358.

LOPSTR-2001-Shankar #functional #static analysis

Static Analysis for Safe Destructive Updates in a Functional Language (NS), pp. 1–24.

POPL-2001-BugliesiC

Secure safe ambients (MB, GC), pp. 222–235.

ICALP-2000-CalcagnoMT #approach #imperative #multi #programming

Closed Types as a Simple Approach to Safe Imperative Multi-stage Programming (CC, EM, WT), pp. 25–36.

ICFP-2000-Weirich #functional #type safety

Type-safe cast: functional pearl (SW), pp. 58–67.

ECOOP-2000-MalabarbaPGBB #java #runtime #type safety

Runtime Support for Type-Safe Dynamic Java Classes (SM, RP, JG, ETB, JFB), pp. 337–361.

OOPSLA-2000-BryceR #approach

An approach to safe object sharing (CB, CR), pp. 367–381.

OOPSLA-2000-RubyL #subclass

Safely creating correct subclasses without seeing superclass code (CR, GTL), pp. 208–228.

GCSE-2000-Veldhuizen #java

Just When You Thought Your Little Language Was Safe: “Expression Templates” in Java (TLV), pp. 188–202.

SAC-2000-MinskyMU #distributed #tuple

Making Tuple Spaces Safe for Heterogeneous Distributed Systems (NHM, YM, VU), pp. 218–226.

ESOP-1999-FlanaganA

Types for Safe Locking (CF, MA), pp. 91–108.

ESOP-1999-TrifonovS

Safe and Principled Language Interoperation (VT, ZS), pp. 128–146.

TACAS-1999-Heljanko #concurrent #logic programming #petri net #problem #reachability #semantics #source code #using

Using Logic Programs with Stable Model Semantics to Solve Deadlock and Reachability Problems for 1-Safe Petri Nets (KH), pp. 240–254.

FM-v1-1999-Dunne #specification

The Safe Machine: A New Specification Construct for B (SD), pp. 472–489.

FM-v2-1999-ButhS #architecture #communication #design #model checking

Model-Checking the Architectural Design of a Fail-Safe Communication System for Railway Interlocking Systems (BB, MS), p. 1869.

ECOOP-1999-Kniesel #adaptation #component #runtime #type safety

Type-Safe Delegation for Run-Time Component Adaptation (GK), pp. 351–366.

TOOLS-EUROPE-1999-CzajkowskiE #internet

Internet Servers, Safe-Language Extensions, and Structured Resource Control (GC, TvE), pp. 295–304.

TOOLS-EUROPE-1999-DuvalC #architecture #concurrent #distributed

Developing Safe Concurrent and Distributed Applications with an Architectural Environment (GD, TC), pp. 20–32.

TOOLS-PACIFIC-1999-SchmolitzkyEKM #how #question #type safety

How Can Covariance in Pragmatical Class Methods be Made Statically Type-Safe? (AS, ME, JLK, GM), pp. 200–209.

POPL-1999-GlewM #assembly #composition #type safety

Type-Safe Linking and Modular Assembly Language (NG, JGM), pp. 250–261.

ICSE-1999-MacKenzie #design

Designing Safe Software for Medical Devices (DMM), p. 618.

SOSP-1999-ChiuehVP #performance #segmentation

Integrating segmentation and paging protection for safe, efficient and transparent software extensions (TcC, GV, PP), pp. 140–153.

CSL-1999-GeuversPZ #proving #type system

Safe Proof Checking in Type Theory with Y (HG, EP, JZ), pp. 439–452.

PODS-1998-BenediktL #constraints #query

Safe Constraint Queries (MB, LL), pp. 99–108.

VLDB-1998-ZouS #online

Safely and Efficiently Updating References During On-line Reorganization (CZ, BS), pp. 512–522.

AdaEurope-1998-Stift #ada #object-oriented #physics

(Astro)Physical Supercomputing: Ada95 as a Safe, Object Oriented Alternative (MJS), pp. 128–139.

ECOOP-1998-BruceOW #static typing

A Statically Safe Alternative to Virtual Types (KBB, MO, PW), pp. 523–549.

OOPSLA-1998-Bouraqadi-SaadaniLR #programming

Safe Metaclass Programming (NMNBS, TL, FR), pp. 84–96.

OOPSLA-1998-BrachaOSW #java #programming language

Making the Future Safe for the Past: Adding Genericity to the Java Programming Language (GB, MO, DS, PW), pp. 183–200.

POPL-1998-NipkowO #java #type safety

JavaNone is Type-Safe — Definitely (TN, DvO), pp. 161–170.

DAC-1997-HongBBM #using

Safe BDD Minimization Using Don’t Cares (YH, PAB, JRB, KLM), pp. 208–213.

VLDB-1997-HumborstadSHT #algorithm #symmetry

1-Safe Algorithms for Symmetric Site Configurations (RH, MS, SOH, ØT), pp. 316–325.

HCI-SEC-1997-KohnoA #concept #named

ROIS: A New Concept to Change into Safe and Comfortable World (MK, YA), pp. 205–208.

AdaEurope-1997-DobbingR #ada #named #realtime #tool support

T-SMART — Task-Safe, Minimal Ada Realtime Toolset (BD, MRF), pp. 244–253.

ECOOP-1997-DrossopoulouE #java #type safety

Java is Type Safe — Probably (SD, SE), pp. 389–418.

ALP-1997-AlpuenteFMV

Safe Folding/Unfolding with Conditional Narrowing (MA, MF, GM, GV), pp. 1–15.

CSL-1997-Hofmann #linear #recursion #λ-calculus

A Mixed Modal/Linear λ Calculus with Applications to Bellantoni-Cook Safe Recursion (MH0), pp. 275–294.

SIGMOD-1996-LiskovACDGGMMS #performance #persistent

Safe and Efficient Sharing of Persistent Objects in Thor (BL, AA, MC, MD, SG, RG, UM, ACM, LS), pp. 318–329.

ECOOP-1996-BoylandC #compilation #type safety

Type-Safe Compilation of Covariant Specialization: A Practical Case (JB, GC), pp. 3–25.

PODS-1995-ChaudhriH #database #policy

Safe Locking Policies for Dynamic Databases (VKC, VH), pp. 233–244.

FPCA-1995-HengleinR #ml #polymorphism #type inference

Safe Polymorphic Type Inference for Scheme: Translating Scheme to ML (FH, JR), pp. 192–203.

AdaEurope-1995-Richard-Foy #ada #safety

Safe Ada Executive: An Executive for Ada Safety Critical Applications (MRF), pp. 11–20.

ECOOP-1995-BruceSG #named #object-oriented #polymorphism #type safety

PolyTOIL: A Type-Safe Polymorphic Object-Oriented Language (KBB, AS, RvG), pp. 27–51.

PLILP-1995-HengleinS #partial evaluation #semantics

A Semantic Model of Binding Times for Safe Partial Evaluation (FH, DS), pp. 299–320.

TOOLS-EUROPE-1994-Schmid94a

Safe Iterators (HAS), pp. 407–418.

CAV-1994-SinghalP #problem

The Verifiacation Problem for Safe Replaceability (VS, CP), pp. 311–323.

CSM-1993-RothermelH #algorithm #performance #testing

A Safe, Efficient Algorithm for Regression Test Selection (GR, MJH), pp. 358–367.

OOPSLA-1993-BruceCMGDM #decidability #object-oriented #type checking

Safe and Decidable Type Checking in an Object-Oriented Language (KBB, JC, TPM, RvG, AD, RM), pp. 29–46.

POPL-1993-Bruce #object-oriented #programming language #static typing #type checking

Safe Type Checking in a Statically-Typed Object-Oriented Programming Language (KBB), pp. 285–298.

PLDI-1992-LandiR #algorithm #alias #approximate #interprocedural #pointer

A Safe Approximate Algorithm for Interprocedural Pointer Aliasing (WL, BGR), pp. 235–248.

Best-of-PLDI-1992-LandiR92a #algorithm #alias #approximate #interprocedural #pointer

A safe approximate algorithm for interprocedural pointer aliasing (with retrospective) (WL, BGR), pp. 473–489.

LFP-1992-Chin #functional

Safe Fusion of Functional Expressions (WNC), pp. 11–20.

PLILP-1992-BossiCE #on the

On Safe Folding (AB, NC, SE), pp. 172–186.

VLDB-1991-Markowitz #database #relational

Safe Referential Structures in Relational Databases (VMM), pp. 123–132.

ECOOP-1991-PalsbergS #question #reuse #type safety #what

What is Type-Safe Code Reuse? (JP, MIS), pp. 325–341.

CSL-1991-Hirshfeld #database #query #relational

Safe Queries in Relational Databases with Functions (YH), pp. 173–183.

POPL-1990-Rouaix #runtime

Safe Run-time Overloading (FR), pp. 355–366.

POPL-1990-Steele #parallel

Making Asynchronous Parallelism Safe for the World (GLSJ), pp. 218–231.

VLDB-1989-CopelandKKS #ram

The Case For Safe RAM (GPC, TWK, RK, MGS), pp. 327–335.

ECOOP-1989-Cook #eiffel #type safety

A Proposal for Making Eiffel Type-Safe (WRC), pp. 57–70.

ESOP-1986-HankinBJ #approach #combinator #parallel #reduction

A Safe Approach to Parallel Combinator Reduction (Extended Abstract) (CH, GLB, SLPJ), pp. 99–110.

VLDB-1985-LausenSW #concurrent #policy

Pre-Analysis Locking: A Safe and Deadlock Free Locking Policy (GL, ESS, PW), pp. 270–281.

POPL-1981-Owicki #garbage collection

Making the World Safe for Garbage Collection (SSO), pp. 77–86.