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 (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2006
Highly Cited
2006
Keynote Papers.- Suggested Research Directions for a New Frontier - Active Conceptual Modeling.- From Conceptual Modeling to… 
Highly Cited
2005
Highly Cited
2005
Despite being the subject of many years of research, distributed channel assignment remains a challenging problem. In this paper… 
Highly Cited
2002
Highly Cited
2002
While empirical evaluations are a common research method in some areas of Artificial Intelligence (AI), others still neglect this… 
Highly Cited
2001
Highly Cited
2001
We establish a refined search tree technique for the parameterized Dominating Set problem on planar graphs. Here, we are given an… 
1996
1996
This paper presents a prefixed tableaux calculus for Propositional Dynamic Logic with Converse based on a combination of… 
1994
1994
We develop several simple operational models of Occam at different levels of abstraction, and relate them by relative correctness… 
Highly Cited
1992
Highly Cited
1992
A layered approach to the specification and verification of real-time systems is described. Application processes are specified… 
Highly Cited
1991
Highly Cited
1991
A system consisting of n identical processors connected by links in which some processors could be faulty is considered… 
Highly Cited
1990
Highly Cited
1990
We present a theory of plan modification applicable to hierarchical nonlinear planning. Our theory utilizes the validation… 
Highly Cited
1984
Highly Cited
1984
the Rouse models provides a general description of the dynamical behavior on length scales up to 40 A and time scales to the lo…