Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Analysis of Recursive State Machines RAJEEV ALUR
 

Summary: Analysis of Recursive State Machines
RAJEEV ALUR
University of Pennsylvania
MICHAEL BENEDIKT
Bell Laboratories
KOUSHA ETESSAMI
University of Edinburgh
PATRICE GODEFROID
Bell Laboratories
THOMAS REPS
University of Wisconsin
and
MIHALIS YANNAKAKIS
Columbia University
Recursive state machines (RSMs) enhance the power of ordinary state machines by allowing ver-
tices to correspond either to ordinary states or to potentially recursive invocations of other state
machines. RSMs can model the control flow in sequential imperative programs containing recursive
procedure calls. They can be viewed as a visual notation extending Statecharts-like hierarchical
state machines, where concurrency is disallowed but recursion is allowed. They are also related to
various models of pushdown systems studied in the verification and program analysis communities.

  

Source: Alur, Rajeev - Department of Computer and Information Science, University of Pennsylvania
Etessami, Kousha - School of Informatics, University of Edinburgh
Fähndrich, Manuel A. - Microsoft Research
Godefroid, Patrice - Computing Sciences Research Center, Bell Laboratories

 

Collections: Computer Technologies and Information Sciences