Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 238,487,753 papers from all fields of science
Search
Sign In
Create Free Account
Correctness (computer science)
Known as:
Partial
, Correctness
, Provably correct
Expand
In theoretical computer science, correctness of an algorithm is asserted when it is said that the algorithm is correct with respect to a…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
34 relations
Algorithm
Algorithmic program debugging
Alloy (specification language)
Artifact (software development)
Expand
Broader (1)
Theoretical computer science
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2006
Highly Cited
2006
Conceptual Modeling - ER 2006, 25th International Conference on Conceptual Modeling, Tucson, AZ, USA, November 6-9, 2006, Proceedings
D. Embley
,
Antoni Olivé
,
S. Ram
International Conference on Conceptual Modeling
2006
Corpus ID: 36043183
Keynote Papers.- Suggested Research Directions for a New Frontier - Active Conceptual Modeling.- From Conceptual Modeling to…
Expand
Highly Cited
2005
Highly Cited
2005
Distributed channel assignment protocols: a cross-layer approach [wireless ad hoc networks]
M. Gong
,
S. Midkiff
IEEE Wireless Communications and Networking…
2005
Corpus ID: 9914278
Despite being the subject of many years of research, distributed channel assignment remains a challenging problem. In this paper…
Expand
Highly Cited
2002
Highly Cited
2002
Advantages, Opportunities and Limits of Empirical Evaluations: Evaluating Adaptive Systems
Stephan Weibelzahl
,
Gerhard Weber
Künstliche Intell.
2002
Corpus ID: 1615301
While empirical evaluations are a common research method in some areas of Artificial Intelligence (AI), others still neglect this…
Expand
Highly Cited
2001
Highly Cited
2001
Refined Search Tree Technique for Dominating Set on Planar Graphs 1
J. Alber
,
H. Fernau
,
+4 authors
Ulrike Stege
2001
Corpus ID: 3978714
We establish a refined search tree technique for the parameterized Dominating Set problem on planar graphs. Here, we are given an…
Expand
1996
1996
Tableaux and Algorithms for Propositional Dynamic Logic with Converse
Giuseppe De Giacomo
,
F. Massacci
CADE
1996
Corpus ID: 11315551
This paper presents a prefixed tableaux calculus for Propositional Dynamic Logic with Converse based on a combination of…
Expand
1994
1994
Occam: Specification and Compiler Correctness - Part I: The Primary Model
E. Börger
,
Igor Durdanovic
,
D. Rosenzweig
Programming Concepts and Methods
1994
Corpus ID: 2952714
We develop several simple operational models of Occam at different levels of abstraction, and relate them by relative correctness…
Expand
Highly Cited
1992
Highly Cited
1992
A Layered Approach to Automating the Verification of Real-Time Systems
Richard A. Gerber
,
Insup Lee
IEEE Trans. Software Eng.
1992
Corpus ID: 7846748
A layered approach to the specification and verification of real-time systems is described. Application processes are specified…
Expand
Highly Cited
1991
Highly Cited
1991
An optimal algorithm for distributed system level diagnosis
A. Bagchi
,
S. Hakimi
[] Digest of Papers. Fault-Tolerant Computing…
1991
Corpus ID: 469783
A system consisting of n identical processors connected by links in which some processors could be faulty is considered…
Expand
Highly Cited
1990
Highly Cited
1990
A Theory of Plan Modification
S. Kambhampati
AAAI Conference on Artificial Intelligence
1990
Corpus ID: 1720555
We present a theory of plan modification applicable to hierarchical nonlinear planning. Our theory utilizes the validation…
Expand
Highly Cited
1984
Highly Cited
1984
Electron spin resonance studies on ordering and rotational diffusion in oriented phosphatidylcholine multilayers: evidence for a new chain-ordering transition
Hisao Tanaka
,
J. Freed
1984
Corpus ID: 7148630
the Rouse models provides a general description of the dynamical behavior on length scales up to 40 A and time scales to the lo…
Expand