A symbolic semantics for abstract model checking

@inproceedings{Levi1998ASS,
  title={A symbolic semantics for abstract model checking},
  author={Francesca Levi},
  booktitle={Science of Computer Programming},
  year={1998}
}
  • Francesca Levi
  • Published in
    Science of Computer…
    14 September 1998
  • Computer Science

A generalized semantics of PROMELA for abstract model checking

A generalized operational semantics of the modelling language promela is presented that provides the theoretical basis to introduce this promising method in the model checker SPIN.

Abstract Domains for Universal and Existential Properties

This work studies the relation between program analyses in the case where the concrete domain is a lattice join-generated by its set of join-irreducible elements.

Three-valued abstractions of games: uncertainty, but with precision

A framework for abstracting two-player turn-based games that preserves any formula of the alternating /spl mu/-calculus (AMC) based on 3-valued games, which can be used to prove and disprove formulas of AMC including arbitrarily nested strategy quantifiers.

Modal Transition Systems: A Foundation for Three-Valued Program Analysis

Two major applications, model checking partial state spaces and three-valued program shape analysis, are presented as evidence of the suitability of Kripke MTSs as a foundation for three- valued analyses.

Hierarchical modeling and analysis of timed systems

This thesis improves the efficiency of Uppaal with new data structures and extend its modeling language and its engine to support hierarchical constructs, and proposes a new architecture to integrate the different verification techniques into a common framework.

The role of model checking in software engineering

It is observed that model checking is useful for software debugging, constraint solving, and malware detection, and it can help verify different types of software systems, such as object- and aspect-oriented systems, service-oriented applications, web-based applications, and GUI applications including safety- and mission-critical systems.

The testing approach of embedded real-time automatic control software based on control objects

An agent-oriented software testing model is presented for solving the existing problems of these methods in testing PLC ERTS and the automatic test of PL ERTS can be realized in simulation environment.

A Bibliography of Publications in Science of Computer Programming

This paper presents a meta-annotation-based treatment of the role that language plays in the development of knowledge and strategy.

Binary Relations for Abstraction and Refinement

By extending Kripke structures to modal-transition systems, the paper is able to employ full modal mu-calculus as a sound logic for necessarily-true propositions and possibly- true propositions about speci cations and abstractions.

References

SHOWING 1-10 OF 22 REFERENCES

Optimality in Abstractions of Model Checking

This paper investigates the use of abstract-interpretationinspired techniques for improving the performance of procedures for determining when systems satisfy formulas in branching-time temporal

Testing-Based Abstractions for Value-Passing Systems

This paper defines a process description language that is parameterized with respect to the set of values that processes may exchange and shows that an abstraction over values induces an abstract semantics for processes.

Abstract Interpretation of Small-Step Semantics

The result is a clear methodology for generating semantically safe, regular trees for programs that do not possess obvious, finite, state-transition diagram depictions.

Model checking and abstraction

Using techniques similar to those involved in abstract interpretation, an abstract model of a program is constructed without ever examining the corresponding unabstracted model, and it is shown how this abstract model can be used to verify properties of the original program.

Symbolic Transition Graph with Assignment

A new model for message-passing processes is proposed which generalizes the notion of symbolic transition graph as introduced in [HL95], by allowing assignments to be carried in transitions, in terms of the greatest solutions of predicate equation systems.

Deductive Model Checking

This work presents an extension of classical tableau-based model checking procedures to the case of infinite-state systems, using deductive methods in an incremental construction of the behavior graph, providing a flexible, general and complete framework that can integrate a diverse number of other verification tools.

Results on the Propositional mu-Calculus

  • D. Kozen
  • Mathematics
    Theor. Comput. Sci.
  • 1983

Data Flow Analysis as Model Checking

The paper develops the idea that modal logic provides an appropriate framework for the specification of data flow analysis (DFA) algorithms as soon as programs are represented as models of the logic and applies it to the problem of determining optimal computation points within flow graphs.