|
|
|
| R2011b Documentation → Polyspace | |
Learn more about Polyspace |
|
| Contents | Index |
In computer programming, the adjective atomic describes a unitary action or object that is essentially indivisible, unchangeable, whole, and irreducible.
In a transaction involving two or more discrete pieces of information, either all of the pieces are committed or none are.
Execution of Polyspace from the command line rather than through the Project Manager perspective.
One of four types of orange check: potential bug, inconclusive check, data set issue and basic imprecision.
See "red check."
A test performed by Polyspace during a verification and subsequently colored red, orange, green or gray in the Run-Time Checks perspective.
The Polyspace process through which code is tested to reveal definite and potential runtime errors and a set of results is generated for review.
Code which is inaccessible at execution time under all circumstances due to the logic of the software executed prior to it.
The process used within a company to progress through the software development lifecycle.
Code has been proven to be free of runtime errors.
Unreachable code; dead code.
Approximations are made during a Polyspace verification, so data values possible at execution time are represented by supersets including those values.
A warning that represents a possible error which may be revealed upon further investigation.
The manner of use of Polyspace to achieve a particular goal, with reference to a collection of techniques and guiding principles.
A verification which includes few inconclusive orange checks is said to be precise
Output from Polyspace during verification that indicates what proportion of the verification has been completed. Could be considered to be a "textual progress bar".
Code has been proven to contain definite runtime errors (every execution will result in an error).
Inspection of the results produced by a Polyspace verification.
Option applied when an application submitted to Polyspace Server proves to be bigger or more complex than is practical.
The ratio (green checks + gray checks + red checks) / (total amount of checks)
Dead code.
The Polyspace process through which code is tested to reveal definite and potential runtime errors and a set of results is generated for review.
 | Using Polyspace Spooler |
| © 1984-2012- The MathWorks, Inc. - Site Help - Patents - Trademarks - Privacy Policy - Preventing Piracy - RSS |