CARET analysis of multithreaded programs

  title={CARET analysis of multithreaded programs},
  author={Huu-Vu Nguyen and Tayssir Touili},
Dynamic Pushdown Networks (DPNs) are a natural model for multithreaded programs with (recursive) procedure calls and thread creation. On the other hand, CARET is a temporal logic that allows to write linear temporal formulas while taking into account the matching between calls and returns. We consider in this paper the model-checking problem of DPNs against CARET formulas. We show that this problem can be effectively solved by a reduction to the emptiness problem of Buchi Dynamic Pushdown… 

A Branching Time Variant of CaRet

BranchCaRet, a natural CTL-like variant of CaRet is defined that provides existentially and universally quantified CaRet modalities and is proved that BranchCaRet model checking is decidable and EXPTIME-complete by extending a known CTL model checking algorithm for Pushdown Systems.

On CARET model-checking of pushdown systems: application to malware detection. (CARET model-checking d'automates à piles: application à la détection de malware)

Cette these propose alors differents algorithmes de model-checking des automates a pile par rapport a ces logiques CARET and montre comment ceci peut s'appliquer pour the detection of malware.

Multi-matching nested relations



CARET model checking for pushdown systems

This paper considers CARET model checking with regular valuations, where the set of configurations in which an atomic proposition holds is a regular language, and reduces these problems to the emptiness problem of Btlchi Pushdown Systems.

Verifying Concurrent Message-Passing C Programs with Recursive Calls

This work considers the model-checking problem for C programs with (1) data ranging over very large domains, (2) (recursive) procedure calls, and (3) concurrent parallel components that communicate via synchronizing actions, and tackles this undecidable problem using a CounterExample Guided Abstraction Refinement (CEGAR) scheme.

A Temporal Logic for Multi-threaded Programs

This work studies both the satisfiability and the model-checking problems, when the multiply nested words are runs of multi-stack pushdown systems (Mpds), and defines a Buchi Mpds for the models of a given formula.

On the analysis of interacting pushdown systems

This paper forms new algorithms for model checking interacting PDSs for important fragments of LTL and the Mu-Calculus, and delineates precisely the decidability boundary for each of the standard synchronization primitives.

LTL Model-Checking for Dynamic Pushdown Networks Communicating via Locks

The model-checking problem of DPNs with well-nested locks against single-indexed Linear Temporal Logic (LTL) properties of the form E f i s.t is studied and it is shown that this model- checking problem is decidable.

An Automata-Theoretic Approach for Model Checking Threads for LTL Propert

This paper shows, by using the new concept of Lock Constrained Multi-Automata Pair (LMAP), that pre*-closures of regular sets of states can be computed efficiently and allows for a fully automatic, efficient and exact decision procedure for model checking threads communicating via nested locks for indexed linear-time temporal logic formulae.

Model checking dynamic pushdown networks

This work considers in this work model checking DPNs against single-indexed LTL and CTL properties of the form $${\bigwedge f_i}$$⋀fi such that fi is a LTL/CTL formula over the PDS i.r.t. and shows that these model checking problems are decidable.

A generic approach to the static analysis of concurrent programs with procedures

An algebraic framework for defining abstractions (upper approximations) of context-free languages is proposed, which considers two classes of abstractions: finite-chain abstractions and commutative abstractions corresponding to classes of languages that contain a word if and only if they contain all its permutations.

Weighted Dynamic Pushdown Networks

A generic framework for the analysis of programs with recursive procedures and dynamic process creation is developed, and a method to determine meet-over-all-paths values for the paths between regular sets of configurations of a WDPN is derived.

Model-Checking Bounded Multi-Pushdown Systems

This work provides complexity characterizations of model checking multi-pushdown systems in which abstract operators are parameterized by stacks and considers three standard notions for boundedness: context boundedness, phase boundedness and stack ordering.