Home > Store

Java Coding Guidelines: 75 Recommendations for Reliable and Secure Programs

Register your product to gain access to bonus material or receive a coupon.

Java Coding Guidelines: 75 Recommendations for Reliable and Secure Programs

eBook (Watermarked)

  • Your Price: $25.59
  • List Price: $31.99
  • Includes EPUB, MOBI, and PDF
  • About eBook Formats
  • This eBook includes the following formats, accessible from your Account page after purchase:

    ePub EPUB The open industry format known for its reflowable content and usability on supported mobile devices.

    MOBI MOBI The eBook format compatible with the Amazon Kindle and Amazon Kindle applications.

    Adobe Reader PDF The popular standard, used most often with the free Adobe® Reader® software.

    This eBook requires no passwords or activation to read. We customize your eBook by discreetly watermarking it with your name, making it uniquely yours.

Description

  • Copyright 2014
  • Dimensions: 7" x 9-1/8"
  • Edition: 1st
  • eBook (Watermarked)
  • ISBN-10: 0-13-343951-8
  • ISBN-13: 978-0-13-343951-9

“A must-read for all Java developers. . . . Every developer has a responsibility to author code that is free of significant security vulnerabilities. This book provides realistic guidance to help Java developers implement desired functionality with security, reliability, and maintainability goals in mind.”

–Mary Ann Davidson, Chief Security Officer, Oracle Corporation  

Organizations worldwide rely on Java code to perform mission-critical tasks, and therefore that code must be reliable, robust, fast, maintainable, and secure. Java™ Coding Guidelines brings together expert guidelines, recommendations, and code examples to help you meet these demands.

Written by the same team that brought you The CERT® Oracle ® Secure Coding Standard for Java™, this guide extends that previous work’s expert security advice to address many additional quality attributes.

You’ll find 75 guidelines, each presented consistently and intuitively. For each guideline, conformance requirements are specified; for most, noncompliant code examples and compliant solutions are also offered. The authors explain when to apply each guideline and provide references to even more detailed information.

Reflecting pioneering research on Java security, Java™ Coding Guidelines offers updated techniques for protecting against both deliberate attacks and other unexpected events. You’ll find best practices for improving code reliability and clarity, and a full chapter exposing common misunderstandings that lead to suboptimal code.

With a Foreword by James A. Gosling, Father of the Java Programming Language

Sample Content

Table of Contents

Foreword xi

Preface xiii

Acknowledgments xix

About the Authors xxi

 

Chapter 1: Security 1

1. Limit the lifetime of sensitive data 2

2. Do not store unencrypted sensitive information on the client side 5

3. Provide sensitive mutable classes with unmodifiable wrappers 9

4. Ensure that security-sensitive methods are called with validated arguments 11

5. Prevent arbitrary file upload 13

6. Properly encode or escape output 16

7. Prevent code injection 20

8. Prevent XPath injection 23

9. Prevent LDAP injection 27

10. Do not use the clone() method to copy untrusted method parameters 31

11. Do not use Object.equals() to compare cryptographic keys 34

12. Do not use insecure or weak cryptographic algorithms 36

13. Store passwords using a hash function 37

14. Ensure that SecureRandom is properly seeded 42

15. Do not rely on methods that can be overridden by untrusted code 44

16. Avoid granting excess privileges 50

17. Minimize privileged code 54

18. Do not expose methods that use reduced-security checks to untrusted code 56

19. Define custom security permissions for fine-grained security 64

20. Create a secure sandbox using a security manager 67

21. Do not let untrusted code misuse privileges of callback methods 72

Chapter 2: Defensive Programming 79

22. Minimize the scope of variables 80

23. Minimize the scope of the @SuppressWarnings annotation 82

24. Minimize the accessibility of classes and their members 84

25. Document thread-safety and use annotations where applicable 89

26. Always provide feedback about the resulting value of a method 96

27. Identify files using multiple file attributes 99

28. Do not attach significance to the ordinal associated with an enum 106

29. Be aware of numeric promotion behavior 108

30. Enable compile-time type checking of variable arity parameter types 112

31. Do not apply public final to constants whose value might change in later releases 115

32. Avoid cyclic dependencies between packages 118

33. Prefer user-defined exceptions over more general exception types 121

34. Try to gracefully recover from system errors 123

35. Carefully design interfaces before releasing them 125

36. Write garbage collection–friendly code 128

Chapter 3: Reliability 131

37. Do not shadow or obscure identifiers in subscopes 132

38. Do not declare more than one variable per declaration 134

39. Use meaningful symbolic constants to represent literal values in program logic 138

40. Properly encode relationships in constant definitions 142

41. Return an empty array or collection instead of a null value for methods that return an array or collection 143

42. Use exceptions only for exceptional conditions 146

43. Use a try-with-resources statement to safely handle closeable resources 148

44. Do not use assertions to verify the absence of runtime errors 151

45. Use the same type for the second and third operands in conditional expressions 153

46. Do not serialize direct handles to system resources 157

47. Prefer using iterators over enumerations 159

48. Do not use direct buffers for short-lived, infrequently used objects 162

49. Remove short-lived objects from long-lived container objects 163

Chapter 4: Program Understandability 167

50. Be careful using visually misleading identifiers and literals 167

51. Avoid ambiguous overloading of variable arity methods 171

52. Avoid in-band error indicators 173

53. Do not perform assignments in conditional expressions 175

54. Use braces for the body of an if, for, or while statement 178

55. Do not place a semicolon immediately following an if, for, or while condition 180

56. Finish every set of statements associated with a case label with a break statement 181

57. Avoid inadvertent wrapping of loop counters 183

58. Use parentheses for precedence of operation 186

59. Do not make assumptions about file creation 189

60. Convert integers to floating-point for floating-point operations 191

61. Ensure that the clone() method calls super.clone() 194

62. Use comments consistently and in a readable fashion 196

63. Detect and remove superfluous code and values 198

64. Strive for logical completeness 202

65. Avoid ambiguous or confusing uses of overloading 205

Chapter 5: Programmer Misconceptions 209

66. Do not assume that declaring a reference volatile guarantees safe publication of the members of the referenced object 209

67. Do not assume that the sleep(), yield(), or getState() methods provide synchronization semantics 216

68. Do not assume that the remainder operator always returns a nonnegative result for integral operands 220

69. Do not confuse abstract object equality with reference equality 222

70. Understand the differences between bitwise and logical operators 225

71. Understand how escape characters are interpreted when strings are loaded 228

72. Do not use overloaded methods to differentiate between runtime types 231

73. Never confuse the immutability of a reference with that of the referenced object 234

74. Use the serialization methods writeUnshared() and readUnshared() with care 239

75. Do not attempt to help the garbage collector by setting local reference variables to null 243

Appendix A: Android 245

 

Glossary 249

References 255

Index 263

Updates

Submit Errata

More Information

InformIT Promotional Mailings & Special Offers

I would like to receive exclusive offers and hear about products from InformIT and its family of brands. I can unsubscribe at any time.

Overview


Pearson Education, Inc., 221 River Street, Hoboken, New Jersey 07030, (Pearson) presents this site to provide information about products and services that can be purchased through this site.

This privacy notice provides an overview of our commitment to privacy and describes how we collect, protect, use and share personal information collected through this site. Please note that other Pearson websites and online products and services have their own separate privacy policies.

Collection and Use of Information


To conduct business and deliver products and services, Pearson collects and uses personal information in several ways in connection with this site, including:

Questions and Inquiries

For inquiries and questions, we collect the inquiry or question, together with name, contact details (email address, phone number and mailing address) and any other additional information voluntarily submitted to us through a Contact Us form or an email. We use this information to address the inquiry and respond to the question.

Online Store

For orders and purchases placed through our online store on this site, we collect order details, name, institution name and address (if applicable), email address, phone number, shipping and billing addresses, credit/debit card information, shipping options and any instructions. We use this information to complete transactions, fulfill orders, communicate with individuals placing orders or visiting the online store, and for related purposes.

Surveys

Pearson may offer opportunities to provide feedback or participate in surveys, including surveys evaluating Pearson products, services or sites. Participation is voluntary. Pearson collects information requested in the survey questions and uses the information to evaluate, support, maintain and improve products, services or sites, develop new products and services, conduct educational research and for other purposes specified in the survey.

Contests and Drawings

Occasionally, we may sponsor a contest or drawing. Participation is optional. Pearson collects name, contact information and other information specified on the entry form for the contest or drawing to conduct the contest or drawing. Pearson may collect additional personal information from the winners of a contest or drawing in order to award the prize and for tax reporting purposes, as required by law.

Newsletters

If you have elected to receive email newsletters or promotional mailings and special offers but want to unsubscribe, simply email information@informit.com.

Service Announcements

On rare occasions it is necessary to send out a strictly service related announcement. For instance, if our service is temporarily suspended for maintenance we might send users an email. Generally, users may not opt-out of these communications, though they can deactivate their account information. However, these communications are not promotional in nature.

Customer Service

We communicate with users on a regular basis to provide requested services and in regard to issues relating to their account we reply via email or phone in accordance with the users' wishes when a user submits their information through our Contact Us form.

Other Collection and Use of Information


Application and System Logs

Pearson automatically collects log data to help ensure the delivery, availability and security of this site. Log data may include technical information about how a user or visitor connected to this site, such as browser type, type of computer/device, operating system, internet service provider and IP address. We use this information for support purposes and to monitor the health of the site, identify problems, improve service, detect unauthorized access and fraudulent activity, prevent and respond to security incidents and appropriately scale computing resources.

Web Analytics

Pearson may use third party web trend analytical services, including Google Analytics, to collect visitor information, such as IP addresses, browser types, referring pages, pages visited and time spent on a particular site. While these analytical services collect and report information on an anonymous basis, they may use cookies to gather web trend information. The information gathered may enable Pearson (but not the third party web trend services) to link information with application and system log data. Pearson uses this information for system administration and to identify problems, improve service, detect unauthorized access and fraudulent activity, prevent and respond to security incidents, appropriately scale computing resources and otherwise support and deliver this site and its services.

Cookies and Related Technologies

This site uses cookies and similar technologies to personalize content, measure traffic patterns, control security, track use and access of information on this site, and provide interest-based messages and advertising. Users can manage and block the use of cookies through their browser. Disabling or blocking certain cookies may limit the functionality of this site.

Do Not Track

This site currently does not respond to Do Not Track signals.

Security


Pearson uses appropriate physical, administrative and technical security measures to protect personal information from unauthorized access, use and disclosure.

Children


This site is not directed to children under the age of 13.

Marketing


Pearson may send or direct marketing communications to users, provided that

  • Pearson will not use personal information collected or processed as a K-12 school service provider for the purpose of directed or targeted advertising.
  • Such marketing is consistent with applicable law and Pearson's legal obligations.
  • Pearson will not knowingly direct or send marketing communications to an individual who has expressed a preference not to receive marketing.
  • Where required by applicable law, express or implied consent to marketing exists and has not been withdrawn.

Pearson may provide personal information to a third party service provider on a restricted basis to provide marketing solely on behalf of Pearson or an affiliate or customer for whom Pearson is a service provider. Marketing preferences may be changed at any time.

Correcting/Updating Personal Information


If a user's personally identifiable information changes (such as your postal address or email address), we provide a way to correct or update that user's personal data provided to us. This can be done on the Account page. If a user no longer desires our service and desires to delete his or her account, please contact us at customer-service@informit.com and we will process the deletion of a user's account.

Choice/Opt-out


Users can always make an informed choice as to whether they should proceed with certain services offered by InformIT. If you choose to remove yourself from our mailing list(s) simply visit the following page and uncheck any communication you no longer want to receive: www.informit.com/u.aspx.

Sale of Personal Information


Pearson does not rent or sell personal information in exchange for any payment of money.

While Pearson does not sell personal information, as defined in Nevada law, Nevada residents may email a request for no sale of their personal information to NevadaDesignatedRequest@pearson.com.

Supplemental Privacy Statement for California Residents


California residents should read our Supplemental privacy statement for California residents in conjunction with this Privacy Notice. The Supplemental privacy statement for California residents explains Pearson's commitment to comply with California law and applies to personal information of California residents collected in connection with this site and the Services.

Sharing and Disclosure


Pearson may disclose personal information, as follows:

  • As required by law.
  • With the consent of the individual (or their parent, if the individual is a minor)
  • In response to a subpoena, court order or legal process, to the extent permitted or required by law
  • To protect the security and safety of individuals, data, assets and systems, consistent with applicable law
  • In connection the sale, joint venture or other transfer of some or all of its company or assets, subject to the provisions of this Privacy Notice
  • To investigate or address actual or suspected fraud or other illegal activities
  • To exercise its legal rights, including enforcement of the Terms of Use for this site or another contract
  • To affiliated Pearson companies and other companies and organizations who perform work for Pearson and are obligated to protect the privacy of personal information consistent with this Privacy Notice
  • To a school, organization, company or government agency, where Pearson collects or processes the personal information in a school setting or on behalf of such organization, company or government agency.

Links


This web site contains links to other sites. Please be aware that we are not responsible for the privacy practices of such other sites. We encourage our users to be aware when they leave our site and to read the privacy statements of each and every web site that collects Personal Information. This privacy statement applies solely to information collected by this web site.

Requests and Contact


Please contact us about this Privacy Notice or if you have any requests or questions relating to the privacy of your personal information.

Changes to this Privacy Notice


We may revise this Privacy Notice through an updated posting. We will identify the effective date of the revision in the posting. Often, updates are made to provide greater clarity or to comply with changes in regulatory requirements. If the updates involve material changes to the collection, protection, use or disclosure of Personal Information, Pearson will provide notice of the change through a conspicuous notice on this site or other appropriate way. Continued use of the site after the effective date of a posted revision evidences acceptance. Please contact us if you have questions or concerns about the Privacy Notice or any objection to any revisions.

Last Update: November 17, 2020