Faster access than browser!
25 relations: Acta Informatica, Algorithm, Communications of the ACM, Compiler correctness, Computer memory, Curry–Howard correspondence, Design by contract, Formal specification, Formal system, Formal verification, Halting problem, Hoare logic, Integer, Intuitionistic logic, Lambda calculus, List of mathematical jargon, Mathematical proof, Model checking, Number theory, Perfect number, Program analysis, Program derivation, Proof theory, Termination analysis, Theoretical computer science.
Acta Informatica
Acta Informatica is a peer-reviewed scientific journal publishing original research papers in computer science.
New!!: Correctness (computer science) and Acta Informatica · See more »
Algorithm
In mathematics and computer science, an algorithm is an unambiguous specification of how to solve a class of problems.
New!!: Correctness (computer science) and Algorithm · See more »
Communications of the ACM
Communications of the ACM is the monthly journal of the Association for Computing Machinery (ACM).
New!!: Correctness (computer science) and Communications of the ACM · See more »
Compiler correctness
In computing, compiler correctness is the branch of computer science that deals with trying to show that a compiler behaves according to its language specification.
New!!: Correctness (computer science) and Compiler correctness · See more »
Computer memory
In computing, memory refers to the computer hardware integrated circuits that store information for immediate use in a computer; it is synonymous with the term "primary storage".
New!!: Correctness (computer science) and Computer memory · See more »
Curry–Howard correspondence
In programming language theory and proof theory, the Curry–Howard correspondence (also known as the Curry–Howard isomorphism or equivalence, or the proofs-as-programs and propositions- or formulae-as-types interpretation) is the direct relationship between computer programs and mathematical proofs.
New!!: Correctness (computer science) and Curry–Howard correspondence · See more »
Design by contract
Design by contract (DbC), also known as contract programming, programming by contract and design-by-contract programming, is an approach for designing software.
New!!: Correctness (computer science) and Design by contract · See more »
Formal specification
In computer science, formal specifications are mathematically based techniques whose purpose are to help with the implementation of systems and software.
New!!: Correctness (computer science) and Formal specification · See more »
Formal system
A formal system is the name of a logic system usually defined in the mathematical way.
New!!: Correctness (computer science) and Formal system · See more »
Formal verification
In the context of hardware and software systems, formal verification is the act of proving or disproving the correctness of intended algorithms underlying a system with respect to a certain formal specification or property, using formal methods of mathematics.
New!!: Correctness (computer science) and Formal verification · See more »
Halting problem
In computability theory, the halting problem is the problem of determining, from a description of an arbitrary computer program and an input, whether the program will finish running (i.e., halt) or continue to run forever.
New!!: Correctness (computer science) and Halting problem · See more »
Hoare logic
Hoare logic (also known as Floyd–Hoare logic or Hoare rules) is a formal system with a set of logical rules for reasoning rigorously about the correctness of computer programs.
New!!: Correctness (computer science) and Hoare logic · See more »
Integer
An integer (from the Latin ''integer'' meaning "whole")Integer 's first literal meaning in Latin is "untouched", from in ("not") plus tangere ("to touch").
New!!: Correctness (computer science) and Integer · See more »
Intuitionistic logic
Intuitionistic logic, sometimes more generally called constructive logic, refers to systems of symbolic logic that differ from the systems used for classical logic by more closely mirroring the notion of constructive proof.
New!!: Correctness (computer science) and Intuitionistic logic · See more »
Lambda calculus
Lambda calculus (also written as λ-calculus) is a formal system in mathematical logic for expressing computation based on function abstraction and application using variable binding and substitution.
New!!: Correctness (computer science) and Lambda calculus · See more »
List of mathematical jargon
The language of mathematics has a vast vocabulary of specialist and technical terms.
New!!: Correctness (computer science) and List of mathematical jargon · See more »
Mathematical proof
In mathematics, a proof is an inferential argument for a mathematical statement.
New!!: Correctness (computer science) and Mathematical proof · See more »
Model checking
In computer science, model checking or property checking refers to the following problem: Given a model of a system, exhaustively and automatically check whether this model meets a given specification.
New!!: Correctness (computer science) and Model checking · See more »
Number theory
Number theory, or in older usage arithmetic, is a branch of pure mathematics devoted primarily to the study of the integers.
New!!: Correctness (computer science) and Number theory · See more »
Perfect number
In number theory, a perfect number is a positive integer that is equal to the sum of its proper positive divisors, that is, the sum of its positive divisors excluding the number itself (also known as its aliquot sum).
New!!: Correctness (computer science) and Perfect number · See more »
Program analysis
In computer science, program analysis is the process of automatically analyzing the behavior of computer programs regarding a property such as correctness, robustness, safety and liveness.
New!!: Correctness (computer science) and Program analysis · See more »
Program derivation
In computer science, program derivation is the derivation of a program from its specification, by mathematical means.
New!!: Correctness (computer science) and Program derivation · See more »
Proof theory
Proof theory is a major branchAccording to Wang (1981), pp.
New!!: Correctness (computer science) and Proof theory · See more »
Termination analysis
In computer science, a termination analysis is program analysis which attempts to determine whether the evaluation of a given program will definitely terminate.
New!!: Correctness (computer science) and Termination analysis · See more »
Theoretical computer science
Theoretical computer science, or TCS, is a subset of general computer science and mathematics that focuses on more mathematical topics of computing and includes the theory of computation.
New!!: Correctness (computer science) and Theoretical computer science · See more »
Redirects here:
Correctness of computer programs, Formal proof of correctness, Partial algorithm, Partial correctness, Program correctness, Proof of correctness, Provably correct, Total correctness.
References
[1] https://en.wikipedia.org/wiki/Correctness_(computer_science)
