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… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1938-2017
01000200019382016

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Review
2017
Review
2017
In the recent years, different web knowledge graphs, both free and commercial, have been created. While Google coined the term… (More)
  • table 1
  • table 2
Is this relevant?
Highly Cited
2008
Highly Cited
2008
Transactional memory (TM) is perceived as an appealing alternative to critical sections for general purpose concurrent… (More)
  • figure 1
  • figure 2
Is this relevant?
Highly Cited
2008
Highly Cited
2008
We present a new symbolic execution tool, KLEE, capable of automatically generating tests that achieve high coverage on a diverse… (More)
  • figure 1
  • table 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
2003
Highly Cited
2003
Despite our best efforts and intentions as educators, student programmers continue to struggle in acquiring comprehension and… (More)
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
2002
Highly Cited
2002
T o accelerate hardware development, designers often employ software models of the hardware they build. They implement these… (More)
  • figure 1
  • figure 2
  • table 1
  • figure 3
Is this relevant?
Highly Cited
1999
Highly Cited
1999
Graphical models, such as Bayesian networks and Markov random fields, represent statistical dependencies of variables by a graph… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 1
  • figure 2
Is this relevant?
Highly Cited
1990
Highly Cited
1990
A concurrent object is a data object shared by concurrent processes. Linearizability is a correctness condition for concurrent… (More)
  • figure 1
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1987
Highly Cited
1987
Concurrencey Control and Recovery in Database Systems. P.A. Bernstein. Copyright 1987, Addison-Wesley, Reading. Hardcover in fine… (More)
Is this relevant?
Highly Cited
1979
Highly Cited
1979
Semantic analysis of programs is essential in optimizingcompilers and program verification systems. It encompasses dataflow… (More)
Is this relevant?
Highly Cited
1972
Highly Cited
1972
A powerful method of simplifying the proofs of program correctness is suggested; and some new light is shed on the problem of… (More)
Is this relevant?