DocumentCode :
2401113
Title :
On the Verifiability of Programs Written in the Feature Language Extensions
Author :
Leung, Wu-Hon F.
fYear :
2007
fDate :
14-16 Nov. 2007
Firstpage :
256
Lastpage :
263
Abstract :
High assurance in embedded system software is difficult to attain. Verification relies on testing. The unreliable and costly testing process is made much worse because the software base constantly changes: Adding a feature is by changing the code of other features, and the programs of the features entangle in the same reusable program unit of the programming language. For a large class of applications, including those requiring exception handling, this entanglement problem cannot be solved using existing general purpose programming languages. The Feature Language Extensions (FLX) is a set of language constructs designed to enable the programmer to solve the entanglement problem. It provides language support for assertion based verification. The satisfiability of first order assertions composed of variables defined by FLX can be determined without iterations of trials and errors. An executable FLX program is compiled into a finite state machine even if the state variables are unbounded.
Keywords :
Application software; Automata; Computer languages; Embedded software; Embedded system; Java; Programming profession; Software reusability; Software systems; Software testing;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
High Assurance Systems Engineering Symposium, 2007. HASE '07. 10th IEEE
Conference_Location :
Plano, TX
ISSN :
1530-2059
Print_ISBN :
978-0-7695-3043-7
Type :
conf
DOI :
10.1109/HASE.2007.72
Filename :
4404748
Link To Document :
بازگشت