Slicing Timed Systems

Authors:
Agata Janowska;Paweł Janowski
Affiliations:
Institute of Informatics, Warsaw University, Banacha 2, 02-097 Warsaw, Poland;Institute of Informatics, Warsaw University, Banacha 2, 02-097 Warsaw, Poland
Venue:
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P 2003)
Year:
2004

Citing 9
Cited 1

Characterizing finite Kripke structures in propositional temporal logic

Theoretical Computer Science - International Joint Conference on Theory and Practice of Software Development, P
The Model Checker SPIN

IEEE Transactions on Software Engineering - Special issue on formal methods in software practice
Automata For Modeling Real-Time Systems

ICALP '90 Proceedings of the 17th International Colloquium on Automata, Languages and Programming
Using Static Analysis to Improve Automatic Test Generation

TACAS '00 Proceedings of the 6th International Conference on Tools and Algorithms for Construction and Analysis of Systems: Held as Part of the European Joint Conferences on the Theory and Practice of Software, ETAPS 2000
A Formal Study of Slicing for Multi-threaded Programs with JVM Concurrency Primitives

SAS '99 Proceedings of the 6th International Symposium on Static Analysis
Design and Synthesis of Synchronization Skeletons Using Branching-Time Temporal Logic

Logic of Programs, Workshop
A partial order approach to branching time logic model checking

ISTCS '95 Proceedings of the 3rd Israel Symposium on the Theory of Computing Systems (ISTCS'95)
√erics: a tool for verifying timed automata and estelle specifications

TACAS'03 Proceedings of the 9th international conference on Tools and algorithms for the construction and analysis of systems
Program Slicing

IEEE Transactions on Software Engineering

Slicing of Timed Automata with Discrete Data

Fundamenta Informaticae - SPECIAL ISSUE ON CONCURRENCY SPECIFICATION AND PROGRAMMING (CS&P 2005) Ruciane-Nide, Poland, 28-30 September 2005

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents a method of slicing timed systems to create reduced models for model checking verification. The reduction is made at the very beginning of the verification process and this makes it beneficial and effective in handling the state explosion problem. The method uses techniques of static analysis to examine the syntax of a program and to remove irrelevant fragments of the code. The timed extension of the classical slicing definition is given and applied to Intermediate Language of the verification system Verics and Estelle specification language.