Control-path Assertions
Control-Path Assertions is a formal verification methodology that specifies and checks temporal properties governing the sequencing and branching behavior of control logic in hardware designs, distinguishing it from data-path assertions by focusing on control flow correctness rather than data transformations.
11
Publications
428
Citations
27
Authors
17
Institutions
Publications per year
2017–2026
0
Parents
11
Is “sometime” sometimes better than “always”?
Zohar Manna, Richard Waldinger · Communications of the ACM · 1978 · 72 citations · Full text
1–5 of 11
27
1
h-index
1
h-index
1
h-index
1
h-index
1
h-index
1–5 of 27
17
University of Cambridge
Cambridge, United Kingdom
1 h-index
1 publications
18 citations
Stanford University
Stanford, United States
1 h-index
1 publications
72 citations

Cornell University
Ithaca, United States
1 h-index
1 publications
15 citations
Indian Institute of Technology Kharagpur
Kharagpur, India
1 h-index
3 publications
87 citations
Institut Supérieur des Études Technologiques en Communications de Tunis
Aryanah, Tunisia
1 h-index
2 publications
22 citations

University of Limerick
Limerick, Ireland
1 h-index
1 publications
37 citations
Aptiv (United States)
Troy, United States
1 h-index
1 publications
152 citations

Nara Institute of Science and Technology
Ikoma, Japan
1 h-index
4 publications
80 citations
1–8 of 17
1 publications · 72 citations
1
h-index
ENTCS · 1 publications · 18 citations
1
h-index
JETTA · 1 publications · 18 citations
1
h-index
1 publications · 18 citations
1
h-index
1 publications · 37 citations
1
h-index
1–5