A Temporal Logic of Nested Calls and Returns

@inproceedings{Alur2004ATL,
  title={A Temporal Logic of Nested Calls and Returns},
  author={Rajeev Alur and Kousha Etessami and P. Madhusudan},
  booktitle={International Conference on Tools and Algorithms for Construction and Analysis of Systems},
  year={2004}
}
Model checking of linear temporal logic (LTL) specifications with respect to pushdown systems has been shown to be a useful tool for analysis of programs with potentially recursive procedures. LTL, however, can specify only regular properties, and properties such as correctness of procedures with respect to pre and post conditions, that require matching of calls and returns, are not regular. We introduce a temporal logic of calls and returns (CaRet) for specification and algorithmic… 

Model Checking Temporal Properties of Recursive Probabilistic Programs

This paper study the model checking problem of pPDA against ω -visibly pushdown languages that can be described by specification logics such as CaRet and are strictly more expressive than ω regular properties.

Pushdown Temporal Logics For Software Model Checking

A general framework for establishing definability results in CaRet and possible extensions to CaRet is developed, and segment of CaRet without caller modalities is explored to determine if they are expressively weaker than the full logic CaRet.

A First-Order Complete Temporal Logic for Structured Context-Free Languages

The new OPL-based logic POTL is defined and proved to be FO-completeness and improves on NWTL by enabling the formulation of requirements involving pre/post-conditions, stack inspection, and others in the presence of exception-like constructs.

A Temporal Logic for Higher-Order Functional Programs

An extension of linear temporal logic for describing temporal properties of higher-order functions, such as “the function calls its first argument before any call of the second argument,” is proposed.

POTL: A First-Order Complete Temporal Logic for Operator Precedence Languages

The new OPL-based logic POTL is introduced, its FO-completeness over finite words is proved, and its model checking procedure is provided, to improve on OPTL by being FO-complete, and by expressing more easily stack inspection and function-local properties.

Model-Checking Structured Context-Free Languages

This work defines the new OPL-based logic POTL, and provides a model checking procedure for it, which improves on OPTL by being FO-complete, and by expressing more easily stack inspection and function-local properties.

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.

Propositional Dynamic Logic for Higher-Order Functional Programs

The extension of propositional dynamic logic called HOT-PDL to specify interesting properties of higher-order programs, including stack-based access control properties and those definable using dependent refinement types, and is decidable via a reduction to modal \(\mu \)-calculus model checking ofHigher-order recursion schemes.

First-Order and Temporal Logics for Nested Words

It is proved that first-order logic over nested words has the three-variable property, and a temporal logic for nested words which is complete for the two- variable fragment of first- order is presented.
...

References

SHOWING 1-10 OF 26 REFERENCES

Model checking LTL with regular valuations for pushdown systems

On the verification problem of nonregular properties for nonregular processes

The verification problem of infinite-state processes w.r.t. nonregular properties, i.e. nondefinable by finite-state /spl omega/-automata is investigated and (un)decidability results concerning the verification problem for the different classes of processes mentioned above and different fragments of CLTL are presented.

Analysis of recursive state machines

This study examines the verification of linear time properties of RSMs, and easily derive algorithms for linear time temporal logic model checking with the same complexity in the model.

Model Checking Linear Properties of Prefix-Recognizable Systems

An automata-theoretic framework for reasoning about linear properties of infinite-state sequential systems and the first optimal algorithm for solving the LTL model-checking problem for prefix recognizable systems is developed.

Reachability Analysis of Pushdown Automata: Application to Model-Checking

This work considers the more general class of alternating pushdown systems and uses alternating finite-state automata as a representation structure for sets of their configurations and gives a simple and natural procedure to compute sets of predecessors using this representation structure.

Model Checking for Context-Free Processes

A model-checking algorithm that decides for a given context-free process whether it satisfies a property written in the alternation-free modal mu-calculus, and iteratively computes a property transformer for each state class of the finite process representation.

Dynamic logic

This book provides the first comprehensive introduction to Dynamic Logic, a system of remarkable unity that is theoretically rich as well as of practical value.

The temporal logic of programs

  • A. Pnueli
  • Computer Science
    18th Annual Symposium on Foundations of Computer Science (sfcs 1977)
  • 1977
A unified approach to program verification is suggested, which applies to both sequential and parallel programs. The main proof method suggested is that of temporal reasoning in which the time

Checking that finite state concurrent programs satisfy their linear specification

An algorithm for checking satisfiability of a linear time temporal logic formula over a finite state concurrent program and a formal proof in case the formula is valid over the program is presented.

Precise interprocedural dataflow analysis via graph reachability

The paper shows how a large class of interprocedural dataflow-analysis problems can be solved precisely in polynomial time by transforming them into a special kind of graph-reachability problem. The