Skip to search formSkip to main contentSkip to account menu

Correctness (computer science)

Known as: Partial, Correctness, Provably correct 
In theoretical computer science, correctness of an algorithm is asserted when it is said that the algorithm is correct with respect to a… 
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2007
Highly Cited
2007
We present YAGO, a light-weight and extensible ontology with high coverage and quality. YAGO builds on entities and relations and… 
Highly Cited
2004
Highly Cited
2004
A novel scheme for the detection of object boundaries is presented. The technique is based on active contours evolving in time… 
Highly Cited
2004
Highly Cited
2004
Model checking of linear temporal logic (LTL) specifications with respect to pushdown systems has been shown to be a useful tool… 
Highly Cited
2000
Highly Cited
2000
From the Publisher: Provides a simple and clear presentation, covering propositional and predicate logic and some specialized… 
Highly Cited
1995
Highly Cited
1995
Artificial "neural networks" are widely used as flexible models for classification and regression applications, but questions… 
Highly Cited
1977
Highly Cited
1977
A program denotes computations in some universe of objects. Abstract interpretation of programs consists in using that denotation… 
Highly Cited
1957
Highly Cited
1957
In this paper we presen algorithms for the solution of the general assignment and transportation problems. In Section 1, a…