On Symbolic Verification of Weakly Extended PAD
Work
Year: 2007
Type: article
Abstract: We consider the verification problem of a class of infinite-state systems called wPAD. These systems can be used to model programs with (possibly recursive) procedure calls and dynamic creation of par... more
Institutions Université Paris Cité, Centre National de la Recherche Scientifique, Laboratoire d'Informatique Algorithmique: Fondements et Applications, Masaryk University
Cites: 9
Cited by: 1
Related to: 10
FWCI: 0.303
Citation percentile (by year/subfield): 38.72
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: gold