On the complexity of verifying concurrent transition systems

In implementation verification, we check that an implementation is correct with respect to a specification by checking whether the behaviors of a transition system that models the program's implementation correlate with the behaviors of a transition system that models its specification. In this...

Ausführliche Beschreibung

Bibliographische Detailangaben

Hauptverfasser:	Harel, David, Kupferman, Orna, Vardi, Moshe Y.
Format:	Tagungsbericht
Sprache:	eng
Schlagworte:	Applied sciences Automata. Abstract machines. Turing machines Computer science control theory systems Concurrent Program Exact sciences and technology Implementation Complexity Model Check Theoretical computing Transition System Turing Machine
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!