A specification language is a formal language used in computer science.
Unlike most programming languages, which are directly executable formal languages used to implement a system, specification languages are used during systems analysis, requirements analysis and systems design.
Specification languages are generally not directly executed. They describe the system at a much higher level than a programming language. Indeed, it is considered as an error if a requirement specification is cluttered with unnecessary implementation detail, because the specification is meant to describe the what, not the how.
A common fundamental assumption of many specification approaches is that programs are modelled as algebraic or model theory|model-theoretic structures that include a collection of set (mathematics)|sets of data values together with function (mathematics)|functions over those sets. This level of abstraction is commensurate with the view that the correctness of the input/output behaviour of a program takes precedence over all its other properties.
In the property-oriented approach to specification (taken e.g. by Common Algebraic Specification Language|CASL), specifications of programs consist mainly of logical axioms, usually in a logical system in which equality has a prominent role, describing the properties that the functions are required to satisfy - often just by their interrelationship.
This is in contrast to so-called model-based specification|model-oriented specification in frameworks like Vienna Development Method|VDM and Z notation|Z, which consist of a simple realization of the required behaviour.Specifications must be subject to a process of refinement (the filling-in of implementation detail) before they can actually be implemented. The result of such a refinement process is an executable algorithm, which is either formulated in a programming language, or in an executable subset of the specification language at hand. For example, Hartmann pipelines, when
properly applied, may be considered a dataflow specification which is directly executable. Another example is the Actor model which has no specific application content and must be specialized to be executable.
An important use of specification languages is enabling the creation of Mathematical proof|proofs of program correctness (see Automated theorem prover|theorem prover).

A specification language is a formal language used in computer science.
Unlike most programming languages, which are directly executable formal languages used to implement a system, specification languages are used during systems analysis, requirements analysis and systems design.
Specification languages are generally not directly executed. They describe the system at a much higher level than a programming language. Indeed, it is considered as an error if a requirement specification is cluttered with unnecessary implementation detail, because the specification is meant to describe the what, not the how.
A common fundamental assumption of many specification approaches is that programs are modelled as algebraic or model theory|model-theoretic structures that include a collection of set (mathematics)|sets of data values together with function (mathematics)|functions over those sets. This level of abstraction is commensurate with the view that the correctness of the input/output behaviour...