• Home
  • Search
  • LTL Model-Checking for Communicating Concurrent Programs
  • Cite Icon2
  • https://doi.org/10.1007/978-3-030-00359-3_10Copy DOI Icon

LTL Model-Checking for Communicating Concurrent Programs

  • Jan 1, 2018
  • Adrien Pommellet +1 more
Show More
  • Abstract
  • Literature Map
  • References
  • Citations
  • Similar Papers
Abstract

Communicating Pushdown Systems (CPDSs) can be used to model multi-threaded programs with recursive procedure calls and synchronisation by rendez-vous between parallel threads. While the reachability problem for this particular class of automata is undecidable, it can be tackled using an algebraic framework for computing abstractions of context-free languages. In this paper, we combine this framework with an automata-based approach in order to approximate an answer to the model-checking problem for Linear Temporal Logic (LTL) on CPDSs: we show that, given a single-indexed LTL formula, we can accurately tell if a CPDS does not follow this formula. Finally, we show how this method can be used to find race conditions in concurrent programs.

Similar Papers
  • Research Article
  • Citations2

LTL model checking for communicating concurrent programs

  • Jun 01, 2020
  • Innovations in Systems and Software Engineering
  • Adrien Pommellet +1
  • Research Article
  • Citations7

The Complexity of Model Checking Multi-Stack Systems

  • Aug 26, 2016
  • Theory of Computing Systems
  • Benedikt Bollig +2
  • Conference Article
  • Citations10

The Complexity of Model Checking Multi-stack Systems

  • Jun 01, 2013
  • Benedikt Bollig +2
  • PDF
  • Research Article
  • Citations14

LTL Model Checking Based on Binary Classification of Machine Learning

  • Jan 01, 2019
  • IEEE Access
  • Weijun Zhu +2
  • Conference Article
  • Citations2

Anchored LTL separation

  • Jul 14, 2014
  • Grgur Petric Maretić +2
  • Book Chapter
  • Citations4

${\mathcal PS}$ -LTL for Constraint-Based Security Protocol Analysis

  • Jan 01, 2005
  • Ricardo Corin +2
  • Research Article

Temporal normal form for Linear Temporal Logic formulae1

  • Mar 01, 2016
  • Journal of Intelligent & Fuzzy Systems
  • Hui-Xian Shi +1
  • Research Article
  • Citations8

Writing out Unifiers in Linear Temporal Logic

  • Sep 02, 2011
  • Journal of Logic and Computation
  • V V Rybakov
  • Research Article
  • Citations1

Efficient approach of translating LTL formulae into Büchi automata

  • Apr 08, 2015
  • Frontiers of Computer Science
  • Laixiang Shan +2
  • Research Article
  • Citations1

Semantic Analysis of a Linear Temporal Extension of Quantum Logic and Its Dynamic Aspect

  • Mar 17, 2023
  • ACM Transactions on Computational Logic
  • Tsubasa Takagi
  • Book Chapter
  • Citations44

Allen Linear (Interval) Temporal Logic – Translation to LTL and Monitor Synthesis

  • Jan 01, 2006
  • Grigore Roşu +1
  • Book Chapter
  • Citations39

Characterizing Kripke structures in temporal logic

  • Jan 01, 1987
  • M C Browne +2
  • Conference Article
  • Citations23

Learning Interpretable Models in the Property Specification Language

  • Jul 01, 2020
  • Rajarshi Roy +2
  • Conference Article
  • Citations209

Monitoring programs using rewriting

  • Nov 26, 2001
  • K Havelund +1
  • Book Chapter
  • Citations25

Layered Concurrent Programs

  • Jan 01, 2018
  • Bernhard Kragl +1
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.