Local model checking for parallel compositions of context-free processes

2005 ◽  
pp. 114-128 ◽  
Author(s):  
Hardi Hungar
Keyword(s):  
Model Checking ◽  
Local Model ◽  
Context Free ◽  
Local Model Checking

COMPLETE SAT-BASED MODEL CHECKING FOR CONTEXT-FREE PROCESSES

2010 ◽  
Vol 21 (02) ◽  
pp. 115-134
Author(s):  
GENG-DIAN HUANG ◽  
BOW-YAW WANG
Keyword(s):  
Model Checking ◽  
Software Verification ◽  
Boolean Satisfiability ◽  
Local Model ◽  
Sat Solvers ◽  
Proof Search ◽  
Software Programs ◽  
Context Free ◽  
Local Model Checking

A complete SAT-based model checking algorithm for context-free processes is presented. We reduce proof search in local model checking to Boolean satisfiability. Bounded proof search can therefore be performed by SAT solvers. Moreover, the completeness of proof search is reduced to Boolean unsatisfiability and hence can be checked by SAT solvers. By encoding the local model checking algorithm in [13], SAT solvers are able to verify properties in the universal fragment of alternation-free µ-calculus formulae on context-free processes. Since software programs can be modeled by context-free processes, our result demonstrates that a purely SAT-based algorithm for software verification is indeed possible.

scholarly journals Local model checking for infinite state spaces

1992 ◽  
Vol 96 (1) ◽  
pp. 157-174 ◽  
Author(s):  
Julian Bradfield ◽  
Colin Stirling
Keyword(s):  
Model Checking ◽  
Local Model ◽  
State Spaces ◽  
Infinite State ◽  
Local Model Checking

scholarly journals Petri nets, traces, and local model checking

1997 ◽  
Vol 183 (2) ◽  
pp. 229-251 ◽  
Author(s):  
Allan Cheng
Keyword(s):  
Model Checking ◽  
Petri Nets ◽  
Local Model ◽  
Local Model Checking

scholarly journals A Compositional Proof System for the Modal mu-Calculus

1998 ◽  
Vol 5 (40) ◽  
Author(s):  
Henrik Reif Andersen ◽  
Colin Stirling ◽  
Glynn Winskel
Keyword(s):  
Model Checking ◽  
Process Algebra ◽  
Local Model ◽  
Proof System ◽  
Compositional Reasoning ◽  
General Process ◽  
Finite State ◽  
Local Model Checking

We present a proof system for determining satisfaction between<br />processes in a fairly general process algebra and assertions of the modal mu-calculus. The proof system is compositional in the structure of processes. It extends earlier work on compositional reasoning within the modal mu-calculus and combines it with techniques from work on local model checking. The proof system is sound for all processes and complete for a class of finite-state processes.

scholarly journals Local Model Checking of Weighted CTL with Upper-Bound Constraints

2013 ◽  
pp. 178-195 ◽  
Author(s):  
Jonas Finnemann Jensen ◽  
Kim Guldstrand Larsen ◽  
Jiří Srba ◽  
Lars Kaerlund Oestergaard
Keyword(s):  
Model Checking ◽  
Upper Bound ◽  
Local Model ◽  
Bound Constraints ◽  
Weighted Ctl ◽  
Local Model Checking
Sign in / Sign up

Export Citation Format

Share Document