Skip to search formSkip to main contentSkip to account menu
You are currently offline. Some features of the site may not work correctly.

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… Expand
Wikipedia

Related topics

Related topics

6 relations
DocumentationProgrammerRequirements analysisSoftware documentation
Expand

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
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… Expand
  • figure 1
  • figure 2
  • figure 4
  • figure 3
  • figure 5
Highly Cited
2014
Highly Cited
2014
Improving cache performance using read-write partitioning
Cache read misses stall the processor if there are no independent instructions to execute. In contrast, most cache write misses… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
2014
2014
An algebraic characterization of unary two-way transducers
Two-way transducers are ordinary finite two-way automata that are provided with a one-way write-only tape. They perform a word to… Expand
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… Expand
  • table 1
  • figure 2
  • figure 1
  • figure 3
  • figure 4
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… Expand
  • figure 1
  • figure 2
  • figure 3
Review
2010
Review
2010
An overview of the K semantic framework
K is an executable semantic framework in which programming languages, calculi, as well as type systems or formal analysis tools… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
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… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Highly Cited
2001
Highly Cited
2001
Cracking the 500-Language Problem
Constructing analysis and modification tools for software assets is laborious because you first need to implement the underlying… Expand
  • figure 1
  • table 1
  • figure 2
  • figure 3
  • figure 4
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… Expand
Highly Cited
1978
Highly Cited
1978
The complexity of satisfiability problems
The problem of deciding whether a given propositional formula in conjunctive normal form is satisfiable has been widely studied… Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License
ACCEPT & CONTINUE