Rajeev Alur

Rajeev Alur

Auto-generated profile, based on publicly available information

Rajeev Alur

University of Pennsylvania

Research Focus & Metrics

Academic Career Length

35Years (1992-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 January 1992
Verified
Book Chapter
Closed access
PDF file
RARajeev Alur
Rajeev Alur
THThomas A. Henzinger
Thomas A. Henzinger

1 January 2016
Verified
Book Chapter
Closed access
PDF file
RARajeev Alur
Rajeev Alur
DFDana Fisman
Dana Fisman
MRMukund Raghothaman
Mukund Raghothaman

17 May 2008 in Formal Methods in System Design
Verified
Journal Article
Closed access
PDF file
WNWonhong Nam
Wonhong Nam
PMP. Madhusudan
P. Madhusudan
RARajeev Alur
Rajeev Alur

15 February 2005 in International Journal on Software Tools for Technology Transfer
Verified
Journal Article
Closed access
PDF file
RARajeev Alur
Rajeev Alur
PMP. Madhusudan
P. Madhusudan
WNWonhong Nam
Wonhong Nam

1 May 2004 in International Journal on Software Tools for Technology Transfer
Verified
Journal Article
Closed access
PDF file
EGElsa L. Gunter
Elsa L. Gunter
ILInsup Lee
Insup Lee
JLJaime Lee
Jaime Lee
WNWonhong Nam
Wonhong Nam
FPFrederick Pearce
Frederick Pearce
DADavid Arney
David Arney

1 November 1998 in ACM SIGSOFT Software Engineering Notes
Verified
Journal Article
Open access
RARajeev Alur
Rajeev Alur
MYMihalis Yannakakis
Mihalis Yannakakis
Model checking is emerging as a practical tool for detecting logical errors in early stages of system design. We investigate the model checking of hierarchical (nested) systems, i.e. finite state machines whose states themselves can be other machines. This nesting ability is common in various software design methodologies and is available in several commercial modeling tools. The straightforward way to analyze a hierarchical machine is to flatten it (thus, incurring an exponential blow up) and apply a model checking tool on the resulting ordinary FSM. We show that this flattening can be avoided. We develop algorithms for verifying linear time requirements whose complexity is polynomial in the size of the hierarchical machine. We address also the verification of branching time requirements and provide efficient algorithms and matching lower bounds.