A formal approach to component based development of synchronous programs

Authors:
Partha S. Roop;A. Sowmya;S. Ramesh
Affiliations:
School of Computer Science and Engineering, University of New South Wales, Sydney, 2052;School of Computer Science and Engineering, University of New South Wales, Sydney, 2052;Department of Computer Science and Engineering, Indian Institute of Technology, Bombay 400 076
Venue:
Proceedings of the 2001 Asia and South Pacific Design Automation Conference
Year:
2001

Citing 7
Cited 1

CCS expressions finite state processes, and three problems of equivalence

Information and Computation
The ESTEREL synchronous programming language: design, semantics, implementation

Science of Computer Programming
Forward and backward simulations I.: untimed systems

Information and Computation
Binary decision diagrams and beyond: enabling technologies for formal verification

ICCAD '95 Proceedings of the 1995 IEEE/ACM international conference on Computer-aided design
Surviving the SOC revolution: a guide to platform-based design

Surviving the SOC revolution: a guide to platform-based design
Compositional Semantics of Non-Deterministic Synchronous Languages

ESOP '96 Proceedings of the 6th European Symposium on Programming Languages and Systems
Forced simulation: a formal approach to component based development of embedded systems

Forced simulation: a formal approach to component based development of embedded systems

Forced simulation: A technique for automating component reuse in embedded systems

ACM Transactions on Design Automation of Electronic Systems (TODAES)

Quantified Score

Hi-index	0.01

Visualization

Abstract

Synchronous languages may be used for specification and design of embedded systems. Assuming the availability of a library of synchronous programs, we propose a technique to enable reuse of these programs, via an algorithm for automatic matching of a design function to a program from the library. The algorithm, when successful, generates an interface which automatically adapts the program. The algorithm is based on a new simulation relation called synchronous forced simulation, which is shown to be necessary and sufficient for matching a given pair of function and program.