Skip to content
cs-conference-ranking
.org
By subfield
By rank
Methodology
⌕
Search 971 venues
Home
/
CONCUR
/
Paper
Verifying Finite-State Graph Grammars: An Unfolding-Based Approach.
Paolo Baldan
,
Andrea Corradini
,
Barbara Knig
Venue
B
CONCUR
Year
2004
Proceedings
CONCUR
DBLP record
conf/concur/BaldanCK04 ↗
Browse the full
CONCUR paper archive
.