Abstract
We show that the precision of static abstract software checking algorithms can be enhanced by taking explicitly into account the abstractions that are involved in the design of the program model/abstract semantics. This is illustrated on reachability analysis and abstract testing.
Original language | English (US) |
---|---|
Title of host publication | Computer Aided Verification - 14th International Conference, CAV 2002, Proceedings |
Publisher | Springer Verlag |
Pages | 37-56 |
Number of pages | 20 |
Volume | 2404 |
ISBN (Print) | 9783540439974 |
State | Published - 2002 |
Event | 14th International Conference on Computer Aided Verification, CAV 2002 - Copenhagen, Denmark Duration: Jul 27 2002 → Jul 31 2002 |
Publication series
Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
---|---|
Volume | 2404 |
ISSN (Print) | 03029743 |
ISSN (Electronic) | 16113349 |
Other
Other | 14th International Conference on Computer Aided Verification, CAV 2002 |
---|---|
Country | Denmark |
City | Copenhagen |
Period | 7/27/02 → 7/31/02 |
Fingerprint
ASJC Scopus subject areas
- Computer Science(all)
- Theoretical Computer Science
Cite this
On abstraction in software verification. / Cousot, Patrick; Cousot, Radhia.
Computer Aided Verification - 14th International Conference, CAV 2002, Proceedings. Vol. 2404 Springer Verlag, 2002. p. 37-56 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2404).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
}
TY - GEN
T1 - On abstraction in software verification
AU - Cousot, Patrick
AU - Cousot, Radhia
PY - 2002
Y1 - 2002
N2 - We show that the precision of static abstract software checking algorithms can be enhanced by taking explicitly into account the abstractions that are involved in the design of the program model/abstract semantics. This is illustrated on reachability analysis and abstract testing.
AB - We show that the precision of static abstract software checking algorithms can be enhanced by taking explicitly into account the abstractions that are involved in the design of the program model/abstract semantics. This is illustrated on reachability analysis and abstract testing.
UR - http://www.scopus.com/inward/record.url?scp=84937570889&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84937570889&partnerID=8YFLogxK
M3 - Conference contribution
AN - SCOPUS:84937570889
SN - 9783540439974
VL - 2404
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 37
EP - 56
BT - Computer Aided Verification - 14th International Conference, CAV 2002, Proceedings
PB - Springer Verlag
ER -