1981•ACM SIGPLAN NoticesRequires access

Prediction models for cyclomatic complexity

Murat M. Tanik

Abstract

article Prediction models for cyclomatic complexity Share on Author: Murat M. Tanik Merle Collins Foundation, College Station, Texas Merle Collins Foundation, College Station, TexasView Profile Authors Info & Claims ACM SIGPLAN NoticesVolume 16Issue 4April 1981 pp 89–97https://doi.org/10.1145/988131.988142Online:01 April 1981Publication History 1citation344DownloadsMetricsTotal Citations1Total Downloads344Last 12 Months6Last 6 weeks0 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteGet Access

About this research paper

What this paper is about

Why it matters

OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Key concepts: Computer science, Cyclomatic complexity, Programming language, Software engineering, Theoretical computer science, Software