loading
Documents

Research.Publish.Connect.

Paper

Paper Unlock

Author: Baltasar Trancón y Widemann

Affiliation: University of Bayreuth, Germany

ISBN: 978-989-8565-13-6

Keyword(s): Formal Method, Trace Function Method, Executable Semantics, Recursion Theory, State System.

Related Ontology Subjects/Areas/Topics: Applications ; Applications and Software Development ; Business and Software Modeling Languages ; Component-Based Software Engineering ; Cross-Feeding between Data and Software Engineering ; Formal Methods ; Model-Driven Software Development ; Requirements Engineering Frameworks and Models ; Service-Oriented Software Engineering and Management ; Simulation and Modeling ; Software and Systems Development Methodologies ; Software Engineering ; Software Engineering Methods and Techniques

Abstract: The Trace Function Method (TFM) is a fundamental approach to the description of system behavior for requirements analysis, specification, and documentation. External behavior of systems or components is given in mathematically direct form, but with full abstraction from internal state, by defining output at discrete interface events as recursive functions of the complete history of previous interaction at the same interface, including both input and output. In order to understand and evaluate the semantics of the notation, and in particular the executable semantics, that is, the potential for automatic simulation and construction of prototype implementations from TFM descriptions, a recursion-theoretic analysis is given. It is demonstrated that a single run and the full reactive behavior of a TFM description can be presented as instances of first-order and higher-order course-of-value iteration, respectively. A simple sufficient condition for correct implementations of TFM description s in terms of state systems is given. The spectrum of possible state-based implementations of a TFM description, ranging from straightforward simulation to minimized state space, is explored. Implications for semantically calculated and hence formally verifiable prototype implementations are summarized. (More)

PDF ImageFull Text

Download
Sign In Guest: Register as new SciTePress user now for free.

Sign In SciTePress user: please login.

PDF ImageMy Papers

You are not signed in, therefore limits apply to your IP address 35.171.183.163

In the current month:
Recent papers: 100 available of 100 total
2+ years older papers: 200 available of 200 total

Paper citation in several formats:
Trancón y Widemann, B. (2012). The Recursion Scheme of the Trace Function Method.In Proceedings of the 7th International Conference on Evaluation of Novel Approaches to Software Engineering - Volume 1: ENASE, ISBN 978-989-8565-13-6, pages 146-155. DOI: 10.5220/0003994501460155

@conference{enase12,
author={Baltasar Trancón y Widemann.},
title={The Recursion Scheme of the Trace Function Method},
booktitle={Proceedings of the 7th International Conference on Evaluation of Novel Approaches to Software Engineering - Volume 1: ENASE,},
year={2012},
pages={146-155},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0003994501460155},
isbn={978-989-8565-13-6},
}

TY - CONF

JO - Proceedings of the 7th International Conference on Evaluation of Novel Approaches to Software Engineering - Volume 1: ENASE,
TI - The Recursion Scheme of the Trace Function Method
SN - 978-989-8565-13-6
AU - Trancón y Widemann, B.
PY - 2012
SP - 146
EP - 155
DO - 10.5220/0003994501460155

Login or register to post comments.

Comments on this Paper: Be the first to review this paper.