Skip to search formSkip to main contentSkip to account menu

Write-only documentation

Known as: Write-only 
Write-only documentation (WOD) is a tongue-in-cheek term for documentation that is written to satisfy a process but never read subsequent to its… 
Wikipedia (opens in a new tab)

Related topics

Related topics

6 relations
DocumentationProgrammerRequirements analysisSoftware documentation

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
A Comprehensive Performance Evaluation of Modern In-Memory Indices
Due to poor cache utilization and latching contention, the B-tree like structures, which have been heavily used in traditional… 
2017
2017
DataLair: Efficient Block Storage with Plausible Deniability against Multi-Snapshot Adversaries
Abstract Sensitive information is present on our phones, disks, watches and computers. Its protection is essential. Plausible… 
Highly Cited
2013
Highly Cited
2013
Stronger Semantics for Low-Latency Geo-Replicated Storage
We present the first scalable, geo-replicated storage system that guarantees low latency, offers a rich data model, and provides… 
Highly Cited
2013
Highly Cited
2013
Regular Functions and Cost Register Automata
We propose a deterministic model for associating costs with strings that is parameterized by operations of interest (such as… 
Highly Cited
2012
Highly Cited
2012
Off-path TCP Sequence Number Inference Attack - How Firewall Middleboxes Reduce Security
In this paper, we report a newly discovered "off-path TCP sequence number inference" attack enabled by firewall middle boxes. It… 
Review
2010
Review
2010
An overview of the K semantic framework
2009
2009
SEMICONDUCTOR INTEGRATED CIRCUITS: Testing content addressable memories with physical fault models
Content addressable memory (CAM) is widely used and its tests mostly use functional fault models. However, functional fault… 
Highly Cited
2008
Highly Cited
2008
Terascale direct numerical simulations of turbulent combustion using S3D
Computational science is paramount to the understanding of underlying processes in internal combustion engines of the future that… 
Highly Cited
1984
Highly Cited
1984
A Trusted Computing Base for Embedded Systems
The structure of many secure systems has been based on the idea of a security kernel—an operating system nucleus that performs… 
Highly Cited
1978
Highly Cited
1978
The complexity of satisfiability problems
  • T. Schaefer
  • Symposium on the Theory of Computing
  • 1978
  • Corpus ID: 17125814
The problem of deciding whether a given propositional formula in conjunctive normal form is satisfiable has been widely studied… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)