Map
Index
Random
Help
Quotes
Related
th

ThesaHelp: ACM references a-e

topic root > Group: all references


--related--
all references
ACM references
ACM references a-e
ACM references f-l
ACM references m-z

--referenced--
all Thesa topics

Summary

references from 'a' to 'e' by first author
Quotes: up

QuoteRef: abadDJ9_2018 ;;Abadi, D.J., Faleiro, J.M., An overview of deterministic database systems
QuoteRef: abadM1_1993 ;;Abadi, M., Lamport, L., Composing specifications
QuoteRef: abadM5_1996 ;;Abadi, M. et al., Analysis and caching of dependencies
QuoteRef: abadM9_1999 ;;Abadi, M., Secrecy by typing in security protocols
QuoteRef: abboRJ8_1987 ;;Abbott, R.J., Knowledge abstraction
QuoteRef: abboRJ3_1990 ;;Abbott, R.J., Resourceful systems for fault tolerance, reliability, and safety
QuoteRef: abduSE9_1998 ;;Abdullahi, S.E., Ringwood, G.A., Garbage collecting the internet: a survey of distributed garbage collection
QuoteRef: abelJ2_2010 ;;Abella, J., Vera, X., Electromigration for microarchitects
QuoteRef: abraD11_1996 ;;Abramson, D. et al., Relative debugging: A new methodology for debugging scientific applications
QuoteRef: abraH12_1977 ;;Abramson, H., Ordered types and a generalized for statement
QuoteRef: abraP12_1986 ;;Abrahams, P., The role of failure in software design
QuoteRef: acarUA2_2013 ;;Acar, U.A. et al., Scheduling parallel programs by work stealing with private deques
QuoteRef: acarUA6_2018 ;;Acar, U.A. et al., Heartbeat scheduling: provable efficiency for nested parallelism [ExtraQuote]
QuoteRef: accoJ3_1997 ;;Accot, J., Zhai, S., Beyond Fitts' law: Models for trajectory-based HCI tasks
QuoteRef: accoJ4_2002 ;;Accot, J., Zhai, S., More than dotting the i's -- Foundations for crossing-based interfaces
QuoteRef: achuJO6_1981 ;;Achugbue, J.O., On the line breaking problem in text formatting
QuoteRef: ackeMS_1990 ;;Ackerman, M.S., Malone, T.W., Answer Garden: a tool for growing organizational memory
QuoteRef: adamK10_2006 ;;Adams, K., Agesen, O., A comparison of software and hardware techniques for x86 virtualization
QuoteRef: adamK10_2014 ;;Adamas, K. et al., The HipHop virtual machine
QuoteRef: adamMD5_2006 ;;Adams, M.D., Wise, D.S., Fast additions on masked integers
QuoteRef: adamMD9_2012 ;;Adams, M.D., DuBuisson, T.M., Template your boilerplate
QuoteRef: adamMD6_2016 ;;Adams, M.D. et al., On the complexity and performance of parsing with derivatives
QuoteRef: adamU6_2018 ;;Adams, U., Ryu: fast float-to-string conversion
QuoteRef: addyAM4_1980 ;;Addyman, A.M., A draft proposal for Pascal
QuoteRef: adjiW12_1999 ;;Adjie-Winoto, W. et al., The design and implementation of an intentional naming system
QuoteRef: adriD1_2019 ;;Adrian, D. et al., Imperfect forward secrecy: how DIffie-Hellman fails in practice
QuoteRef: adriFA11_1993 ;;Adrian, F.A., A modest proposal concerning variables and assignment statements
QuoteRef: adveSV8_2010 ;;Adve, S.V., Boehm, H.-J., Memory models: a case for rethinking parallel languages and hardware
QuoteRef: afekY1_1993 ;;Afek, Y. et al., Lazy caching
QuoteRef: afekY6_2011 ;;Afek, Y. et al., Cache index-aware memory allocation
QuoteRef: aftaEE6_2009 ;;Aftandilian, E.E., Guyer, S.Z., GC assertions: using the garbage collector to check heap properties
QuoteRef: agesO6_1998 ;;Agesen, O. et al., Garbage collection and local variable type-precision and liveness in Java Virtual Machines
QuoteRef: agesO11_1999 ;;Agesen, O. et al., An efficient meta-lock for implementing ubiquitous synchronization
QuoteRef: aggaA6_2001 ;;Aggarwal, A., Randall, K.H., Related field analysis
QuoteRef: ahlbC4_1994 ;;Ahlberg, C., Shneiderman, B., The Alphaslider: A compact and rapid selector
QuoteRef: ahnDH2_2021 ;;Ahn, D.H. et al., Keeping science on keel when software moves [ExtraQuote]
QuoteRef: ahoAV7_1976 ;;Aho, A.V., Johnson, S.C., Optimal code generation for expression trees
QuoteRef: ahoAV1_1977 ;;Aho, A.V. et al., Code generation for expressions with common subexpressions
QuoteRef: aignM10_2015 ;;Aigner, A. et al., Fast, multicore-scalable, low-fragmentation memory allocation through large virtual memory and global data structures
QuoteRef: aikeA6_2003 ;;Aiken, A. et al., Checking and inferring local non-aliasing
QuoteRef: ailoN2_2010 ;;Ailon, N., Chazelle, B., Faster dimension reduction
QuoteRef: aitkH1_1989 ;;Ait-Kaci, H. et al., Efficient implementation of lattice operations
QuoteRef: akerB10_2015 ;;Akerblom, B., Wrigstad, T., Measuring polymorphism in python programs
QuoteRef: akerD7_2012 ;;Akers, D. et al., Backtracking events as indicators of usability problems in creation-oriented applications
QuoteRef: akguT4_2004 ;;Akgul, T., Mooney, V.J., Assembly instruction level reverse execution for debugging
QuoteRef: akscRM7_1988 ;;Akscyn, R.M. et al., KMS: A distributed hypermedia system for managing knowledge in organizations [OK]
QuoteRef: akscRM7_1988a ;;Akscyn, R.M. et al., KMS: A distributed hypermedia system for managing knowledge in organizations
QuoteRef: akscRM11_1993 ;;Akscyn, R.M., McCracken, D.L., Design of hypermedia script languages: The KMS experience
QuoteRef: alakJ12_2018 ;;Alakuijala, J. et al., Brotli: a general-purpose data compressor
QuoteRef: alfoM_1980 ;;Alford, M., Software requirements in the 80's: from alchemy to science
QuoteRef: alglJ3_2015 ;;Alglave, J. et al., GPU concurrency: Weak behaviours and programming assumptions
QuoteRef: alglJ7_2021 ;;Alglave, J. et al., Armed cats: Formal concurrency modelling at Arm [ExtraQuote]
QuoteRef: alhaA11_2012 ;;Al-Hafeedh, A. et al., A comparison of index-based Lempel-Ziv LZ77 factorization algorithms
QuoteRef: aliIM8_2020 ;;Ali, I.M. et al., Foundations, properties, and security applications of puzzles: A survey [ExtraQuote]
QuoteRef: alisD2_2015 ;;Alistarh, D. et al., The spraylist: a scalable relaxed priority queue
QuoteRef: alleE10_2003 ;;Allen, E. et al., A first-class approach to genericity
QuoteRef: alleJF11_1983 ;;Allen, J.F., Maintaining knowledge about temporal intervals
QuoteRef: allmE7_2004 ;;Allman, E., A conversation with James Gosling
QuoteRef: allmE8_2011 ;;Allman, E., The robustness principle reconsidered
QuoteRef: allsJ10_2012 ;;Allspaw, J., Fault injection in production
QuoteRef: almaL6_2004 ;;Almagor, L. et al., Finding effective compilation sequences
QuoteRef: alpeB10_2001 ;;Alpern, B. et al., Efficient implementation of java interfaces: Invokeinterface considered harmless
QuoteRef: alstMW12_2021 ;;van Alstyne, M.W. et al., 'In Situ' Data Rights [ExtraQuote]
QuoteRef: alstS7_2005 ;;Alstrup, S. et al., Black box for constant-time insertion in priority queues (note)
QuoteRef: altmE10_2010 ;;Altman, E. et al., Performance analysis of idle programs
QuoteRef: alveP10_2015 ;;Alves, P. et al., Runtime pointer disambiguation
QuoteRef: ambeAH1_2022 ;;Ambe, A.H. et al., From collaborative habituation to everyday togetherness: a long-term study of use of the messaging kettle [ExtraQuote]
QuoteRef: amirA1_1994 ;;Amir, A. et al., Let sleeping files lie: pattern matching in Z-compressed files
QuoteRef: ammeW6_2001 ;;Amme, W. et al., SafeTSA: A type safe and referentially secure mobile-code representation based on static single assignment form
QuoteRef: ammoG1_2002 ;;Ammons, G. et al., Mining specifications
QuoteRef: ancoM6_1998 ;;Ancona, M., Cazzola, W., Static header as sentinel
QuoteRef: andeDG7_2011 ;;Andersen, D.G. et al., FAWN: A fast array of wimpy nodes
QuoteRef: andeJH8_1995 ;;Anderson, J.H., Ramamurthy, S., Using lock-free objects in hard real-time applications
QuoteRef: andeRJ11_1994 ;;Anderson, R.J., Why cryptosystems fail
QuoteRef: andeZ6_2008 ;;Anderson, Z. et al., SharC: checking data sharing strategies for multithreaded C
QuoteRef: andeZ10_2011 ;;Anderson, Z., Gay, D., Composable, nestable, pessimistic atomic statements
QuoteRef: andrM1_2016 ;;Andrysco, M. et al., Printing floating-point numbers. A faster, always correct method
QuoteRef: andrM4_2016 ;;Andrychowicz, M. et al., Secure multiparty computations on Bitcoin
QuoteRef: anglR9_2017 ;;Angles, R. et al., Foundations of modern query languages for graph databases
QuoteRef: antoS4_2010 ;;Antoy, S., Hanus, M., Functional logic programming
QuoteRef: apitG5_2010 ;;Apitz, G. et al., Foundations for designing and evaluating user interfaces based on the crossing paradigm
QuoteRef: aposA4_2016 ;;Apostolico, A. et al., 40 Years of suffix trees
QuoteRef: appeAW5_1988 ;;Appel, A.W., Jacobson, G.J., The world's fastest scrabble program
QuoteRef: appeAW7_1988 ;;Appel, A.W. et al., Real-time concurrent collection on stock multiprocessors
QuoteRef: appeAW4_1998 ;;Appel, A.W., SSA is functional programming
QuoteRef: arbeM2_2018 ;;Arbel-Raviv, M., Brown, T., Harnessing epoch-based reclamation for efficient range queries
QuoteRef: armoP11_2002 ;;Armour, P., Ten unmyths of project estimation
QuoteRef: armsJ9_2010 ;;Armstrong, J., Erlang
QuoteRef: arnoM10_2008 ;;Arnold, M. et al., QVM: An efficient runtime for detecting defects in deployed systems
QuoteRef: arnoM12_2011 ;;Arnold, M. et al., QVM: An efficient runtime for detecting defects in deployed systems
QuoteRef: aronM8_2000 ;;Aron, M., Druschel, P., Soft timers: efficient microsecond software timer support of network processing
QuoteRef: arroD11_2020 ;;Arroyuelo, D. et al., Three success stories about compact data structures [ExtraQuote]
QuoteRef: arsaJJ1_1979 ;;Arsac, J.J., Syntactic source to source transforms and program manipulation
QuoteRef: arulJ3_2013 ;;Arulraj, J. et al., Production-run software failure diagnosis via hardware performance counters
QuoteRef: arulJ3_2014 ;;Arulraj, J. et al., Leveraging the short-term memory of hardware to diagnose production-run software failures [ExtraQuote]
QuoteRef: ashkS3_2016 ;;Ashkiani, S. et al., GPU multisplit
QuoteRef: ashmH9_2000 ;;Ashman, H., Electronic document addressing: dealing with change
QuoteRef: aslaF6_2012 ;;Aslam, F., et. al., Rethinking Java call stack design for tiny embedded devices
QuoteRef: aspnJ11_2007 ;;Aspnes, J., Shah, G., Skip graphs
QuoteRef: asudA2_2021 ;;Asudeh, A. et al., Scalable signal reconstruction for a broad range of applications [ExtraQuote]
QuoteRef: atkiMP6_1987 ;;Atkinson, M.P., Buneman, O.P., Types and persistence in database programming languages
QuoteRef: atkiR_1977 ;;Atkinson, R., Hewitt, C., Synchronization in actor systems
QuoteRef: attiH1_2011 ;;Attiya, H. et al., Laws of order: expensive synchronization in concurrent algorithms cannot be eliminated
QuoteRef: auerJ7_2008 ;;Auerbach, J. et al., Flexible task graphs: a unified restricted thread programming model for Java
QuoteRef: auslM6_1982 ;;Auslander, M., Hopkins, M., An overview of the PL.8 compiler
QuoteRef: auslM5_2011 ;;Auslander, M., Let implementation semantics unlock the pop [Letter to the Editor]
QuoteRef: austTM6_1994 ;;Austin, T.M. et al., Efficient detection of all pointer and array access errors
QuoteRef: avgeT6_2016 ;;Avgerinos, T. et al., Enhancing symbolic execution with veritesting
QuoteRef: awadA4_2016 ;;Awad, A. et al., Silent shredder: zero-cost shredding for secure non-volatile main memory controllers
QuoteRef: awekZB4_2016 ;;Aweke, Z.B. et al., ANVIL: software-based protection against next-generation rowhammer attacks
QuoteRef: axfoTH3_1979 ;;Axford, T.H. et al., ATOL: A simple language with powerful data structuring facilities
QuoteRef: aycoJ6_2003 ;;Aycock, J., A brief history of just-in-time
QuoteRef: ayerA6_1998 ;;Ayers, A. et al., Scalable cross-module optimization
QuoteRef: azatH10_2003 ;;Azatchi, H. et al., An on-the-fly mark and sweep garbage collector based on sliding views
QuoteRef: babiD5_2008 ;;Babic, D., Hu, A.J., Calysto: scalable and precise extended static checking
QuoteRef: bacaR9_2017 ;;Baca, R. et al., Structural XML query processing
QuoteRef: bachCW11_1973 ;;Bachman, C.W., The programmer as navigator
QuoteRef: bachM8_2017 ;;Bacher, M. et al., Spin-it: optimizing moment of inertia for spinnable objects
QuoteRef: bachR1_1997 ;;Bachrach, R., El-Yaniv, R., Online list accessing algorithms and their applications: Recent empirical evidence
QuoteRef: backJ_1973 ;;Backus, J., Programming language semantics and closed applicative languages
QuoteRef: backJ8_1978 ;;Backus, J., The history of Fortran I, II, and III
QuoteRef: backJ8_1978a ;;Backus, J., Can programming be liberated from the von Neumann style? A functional style and its algebra of programs
QuoteRef: backJW1_1954 ;;Backus, J.W., The IBM 701 speedcoding system
QuoteRef: backL12_2011 ;;Backstrom, L. et al., Wherefore art though R3579X? Anonymized social networks, hidden patterns, and structural steganography
QuoteRef: bacoDF10_2000 ;;Bacon, D.F. et al., Guava: a dialect of Java without data races
QuoteRef: bacoDF6_2001 ;;Bacon, D.F. et al., Java without the coffee breaks: a noninstrusive multiprocessor garbage collector
QuoteRef: bacoDF1_2003 ;;Bacon, D.F. et al., A real-time garbage collector with low overhead and consistent utilization
QuoteRef: bacoDF10_2004 ;;Bacon, D.F. et al., A unified theory of garbage collection
QuoteRef: bacoDF6_2005 ;;Bacon, D.F. et al., Syncopation: generational real-time garbage collection in the metronome
QuoteRef: bacoDF6_2012 ;;Bacon, D.F. et al., An then there were none: A stall-free real-time garbage collector for reconfigurable hardware
QuoteRef: bacoDF12_2013 ;;Bacon, D.F. et al., And then there were none: a stall-free real-time garbage collector for reconfigurable hardware
QuoteRef: baeJ2_2020 ;;Bae, J. et al., Interactive clustering: a comprehensive review [ExtraQuote]
QuoteRef: baecR4_1991 ;;Baecker, R. et al., Bringing icons to life
QuoteRef: baezRA11_1996 ;;Baeza-Yates, R.A.,, Gonnet, G.H., Fast text searching for regular expressions or automaton searching on tries
QuoteRef: bahlD8_2002 ;;Bahle, D. et al., Efficient phrase querying with an auxiliary index
QuoteRef: bailG10_2016 ;;Bailly, G. et al., Visual menu techniques
QuoteRef: bailP8_2014 ;;Bailis, P. et al., Quantifying eventual consistency with PBS
QuoteRef: bainE8_2013 ;;Bainomugisha, E. et al., A survey of reactive programming
QuoteRef: baldG8_1987 ;;Baldwin, G., Implementation of physical units
QuoteRef: baldR5_2018 ;;Baldoni, R. et al., A survey of symbolic execution techniques
QuoteRef: ballG2_2014 ;;Ballard, G. et al., Communication costs of Strassen's matrix multiplication
QuoteRef: ballT6_1993 ;;Ball, t., Larus, J.R., Branch prediction for free
QuoteRef: ballT12_1996 ;;Ball, T., Larus, J.R., Efficient path profiling
QuoteRef: ballT1_2003 ;;Ball, T. et al., From symptom to cause: localizing errors in counterexample traces
QuoteRef: ballT3_2005 ;;Ball, T. et al., Polymorphic predicate abstraction
QuoteRef: ballT7_2011 ;;Ball, T. et al., A decade of software model checking with SLAM
QuoteRef: bandS9_2011 ;;Bandhakavi, S. et al., Vetting browser extensions for security vulnerabilities with VEX
QuoteRef: baneA11_2005 ;;Banerjee, A., Naumann, D.A., Ownership confinement ensures representation independence for object-oriented programs
QuoteRef: bankRD11_1993 ;;Banker, R.D. et al., Software complexity and maintenance costs
QuoteRef: bansJP4_1993 ;;Bansler, J.P., Bodker, K., A reappraisal of structured analysis: design in an organizational context
QuoteRef: bansS10_2006 ;;Bansal, S., Aiken, A., Automatic generation of peephole superoptimizers
QuoteRef: baoT10_2013 ;;Bao, T.,, Zhang, X., On-the-fly detection of instability problems in floating-point program execution
QuoteRef: baraK10_2003 ;;Barabash, K. et al., Mostly concurrent garbage collection revisited
QuoteRef: bardGJ12_2001 ;;Badros, G.J. et al., The Cassowary linear arithmetic constraint solving algorithm
QuoteRef: barkK11_2011 ;;Barkati, K., Jouvelot, P., Synchronous programming in audio processing: A lookup table oscillator case study
QuoteRef: barkL9_2009 ;;Barkhuus, L., Brown, B., Unpacking the television: user practices around a changing technology
QuoteRef: barnC11_2011 ;;Barnes, C. et al., The PatchMatch randomized matching algorithm for image manipulation
QuoteRef: barnDT3_1978 ;;Barnard, D.T. et al., Euclid and Modula
QuoteRef: baroDW10_2014 ;;Barowy, D.W. et al., CHECKCELL: Data debugging for spreadsheets
QuoteRef: baroDW11_2018 ;;Barowy, D.W. et al., ExceLint: automatically finding spreadsheet formula errors [ExtraQuote]
QuoteRef: barrD7_1995 ;;Barreau, D., Nardi, B.A., Finding and reminding, file organization from the desktop
QuoteRef: barrET1_2013 ;;Barr, E.T. et al., Automatic detection of floating-point exceptions
QuoteRef: barrET10_2014 ;;Barr, E.T., Marron, M., Tardis: Affordable time-travel debugging in managed runtimes
QuoteRef: barrJ5_2006 ;;Barr, J., Cabrera, L.F., AI gets a brain
QuoteRef: bartA6_2009 ;;Barth, A. et al., Securing frame communication in browsers
QuoteRef: bartA5_2019 ;;Bartoli, A. et al., Enterprise Wi-Fi: we need devices that are secure by default [ExtraQuote]
QuoteRef: baryR12_2004 ;;Bar-Yehuda, R. et al., Local ratio: a unified framework for approximation algorithms
QuoteRef: bassL3_1997 ;;Bass, L. et al., The design of a wearable computer
QuoteRef: bastH8_2006 ;;Bast, H., Weber, I., Type less, find more: Fast autocompletion search with a succinct index
QuoteRef: bastH7_2011 ;;Bast, H., Celikik, M., Fast construction of the HYB index
QuoteRef: bastH5_2013 ;;Bast, H., Celikik, A., Efficient fuzzy selection in large text collections
QuoteRef: batesR11_2004 ;;Bates, R., Schizoid classes
QuoteRef: batsJ8_2013 ;;Batson, J. et al., Spectral sparsification of graphs: theory and algorithms
QuoteRef: baudP8_2021 ;;Baudin, P. et al., The dogged pursuit of bug-free C programs: The Frama-C software analysis platform [ExtraQuote]
QuoteRef: baueFL7_1972 ;;Bauer, F.L., Wossner, H., The 'plankalkul' of Konrad Zuse: a forerunner of today's programming languages
QuoteRef: baymP9_1983 ;;Bayman, P., Mayer, R.E., A diagnosis of beginning programmers' misconceptions of BASIC programming statements
QuoteRef: bealNC_1981 ;;Beale, N.C. et al., An ADA compatible specification language
QuoteRef: beauO5_2020 ;;Beaumont, O. et al., Scheduling on two types of resources: A survey [ExtraQuote]
QuoteRef: beckJD7_1987 ;;Becker, J.D., Arabic word processing
QuoteRef: beckLL10_1982 ;;Beck, L.L., A dynamic storage allocation technique based on memory residence time
QuoteRef: beckN5_1990 ;;Beckmann, N. et al., The R*-tree: An efficient and robust access method for points and rectangles
QuoteRef: bellB10_2008 ;;Bellamy, B. et al., Efficient local type inference
QuoteRef: bellJR6_1973 ;;Bell, J.R., Threaded code
QuoteRef: bellSM10_1990 ;;Bellovin, S.M., Merritt, M., Limitations of the Kerberos Authentication System
QuoteRef: bellT12_1989 ;;Bell, T. et al., Modeling for text compression
QuoteRef: benaM9_2010 ;;Ben-Ari, M., Viewpoint: Objects never? Well, hardly ever!
QuoteRef: benbI4_1984 ;;Benbasat, I., Wand, Y., Command abbreviation behavior in human-computer interaction
QuoteRef: bendMA3_2016 ;;Bender, M.A. et al., B-trees and cache-oblivious b-trees with different-sized atomic keys
QuoteRef: bennRK7_1976 ;;Bennett, R.K., Build: a primitive approach to the design of computer languages and their translators
QuoteRef: bensAR2_2015 ;;Benson, A.R., Ballard, G., A framework for practical parallel fast matrix multiplication
QuoteRef: bensBW2_1999 ;;Benson, B.W., Jr., Inner classes. Closures for the masses
QuoteRef: bentC12_2006 ;;Bentley, C. et al., Implicit array bounds checking on 64-bit architectures
QuoteRef: bentJ10_1983 ;;Bentley, J., Programming Pearls: Writing correct programs
QuoteRef: bentJ3_1984 ;;Bentley, J., Programming pearls: The back of the envelope
QuoteRef: bentJ5_1985 ;;Bentley, J., Programming pearls: A spelling checker
QuoteRef: bentJ2_1986 ;;Bentley, J., Programming pearls: Cutting the Gordian knot
QuoteRef: bentJ9_1987 ;;Bentley, J., Programming pearls. A sample of brilliance
QuoteRef: bentJL1_1997 ;;Bentley, J.L., Sedgewick, R., Fast algorithms for sorting and searching strings
QuoteRef: benzF6_2012 ;;Benz, F. et al., A dynamic program analysis to find floating-point accuracy problems
QuoteRef: bergED11_2000 ;;Berger, E.D. et al., Hoard: A scalable memory allocator for multithreaded applications
QuoteRef: bergED11_2002 ;;Berger, E.D. et al., Reconsidering custom memory allocation
QuoteRef: bergED10_2009 ;;Berger, E.D. et al., Grace: safe multithreaded programming for C/C++
QuoteRef: bergO9_2008 ;;Bergman, O. et al., Improved search engines and navigation preference in personal information systems
QuoteRef: bergT9_1997 ;;Bergin, T., HOPL II - Closing panel: The history of programming: Does our present past have a future?
QuoteRef: bergT3_2010 ;;Bergan, T. et al., CoreDet: A compiler and runtime system for deterministic multithreaded execution
QuoteRef: bernM6_2003 ;;Berndl, M. et al., Pointers-to analysis using BDDs
QuoteRef: bernM9_2008 ;;Bernstein, M. et al., Information scraps: how and why information eludes our personal information management tools
QuoteRef: bernT8_1994 ;;Berners-Lee, T. et al., The world-wide web
QuoteRef: bersBN12_1995 ;;Bershad, B.N. et al., Extensibility, safety and performance in the SPIN operating system
QuoteRef: bertE4_1999 ;;Bertino, E. et al., A flexible authorization mechanism for relational data management systems
QuoteRef: berzAT_1980 ;;Berztiss, A.T., Data abstraction, controlled iteration, and communicating processes
QuoteRef: bessA2_2010 ;;Bessey, A. et al., A few billion lines of code later. Using static analysis to find bugs in the real world
QuoteRef: beszA9_2003 ;;Beszedes, A. et al., Survey of code-size reduction methods
QuoteRef: bezaJ11_2018 ;;Bezanson, J. et al., Julia: dynamism and performance reconciled by design [ExtraQuote]
QuoteRef: bharR3_2008 ;;Bhargava, R. et al., Accelerating two-dimensional page walks for virtualized systems
QuoteRef: bhatP5_2011 ;;Bhattacharya, P., Neamtiu, L., Assessing programming language impact on development and maintenance: A study on C and C++
QuoteRef: bhatP2_2019 ;;Bhat, P., Dutta, K., A survey of various threats and current state of security in Android platform [ExtraQuote]
QuoteRef: bierGM10_2007 ;;Bierman, G.M. et al., Lost in translation: Formalizing proposed extensions to C#
QuoteRef: bierKH1_1988 ;;Bierman, K.H., A proposal for improving optimizer quality via dynamic analysis
QuoteRef: biloW5_1974 ;;Bilofsky, W., Syntax extension and the IMP72 programming language
QuoteRef: birdR2_1995 ;;Bird, R. et al., The KryptoKnight family of light-weight protocols for authentication and key distribution
QuoteRef: birkA10_2004 ;;Birka, A., Ernst, M.D., A practical type system and language for reference immutability
QuoteRef: birmKP2_1987 ;;Birman, K.P., Joseph, T.A., Reliable communication in the presence of failures
QuoteRef: birrAD4_1982 ;;Birrell, A.D. et al., Grapevine: An exercise in distributed computing
QuoteRef: birrAD11_1987 ;;Birrell, A.D. et al., A simple and efficient implementation for small databases
QuoteRef: bishS1_2006 ;;Bishop, S. et al., Engineering with Logic: HOL specification and symbolic-evaluation testing for TCP implementations
QuoteRef: blacS11_2018 ;;Blackshear, S. et al., RacerD: compositional static race detection [ExtraQuote]
QuoteRef: blacSM10_2003 ;;Blackburn, S.M., McKinley, K.S., Ulterior reference counting: fast garbage collection without a long wait
QuoteRef: blacSM6_2004 ;;Blackburn, S.M. et al., Myths and realities: the performance impact of garbage collection
QuoteRef: blacSM6_2008 ;;Blackburn, S.M., McKinley, K.S., Immix: a mark-region garbage collector with space efficiency, fast collection, and mutator performance
QuoteRef: blacSM8_2008 ;;Blackburn, S.M., et. al., Wake up and smell the coffee: evaluation methodology for the 21st century
QuoteRef: blaiDC3_1985 ;;Blair, D.C., Maron, M.E., An evaluation of retrieval effectiveness for a full-text document-retrieval system
QuoteRef: blelGE3_1996 ;;Blelloch, G.E., Programming parallel algorithms
QuoteRef: blooBH7_1970 ;;Bloom, B.H., Space/Time trade-offs in hash coding with allowable errors
QuoteRef: bobrDG7_1980 ;;Bobrow, D.G., Managing reentrant structures using reference counts
QuoteRef: bobrDG9_1986 ;;Bobrow, D.G. et al., Expert systems: perils and promise
QuoteRef: boccRL10_2009 ;;Bocchino, R.L., Jr. et al., A type and effect system for deterministic parallel Java
QuoteRef: bochGV7_1973 ;;Bochmann, G.V., Multiple exits from a loop without the goto
QuoteRef: bocqS10_2012 ;;Bocq, S., Daenen, K., Molecule: using monadic and streaming I/O to compose process networks on the JVM
QuoteRef: bodiR6_2000 ;;Bodik, R. et al., ABCD: Eliminating array bounds checks on demand
QuoteRef: boehHJ6_1993 ;;Boehm, H.-J., Space efficient conservative garbage collection
QuoteRef: boehHJ1_2004 ;;Boehm, H.J., The space cost of lazy reference counting
QuoteRef: boehHJ6_2008 ;;Boehm, H.-J., Adve, S.V., Foundations of the C++ concurrency memory model
QuoteRef: boehHJ6_2009 ;;Boehm, H.-J., Spertus, M., Garbage collection in the next C++ standard
QuoteRef: bohmC5_1966 ;;Bohm, C., Jacopini, G., Flow diagrams, turing machines, and languages with only two formation rules
QuoteRef: bohmC9_2001 ;;Bohm, C. et al., Searching in high-dimensional spaces--Index structures for improving the performance of multimedia databases
QuoteRef: bohmR10_2020 ;;Bohme, R. et al., Responsible vulnerability disclosure in cryptocurrencies [ExtraQuote]
QuoteRef: boisJD6_2000 ;;Boissonnat, J.-D. et al., Triangulations in CGAL [ExtraQuote]
QuoteRef: boisJD6_2009 ;;Boissonnat, J.-D. et al., Incremental construction of the Delaunay triangulation and the Delaunay graph in medium dimension
QuoteRef: bojiH8_2010 ;;Bojinov, H. et al., The emergence of cross channel scripting
QuoteRef: boltRA7_1980 ;;Bolt, R.A., "Put-that-there": Voice and gesture at the graphics interface
QuoteRef: bolzCF7_2009 ;;Bolz, C.F. et al., Tracing the meta-level: PyPy's tracing JIT compiler
QuoteRef: boncPA12_2008 ;;Boncz, P.A. et al., Breaking the memory wall in MonetDB
QuoteRef: bondMD10_2007 ;;Bond, M.D., McKinley, K.S., Probabilistic calling context
QuoteRef: bondMD10_2007a ;;Bond, M.D. et al., Tracking bad apples: Reporting the origin of null and undefined value errors
QuoteRef: bondMD6_2010 ;;Bond, M.D. et al., PACER: proportional detection of data races
QuoteRef: bondMD6_2010b ;;Bond, M.D. et al., Breadcrumbs: efficient context sensitivity for dynamic bug detection analyses
QuoteRef: boocG1_1982 ;;Booch, G., Naming subprograms with clarity
QuoteRef: bootB6_2000 ;;Boothe, B., Efficient algorithms for bidirectional debugging
QuoteRef: bootKS11_1981 ;;Booth, K.S., Authentication of signatures using public key encryption
QuoteRef: bordL12_2006 ;;Bordeaux, L. et al., Propositional satisfiability and constraint programming: a comparative survey
QuoteRef: boreNS9_1988 ;;Borenstein, N.S., Thyberg, C.A., Cooperative work in the Andrew Message System
QuoteRef: boreNS11_1992 ;;Borenstein, N.S., Computational mail as network infrastructure for computer- supported cooperative work
QuoteRef: borgA10_1986 ;;Borgida, A., Exceptions in object-oriented languages
QuoteRef: bornA2_1987 ;;Borning, A., Computer system reliability and nuclear war
QuoteRef: bornA10_1997 ;;Borning, a. et al., Solving linear arithmetic constraints for user interface applications
QuoteRef: bornA11_1997 ;;Borning, A. et al., Constraints for the web
QuoteRef: bornAH11_1986 ;;Borning, A.H., Classes versus prototypes in object-oriented languages
QuoteRef: bornJ4_2016 ;;Bornholt, J. et al., A DNA-based archival storage system
QuoteRef: boroA2_2005 ;;Borodin, A. et al., Link analysis ranking: algorithms, theory and experiments
QuoteRef: boroR11_1998 ;;Borovoy, R. et al., Meme tags and community mirrors: moving from conferences to collaboration
QuoteRef: bosaR4_1962 ;;Bosak, R. et al., An information algebra. Phase 1 report--Language Structure Group of the CODASYL Development Committee
QuoteRef: bostT6_2013 ;;Bostoen, T. et al., Power-reduction techniques for data-center storage systems
QuoteRef: boswA10_2005 ;;Bosworth, A., Learning from the web
QuoteRef: bouiO6_2012 ;;Bouissou O., Chapoutot, A., An operational semantics for Simulink's simulation engine
QuoteRef: boukA6_2020 ;;Boukerche, A. et al., Outilier detection: methods, models, and classification [ExtraQuote]
QuoteRef: boutRT1_1990 ;;Boute, R.T., A heretical view on type embedding
QuoteRef: boutRT4_1992 ;;Boute, R.T., The Euclidean definition of the functions div and mod
QuoteRef: bowlM11_17 ;;Bowling, M. et al., Heads-up limit hold'em poker is solved
QuoteRef: boyaC6_2003 ;;Boyapati, C. et al., Ownership types for safe region-based memory management in real-time Java
QuoteRef: boyaJ4_2017 ;;Boyar, J. et al., Online algorithms with advice: a survey
QuoteRef: boycRF11_1973 ;;Boyce, R.F. et al., Specifying queries as relational expressions
QuoteRef: brabC1_2002 ;;Brabrand, C., Schwartzbach, M.I., Growing languages with metamorphic syntax macros
QuoteRef: bracG10_2004 ;;Bracha, G., Ungar, D., Mirrors: design principles for meta-level facilities of object-oriented programming languages
QuoteRef: bragA4_2010 ;;Bragdon, A. et al., Code bubbles: a working set-based interface for code understanding and maintenance
QuoteRef: bragA5_2010 ;;Bragdon, A. et al., A research demonstration of code bubbles
QuoteRef: branP11_1971 ;;Branquart, P. et al., The composition of semantics in Algol 68
QuoteRef: branR9_1981 ;;Brandshaft, R., Letter to the editor
QuoteRef: branSR6_2014 ;;Brandt, S.R. et al., Concurrent, parallel garbage collection in linear time
QuoteRef: brenRP2_1973 ;;Brent, R.P., Reducing the retrieval time of scatter storage techniques
QuoteRef: brenRP7_1989 ;;Brent, R.P., Efficient implementation of the first-fit strategy for dynamic storage allocation
QuoteRef: brewG12_2011 ;;Brewka, G. et al., Answer set programming at a glance
QuoteRef: brigC7_2022 ;;Bright, C. et al., When satisfiability solving meets symbolic computation [ExtraQuote]
QuoteRef: brigP6_1989 ;;Briggs, P. et al., Coloring heuristics for register allocation
QuoteRef: brinP4_1970 ;;Brinch Hansen, P., The nucleus of a multiprogramming system
QuoteRef: brinP7_1972 ;;Brinch Hansen, P., Structured multiprogramming
QuoteRef: brinP11_1978 ;;Brinch-Hansen, P., Distributed processes: a concurrent programming concept
QuoteRef: brinP4_1999 ;;Brinch Hansen, P., Java's insecure parallelism
QuoteRef: brisN6_2010 ;;Brisaboa, N. et al., Dynamic lightweight text compression
QuoteRef: brodML1_1981 ;;Brodie, M.L., Data abstraction for designing database-intensive applications
QuoteRef: brooFP3_1996 ;;Brooks, F.P., Jr., The computer scientist as toolsmith II
QuoteRef: browD9_2007 ;;Brown, D., A conversation with Jeff Bonwick and Bill Moore
QuoteRef: browF4_2016 ;;Brown, F. et al., How to build static checking systems using orders of magnitude less code
QuoteRef: browN2_2009 ;;Brown, N., Chemoinformatics--An introduction for computer scientists
QuoteRef: browPJ10_1967 ;;Brown, P.J., The ML1 macro processor
QuoteRef: browPS7_1987 ;;Brown, P.S., Gould, J.D., An experimental study of people creating spreadsheets
QuoteRef: browRE7_1976 ;;Brown, R.E., Toward a better language for structured programming
QuoteRef: browSA11_1963 ;;Brown, S.A. et al., A description of APT language
QuoteRef: brucKB3_1996 ;;Bruce, K.B., Progress in programming languages
QuoteRef: brueB8_1983 ;;Bruegge, B., Hibbard, P., Generalized path expressions: A high level debugging mechanism
QuoteRef: brunJ7_1972 ;;Bruno, J., Steiglitz, K., The expression of algorithms by charts
QuoteRef: brunR1_2018 ;;Bruno, R., Ferreira, P., A study on garbage collection algorithms for big data environments
QuoteRef: buchAL1_2000 ;;Buchsbaum, A.L. et al., Engineering the compression of massive tables: an experimental approach
QuoteRef: buchO5_1976 ;;Buchegger, O., Fuchs, N.E., If 'ELSE' then 'CASE'
QuoteRef: buddTA_1980 ;;Budd, T.A. et al., Theoretical and empirical studies on using program mutation to test the functional correctness of programs
QuoteRef: buneP1_1981 ;;Buneman, P., Winston, I., The use of data type information in an interactive database environment
QuoteRef: buneP5_1986 ;;Buneman, P., Atkinson, M., Inheritance and persistence in database programming languages
QuoteRef: buneP3_1994 ;;Buneman, P. et al., Comprehension syntax
QuoteRef: burcS10_2010 ;;Burckhardt, S. et al., Concurrent programming with revisions and isolation types
QuoteRef: burgRG5_1996 ;;Burger, R.G., Dybvig, R.K., Printing floating-point numbers quickly and accurately
QuoteRef: burnA11_2017 ;;Burns, A., Davis, R.I., A survey of research into mixed criticality systems
QuoteRef: burrM2_1990 ;;Burrows, M. et al., A logic of authentication
QuoteRef: burrWE8_1983 ;;Burr, W.E., An Overview of the proposed american national standard for local distributed data interfaces
QuoteRef: butlRW12_1991 ;;Butler, R.W., Finelli, G.B., The infeasibility of experimental quantification of life- critical software reliability
QuoteRef: buytD1_2008 ;;Buytaert, D. et al., Using HPM-sampling to drive dynamic compilation
QuoteRef: byrnMD10_1991 ;;Byrne, M.D., The misunderstood picture: A study of icon recognition
QuoteRef: byrnMD4_1993 ;;Byrne, M.D., Using icons to find documents: Simplicity is critical
QuoteRef: byrnMD5_1999 ;;Byrne, M.D. et al., The tangled web we wove: A taxonomy of WWW use
QuoteRef: cabaJ5_2016 ;;Caballero, J., Lin, Z., Type inference on executables
QuoteRef: cadaC10_2006 ;;Cadar, C. et al., EXE: automatically generating inputs of death
QuoteRef: caiY6_2012 ;;Cai, Y., Chan, W.K., MagicFuzzer: Scalable deadlock detection for large-scale applications
QuoteRef: calcI12_2018 ;;Calciu, I. et al., How to implement any concurrent data structure
QuoteRef: callO10_2014 ;;Callau, O. et al., On the use of type predicates in object-oriented software: The case of Smalltalk
QuoteRef: calzS10_2016 ;;Calzavara, S. et al., Surviving the web: a journey into web session security
QuoteRef: campB7_1988 ;;Campbell, B., Goodman, J.M., HAM: A general purpose hypertext abstract machine
QuoteRef: campS12_2017 ;;Campani, S. et al., Automatically accelerating non-numerical programs by architecture-compiler co-design
QuoteRef: cannA7_2002 ;;Cannane, A., Williams, H.E., A general-purpose compression scheme for large collections
QuoteRef: cannDJ6_2000 ;;Cannarozzi, D.J. et al., Contaminated garbage Collection
QuoteRef: cantB2_2006 ;;Cantrill, Br., Hidden in plain sight
QuoteRef: caoM6_2016 ;;Cao, M. et al., Prescient memory: exposing weak memory model behavior by looking into the future
QuoteRef: caplM12_1987 ;;Caplinger, M., An information system based on distributed objects
QuoteRef: caraL5_2014 ;;Carata, L. et al., A primer on provenance
QuoteRef: cardN2_2017 ;;Cardwell, N. et al., BBR: congestion-based congestion control
QuoteRef: cardSK7_1980 ;;Card, S.K. et al., The keystroke-level model for user performance time with interactive systems
QuoteRef: cargTA10_1987 ;;Cargill, T.A., Locanthi, B.N., Cheap Hardware support for software debugging and profiling
QuoteRef: carlBD6_2006 ;;Carlstrom, B.D. et al., The ATOMOS transactional programming language
QuoteRef: carrJM8_1984 ;;Carroll, J.M., Carrithers, C., Training wheels in a user interface
QuoteRef: carrJM9_1988 ;;Carroll, J.M., Aaronson, A.P., Learning by doing with simulated intelligent help
QuoteRef: carrN4_1989 ;;Carriero, N., Gelernter, D., Linda in context
QuoteRef: cartDG1_1990 ;;Carta, D.G., Two fast implementations of the "minimal standard" random number generator
QuoteRef: cartL5_1978 ;;Carter, L. et al., Exact and approximate membership testers
QuoteRef: cartR1_1985 ;;Cartwright, R., Types as intervals
QuoteRef: cashPM1_1980 ;;Cashman, P.M., Holt, A_W., A communication-oriented approach to structuring the software maintenance environment
QuoteRef: casiRJ9_1983 ;;Casimir, R.J., Collection of variables
QuoteRef: castJ10_2012 ;;Castanos, J. et al., On the benefits and pitfalls of extending a statically typed language JIT compiler for dynamic scripting languages
QuoteRef: castM3_2008 ;;Castro, M. et al., Better bug reporting with better privacy
QuoteRef: cavaM8_2014 ;;Cavage, M., Pacheco, D., Bringing arbitrary compute to authoritative data
QuoteRef: celkJ7_1981 ;;Celko, J., Letter to the editor.
QuoteRef: cerfVG12_2018 ;;Cerf, V.G., Self-authenticating identifiers
QuoteRef: cerfVG6_2021 ;;Cerf, V.G., It came from outer space! [ExtraQuote]
QuoteRef: chaiGJ_1966 ;;Chaitin, G.J., On the length of programs for computing finite binary sequences
QuoteRef: chaiGJ6_1982 ;;Chaitin, G.J., Register allocation & spilling via graph coloring
QuoteRef: chamB6_2016 ;;Chamith, B. et al., Living on the edge: rapid-toggling probes with cross-modification on x86
QuoteRef: chamB6_2017 ;;Chamith, B. et al., Instruction punning: lightweight instrumentation for x86-64
QuoteRef: chamC4_1995 ;;Chambers, C. et al., A framework for selective recompilation in the presence of complex intermodule dependencies
QuoteRef: chamDD5_1974 ;;Chamberlin, D.D., Boyce, R.F., Sequel: a structured english query language
QuoteRef: chanE3_1978 ;;Chang, E. et al., Abstract data types in Euclid
QuoteRef: chanF6_2008 ;;Chang, F. et al., Bigtable: a distributed storage system for structured data
QuoteRef: chanKM7_1980 ;;Chandy, K.M., Misra, J., A simple model of distributed programs based on implementation-hiding and process autonomy
QuoteRef: chanT8_2007 ;;Chandra, T. et al., Paxos made live -- An engineering perspective
QuoteRef: chaoP1_2011 ;;Chaovalit, P. et al., Discrete wavelet transform-based time series analysis and mining
QuoteRef: chapN5_1978 ;;Chapin, N., Denniston, S.P., Characteristics of a structured program
QuoteRef: chapPC8_2008 ;;Chapin, P.C. et al., Authorization in trust management: features and foundations
QuoteRef: charA5_2011 ;;Charland, A., Leroux, B., Mobile application development: web vs. native
QuoteRef: chauS1_2010 ;;Chaudhuri, S. et al., Continuity analysis of programs
QuoteRef: chavE9_2001 ;;Chavez, E. et al., Searching in metric spaces
QuoteRef: cheaAM9_2000 ;;Cheadle, A.M. et al., Non-stop Haskell
QuoteRef: chenH6_2020 ;;Chen, H. et al., A survey on Ethereum systems security: vulnerabilities, attacks, and defenses [ExtraQuote]
QuoteRef: chenJ2_2020 ;;Chen, J. et al., A survey of compiler testing [ExtraQuote]
QuoteRef: chenJ5_2021 ;;Chen, J., He, F., Leveraging control flow knowledge in SMT solving of program verification [ExtraQuote]
QuoteRef: chenPM9_1996 ;;Chen, P.M. et al., The Rio file cache: surviving operating system crashes
QuoteRef: chenPP3_1976 ;;Chen, P.P.-S., The entity-relationship model--toward a unified view of data
QuoteRef: chenX3_2008 ;;Chen, X. et al., Overshadow: a virtualization-based approach to retrofitting protection in commodity operating systems
QuoteRef: chenY9_2015 ;;Chen, Y. et al., Deterministic replay: A survey
QuoteRef: cherC5_1988 ;;Cherniak, C., Undebuggability and cognitive science
QuoteRef: cherDR_1976 ;;Cheriton, D.R., Man-machine interface design for timesharing systems
QuoteRef: cherDR2_1979 ;;Cheriton, D.R. et al., Thoth, a portable real-time operating system
QuoteRef: cherDR3_1988 ;;Cheriton, D.R., The V distributed system
QuoteRef: cherDR12_1993 ;;Cheriton, D.R., Skeen, D., Understanding the limitations of causally and totally ordered communication
QuoteRef: cherS4_2020 ;;Cherubin, S., Agosta, G., Tools for reduced precision computation: a survey [ExtraQuote]
QuoteRef: chesS9_2010 ;;Chessin, S., Injecting errors for fun and profit
QuoteRef: chiL10_2016 ;;Chi, L., Zhu, X., Hashing techniques: a survey and taxonomy
QuoteRef: chilTM10_1998 ;;Chilimbi, T.M., Larus, J.R., Using generational garbage collection to implement cache- conscious data placement
QuoteRef: chilTM10_2004 ;;Chilimbi, T.M., Hauswirth, M., Low-overhead memory leak detection using adaptive statistical profiling
QuoteRef: chilTM10_2006 ;;Chilimbi, T.,M., Ganapathy, V., HeapMD: Identifying heap-based bugs using anomaly detection
QuoteRef: chinRS3_1991 ;;Chin, R.S., Chanson, S.T., Distributed object-based programming systems
QuoteRef: chisD3_2015 ;;Chisnall, D. et al., Beyond the PDP-11: Architectural support for a memory-safe C abstract machine
QuoteRef: chisD7_2018 ;;Chisnall, D., C is not a low-level language
QuoteRef: chocGV12_2001 ;;Chockler, G.V. et al., Group communication specifications: a comprehensive survey
QuoteRef: chopS8_2010 ;;Chopra, S., Viewpoint: Rights for autonomous artificial agents?
QuoteRef: chouA11_2000 ;;Chou, A. et al., Using meta-level compilation to check FLASH protocol code
QuoteRef: chowFC10_1990 ;;Chow, F.C., Hennessy, J.L., The priority-based coloring approach to register allocation
QuoteRef: chriC8_1966 ;;Christensen, C., On the implementation of AMBIT, a language for symbol manipulation
QuoteRef: chriTW2_2002 ;;Christopher, T.W., What should be in a parallel library
QuoteRef: chunYC1_2000 ;;Chung, Y.C. et al., Reducing sweep time for a nearly empty heap
QuoteRef: churK2_2014 ;;Church, K. et al., A large-scale study of daily information needs captured in situ
QuoteRef: ciacP4_1993 ;;Ciaccia, P., Zezula, P., Estimating accesses in partitioned signature file organizations
QuoteRef: ciapE1_1999 ;;Ciapessoni, E., et al, From formal methods to formally based methods: an industrial experience
QuoteRef: claeK9_2000 ;;Claessen, K., Hughes, J., QuickCheck: a lightweight tool for random testing of Haskell programs
QuoteRef: clarBL9_1973 ;;Clark, B.L., Horning, J.J., Reflections on a language designed to write an operating system
QuoteRef: clarCL5_1997 ;;Clarke, C.L.A., Cormack, G.V., On the use of regular expressions for searching text
QuoteRef: clarDD8_1988 ;;Clark, D.D., The design philosophy of the DARPA Internet protocols
QuoteRef: clarDD12_1995 ;;Clark,D.D., The structuring of systems using upcalls
QuoteRef: clarDG10_1998 ;;Clarke, D.G. et al., Ownership types for flexible alias protection
QuoteRef: clarEM1_1979 ;;Clarke, E.M., Jr., Programming language constructs for which it is impossible to obtain good Hoare axiom systems
QuoteRef: clarEM11_2009 ;;Clarke, E.M. et al., Model checking: algorithmic verification and debugging
QuoteRef: clarLA8_1983 ;;Clarke, L.A., Richardson, D.J., The application of error-sensitive testing strategies to debugging
QuoteRef: clayR4_1978 ;;Clayton, R., letter to the editor
QuoteRef: clebS10_2013 ;;Clebsch, S., Drossopoulou, S., Fully concurrent garbage collection of actors on many-core machines
QuoteRef: clemAT8_2017 ;;Clements, A. et al., The scalable commutativity rule: designing scalable software for multicore processors
QuoteRef: clicC3_1995 ;;Click, C., Cooper, K.D., Combining analyses, combining optimizations
QuoteRef: clifC9_1988 ;;Clifton, C. et al., The design of a document database
QuoteRef: clinWD6_1990 ;;Clinger, W.D., How to read floating point numbers accurately
QuoteRef: clouMJ7_1983 ;;Cloutier, M.J., Friedman, M.J., Precision averaging for real-time analysis
QuoteRef: coatA7_2009 ;;Coates, A. et al., Apprenticeship learning for helicopter control
QuoteRef: coddEF6_1970 ;;Codd, E.F., A relational model of data for large shared data banks
QuoteRef: coddEF12_1979 ;;Codd, E.F., Extending the database relational model to capture more meaning
QuoteRef: coddEF2_1982 ;;Codd, E.F., Relational database: A practical foundation for productivity
QuoteRef: coheJD7_1997 ;;Cohen, J.D., Recursive hashing functions for n-grams
QuoteRef: coheNH10_1991 ;;Cohen, N.H., Technical correspondence: Type-extension type tests can be performed in constant time
QuoteRef: coheS4_1974 ;;Cohen, S., Speakeasy, an evolutionary system
QuoteRef: colbLS6_1989 ;;Colby, L.S., A recursive algebra and query optimization for nested relations
QuoteRef: collC1_1999 ;;Collberg, C., Thomborson, C., Software watermarking: models and dynamic embeddings
QuoteRef: comeDE11_1986 ;;Comer, D.E., Peterson, L.L., Conversation-based mail
QuoteRef: conrM5_1985 ;;Conrad, M., On design principles for a molecular computer
QuoteRef: conwME7_1963 ;;Conway, M.E., Design of a separable transition-diagram compiler
QuoteRef: cookB1_2007 ;;Cook, B. et al., Proving that programs eventually do something good
QuoteRef: cookB5_2011 ;;Cook, B. et al., Proving program termination
QuoteRef: cookCR11_1980 ;;Cook, C.R., Kim, D.J., Best sorting algorithm for nearly sorted lists
QuoteRef: cookRP3_1982 ;;Cook, R.P., Donde, N., An experiment to improve operand addressing
QuoteRef: coonEE1_2010 ;;Coons, K.E. et al., GAMBIT: Effective unit testing for concurrency libraries
QuoteRef: coopKD9_2001 ;;Cooper, K.D. et al., Operator strength reduction
QuoteRef: coopN6_2007 ;;Cooprider, N., Regehr, J., Offline compression for on-chip RAM
QuoteRef: copeG3_1980 ;;Copeland, G., What if mass storage where free?
QuoteRef: copeGP5_1985 ;;Copeland, G.P., Khoshafian, S.N., A decomposition storage model
QuoteRef: cormGV8_2017 ;;Cormack, G.V., Grossman, M.R., Navigating imprecision in relevance assessments on the road to total recall: Roger and me [ExtraQuote]
QuoteRef: corrA5_2000 ;;Corral, A. et al., Closest pair queries in spatial databases
QuoteRef: corrH9_2015 ;;Corrigan-Gibbs, H. et al., Deterring cheating in online environments
QuoteRef: corwJ10_2003 ;;Corwin, J. et al., MJ: a rational module system for Java and its applications
QuoteRef: courPJ10_1971 ;;Courtois, P.J. et al., Concurrent control with "readers" and "writers"
QuoteRef: cousP1_2004 ;;Cousot, P., Cousot, R., An abstract interpretation-based framework for software watermarking
QuoteRef: coxBJ1_1983 ;;Cox, B.J., The object oriented pre-compiler
QuoteRef: coxR3_2008 ;;Cox, R. et al., Xoc, an extension-oriented compiler for systems programming
QuoteRef: cranK11_2017 ;;Crane, K. et al., The heat method of distance computation
QuoteRef: crarK1_2015 ;;Crary, K., Sullivan, M.J., A calculus for relaxed memory
QuoteRef: crusMR6_2022 ;;Crusoe, M.R. et al., Methods included [ExtraQuote]
QuoteRef: cullDE11_1996 ;;Culler, D.E. et al., A practical model of parallel computation
QuoteRef: culpJS12_2010 ;;Culpepper, J.S., Moffat, A., Efficient set intersection for inverted indexing
QuoteRef: currG11_1986 ;;Curry, G., An approach to type safety in a traits system
QuoteRef: curtC6_2018 ;;Curtsinger, C., Berger, E.D., Coz: finding code that counts with causal profiling
QuoteRef: cusuMA6_1997 ;;Cusumano, M.A., Selby, R.W., How Microsoft builds software
QuoteRef: cusuMA1_2021 ;;Cusumano, M.A., Boeing's 737 Max: A failure of management, not just technology [ExtraQuote]
QuoteRef: cyphA4_1991 ;;Cypher, A., Eager: programming repetitive tasks by example
QuoteRef: cytrR10_1991 ;;Cytron, R. et al., Efficiently computing static single assignment form and the control dependence graph
QuoteRef: dacrMF1_2021 ;;Dacrema, M.F. et al., A troubling analysis of reproducibility and progress in recommender systems research [ExtraQuote]
QuoteRef: dahlOJ9_1966 ;;Dahl, O.-J., Nygaard, K., SIMULA, an Algol based simulation language
QuoteRef: daiL4_2009 ;;Dai, L. et al., Shifting the focus from accuracy to recallability: a study of informal note-taking on mobile information technologies
QuoteRef: daiuC_1981 ;;Daiute, C., Taylor, R., Computers and the improvement of writing
QuoteRef: daleRC5_1968 ;;Daley, R.C., Dennis, J.B., Virtual memory, processes, and sharing in MULTICS
QuoteRef: daloB11_2016 ;;Daloze, B. et al., Efficient and thread-safe objects for dynamically-typed languages [ExtraQuote]
QuoteRef: damA7_1988 ;;van Dam, A., Hypertext '87 keynote address
QuoteRef: damaL1_1982 ;;Dama, L., Milner, R., Principal type-schemes for functional programs
QuoteRef: dameF3_1964 ;;Damerau, F., A technique for computer detection and correction of spelling errors
QuoteRef: dantA6_2017 ;;d'Antras, A. et al., Low overhead dynamic binary translation on ARM
QuoteRef: dantL5_2021 ;;D'Antoni, L., Veanes, M., Automata modulo theories [ExtraQuote]
QuoteRef: dargPT10_2006 ;;Darga, P.T., Boyapati, C., Efficient software model checking of data structure properties
QuoteRef: darkRP10_1997 ;;Darken, R.P. et al., The omni-directional treadmill: a locomotion device for virtual worlds
QuoteRef: daruE3_2017 ;;Darulova, E., Kuncak, V., Towards a compiler for reals [ExtraQuote]
QuoteRef: dasM6_2000 ;;Das, M., Unification-based pointer analysis with directional assignments
QuoteRef: daskC2_2009 ;;Daskalakis, C. et al., The complexity of computing a Nash equilibrium
QuoteRef: dautN3_2015 ;;Dautenhahn, N. et al., Nested kernel: An operating system architecture for intra-kernel privilege separation
QuoteRef: daviB6_2003 ;;Davis, B. et al., The case for virtual register machines
QuoteRef: daviJW6_1987 ;;Davidson, J.W., Vaughan, R.A., The effect of instruction set complexity on program size and memory performance
QuoteRef: daviMD_1981 ;;Davis, M.D., Weyuker, E.J., Pseudo-oracles for non-testable programs
QuoteRef: daviRI10_2011 ;;Davis, R.I., Burns, A., A survey of hard real-time scheduling for multiprocessor systems
QuoteRef: daviT3_2015 ;;David, T. et al., Asynchronized concurrency: The secret to scaling concurrent search data structures
QuoteRef: daviY6_2016 ;;David, Y. et al., Statistical similarity of binaries
QuoteRef: daviY6_2017 ;;David, Y. et al., Similarity of binaries through re-optimization
QuoteRef: davoA4_2018 ;;Davoudian, A. et al., A survey of NoSQL stores
QuoteRef: deanJ1_2008 ;;Dean, J., Ghemawat, S., MapReduce: Simplified data processing on large clusters
QuoteRef: debrS1_1998 ;;Debray, S. et al., Alias analysis of executable code
QuoteRef: debrSK3_2000 ;;Debray, S.K., Evans, W., Compiler techniques for code compaction
QuoteRef: decaG10_2007 ;;DeCandia, G. et al., Dynamo: Amazon's highly available key-value store
QuoteRef: defoDC6_2005 ;;Defoe, D.C. et al., Upper bound for defragmenting buddy heaps
QuoteRef: degaP6_2001 ;;Degano, P., Priami, C., Enhanced operational semantics: a tool for describing and analyzing concurrent systems
QuoteRef: deliC4_2017 ;;Delimitrou, C., Kozyrakis, C., Bolt: I know what you did last summer... in the cloud
QuoteRef: deliDC6_2011 ;;D'Elia, D.C. et al., Mining hot calling contexts in small space
QuoteRef: deliNM5_1984 ;;Delisle, N.M. et al., Viewing a programming environment as a single tool
QuoteRef: deliR8_2010 ;;Deline, R. et al., Software development with code maps
QuoteRef: deloC10_2013 ;;DeLozier, C. et al., Ironclass C++: A library-augmented type-safe subset of C++
QuoteRef: demaT5_1989 ;;DeMarco, T., Lister, T., Software development: state of the art vs. state of the practice
QuoteRef: demeA_1978 ;;Demers, A. et al., Data types as values: polymorphism, type-checking, encapsulation
QuoteRef: demeA_1980 ;;Demers, A., Donahue, J., Type-Completeness: as a language principle
QuoteRef: demeA7_1985 ;;Demers, A. et al., Attribute propagation by message passing
QuoteRef: demeA8_1987 ;;Demers, A. et al., Epidemic algorithms for replicated database maintenance
QuoteRef: demeAJ_1980 ;;Demers, A.J., Donahue, J.E., Data Types, parameters and type checking
QuoteRef: demiRA_1977 ;;DeMillo, R.A. et al., Social processes and proofs of theorems and programs
QuoteRef: demiRA5_1979 ;;DeMillo, R.A. et al., Social processes and proofs of theorems and programs
QuoteRef: demsB10_2003 ;;Demsky, B., Rinard, M., Automatic detection and repair of errors in data structures
QuoteRef: demsB2_2013 ;;Demsky, B., Lam, P., Views: Synthesizing fine-grained concurrency control
QuoteRef: dennDE5_1976 ;;Denning, D.E., A lattice model of secure information flow
QuoteRef: dennDE8_1981 ;;Denning, D.E., Sacco, G.M., Timestamps in key distribution protocols
QuoteRef: dennDE4_1984 ;;Denning, D.E., Digital signatures with RSA and other public-key cryptosystems
QuoteRef: dennJB3_1966 ;;Dennis, J.B., Van Horn, E.C., Programming semantics for multiprogrammed computations
QuoteRef: dennPJ3_1982 ;;Denning, P.J., Electronic Junk
QuoteRef: dennPJ3_1995 ;;Denning, P.J., Can there be a science of information?
QuoteRef: dennPJ11_2007 ;;Denning, P.J., The choice uncertainty principle
QuoteRef: dennPJ3_2009 ;;Denning, P.J., Riehle, R.D., The profession of IT: Is software engineering engineering?
QuoteRef: dennPJ2_2021 ;;Denning, P.J., Working set analytics [ExtraQuote]
QuoteRef: dereF8_1979 ;;DeRemer, F., Pennello, T.J., Efficient computation of LALR(1) look-ahead sets
QuoteRef: dereFL6_1975 ;;DeRemer, F.L., Kron, H., Programming-in-the-small versus programming-in-the-large
QuoteRef: dersN5_2021 ;;Dershowitz, N., Viewpoint: Let's be honest [ExtraQuote]
QuoteRef: desaA6_2013 ;;Desai, A. et al., P: Safe asynchronous event-driven programming
QuoteRef: desaA10_2014 ;;Desai, A. et al., Natural proofs for asynchronous programs using almost-synchronous reductions
QuoteRef: desnM7_2013 ;;Desnoyers, M., Proving the correctness of nonblocking data structures
QuoteRef: deutLP1_1981 ;;Deutsch, L.P., Constraints: a uniform model for data and control
QuoteRef: deviJ3_2009 ;;Devietti, J. et al., DMP: Deterministic shared memory multiprocessing
QuoteRef: deviO6_1999 ;;Devillers, O., On deletion in Delaunay triangulations
QuoteRef: dewaRB10_1969 ;;Dewar, R.B.K. et al., The Iltran programming language
QuoteRef: dewaRB6_1975 ;;Dewar, R.B.K., Indirect threaded code
QuoteRef: deyTK6_1991 ;;Dey, T.K. et al., On good triangulations in three dimensions
QuoteRef: dhurD6_2003 ;;Dhurjati, D. et al., Memory safety without runtime checks or garbage collection
QuoteRef: dhurD6_2006 ;;Dhurjati, D. et al., SAFECode: enforcing alias analysis for weakly typed languages
QuoteRef: diasJ1_2010 ;;Dias, J., Ramsey, N., Automatically generating instruction selectors using declarative machine descriptions
QuoteRef: diceD2_2003 ;;Dice, D., Garthwaite, A., Mostly lock-free malloc
QuoteRef: dickGW1_1986 ;;Dickson, G.W. et al., Understanding the effectiveness of computer graphics for decision support: A cumulative experimental approach
QuoteRef: diesSM11_2010 ;;Diesburg, S.M., Wang, A.-I. .A., A survey of confidential data storage and deletion methods
QuoteRef: dietW6_2012 ;;Dietz, W. et al., Understanding integer overflow in C/C++
QuoteRef: dietW11_2018 ;;Dietz, W., Adve, V., Software multiplexing: Share your libraries and statically link them too [ExtraQuote]
QuoteRef: dijkEW9_1965 ;;Dijkstra, E.W., Solution of a problem in concurrent programming control
QuoteRef: dijkEW3_1968 ;;Dijkstra, E.W., Goto statement considered harmful
QuoteRef: dijkEW10_1972 ;;Dijkstra, E.W., The humble programmer
QuoteRef: dijkEW11_1974 ;;Dijkstra, E.W., Self-stabilizing systems in spite of distributed control
QuoteRef: dijkEW12_1989 ;;Dijkstra, E.W., A debate on teaching computing science: On the cruelty of really teaching computing science
QuoteRef: dillI6_2007 ;;Dillig, I. et al., Static error detection using semantic inconsistency inference
QuoteRef: dillI6_2008 ;;Dillig, I. et al., Sound, complete and scalable path-sensitive analysis
QuoteRef: dimoT9_1986 ;;Dimock, T., letter to the editor
QuoteRef: dineF7_2013 ;;de Dinechin, F. et al., On Ziv's rounding test
QuoteRef: dingC5_1999 ;;Ding, C., Kennedy, K., Improving cache performance in dynamic applications through data and computation reorganization at run time
QuoteRef: dingX2_2011 ;;Ding, X. et al., ULCC: A user-level facility for optimizing shared cache performance on multicores
QuoteRef: diseAA9_1986 ;;diSessa, A.A., Abelson, H., Boxer: A reconstructible computational medium
QuoteRef: ditzDR3_1982 ;;Ditzel, D.R., McLellan, H.R., Register allocation for free: The C machine stack cache.
QuoteRef: dobsJ4_1989 ;;Dobson, J., Randell, B., Program verification: Public image and private reality
QuoteRef: dod12_1977 ;;no author, Department of Defense requirements for high order computer programming languages
QuoteRef: doddM1_2015 ;;Dodds, M. et al., A scalable, correct time-stamped stack
QuoteRef: doheJ10_2011 ;;Doherty, J. et al., Kind analysis for MATLAB
QuoteRef: dolaS6_2018 ;;Dolan, S. et al., Bounding data races in space and time [ExtraQuote]
QuoteRef: dolbJ10_1998 ;;Dolby, J., Chien, A.A., An evaluation of automatic object inline allocation techniques
QuoteRef: dolbJ6_2000 ;;Dolby, J., Chien, A.A., An automatic object inlining optimization and its evaluation
QuoteRef: domiP10_2012 ;;Domingos, P., A few useful things to know about machine learning
QuoteRef: donaJ7_1985 ;;Donahue, J., Demers, A., Data types as values
QuoteRef: donaJ7_1985a ;;Donahue, J., Integration mechanisms in Cedar
QuoteRef: dongJJ5_1987 ;;Dongarra, J.J., Grosse, E., Distribution of mathematical software via electronic mail
QuoteRef: dorN6_2003 ;;Dor, N. et al., CSSV: towards a realistic tool for statically detecting all buffer overflows in C
QuoteRef: dosrG1_2006 ;;Dos Reis, G., Stroustrup, B., Specifying C++ concepts
QuoteRef: dossR9_2014 ;;Doss, R., Using goto statements
QuoteRef: doucJR5_1999 ;;Douceur, J.R., Bolosky, W.J., A large-scale study of file-system contents
QuoteRef: dourP6_1999 ;;Dourish, P. et al., Presto: an experimental architecture for fluid interactive document spaces
QuoteRef: dowSP12_2010 ;;Dow, S.P. et al., Parallel prototyping leads to better design results, more divergence, and increased self-efficacy
QuoteRef: drisJR5_1986 ;;Driscoll, J.R. et al., Making data structures persistent
QuoteRef: drosS10_1998 ;;Drossopoulou, S. et al., What is binary compatibility?
QuoteRef: druiA3_1997 ;;Druin, A. et al., KidPad: A design collaboration between children, technologists, and educators
QuoteRef: druiA4_1997 ;;Druin, A., Why do we make technology for kids?
QuoteRef: dubaC6_2012 ;;Dubach, C. et al., Compiling a high-level language for GPUs
QuoteRef: duboK10_2013 ;;Du Bois, K. et al., Bottle graphs: Visualizing scalability bottlenecks in multi-threaded applications
QuoteRef: dubyJJ12_1971 ;;Duby, J.J., Extensible language: A potential user's point of view
QuoteRef: duccR10_2008 ;;Duccournau, R., Perfect hashing as an almost perfect subtype test
QuoteRef: duckGJ6_2018 ;;Duck, G.J., Yap, R.H.C., EffectiveSan: type and memory error detection using dynamically typed C/C++ [ExtraQuote]
QuoteRef: ducoR10_2008 ;;Ducournau, R., Perfect hashing as an almost perfect subtype test
QuoteRef: ducoR10_2009 ;;Ducournau, R. et al., Empirical assessment of object-oriented implementations with multiple inheritance and static typing
QuoteRef: ducoR4_2011 ;;Ducournau, R., Implementing statically typed object-oriented programming languages
QuoteRef: duffT3_2008 ;;Duff, T., A conversation with Kurt Akeley and Pat Hanrahan
QuoteRef: duggD9_2001 ;;Duggan, D., Type-based hot swapping of running modules
QuoteRef: dujaE1_1998 ;;Dujardin, E. et al., Fast algorithms for compressed multimethod dispatch table generation
QuoteRef: dumaJ6_1995 ;;Dumas, J., Parsons, P., Discovering the way programmers think about new programming environments
QuoteRef: dumaS12_2015 ;;Dumais, S. et al., Stuff I've seen: a system for personal information retrieval and re-use
QuoteRef: earlJ2_1970 ;;Earley, J., An efficient context-free parsing algorithm
QuoteRef: earlJ10_1971 ;;Earley, J., Toward an understanding of data structures
QuoteRef: earlJ4_1974 ;;Earley, J., High level operations in automatic programming
QuoteRef: edgaAD3_1979 ;;Edgar, A.D., Lee, S.C., FOCUS microcomputer number system
QuoteRef: edmoJ5_1999 ;;Edmonds, J., Scheduling in the dark
QuoteRef: edwaJ10_2005 ;;Subtext: uncovering the simplicity of programming, OOPSLA'05 Conference Proceedings. 20th Annual ACM Conference on Object-Oriented Programming, Systems, Languages, and Applications
QuoteRef: edwaJ10_2007 ;;Edwards, J., No ifs, ands, or buts. Uncovering the simplicity of conditionals
QuoteRef: edwaWK10_1997 ;;Edwards, W.K. et al., Designing and implementing asynchronous collaborative applications with Bayou
QuoteRef: efeK11_1987 ;;Efe, K., A proposed solution to the problem of levels in error-message generation
QuoteRef: effiL10_2012 ;;Effinger-Dean, L. et al., IFRit: Interference-free regions for dynamic data-race detection
QuoteRef: eganDE5_1989 ;;Egan, D.E. et al., Behavioral evaluation and analysis of a hypertext browser
QuoteRef: egelM2_2012 ;;Egele, M. et al., A survey on automated dynamic malware-analysis techniques and tools
QuoteRef: einiO8_2011 ;;Eini, O., The pain of implementing LINQ providers
QuoteRef: eiseM4_1995 ;;Eisenberg, M., Programmable applications, interpreter meets interface
QuoteRef: elliC2_2000 ;;Ellison, C., Schneier, B., Risks of PKI: E-commerce
QuoteRef: elmaT11_2010 ;;Elmas, T. et al., Goldilocks: a race-aware Java runtime
QuoteRef: elnoEN9_2002 ;;Elnozahy, E.N. et al., A survey of rollback-recovery protocols in message-passing systems
QuoteRef: elwaK6_2013 ;;ElWazeer, K. et al., Scalable variable and data type detection in a binary rewriter
QuoteRef: emmiM1_2007 ;;Emmi, M. et al., Lock allocation
QuoteRef: engbJ5_1999 ;;Engblom, J., Why SpecInt95 should not be used to benchmark embedded systems tools
QuoteRef: englD10_2001 ;;Engler, D. et al., Bugs as deviant behavior: a general approach to inferring errors in systems code
QuoteRef: englDR12_1995 ;;Engler, D.R. et al., Exokernel: an operating system architecture for application- level resource management
QuoteRef: eomY2_2012 ;;hun Eom, Y. et al., DOJ: Dynamically parallelizing object-oriented programs
QuoteRef: eppsD6_2005 ;;Eppstein, D. et al., The skip quadtree: a simple dynamic data structure for multidimensional data
QuoteRef: erbaA12_2012 ;;Erbad, A., Krasic, C., Sender-side buffers and the case for multimedia adaptation
QuoteRef: erdwS10_2015 ;;Erdweg, S. et al., A sound and optimal incremental build system and dynamic dependencies
QuoteRef: ernsJ6_1997 ;;Ernst, J. et al., Code compression
QuoteRef: esmaH7_2012 ;;Esmaelizadeh, H. et al., Looking back and looking forward: power, performance, and upheaval
QuoteRef: eugsPT6_2003 ;;Eugster, P.T. et al., The many faces of publish/subscribe
QuoteRef: evanWS6_2001 ;;Evans, W.S., Fraser, C.W., Bytecode compression via profiled grammar rewriting
QuoteRef: evanWS8_2003 ;;Evans, W.S., Fraser, C.W., Grammar-based compression of interpreted code
QuoteRef: ewics7_1981 ;;Technical Committee 1 of the European Workshop on Industrial computer systems, and Inter. Purdue Workshop on Industrial computer systems., Draft Standard, Industrial Real-time FORTRAN, definition of procedures for the application of FORTRAN for the control of industrial processes.

Related up

Topic: ACM references
ThesaHelp: ACM references a-e
ThesaHelp: ACM references f-l
ThesaHelp: ACM references m-z

Updated barberCB 4/23
Copyright © 2002-2023 by C.B. Barber
Thesa, Avev, and thid-... are trademarks of C.B. Barber