Narrowing and heuristic search for symbolic reachability analysis of concurrent object-oriented systems

A concurrent system specified as a rewrite theory can be analyzed symbolically using narrowing-based reachability analysis. Narrowing-based approaches have been applied to formally analyze cryptographic protocols and parameterized protocols. However, existing narrowing-based analysis methods, based...

Full description

Bibliographic Details

Published in:	Science of computer programming Vol. 235; p. 103097
Main Authors:	Kang, Byeongjee, Bae, Kyungmin
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 01.07.2024
Subjects:	Heuristic search Narrowing Rewriting logic Symbolic reachability analysis Rewriting logic Narrowing Heuristic search Symbolic reachability analysis
ISSN:	0167-6423, 1872-7964
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!