Treffer: Complete symbolic reachability analysis using back-and-forth narrowing

Title:
Complete symbolic reachability analysis using back-and-forth narrowing
Authors:
THATI, Prasanna, MESEGUER, José
Source:
Algebra and coalgebra in computer science (Swansea, 3-6 September 2005)Lecture notes in computer science. :379-394
Publisher Information:
Berlin: Springer, 2005.
Publication Year:
2005
Physical Description:
print, 20 ref
Original Material:
INIST-CNRS
Subject Terms:
Computer science, Informatique, Sciences exactes et technologie, Exact sciences and technology, Sciences appliquees, Applied sciences, Informatique; automatique theorique; systemes, Computer science; control theory; systems, Informatique théorique, Theoretical computing, Théorie programmation, Programming theory, Algèbre processus, Process algebra, Algebra proceso, Analyse atteignabilité, Reachability analysis, Analyse symbolique, Symbolic analysis, Análisis simbolico, Atteignabilité, Reachability, Asequibilidad, Coalgèbre, Coalgebra, FORTH, Modélisation, Modeling, Modelización, Règle inférence, Inference rule, Regla inferencia, Simultanéité informatique, Concurrency, Simultaneidad informatica, Surréduction, Narrowing(logics), Sobrereducción, Système réparti, Distributed system, Sistema repartido, Système réécriture, Rewriting systems
Document Type:
Konferenz Conference Paper
File Description:
text
Language:
English
Author Affiliations:
Carnegie Mellon University, United States
University of Illinois at Urbana-Champaign, United States
ISSN:
0302-9743
Access URL:
http://pascal-francis.inist.fr/vibad/index.php?action=search&terms=17115885
Rights:
Copyright 2005 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Computer science; theoretical automation; systems
Accession Number:
edscal.17115885
Database:
PASCAL Archive

Weitere Informationen

We propose a method called back-and-forth narrowing for solving reachability goals of the form (∃x).t1 →* t'1 Λ... A tn →* t'n in general term rewrite systems. The method is a complete semi-decision procedure in the sense that it is guaranteed to find a solution when one exists, but in general it may not terminate when there are no solutions. The completeness result is very general in that it makes no assumptions about the given term rewrite system. Specifically, the rewrite rules need not be linear, confluent, or terminating, and can even have extra-variables in the righthand side. Such generality is often essential while modeling concurrent systems or axiomatizing inference systems as rewrite rules, and in such applications back'and-forth narrowing can be used as a sound and complete technique for symbolic reachability analysis or as a deductive procedure for proving existential formulae.