Map
Index
Random
Help
Group
Notes
Related
th

ThesaHelp: references a-b

topic root > Group: all references


--related--
all references
QuoteRef
references a-b
references c-d
references e-f
references g-h
references i-l
references m-o
references p-r
references sa-sz
references t-z

--referenced--
all Thesa topics

Summary

Quotation references starting with 'a' or 'b'.

Group members up

QuoteRef: abadDJ2_2012 ;;Abadi, D.J., Consistency tradeoffs in modern distributed database system design
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: abadM_1996 ;;Abadi, M., Cardelli, L., A theory of objects
QuoteRef: abadM1_1996 ;;Abadi, M., Needham, R., Prudent engineering practice for cryptographic protocols
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: abdaM12_1998 ;;Abdallah, M. et al., One-phase commit: Does it make sense
QuoteRef: abdeA6_2018 ;;Abdelkader, A. et al., Sampling conditions for conforming Voronoi meshing by the VoroCrust algorithm [NewQuotes]
QuoteRef: abdeKA1_1994 ;;Abdel-Ghaffar, K.A.S., El Abbadi, A., An optimal strategy for comparing file copies
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: abelNE_1969 ;;Abel, N.E. et al., Tranquil: A language for an array processing computer
QuoteRef: abraD11_1996 ;;Abramson, D. et al., Relative debugging: A new methodology for debugging scientific applications
QuoteRef: abraD4_1998 ;;Abrahams, D., Exception-safety in generic components
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: abraPW2_1976 ;;Abrahams, P.W., On realism in programming examples
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 [NewQuotes]
QuoteRef: acceM6_1986 ;;Accetta, M. et al., Mach: a new kernel foundation for UNIX
QuoteRef: accoJ3_1997 ;;Accot, J., Zhai, S., Beyond Fitts' law: Models for trajectory-based HCI tasks
QuoteRef: accoJ5_1999 ;;Accot, J., Zhai, S., Performance evaluation of input devices in trajectory-based tasks: an application of the steering law
QuoteRef: accoJ4_2002 ;;Accot, J., Zhai, S., More than dotting the i's -- Foundations for crossing-based interfaces
QuoteRef: acheF9_2000 ;;Achermann, F., Nierstrasz, O., Explicit namespaces
QuoteRef: achuJO6_1981 ;;Achugbue, J.O., On the line breaking problem in text formatting
QuoteRef: ackeD_1979 ;;Ackerman, D., De re propositional attitudes toward integers
QuoteRef: ackeMS_1990 ;;Ackerman, M.S., Malone, T.W., Answer Garden: a tool for growing organizational memory
QuoteRef: ackeMS6_1996 ;;Ackerman, M.S., Starr, B., Social activity indicators for groupware
QuoteRef: ackeWB_1979 ;;Ackerman, W.B., Data flow languages
QuoteRef: ackoRL_1975 ;;Ackoff, R.L., Ernshoff, J.R., Advertising research at Anheuser-Busch, Inc. (1963-68)
QuoteRef: adamEN1_1973 ;;Adams, E.N., III, The concept of time in programming languages
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: adamKA7_1983 ;;Adams, K.A., Halasz, I.M., 25 ways to improve software user manuals
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: adelB_1116 ;;Adelard of Bath, Questiones naturales [NewQuotes]
QuoteRef: adjiW12_1999 ;;Adjie-Winoto, W. et al., The design and implementation of an intentional naming system
QuoteRef: adleBT5_2007 ;;Adler, B.T., Alfaro, L. de, A content-driven reputation system for the Wikipedia
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: adveSV5_1990 ;;Adve, S.V., Hill, M.D., Weak ordering -- a new definition [NewQuotes]
QuoteRef: adveSV12_1996 ;;Adve, S.V., Gharachorloo, K., Shared memory models: a tutorial
QuoteRef: adveSV8_2010 ;;Adve, S.V., Boehm, H.-J., Memory models: a case for rethinking parallel languages and hardware
QuoteRef: adyaA6_2002 ;;Adya, A. et al., Cooperative task management without manual stack management
QuoteRef: adyaA4_2010 ;;Adya, A. et al., Centrifuge: integrated lease management and partitioning for cloud services [NewQuotes]
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: agesO2_1999 ;;Agesen, O., Space and time-efficient hashing of garbage-collected objects
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: aggaCC1_2001 ;;Aggarwal, C.C. et al., On the surprising behavior of distance metrics in high dimensional space
QuoteRef: agraM9_2004 ;;Agrawal, M. et al., PRIMES is in P
QuoteRef: agresWW1_1979 ;;Agresti, W.W., Register Assignment in Tree-structured programs
QuoteRef: ahlbC4_1994 ;;Ahlberg, C., Shneiderman, B., The Alphaslider: A compact and rapid selector
QuoteRef: ahmeR12_1991 ;;Ahmed, R. et al., The Pegasus heterogeneous multidatabase system
QuoteRef: ahnDH2_2021 ;;Ahn, D.H. et al., Keeping science on keel when software moves [NewQuotes]
QuoteRef: ahnY7_2014 ;;Ahn, Y. et al., Monitoring translation lookahead buffers to detect code injection attacks
QuoteRef: ahoAV_1973 ;;Aho, A.V., Ullman, J.D., The Theory of Parsing, Translation, and Compiling. Vol II: Compiling
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: ahoAV4_1979 ;;Aho, A.V. et al., Awk-- A pattern scanning and processing language
QuoteRef: ahoAV_1986 ;;Aho, A.V. et al., Compilers, principles, techniques, and tools
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: aikeH11_1937 ;;Aiken, H., Proposed automatic calculating machine [NewQuotes]
QuoteRef: ailoN2_2010 ;;Ailon, N., Chazelle, B., Faster dimension reduction
QuoteRef: aitkAC3_1932 ;;Aitken, A.C., On interpolation by iteration of proportional parts, without the use of differences [NewQuotes]
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: akidT8_2013 ;;Akidau, T. et al., MillWheel: fault-tolerant stream processing at Internet scale
QuoteRef: akscRM5_1984 ;;Akscyn, R.M., McCracken, D.L., The ZOG approach to database management
QuoteRef: akscRM9_1984 ;;Akscyn, R.M., McCracken, D.L., ZOG and the USS CARL VINSON: Lessons in system development
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: albrAJ11_1983 ;;Albrecht, A.J., Gaffney, J.E., Jr., Software function, source lines of code, and development effort prediction: A software science validation
QuoteRef: aldeW_1958 ;;Alderson, W., The analytical framework for marketing
QuoteRef: alexA_2014 ;;Alexander, A., Infinitesimal: How a dangerous mathematical theory shaped the modern world [NewQuotes]
QuoteRef: alexC_1975 ;;Alexander, C. et al., The Oregon Experiment
QuoteRef: alexC9_1999 ;;Alexander, C., The origins of pattern theory
QuoteRef: alexRT1_2000 ;;Alexander, R.T. et al., Coping with Java programming stress
QuoteRef: alexWG2_1972 ;;Alexander, W.G., How a programming language is used
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 [NewQuotes]
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 [NewQuotes]
QuoteRef: aligD_1305 ;;Alighieri, Dante, Il Convivio
QuoteRef: alisD2_2015 ;;Alistarh, D. et al., The spraylist: a scalable relaxed priority queue
QuoteRef: alkhAJMM_825 ;;Al-Khwarizmi, A. J. M. M., Arithmetic
QuoteRef: alkhAJMM_825a ;;Al-Khwarizmi, A. J. M. M. (appendix to his book, ca 825), The Toledan regule (Liber Alchorismi, part II): a twelfth-century arithmetical miscellany
QuoteRef: alkhMM_825 ;;Al-Khowarizmi, Mohammed ibn Musa, Algoritmi de numero Indorum ("Al-Khowarizmi Concerning the Hindu Art of Reckoning"). The Book of Algebra and Almucabola. [OK]
QuoteRef: alkhMM_825a ;;Al-Khowarizmi, Mohammed ibn Musa, algorism
QuoteRef: alleA8_2014 ;;Allevato, A., Edwards, S.H., Dereferee: instrumenting C++ pointers with meaningful runtime diagnostics
QuoteRef: alleE10_2003 ;;Allen, E. et al., A first-class approach to genericity
QuoteRef: alleFE_1982 ;;Allen, F.E., A technological review of the FORTRAN I compiler
QuoteRef: alleJF11_1983 ;;Allen, J.F., Maintaining knowledge about temporal intervals
QuoteRef: alleL_1993 ;;Allen, L. et al., ClearCase MultiSite: Supporting geographically-distributed software development
QuoteRef: alleRB_2000 ;;Alley, R.B., The Two-Mile Time Machine [NewQuotes]
QuoteRef: allmE7_1983 ;;Allman, E., SENDMAIL -- An internetwork mail router
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: alluY7_2017 ;;Allu, Y. et al., Backup to the future: how workload and hardware changes continually redefine data domain file systems
QuoteRef: almaL6_2004 ;;Almagor, L. et al., Finding effective compilation sequences
QuoteRef: almePS6_1997 ;;Almeida, P.S., Balloon types: controlling sharing of state in data types
QuoteRef: alonRL9_2004 ;;Alonso, R.L., Evolutionary dead ends (or how good ideas that successfully solve problems are not always the way of the future) [NewQuotes]
QuoteRef: alpeB6_2001 ;;Alpern, B. et al., Efficient dispatch of java interface methods
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 [NewQuotes]
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: aluqAAH_952 ;;Al-Uqlidisi, Abu al-Hassan Ahmad Ibn Ibrahim, Kitab al Fusul Fi al-Hisab al-Hindi
QuoteRef: alurR12_1993 ;;Alur, R., Taubenfeld, G., How to share an object: a fast timing-based solution
QuoteRef: alveP10_2015 ;;Alves, P. et al., Runtime pointer disambiguation
QuoteRef: alzoD_1985 ;;Alzofon D., Raskin, J., SwyftCard. Using SwyftCard on the Apple IIe: a guide, glossary, and reference manual
QuoteRef: ambeAH1_2022 ;;Ambe, A.H. et al., From collaborative habituation to everyday togetherness: a long-term study of use of the messaging kettle [NewQuotes]
QuoteRef: amblO5_1974 ;;Amble, O., Knuth, D.E., Ordered hash tables
QuoteRef: amblSW5_2007 ;;Ambler, S.W., Test-driven development of relational databases
QuoteRef: ambrW3_1994 ;;Ambrosch, W. et al., Dependence-conscious global register allocation
QuoteRef: amenN7_2001 ;;Amenta, N. et al., The power crust, unions of balls, and the medial axis transform [NewQuotes]
QuoteRef: amesSR7_1983 ;;Ames, S.R. et al., Security kernel design and implementation: an introduction
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: amzaC2_1996 ;;Amza, C. et al., TreadMarks: shared memory computing on networks of workstations
QuoteRef: ancoM6_1998 ;;Ancona, M., Cazzola, W., Static header as sentinel
QuoteRef: andaBC5_2009 ;;Anda, B.C.D. et al., Variability and reproducibility in software engineering: A study of four companies that developed the same system
QuoteRef: andeDG7_2011 ;;Andersen, D.G. et al., FAWN: A fast array of wimpy nodes
QuoteRef: andeEA6_2004 ;;Anderson, E.A. et al., Subversion as a threat in information warfare
QuoteRef: andeJ6_2010 ;;Andersen, J., Lawall, J.L., Generic patch inference
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: andeRJ5_1996 ;;Anderson, R.J., Bezuidenhoudt, S.J., On the reliability of electronic payment systems
QuoteRef: andeT_1985 ;;Anderson, T., Witty, R.W., Safe programming
QuoteRef: andeVR_2003 ;;Andem, V.R., A cryptanalysis of the tiny encryption algorithm
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: anelIH2_2012 ;;Anellis, I.H., Peirce's truth-functional analysis and the origin of the truth table
QuoteRef: anglR9_2017 ;;Angles, R. et al., Foundations of modern query languages for graph databases
QuoteRef: anhVN1_2005 ;;Anh, V.N., Moffat, A., Inverted index compression using word-aligned binary codes
QuoteRef: anhVN2_2010 ;;Anh, V.N., Moffat, A., Index compression using 64-bit words
QuoteRef: antoS4_2010 ;;Antoy, S., Hanus, M., Functional logic programming
QuoteRef: aoeJI9_1992 ;;Aoe, J.-I. et al., An efficient implementation of trie structures
QuoteRef: apitG5_2010 ;;Apitz, G. et al., Foundations for designing and evaluating user interfaces based on the crossing paradigm
QuoteRef: apiwT3_2007 ;;Apiwattanapong, T. et al., JDiff: A differencing technique and tool for object-oriented programs
QuoteRef: aposA4_2016 ;;Apostolico, A. et al., 40 Years of suffix trees
QuoteRef: appeAW6_1987 ;;Appel, A.W., Garbage collection can be faster than stack allocation
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: appeAW_1992 ;;Appel, A.W., Compiling with continuations
QuoteRef: appeAW4_1998 ;;Appel, A.W., SSA is functional programming
QuoteRef: appl_1988 ;;Apple Computer, Inc., Apple Numerics Manual
QuoteRef: apple_1987 ;;Apple Computer, Inc., Human Interface Guidelines: The Apple desktop interface
QuoteRef: aquiT_1273 ;;Aquinas, T., Summa Theologiae
QuoteRef: arbeM2_2018 ;;Arbel-Raviv, M., Brown, T., Harnessing epoch-based reclamation for efficient range queries
QuoteRef: arbiMA_1987 ;;Arbib, M.A. et al., Schemas that integrate vision and touch for hand control
QuoteRef: arch_212 ;;Archimedes, On floating bodies, Book one
QuoteRef: arch_287 ;;Archimedes, The sand-reckoner
QuoteRef: ardeBW_1980 ;;Arden, B.W., What can be Automated?
QuoteRef: argeL9_2000 ;;Arge, L. et al., Efficient sorting using registers and caches
QuoteRef: aris_322 ;;Aristotle, The Politics of Aristotle
QuoteRef: aris_322a ;;Aristotle (384-322 B.C.), Metaphysics
QuoteRef: aris_322b ;;Aristotle (384-322 B.C.), De Anima (On the Soul)
QuoteRef: aris_323 ;;Aristotle, Physics
QuoteRef: aris_350 ;;Aristotle, Aristotle, Physics [NewQuotes]
QuoteRef: armoP11_2002 ;;Armour, P., Ten unmyths of project estimation
QuoteRef: armsJ9_2010 ;;Armstrong, J., Erlang
QuoteRef: arnaA_1683 ;;Arnauld, A., Nicole, P., Logic or the Art of Thinking [NewQuotes]
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 [NewQuotes]
QuoteRef: arsaJJ1_1979 ;;Arsac, J.J., Syntactic source to source transforms and program manipulation
QuoteRef: arthRTW_2018 ;;Arthur, R.T.W., Leibnitz's syncategorematic actual infinite
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: ashbWR_1956 ;;Ashby, W.R., Design for an intelligence-amplifier
QuoteRef: ashcEA2_1975 ;;Ashcroft, E.A., Proving assertions about parallel programs
QuoteRef: ashkS3_2016 ;;Ashkiani, S. et al., GPU multisplit
QuoteRef: ashmH9_2000 ;;Ashman, H., Electronic document addressing: dealing with change
QuoteRef: askwS4_1985 ;;Askwall, S., Computer supported reading vs. reading text on paper: a comparison of two reading situations
QuoteRef: aslaF6_2012 ;;Aslam, F., et. al., Rethinking Java call stack design for tiny embedded devices
QuoteRef: aslaT10_1996 ;;Aslam, T. et al., Use of a taxonomy of security faults
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 [NewQuotes]
QuoteRef: atkiDL7_2002 ;;Atkins, D.L. et al., Using version control data to evaluate the impact of software tools: A case study of the version editor
QuoteRef: atkiLV9_1979 ;;Atkinson, L.V., Should if...then...else... follow the dodo?
QuoteRef: atkiM7_1995 ;;Atkinson, M., Morrison, R., Orthogonally persistent object systems
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: atleJM1_1993 ;;Atlee, J.M., Gannon, J., State-based model checking of event-driven system requirements
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: augu_400 ;;Saint Augustine of Hippo, Confessions
QuoteRef: augu_420 ;;Saint Augustine of Hippo, De Trinitate
QuoteRef: auguJ10_2015 ;;Augustine, J. et al., Enabling robust and efficient distributed computation in dynamic peer-to-peer networks
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: austRD10_1999 ;;Austin, R.D., The phantom menace
QuoteRef: austTM6_1994 ;;Austin, T.M. et al., Efficient detection of all pointer and array access errors
QuoteRef: aver_1180 ;;Averroes (ibn Rushd), Tahufut Al-Tahafut
QuoteRef: avgeT6_2016 ;;Avgerinos, T. et al., Enhancing symbolic execution with veritesting
QuoteRef: avic_1027 ;;Avicenna (Abu Ali ibn Sina), Kitab al-Shifa' (The Book of Healing)
QuoteRef: avic_1097 ;;Avicenna, Avicenna's Deliverance: Logic [NewQuotes]
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: aycoJ11_2015 ;;Aycock, J., Stringlish: improved English string searching in binary files
QuoteRef: ayerA6_1998 ;;Ayers, A. et al., Scalable cross-module optimization
QuoteRef: ayerAJ_1956 ;;Ayer, A.J., Language, Truth and Logic
QuoteRef: azatH10_2003 ;;Azatchi, H. et al., An on-the-fly mark and sweep garbage collector based on sliding views
QuoteRef: babbC_1826 ;;Babbage, C., On a method of expressing by signs the action of machinery [OK]
QuoteRef: babbC_1864 ;;Babbage, C., Of the analytical engine (Chapter VIII) [OK]
QuoteRef: babeRL6_1985 ;;Baber, R.L., I/O statements in higher programming languages: unnecessary and undesirable
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: bachCW_1964 ;;Bachman, C.W., Williams, S.B., A general purpose programming system for random access memories
QuoteRef: bachCW11_1973 ;;Bachman, C.W., The programmer as navigator
QuoteRef: bachFH7_2013 ;;Bachmann, F.H. et al., Integrate end to end early and often
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_1972 ;;Backus, J., Reduction languages and variable-free programming
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: backJ_1980 ;;Backus, J., Programming in America in the nineteen fifties -- some personal impressions
QuoteRef: backJ3_2021 ;;Backes, J. et al., One-click formal methods [NewQuotes]
QuoteRef: backJW1_1954 ;;Backus, J.W., The IBM 701 speedcoding system
QuoteRef: backJW_1957 ;;Backus, J. et al., The FORTRAN automatic coding system
QuoteRef: backL12_2011 ;;Backstrom, L. et al., Wherefore art though R3579X? Anonymized social networks, hidden patterns, and structural steganography
QuoteRef: backRJ11_1979 ;;Back, R.J.R., Exception handling with multi-exit statements
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: bacoDF6_2002 ;;Bacon, D.F. et al., Space- and time-efficient implementation of the Java object model
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: bacoF_1599 ;;Bacon, F., Francis Bacon's Advice to Fulke Greville on research techniques[1599]
QuoteRef: bacoF_1600 ;;Bacon, Sir Francis, Essay on Dispatch [OK]
QuoteRef: bacoF_1605 ;;Bacon, F., The Advancement of Learning [OK]
QuoteRef: bacoF_1620 ;;Bacon, F., Novum Organum [OK]
QuoteRef: bacoR_1266 ;;Bacon, R., Opus Majus [OK NewQuotes]
QuoteRef: badgL5_1995 ;;Badger, L. et al., Practical domain and type enforcement for UNIX
QuoteRef: baeJ2_2020 ;;Bae, J. et al., Interactive clustering: a comprehensive review [NewQuotes]
QuoteRef: baecR4_1991 ;;Baecker, R. et al., Bringing icons to life
QuoteRef: baerJL5_1989 ;;Baer, J.-L., Lin, Y.-B., Improving quicksort performance with a codeword data structure
QuoteRef: baezR9_1998 ;;Baeza-Yates, R., Navarro, G., Fast approximate string matching in a dictionary
QuoteRef: baezRA8_1989 ;;Baeza-Yates, R.A., String searching algorithms revisited
QuoteRef: baezRA11_1996 ;;Baeza-Yates, R.A.,, Gonnet, G.H., Fast text searching for regular expressions or automaton searching on tries
QuoteRef: baglPR_1969 ;;Bagley, P.R., Extension of programming language concepts
QuoteRef: bahlD8_2002 ;;Bahle, D. et al., Efficient phrase querying with an auxiliary index
QuoteRef: bahnH6_2002 ;;Bahn, H. et al., Efficient replacement of nonuniform objects in web caches
QuoteRef: bahrHP3_1975 ;;Bahrick, H.P. et al., Fifty years of memory for names and faces: A cross-sectional approach
QuoteRef: bailBP7_2001 ;;Bailey, B.P. et al., The effects of interruptions on task performance, annoyance, and anxiety in the user interface
QuoteRef: bailG10_2016 ;;Bailly, G. et al., Visual menu techniques
QuoteRef: bailGV8_1977 ;;Bailey, G.V. et al., Functional requirements and other design features of a manned system research facility
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: bakL3_1991 ;;Bak, L. et al., An overview of the Mjolner BETA system
QuoteRef: bakeBS5_1999 ;;Baker, B.S. et al., Compressing differences of executable code
QuoteRef: bakeFT_1972 ;;Baker, F.T., System quality through structured programming
QuoteRef: bakeFT12_1973 ;;Baker, F.T., Mills, H.D., Chief programmer teams
QuoteRef: bakeJ1_2011 ;;Baker, J. et al., Megastore: providing scalable, highly available storage for interactive services
QuoteRef: bakeJD6_1966 ;;Baker, J.D., Goldstein, I., Batch vs. sequential displays: Effects on human problem solving
QuoteRef: bakeMC_2001 ;;Baker, M.C., The Atoms of Language
QuoteRef: baksA3_2016 ;;Baksa, A. et al., Software on a comet: the Philae Lander's central onboard computer [NewQuotes]
QuoteRef: balaA7_2018 ;;Balazs, A., A comet revisited: lessons learned from Philae's landing [NewQuotes]
QuoteRef: baldG8_1987 ;;Baldwin, G., Implementation of physical units
QuoteRef: baldR5_2018 ;;Baldoni, R. et al., A survey of symbolic execution techniques
QuoteRef: balkB10_2000 ;;Balkenhol, B., Kurtz, S., Universal data compression based on the Burrows-Wheeler transformation: theory and practice
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: ballT7_2000 ;;Ball, T., Larus, J.R., Using paths to measure, explain, and enhance program behavior
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: ballT5_2011 ;;Ball, T. et al., Predictable and progressive testing of multithreaded code
QuoteRef: ballT7_2011 ;;Ball, T. et al., A decade of software model checking with SLAM
QuoteRef: balmL7_2003 ;;Balmelli, L. et al., Computational analysis of mesh simplification using global error [NewQuotes]
QuoteRef: balzRM8_1968 ;;Balzer, R.M., Shirey, R.W., The on-line firing squad simulator
QuoteRef: balzRM3_1974 ;;Balzer, R.M., Language-independent programmer's interface
QuoteRef: balzRM3_1978 ;;Balzer, R.M. et al., Informality in program specifications
QuoteRef: balzRM_1986 ;;Balzer, R.M., Living in the next-generation operating system
QuoteRef: bandD9_2007 ;;Bandyopadhyay, D., Snoeyink, J., Almost-delaunay simplices: robust neighbor relations for imprecise 3D points using CGAL [NewQuotes]
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: bangG2_1999 ;;Banga, G. et al., Resource containers: a new facility for resource management in server systems
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: baraAM3_1978 ;;Barak, A.M., Aharoni, M., A study of machine-level software profile
QuoteRef: baraK10_2003 ;;Barabash, K. et al., Mostly concurrent garbage collection revisited
QuoteRef: baraP8_1964 ;;Baran, P., On Distributed communications: 1. Introduction to distributed communications networks
QuoteRef: baraP8_1964a ;;Baran, P., On Distributed communications: X1. Summary Overview
QuoteRef: baraP8_1964b ;;Baran, P., On distributed communications: IX. Security, secrecy, and tamper-free considerations
QuoteRef: barbLA10_2018 ;;Barba, L.A., The hard road to reproducibility [NewQuotes]
QuoteRef: barbLA8_2022 ;;Barba, L.A., Defining the role of open source software in research reproducibility [NewQuotes]
QuoteRef: barbME7_1983 ;;Barber, M.E., PARSLEY: A new compiler-compiler
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: baroAJ3_1982 ;;Baroody, A.J. Jr., DeWitt, D.J., The impact of run-time schema interpretation in a network data model DBMS
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 [NewQuotes]
QuoteRef: barrD7_1995 ;;Barreau, D., Nardi, B.A., Finding and reminding, file organization from the desktop
QuoteRef: barrET4_2012 ;;Barr, E.T. et al., Cohesive and isolated development with branches
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: barrJD_1986 ;;Barrow, J.D., Tipler, F.J., The Anthropic Cosmological Principle
QuoteRef: barrLA3_2003 ;;Barroso, L.A. et al., Web search for a planet: the Google cluster architecture
QuoteRef: barsM10_2010 ;;Barsky, M. et al., A survey of practical algorithms for suffix tree construction in external memory
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 [NewQuotes]
QuoteRef: bartCW7_1974 ;;Barth, C.W., Notes on the case statement
QuoteRef: bartH9_2005 ;;Barth, H. et al., Abstract number and arithmetic in preschool children
QuoteRef: bartW12_1977 ;;Bartussek, W., Parnas, D.L., Using assertions about traces to write abstract specifications for software modules
QuoteRef: baryR12_2004 ;;Bar-Yehuda, R. et al., Local ratio: a unified framework for approximation algorithms
QuoteRef: baryZ8_2002 ;;Bar-Yossef, Z. et al., Counting distinct elements in a data stream
QuoteRef: basiA5_2016 ;;Basiri, A. et al., Chaos Engineering [NewQuotes]
QuoteRef: basiVR9_1975 ;;Basili, V.R., Turner, A.J., Iterative enhancement: A practical technique for software development
QuoteRef: basiVR5_1982 ;;Basili, V.R., Mills, H.D., Understanding and documenting programs
QuoteRef: basiVR12_1987 ;;Basili, V.R., Selby, R.W., Comparing the effectiveness of software testing strategies
QuoteRef: bassL3_1997 ;;Bass, L. et al., The design of a wearable computer
QuoteRef: bassPG7_1987 ;;Bassett, P.G., Frame-based software engineering
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: bateD_1974 ;;Bates, D., Commercial Language Systems: International Computer State of the Art Report
QuoteRef: bateD_1976 ;;Bates, D., Structured Programming: International State of the Art Report
QuoteRef: bateF_1970 ;;Bates, F., Programming Language / One
QuoteRef: bateFH12_2001 ;;van Batenburg, F.H.D., New primitive .del. for APL-style structured control
QuoteRef: bateG_1972 ;;Bateson, Gregory, Steps to an ecology of mind
QuoteRef: bateG_1979 ;;Bateson, Gregory, Mind and Nature: A necessary unity
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 [NewQuotes]
QuoteRef: baueFL7_1972 ;;Bauer, F.L., Wossner, H., The 'plankalkul' of Konrad Zuse: a forerunner of today's programming languages
QuoteRef: baueFL_1976 ;;Bauer, F.L., Programming as an evolutionary process
QuoteRef: baueFL_2002 ;;Bauer, F.L., From the stack principle to ALGOL
QuoteRef: baueL8_2002 ;;Bauer, L. et al., A general and flexible access-control system for the web
QuoteRef: baumEB_2004 ;;Baum, E.F., What is Thought?
QuoteRef: baviA3_2004 ;;Bavier, A. et al., Operating system support for planetary-scale network services
QuoteRef: baxtCJ_1975 ;;Baxter, C.J., Barton, A.R., A language for structured programming
QuoteRef: bayeD6_1991 ;;Bayer, D. et al., Improving the efficiency and reliability of digital time-stamping [NewQuotes]
QuoteRef: bayeR_1972 ;;Bayer, R., Mccreight, E., Organization and maintenance of large ordered indexes
QuoteRef: bayeR_1977 ;;Bayer, R., Schkolnick, M., Concurrency of operations on B-trees
QuoteRef: bayeR_2002 ;;Bayer, R., B-trees and databases, past and future
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: beatJC1_1974 ;;Beatty, J.C., Register assignment algorithm for generation of highly optimized object code
QuoteRef: beauO5_2020 ;;Beaumont, O. et al., Scheduling on two types of resources: A survey [NewQuotes]
QuoteRef: beckE_1973 ;;Becker, Ernest, The Denial of death
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: beckR7_1990 ;;Beckwith, R. et al., Implementing a lexical network
QuoteRef: beemWO11_1987 ;;Beeman, W.O. et al., Hypertext and pluralism: From lineal to non-lineal thinking
QuoteRef: beenK9_2006 ;;Been, K. et al., Dynamic map labeling
QuoteRef: beet5_1989 ;;Beetem, A.F., Beetem, J.F., Introduction to the Galaxy language
QuoteRef: begeML10_1988 ;;Begeman, M.L., Conklin, J., The right tool for the job
QuoteRef: beizB_1984 ;;Beizer, B., Software System Testing and Quality Assurance
QuoteRef: beizB3_1997 ;;Beizer, B., Cleanroom process model: a critical examination
QuoteRef: bekeGA4_1986 ;;Bekey, G.A., Tomovic, R., Robot control by reflex actions
QuoteRef: bekiH_1971 ;;Bekii, H., An introduction to Algol 68
QuoteRef: belaLA3_1976 ;;Belady, L.A., Lehman, M.M., A model of large program development
QuoteRef: belaLA_1979 ;;Belady, L.A., Lehman, M.M., The characteristics of large systems
QuoteRef: belaLA10_1980 ;;Belady, L.A., Modifiability of large software systems
QuoteRef: belfPC_1976 ;;Belford, P.C., Taylor, D.S., Specification verification--A key to improving software reliability
QuoteRef: bellB10_2008 ;;Bellamy, B. et al., Efficient local type inference
QuoteRef: bellCG_1971 ;;Bell, C.G., Newell, A., Computer Structures: readings and examples
QuoteRef: bellF6_1991 ;;Bell, F., Grosspietsch, K.-E., Specification of fault-tolerant system issues by predicate/transition nets and regular expressions--approach and case study
QuoteRef: bellJ4_1993 ;;Bell, J., Gupta, G., An evaluation of self-adjusting binary search tree techniques
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: bellT7_1993 ;;Bell, T., Kulp, D., Longest-match string searching for Ziv-Lempel compression
QuoteRef: benaM9_2010 ;;Ben-Ari, M., Viewpoint: Objects never? Well, hardly ever!
QuoteRef: benaP_1965 ;;Benacerraf, P., What numbers could not be
QuoteRef: benaP_1983 ;;Benacerraf, P., Putnam, H., Introduction
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: beneSR4_1914 ;;Benedict, S.R., A comparative study of the early treatises introducing into Europe the Hindu art of reckoning [OK]
QuoteRef: bennRK6_1968 ;;Bennett, R.K., Build... A base for uniform language definition: A user's manual for computer language designers and systems programmers
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: bensJP_1973 ;;Benson, J.P., Structured programming techniques
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: bentJ4_1998 ;;Bentley, J., Sedgewick, B., Ternary search trees
QuoteRef: bentJ11_1998 ;;Bentley, J., Sedgewick, R., Sorting strings with three-way radix quicksort
QuoteRef: bentJ3_1999 ;;Bentley, J., McIlroy, D., Data compression using long common strings
QuoteRef: bentJL_1982 ;;Bentley, J.L., Writing efficient Programs
QuoteRef: bentJL11_1993 ;;Bentley, J.L., McIlroy, M.D., Engineering a sort function
QuoteRef: bentJL1_1997 ;;Bentley, J.L., Sedgewick, R., Fast algorithms for sorting and searching strings
QuoteRef: bentLA8_1978 ;;Benton, L.A., Interactive compiler translates step-by-step and stores translation
QuoteRef: benvA9_1991 ;;Benveniste, A., Berry, G., The synchronous approach to reactive and real-time systems
QuoteRef: benvA1_2003 ;;Benveniste, A. et al., The synchronous languages 12 years later
QuoteRef: benzF6_2012 ;;Benz, F. et al., A dynamic program analysis to find floating-point accuracy problems
QuoteRef: bereG9_1982 ;;Beretta, G. et al., XS-1: An integrated interactive system and its kernel
QuoteRef: bergD12_1985 ;;Bergmark, D., GIBBSGEN: Code generation for GIBBS
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: bergGD10_1981 ;;Bergland, G.D., A guided tour of program design methodologies
QuoteRef: bergN1_2006 ;;Berger, N., The Excel story
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: berkG_1713 ;;Berkeley, G., Three dialogues between Hylas and Philonous
QuoteRef: berkS11_2000 ;;Berkovich, S. et al., A bit-counting algorithm using the frequency division principle
QuoteRef: berlB2_1973 ;;Berlin, B. et al., General principles of classification and nomenclature in folk biology
QuoteRef: bermHJ_1983 ;;Berman, H.J., Law and Revolution. The Formation of the Western Legal Tradition
QuoteRef: bernCL4_1948 ;;Bernier, C.L., Crane, E.J., Indexing abstracts
QuoteRef: bernG12_2001 ;;Bernat, G., Gayssials, R., Guaranteed on-line weakly-hard real-time systems
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: bernN_1935 ;;Bernstein, N., The problem of the interrelation of co-ordination and localization
QuoteRef: bernN_1940 ;;Bernstein, N., et al, Biodynamics of locomotion
QuoteRef: bernN_1957 ;;Bernstein, N., Some emergent problems of the regulation of motor acts
QuoteRef: bernN_1962 ;;Bernstein, N., Trends in physiology and their relation to cybernetics
QuoteRef: bernN_1967 ;;Bernstein, N., The Co-ordination and regulation of movement
QuoteRef: bernN3_1977 ;;Bernstein, N., Knobe, B., A non-general-purpose operating system
QuoteRef: bernNA_1947 ;;Bernstein, N.A., On Dexterity and Its Development
QuoteRef: bernPA5_1978 ;;Bernstein, P.A. et al., The concurrency control mechanism of SDD-1: A system for distributed databases (the fully redundant case)
QuoteRef: bernPA12_1984 ;;Bernstein, P.A., Goodman, N., An algorithm for concurrency control and recovery in replicated distributed databases
QuoteRef: bernT3_1989 ;;Berners-Lee, T., Information management: a proposal
QuoteRef: bernT8_1994 ;;Berners-Lee, T. et al., The world-wide web
QuoteRef: berrDM4_1977 ;;Berry, D.M. et al., Pointers and data abstractions in high level languages. I. Language proposals
QuoteRef: berrDM10_2002 ;;Berry, D.M., The inevitable pain of software development: Why there is no silver bullet [ExtraQuote]
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: bertF10_2019 ;;Bertini, F. et al., Can information hiding in social media posts represent a thread? [NewQuotes]
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: bettL5_2006 ;;Bettini, L. et al., Double dispatch in C++
QuoteRef: beylK2_2009 ;;Beyls, K., D'Hollander, K.H., Refactoring for data locality
QuoteRef: bezaJ11_2018 ;;Bezanson, J. et al., Julia: dynamism and performance reconciled by design [NewQuotes]
QuoteRef: bhamA2_1998 ;;Bhamidipaty, A., Proebsting, T.A., Very fast YACC-compatible parsers (for very little effort)
QuoteRef: bhanS6_2006 ;;Bhansali, S. et al., Framework for instruction-level tracing and analysis of program executions
QuoteRef: bharR3_2008 ;;Bhargava, R. et al., Accelerating two-dimensional page walks for virtualized systems
QuoteRef: bhas_1150 ;;Bhascara Acharya, Arithmetic (Lilavati) and Algebra (Vija-ganita) of Bhascara's Course of Astronomy (Sidd'uanta-siromani)
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 [NewQuotes]
QuoteRef: bhatS4_1997 ;;Bhattacharjee, S. et al., Application-layer anycasting
QuoteRef: bhatWA9_2018 ;;Bhat, W.A., Is a data-capacity gap inevitable in big data storage?
QuoteRef: bianMH_1976 ;;Bianchi, M.H., Wood, J.L., A user's viewpoint of the programmer's workbench
QuoteRef: biasR9_1991 ;;Bias, R., Walkthroughs: Efficient collaborative testing
QuoteRef: bierAW1_1983 ;;Biermann, A.W. et al., An experimental study of natural language programming
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: bigeJ11_1987 ;;Bigelow, J., Riley, V., Manipulating source code in DynamicDesign
QuoteRef: bigeJ3_1988 ;;Bigelow, J., Hypertext and CASE
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: birrAD9_1980 ;;Birrell, A.D., Needham, R.M., A universal file server
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: birrAD_1991 ;;Birrell, A.D., An introduction to programming with threads
QuoteRef: birrAD_1991a ;;Birrell, A.D. et al., Thread synchronization: a formal specification
QuoteRef: bishM10_1986 ;;Bishop, M., How to use USENET effectively
QuoteRef: bishS1_2006 ;;Bishop, S. et al., Engineering with Logic: HOL specification and symbolic-evaluation testing for TCP implementations
QuoteRef: blacR3_1983 ;;Blackwell, R., Console helps programmers code software
QuoteRef: blacS11_2018 ;;Blackshear, S. et al., RacerD: compositional static race detection [NewQuotes]
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: blahM2_2004 ;;Blaha, M., A copper bullet for software quality improvement
QuoteRef: blaiAM_2010 ;;Blair, A.M., Too much to know : Managing scholarly information before the modern age
QuoteRef: blaiD_2006 ;;Blair, D., Wittgenstein, Language and Information: 'Back to the Rough Ground!'
QuoteRef: blaiDC3_1985 ;;Blair, D.C., Maron, M.E., An evaluation of retrieval effectiveness for a full-text document-retrieval system
QuoteRef: blaiDC_1990 ;;Blair, D.C., Language and representation in information retrieval
QuoteRef: blaiDC6_1992 ;;Blair, D.C., Information retrieval and the philosophy of language
QuoteRef: blaiDC1_1996 ;;Blair, D.C., STAIRS redux: Thoughts on the STAIRS evaluation, ten years later
QuoteRef: blakBA3_1996 ;;Blake, B.A., Jalics, P., An assessment of object-oriented methods and C++
QuoteRef: blazM6_1994 ;;Blaze, M., Key management in an encrypting file system
QuoteRef: blazM2_1996 ;;Blaze, M., High-bandwidth encryption with low-bandwidth smartcards
QuoteRef: blazM5_1996 ;;Blaze, M. et al., Decentralized trust management
QuoteRef: blazM_1999 ;;Blaze, M. et al., The role of trust management in distributed systems security
QuoteRef: blelGE3_1996 ;;Blelloch, G.E., Programming parallel algorithms
QuoteRef: blisCK_1965 ;;Bliss, C.K., Semantography (Blissymbolics)
QuoteRef: blocJ_2001 ;;Bloch, J., Effective Java, Programming Language Guide
QuoteRef: blomJ_1995 ;;Blomer, J. et al., An xor-based erasure-resilient coding scheme
QuoteRef: blooBH7_1970 ;;Bloom, B.H., Space/Time trade-offs in hash coding with allowable errors
QuoteRef: blumBI_1985 ;;Blum, B.I., Language, problem solving and system development
QuoteRef: blumBI8_1985 ;;Blum, B.I., On how we get invalid systems
QuoteRef: bobrD1_1977 ;;Bobrow, D., Winograd, T., An overview of KRL, a knowledge representation language
QuoteRef: bobrDG9_1974 ;;Bobrow, D.G., Raphael, B., New programming languages for artificial intellegence research
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: bockDB7_1992 ;;Bock, D.B., Klepper, R., FP-S: A simplified function point counting method
QuoteRef: bocqS10_2012 ;;Bocq, S., Daenen, K., Molecule: using monadic and streaming I/O to compose process networks on the JVM
QuoteRef: bodeMA_2006 ;;Boden, M.A., Mind as machine. A history of cognitive science
QuoteRef: bodiR6_2000 ;;Bodik, R. et al., ABCD: Eliminating array bounds checks on demand
QuoteRef: boebE_2016 ;;Boebert, E., Blossom, J.M., Deepwater Horizon: A Systems Analysis of the Macondo Disaster
QuoteRef: boehBW5_1973 ;;Boehm, B.W., Software and its impact: a quantitative assessment
QuoteRef: boehBW_1976 ;;Boehm, B.W. et al., Quantitative evaluation of software quality
QuoteRef: boehBW12_1976 ;;Boehm, B.W., Software engineering
QuoteRef: boehBW_1978 ;;Boehm, B.W. et al., Characteristics of Software Quality
QuoteRef: boehBW_1979 ;;Boehm, B.W., Software engineering--as it is
QuoteRef: boehBW5_1984 ;;Boehm, B.W. et al., Prototyping versus specifying: A multiproject experiment
QuoteRef: boehHJ6_1993 ;;Boehm, H.-J., Space efficient conservative garbage collection
QuoteRef: boehHJ12_1995 ;;Boehm, H.-J. et al., Ropes: an alternative to strings
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: boehP_1964 ;;Boehner, P., Philosophical Writings: a selection. William of Ockham
QuoteRef: boehSP8_1964 ;;Boehm, S., Baran, P., On Distributed communications: II. Digital simulation of hot-potato routing in a broadband distributed communications network
QuoteRef: boet_500 ;;Boethius, De Institutione Arhimetica
QuoteRef: boetAM_524 ;;Boethius, A.M.S., Consolation of Philosophy
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 [NewQuotes]
QuoteRef: bohrN8_1932 ;;Bohr, N., Light and Life
QuoteRef: bohrN_1934 ;;Bohr, N., Atomic Theory and the Description of Nature
QuoteRef: bohrN_1949 ;;Bohr, N., Discussion with Einstein on epistemological problems in atomic physics
QuoteRef: bohrN_1958 ;;Bohr, N., Atomic Physics and Human Knowledge
QuoteRef: boieSJ6_1974 ;;Boies, S.J., Gould, J.D., Syntactic errors in computer programming
QuoteRef: boisJD6_2000 ;;Boissonnat, J.-D. et al., Triangulations in CGAL [NewQuotes]
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: boltJD11_1987 ;;Bolter, J.D., Joyce, M., Hypertext and creative writing
QuoteRef: boltRA_1979 ;;Bolt, R.A., Spatial Data-Management
QuoteRef: boltRA7_1980 ;;Bolt, R.A., "Put-that-there": Voice and gesture at the graphics interface
QuoteRef: boltRA_1984 ;;Bolt, R.A., The Human Interface
QuoteRef: bolzCF7_2009 ;;Bolz, C.F. et al., Tracing the meta-level: PyPy's tracing JIT compiler
QuoteRef: bonaR_1981 ;;Bonami,R. et al., ITT 1240 Digital Exchange, Architecture
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: bonfIB_1350 ;;Bonfils, I.B.J., Derekh Hilluq
QuoteRef: bongM_1967 ;;Bongard, M., Problema Uznavaniya
QuoteRef: bonwJ6_1994 ;;Bonwick, J., The slab allocator: an object-caching kernel memory allocator
QuoteRef: boocG1_1982 ;;Booch, G., Naming subprograms with clarity
QuoteRef: boocG_1999 ;;Booch, G. et al., The Unified Modeling Language User Guide
QuoteRef: boolG_1847 ;;Boole, G., The Mathematical Analysis of Logic, Being an Essay Towards a Calculus of Deductive Reasoning [OK]
QuoteRef: boolG_1854 ;;Boole, G., An investigation of the laws of thought [OK]
QuoteRef: boolM_1916 ;;Boole, M. (1832, 1916), A Boolean Anthology. Selected writings of Mary Boole on mathematical education
QuoteRef: boomHJ9_1976 ;;Boom, H.J., Extended type checking
QuoteRef: boorDJ11_1979 ;;Boorstin, D.J., Gresham's law: Knowledge or information? The Center for the Book Viewpoint Series N. 3 [NewQuotes]
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: boreN2_1988 ;;Borenstein, N. et al., A multi-media message system for Andrew
QuoteRef: boreNS9_1988 ;;Borenstein, N.S., Thyberg, C.A., Cooperative work in the Andrew Message System
QuoteRef: boreNS_1991 ;;Borenstein, N.S., Programming as if people mattered: friendly programs, software engineering, and other noble delusions
QuoteRef: boreNS11_1992 ;;Borenstein, N.S., Computational mail as network infrastructure for computer- supported cooperative work
QuoteRef: borgA1_1985 ;;Borgida, A., Features of languages for the development of information systems at the conceptual level
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: bornJ3_2014 ;;Bornholt, J. et al., Uncertain: a first-order type for uncertain data
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: borrA8_1984 ;;Borr, A., Robustness to crash in a distributed database: A non shared-memory multi-processor approach
QuoteRef: bosaR4_1962 ;;Bosak, R. et al., An information algebra. Phase 1 report--Language Structure Group of the CODASYL Development Committee
QuoteRef: boscR9_1973 ;;Bosch, R. et al., Aleph, a language encouraging program hierarchy
QuoteRef: bossA8_1996 ;;Bosselaers, A. et al., Fast hashing on the Pentium
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: boswD_2012 ;;Boswell, D., Foucher, T., The Art of Readable Code
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 [NewQuotes]
QuoteRef: bounE5_2015 ;;Bounimova, E. et al., Billions and billions of constraints: Whitebox fuzz testing in production
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: boweJP4_1995 ;;Bowen, J.P., Hinchey, M.G., Ten commandments of formal methods
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: boydRE3_1984 ;;Boydston, R.E., Programming cost estimate: Is it reasonable?
QuoteRef: boylJ5_2001 ;;Boyland, J., Alias burying: unique variables without destructive reads
QuoteRef: boylJ7_2005 ;;Boyland, J., Why we should not add
QuoteRef: boylJM5_1999 ;;Boyle, J.M. et al., Do you trust your compiler?
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: bracG_2016 ;;Bracha, G., The Dart Programming Language
QuoteRef: bracRJ10_1983 ;;Brachman, R.J., What IS-A is and isn't: an analysis of taxonomic links in semantic networks
QuoteRef: bradJT5_1986 ;;Brady, J.T., A theory of productivity in the creative process
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: brah_600 ;;Brahmegupta, Ganitad'hyaya, On Arithmetic; The Twelfth Chapter of the Brahme-Sphuta-Sidd'hanta
QuoteRef: branD10_2000 ;;Brand, D., A software falsifier
QuoteRef: branP11_1971 ;;Branquart, P. et al., The composition of semantics in Algol 68
QuoteRef: branR9_1981 ;;Brandshaft, R., Letter to the editor
QuoteRef: branS_1974 ;;Brand, Stewart, Both sides of the necessary paradox (conversations with Gregory Bateson)
QuoteRef: branSR6_2014 ;;Brandt, S.R. et al., Concurrent, parallel garbage collection in linear time
QuoteRef: brasJ10_2002 ;;Brassil, J., Tracing the source of a shredded document
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: briaD_1996 ;;Brian, D., Einstein: a life
QuoteRef: briaM10_1999 ;;Briand, M., Editor's Forum
QuoteRef: briaM1_2001 ;;Briand, M., The Woods of Complexity [Editor's Forum]
QuoteRef: bricEF11_1991 ;;Brickell, E.F., McCurley, K.S., Interactive identification and digital signatures
QuoteRef: brigC7_2022 ;;Bright, C. et al., When satisfiability solving meets symbolic computation [NewQuotes]
QuoteRef: brigP6_1989 ;;Briggs, P. et al., Coloring heuristics for register allocation
QuoteRef: brinP4_1969 ;;Brinch Hansen, P., RC 4000 software: multiprogramming system, Part 1 General description
QuoteRef: brinP4_1970 ;;Brinch Hansen, P., The nucleus of a multiprogramming system
QuoteRef: brinP7_1972 ;;Brinch Hansen, P., Structured multiprogramming
QuoteRef: brinP_1973 ;;Brinch Hansen, P., Chapter 7, Resource Protection
QuoteRef: brinP12_1973 ;;Brinch-Hansen, P., Concurrent programming
QuoteRef: brinP9_1978 ;;Brinch-Hansen, P., Staunstrup, J., Specification and implementation of mutual exclusion
QuoteRef: brinP11_1978 ;;Brinch-Hansen, P., Distributed processes: a concurrent programming concept
QuoteRef: brinP4_1999 ;;Brinch Hansen, P., Java's insecure parallelism
QuoteRef: brinS4_1998 ;;Brin, S., Page, L., The anatomy of a large-scale hypertextual web search engine
QuoteRef: brinS10_2000 ;;Bringsjord, S. et al., Animals, zombanimals, and the total Turing test
QuoteRef: brisN6_2010 ;;Brisaboa, N. et al., Dynamic lightweight text compression
QuoteRef: britKH3_1981 ;;Britton, K.H. et al., A procedure for designing abstract interfaces for device interface modules
QuoteRef: brodGS_2008 ;;Broda, G.S. et al., Engineering a cache-oblivious sorting algorithm
QuoteRef: brodML1_1981 ;;Brodie, M.L., Data abstraction for designing database-intensive applications
QuoteRef: brogL_1937 ;;de Broglie, L., Matiere et Lumiere
QuoteRef: bron2_2006 ;;Bronnimann, H. et al., The design of the Boost interval arithmetic library
QuoteRef: brooFP_1975 ;;Brooks, F.P., Jr., The Mythical Man-month: essays on software engineering
QuoteRef: brooFP8_1977 ;;Brooks, F.P. Jr., The computer "scientist" as toolsmith--studies in interactive computer graphics
QuoteRef: brooFP_1986 ;;Brooks, F.P., No silver bullet. Essence and accidents of software engineering
QuoteRef: brooFP3_1996 ;;Brooks, F.P., Jr., The computer scientist as toolsmith II
QuoteRef: brooR3_1993 ;;Brooks, R., The case for the specialized interface
QuoteRef: brooR9_1993 ;;Brooks, R., reply to Goran Pop-Jordanov's letter, Prototyping for interface-development
QuoteRef: brooRA_1987 ;;Brooks, R.A., A robust programming scheme for a mobile robot
QuoteRef: brooRA6_1990 ;;Brooks, R.A., Elephants don't play chess
QuoteRef: brooRA1_1991 ;;Brooks, R.A., Intelligence without representation
QuoteRef: brooTA4_1993 ;;Brooks, T.A., All the right descriptors: a test of the strategy of unlimited aliasing
QuoteRef: browAW5_1993 ;;Brown, A.W., An examination of the current state of IPSE technology
QuoteRef: browBR_2019 ;;Brown, B.R., The Apollo Chronicles: Engineering America's First Moon Missions [NewQuotes]
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: browGM6_1989 ;;Brown, G.M. et al., Token systems that self-stabilize
QuoteRef: browGS_1972 ;;Brown, G.S., Laws of Form
QuoteRef: browMH1_1985 ;;Brown, M.H., Sedgewick, R., Techniques for algorithm animation
QuoteRef: browMH5_1988 ;;Brown, M.H., Exploring algorithms using Balsa-II
QuoteRef: browMH12_1992 ;;Brown, M.H., Hershberger, J., Color and sound in algorithm animation
QuoteRef: browMR_1991 ;;Brown, M.R., Nelson, G., I/O streams: abstract types, real programs
QuoteRef: browN2_2009 ;;Brown, N., Chemoinformatics--An introduction for computer scientists
QuoteRef: browPJ10_1967 ;;Brown, P.J., The ML1 macro processor
QuoteRef: browPJ_1969 ;;Brown, P.J., A survey of macro processors
QuoteRef: browPJ_1974 ;;Brown, P.J., Macro Processors and Techniques for Portable Software
QuoteRef: browPJ11_1987 ;;Brown, P.J., Turning ideas into products: the Guide system
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: brunG_1584 ;;Bruno, G., De la causa, principio et uno
QuoteRef: brunG_1584a ;;Bruno, G., La Cena de le ceneri
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: bryaGE_1994 ;;Bryan, G.E., Not all programmers are created equal
QuoteRef: bubeR2_1992 ;;Bubenik, R., Zwaenepoel, W., Optimistic Make
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: buckJD6_1973 ;;Buckley, J.D. et al., Search--a language for retrieval and statistical analysis of medical records
QuoteRef: buddTA_1978 ;;Budd, T.A. et al., The design of a prototype mutation system for program testing
QuoteRef: buddTA_1980 ;;Budd, T.A. et al., Theoretical and empirical studies on using program mutation to test the functional correctness of programs
QuoteRef: budiZ2_1999 ;;Budimlic, Z. et al., The cost of being object-oriented: a preliminary study
QuoteRef: buffJ9_1999 ;;Buffenbarger, J., Gruell, K., A branching/merging strategy for parallel software development
QuoteRef: buhrPA9_2000 ;;Buhr, P.A., Moke, W.Y.R., Advanced exception handling mechanisms
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: burgJP_2015 ;;Burgess, J.P., Rigor and Structure
QuoteRef: burgM7_1995 ;;Burgess, M., A site configuration engine
QuoteRef: burgM12_1998 ;;Burgess, M., Computer immunology [NewQuotes]
QuoteRef: burgRG5_1996 ;;Burger, R.G., Dybvig, R.K., Printing floating-point numbers quickly and accurately
QuoteRef: burgT_1979 ;;Burge, T., Individualism and the mental
QuoteRef: burgWH_1975 ;;Burge, W.H., Recursive Programming Techniques
QuoteRef: burgWH1_1975 ;;Burge, W.H., Stream processing functions
QuoteRef: buriJ_1328 ;;Buridan, J., Quaestiones super libris quattuor De caelo et mundo [NewQuotes]
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: burrM11_2006 ;;Burrows, M., The Chubby lock service for loosely-coupled distributed systems
QuoteRef: burrS2_2007 ;;Burrows, S. et al., Efficient plagiarism detection for large code repositories
QuoteRef: burrWE8_1983 ;;Burr, W.E., An Overview of the proposed american national standard for local distributed data interfaces
QuoteRef: burrou_1972 ;;Burroughs, B6700/B7700 Extended Algol Language: Information Manual
QuoteRef: bursRM8_1977 ;;Burstall, R.M., Goguen, J.A., Putting specifications together
QuoteRef: bushV7_1945 ;;Bush, V., As we may think
QuoteRef: bushV8_1959 ;;Bush, V., Memex II
QuoteRef: butlR12_2000 ;;Butler, R. et al., A national-scale authentication infrastructure
QuoteRef: butlRW12_1991 ;;Butler, R.W., Finelli, G.B., The infeasibility of experimental quantification of life- critical software reliability
QuoteRef: butlRW1_1993 ;;Butler, R.W., Finelli, G.B., The infeasibility of quantifying the reliability of life-critical real-time software
QuoteRef: buttRA4_1975 ;;Butterworth, R.A., Structured symbols
QuoteRef: buxtB_1987 ;;Buxton, B., The "natural" language of interaction: A perspective on nonverbal dialogues
QuoteRef: buxtJN_1962 ;;Buxton, J.N., Laske, J.G., Control and simulation language (CSL)
QuoteRef: buxtJN4_1970 ;;Buxton, J.N., Randell, B., Software Engineering Techniques: Report on a Conference Sponsored by the NATO Science Committee
QuoteRef: buxtW_1986 ;;Buxton, W., There's more to interaction than meets the eye: Some issues in manual input
QuoteRef: buytD1_2008 ;;Buytaert, D. et al., Using HPM-sampling to drive dynamic compilation
QuoteRef: buzzRD1_1975 ;;Buzzell, R.D. et al., Market Share -- A key to profitability.
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: byte4_1982 ;;no author, BYTE

Related up

Depot: QuoteRef
ThesaHelp: references a-b
ThesaHelp: references c-d
ThesaHelp: references e-f
ThesaHelp: references g-h
ThesaHelp: references i-l
ThesaHelp: references m-o
ThesaHelp: references p-r
ThesaHelp: references sa-sz
ThesaHelp: references t-z

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