Slicing tools for synchronous reactive programs

RameshS.,; KulkarniA.,; KamatV.,

doi:10.1145/1013886.1007541

Cited by 3 publications

(4 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Because previous works [12]- [14] focus on correct and complete representations, they are not proper for practical analyzers based on flow analyses of existing imperative languages.…”

Section: Resultsmentioning

confidence: 99%

See 1 more Smart Citation

Over-Approximated Control Flow Graph Construction on Pure Esterel

Kim

Yun

Kim

et al. 2010

IEICE Trans. Inf. & Syst.

View full text Add to dashboard Cite

SUMMARYEsterel is an imperative synchronous language for controldominant reactive systems. Regardless of imperative features of Esterel, combination of parallel execution and preemption makes it difficult to build control flow graphs (CFGs) of Esterel programs. Simple and convenient CFGs can help to analyze Esterel programs. However, previous researches are not suitable for flow analyses of imperative languages. In this work, we present a method to construct over-approximated CFGs for Pure Esterel. Generated CFGs expose invisible interferences among threads and show program structures explicitly so that they are useful for program analyses based on graph theory or control-/data-flows.

show abstract

“…Because previous works [12]- [14] focus on correct and complete representations, they are not proper for practical analyzers based on flow analyses of existing imperative languages.…”

Section: Resultsmentioning

confidence: 99%

“…Flow information is a basis of most program analyses, and some analyzers [12]- [14] have their own structures for flow information.…”

Section: Related Workmentioning

confidence: 99%

Over-Approximated Control Flow Graph Construction on Pure Esterel

Kim

Yun

Kim

et al. 2010

IEICE Trans. Inf. & Syst.

View full text Add to dashboard Cite

show abstract

“…Ramesh et al [26] present two static backward slicing algorithms that compute slices of Esterel programs (FSM language) and VHDL programs used for developing synchronous reactive systems. The slicing criterion is an event or a set of events.…”

Section: Related Workmentioning

confidence: 99%

A theoretical and empirical study of EFSM dependence

Androutsopoulos

Gold

Harman

et al. 2009

2009 IEEE International Conference on Software Maintenance

View full text Add to dashboard Cite

“…We have described a simulator and model checker for our distributed reactive systems model in [14,15]. We have added an abstraction-refinement algorithm to the tool based on the ideas in this paper.…”

Section: Experiencementioning

confidence: 99%

Existential abstractions for distributed reactive systems via syntactic transformations

D’Silva

Sonalkar

Ramesh

2007

Proceedings of the 7th ACM &Amp; IEEE International Conference on Embedded Software - EMSOFT '07

Self Cite

View full text Add to dashboard Cite

Synchronous languages are well suited to implementation and verification of reactive systems. Large reactive systems tend to be distributed to cope with scalability and application specific demands. We propose abstractions for distributed reactive systems modelled as a set of synchronous nodes with asynchronous communication between them. The special features of synchronous programs allow us to obtain abstractions that are also valid synchronous programs only by syntactic transformations. For a given program, the set of all such abstractions forms a semi-lattice with the original program as the bottom and the most abstract program as the top element. The transformation we define is a natural basis for constructing an abstraction-refinement framework for verification. Given a program and a safety property, the abstraction-refinement process is a search in a lattice of programs obtained via syntactic transformations. We have implemented this abstraction refinement framework in a prototype tool and report our case studies.

show abstract

Slicing tools for synchronous reactive programs

Abstract: In this paper, we present two slicing tools: VHDL Slice and Est slice that compute static executable slices of VHDL and Esterel programs respectively. The slicers have been tested on a number of small and medium sized examples.

Cited by 3 publications

References 12 publications

Over-Approximated Control Flow Graph Construction on Pure Esterel

Over-Approximated Control Flow Graph Construction on Pure Esterel

A theoretical and empirical study of EFSM dependence

Existential abstractions for distributed reactive systems via syntactic transformations

Contact Info

Product

Resources

About