Parallel and Symbolic Model Checking for Fixpoint Logic with Chop | Zendy

Martin Lange | Zendy; Hans Loidl | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Parallel and Symbolic Model Checking for Fixpoint Logic with Chop

Author(s) -

Martin Lange,

Hans Loidl

Publication year - 2005

Publication title -

electronic notes in theoretical computer science

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.242

H-Index - 60

ISSN - 1571-0661

DOI - 10.1016/j.entcs.2004.10.023

Subject(s) - computer science , model checking , haskell , programming language , fixed point , modal μ calculus , theoretical computer science , mathematics , multimodal logic , normal modal logic , functional programming , description logic , mathematical analysis

We consider the model checking problem for FLC, a modal fixpoint logic capable of defining non-regular properties. This paper presents a refinement of a symbolic model checker and discusses how to parallelise this algorithm. It reports on a prototype implementation of the algorithm in Glasgow Parallel Haskell (GpH) and its performance on a cluster of workstations

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research