Formalization of a software architecture for embedded systems: a process algebra for SPLICE

Dechering, P.; Groenboom, Rix; Jong, Edwin de; Udding, Jan Tijmen

doi:10.1109/hicss.1999.772889

Cited by 5 publications

(5 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…There is already some work on the semantics of Splice, e.g. a comparison of semantic choices using an operational semantics [3; 4] and a process algebra framework [5]. We aim at a denotational semantics, however, since this is the proper starting point for compositional reasoning.…”

Section: Context Of the Researchmentioning

confidence: 99%

“…The approach is inspired by a process algebra for describing delay-insensitive communications. Whereas the aim of [5] is to be able to reason and compute algebraically with programs, we aim at compositional assertional verification of programs. Indeed we can prove properties formally that have are axiomatized as laws in the Splice Process Algebra of [5].…”

Section: Related Workmentioning

confidence: 99%

“…Another approach for giving a semantics to part of the Splice language has been taken in [5], where Splice is described in terms of process algebraic laws. The approach is inspired by a process algebra for describing delay-insensitive communications.…”

Section: Related Workmentioning

confidence: 99%

See 2 more Smart Citations

Semantical aspects of an architecture for distributed embedded systems

Bloo

Hooman

Jong

2000

Proceedings of the 2000 ACM Symposium on Applied Computing - Volume 1

View full text Add to dashboard Cite

We investigate the formulation of a formal semantics for the industrial software architecture Splice. In this paper, we present a set of basic Splice interaction primitives that is both powerful and easy to implement. We define a semantics for this language based on a conceptual global dataspace. It is shown that the semantics is equivalent to an implementation-biased semantics where each process has its own local dataspace and communication is established by means of asynchronous message passing. Hence, our language allows both convenient reasoning using a global dataspace and efficient implementation by means of distributed dataspaces. The equivalence result is checked mechanically by means of the inter* active theorem prover PVS.

show abstract

Section: Context Of the Researchmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Semantical aspects of an architecture for distributed embedded systems

Bloo

Hooman

Jong

2000

Proceedings of the 2000 ACM Symposium on Applied Computing - Volume 1

View full text Add to dashboard Cite

show abstract

“…Several formalizations of (fragments of) Splice already exist. We mention work on the process algebra SPA [9], the µCRL tool set [10,21] and a formalization in the higher-order logic of the theorem prover PVS [3]. Related work on the operational semantics of Linda and JavaSpaces has been presented in [6].…”

Section: Vdpol@cwinl 'mentioning

confidence: 99%

Formal verification of replication on a distributed data space architecture

Hooman¹,

Pol

2002

Proceedings of the 2002 ACM Symposium on Applied Computing - SAC '02

View full text Add to dashboard Cite

We investigate the formal verification of safety-critical systems on top of the distributed data space architecture Splice. In Splice each component has its own local data space which can be kept small using keys, time stamps and selective overwriting. We use two complementary formal tools: first the µCRL tool set for a rapid investigation of alternatives by a limited verification with state space exploration techniques; next the most promising solutions are verified in general by means of the interactive theorem prover of PVS. These formal techniques are used to investigate transparent replication of certain components on top of Splice. We prove that a convenient solution can be obtained by means of a slight extension of the write primitive of Splice.

show abstract

“…Dechering et al [2] apply ideas from delay insensitivity theory to a particular model of embedded systems, but do little more than relate the two.…”

Section: Related Workmentioning

confidence: 99%

Deterministic receptive processes are kahn processes

Edwards

Tardieu

Proceedings. Second ACM and IEEE International Conference on Formal Methods and Models for Co-Design, 2005. MEMOCODE '05.

View full text Add to dashboard Cite

Deterministic asynchronous concurrent formalisms are valuable because determinism greatly simplifies the design and validation of such systems and most concurrent formalisms are nondeterministic. This paper connects two of the more successful deterministic asynchronous formalisms: Kahn's dataflow networks and Josephs's deterministic receptive processes. The main result: a divergence-free deterministic receptive process is a Kahn process in that it can be modeled by a continuous function from input to output sequences, thus verifying it is compositionally deterministic. This result provides a bridge between two communities, enabling results from the asynchronous digital hardware community to be used in the context of dataflow computation and vice versa.

show abstract

Formalization of a software architecture for embedded systems: a process algebra for SPLICE

Cited by 5 publications

References 11 publications

Semantical aspects of an architecture for distributed embedded systems

Semantical aspects of an architecture for distributed embedded systems

Formal verification of replication on a distributed data space architecture

Deterministic receptive processes are kahn processes

Contact Info

Product

Resources

About