Reverse software engineering of concurrent real time programs:
Abstract: "This paper presents an algorithm for translating concurrent procedural language programs into nonprocedural, mathematical language programs, called specifications. The goal is to achieve reuse of old existing programs in developing new systems, through having them explained automatic...
Gespeichert in:
1. Verfasser: | |
---|---|
Format: | Buch |
Sprache: | English |
Veröffentlicht: |
Philadelphia, Pa.
Dep. of Computer and Information Science, School of Engineering and Applied Science
1989
|
Schlagworte: | |
Zusammenfassung: | Abstract: "This paper presents an algorithm for translating concurrent procedural language programs into nonprocedural, mathematical language programs, called specifications. The goal is to achieve reuse of old existing programs in developing new systems, through having them explained automatically and facilitating their modification. Mathematical languages are widely believed to be superior to procedural languages. Unlike procedural languages, mathematical languages do not have 'side effects' and are oblivious to computer concepts. Thus mathematical languages free the user of having to 'think like a computer' when developing or modifying a program Its mathematical semantics make proving software correctness easier and improves software reliability. The specification can then be used to generate automatically highly efficient procedural language programs for computer system [sic]. The translation algorithm centers around the difference in the meaning of variables in procedural and mathematical languages. In a procedural language a variable may be assigned many values. In a mathematical language, however, a variable may be assigned only one value. The translation algorithm focuses on renaming variables in a procedural language program so that each variable is assigned only one value This paper also presents a methodology for proving specification correctness. The idea is based on generating scenarios that define values of variable [sic] for an applicable situation and using this to prove the specification [sic] satisfy a given requirement. This is contrasted with use of temporal logic for proving correctness of concurrent programs. |
Beschreibung: | Zugl.: Philadelphia, Pa., Univ., Diss. |
Beschreibung: | 68 S. graph. Darst. |
Internformat
MARC
LEADER | 00000nam a2200000 c 4500 | ||
---|---|---|---|
001 | BV004413020 | ||
003 | DE-604 | ||
005 | 00000000000000.0 | ||
007 | t | ||
008 | 910711s1989 d||| m||| 00||| eng d | ||
035 | |a (OCoLC)25464307 | ||
035 | |a (DE-599)BVBBV004413020 | ||
040 | |a DE-604 |b ger |e rakddb | ||
041 | 0 | |a eng | |
049 | |a DE-91G | ||
084 | |a DAT 310f |2 stub | ||
088 | |a MS CIS 89 81 | ||
100 | 1 | |a Song, Mitchell C. |e Verfasser |4 aut | |
245 | 1 | 0 | |a Reverse software engineering of concurrent real time programs |
246 | 1 | 3 | |a MS CIS 89 81 |
264 | 1 | |a Philadelphia, Pa. |b Dep. of Computer and Information Science, School of Engineering and Applied Science |c 1989 | |
300 | |a 68 S. |b graph. Darst. | ||
336 | |b txt |2 rdacontent | ||
337 | |b n |2 rdamedia | ||
338 | |b nc |2 rdacarrier | ||
500 | |a Zugl.: Philadelphia, Pa., Univ., Diss. | ||
520 | 3 | |a Abstract: "This paper presents an algorithm for translating concurrent procedural language programs into nonprocedural, mathematical language programs, called specifications. The goal is to achieve reuse of old existing programs in developing new systems, through having them explained automatically and facilitating their modification. Mathematical languages are widely believed to be superior to procedural languages. Unlike procedural languages, mathematical languages do not have 'side effects' and are oblivious to computer concepts. Thus mathematical languages free the user of having to 'think like a computer' when developing or modifying a program | |
520 | 3 | |a Its mathematical semantics make proving software correctness easier and improves software reliability. The specification can then be used to generate automatically highly efficient procedural language programs for computer system [sic]. The translation algorithm centers around the difference in the meaning of variables in procedural and mathematical languages. In a procedural language a variable may be assigned many values. In a mathematical language, however, a variable may be assigned only one value. The translation algorithm focuses on renaming variables in a procedural language program so that each variable is assigned only one value | |
520 | 3 | |a This paper also presents a methodology for proving specification correctness. The idea is based on generating scenarios that define values of variable [sic] for an applicable situation and using this to prove the specification [sic] satisfy a given requirement. This is contrasted with use of temporal logic for proving correctness of concurrent programs. | |
650 | 4 | |a Computer programs | |
650 | 4 | |a Real-time data processing | |
650 | 4 | |a Software engineering | |
655 | 7 | |0 (DE-588)4113937-9 |a Hochschulschrift |2 gnd-content | |
999 | |a oai:aleph.bib-bvb.de:BVB01-002737840 |
Datensatz im Suchindex
_version_ | 1804118589306830848 |
---|---|
any_adam_object | |
author | Song, Mitchell C. |
author_facet | Song, Mitchell C. |
author_role | aut |
author_sort | Song, Mitchell C. |
author_variant | m c s mc mcs |
building | Verbundindex |
bvnumber | BV004413020 |
classification_tum | DAT 310f |
ctrlnum | (OCoLC)25464307 (DE-599)BVBBV004413020 |
discipline | Informatik |
format | Book |
fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02778nam a2200373 c 4500</leader><controlfield tag="001">BV004413020</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">910711s1989 d||| m||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)25464307</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV004413020</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakddb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-91G</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 310f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="088" ind1=" " ind2=" "><subfield code="a">MS CIS 89 81</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Song, Mitchell C.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Reverse software engineering of concurrent real time programs</subfield></datafield><datafield tag="246" ind1="1" ind2="3"><subfield code="a">MS CIS 89 81</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Philadelphia, Pa.</subfield><subfield code="b">Dep. of Computer and Information Science, School of Engineering and Applied Science</subfield><subfield code="c">1989</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">68 S.</subfield><subfield code="b">graph. Darst.</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Zugl.: Philadelphia, Pa., Univ., Diss.</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "This paper presents an algorithm for translating concurrent procedural language programs into nonprocedural, mathematical language programs, called specifications. The goal is to achieve reuse of old existing programs in developing new systems, through having them explained automatically and facilitating their modification. Mathematical languages are widely believed to be superior to procedural languages. Unlike procedural languages, mathematical languages do not have 'side effects' and are oblivious to computer concepts. Thus mathematical languages free the user of having to 'think like a computer' when developing or modifying a program</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Its mathematical semantics make proving software correctness easier and improves software reliability. The specification can then be used to generate automatically highly efficient procedural language programs for computer system [sic]. The translation algorithm centers around the difference in the meaning of variables in procedural and mathematical languages. In a procedural language a variable may be assigned many values. In a mathematical language, however, a variable may be assigned only one value. The translation algorithm focuses on renaming variables in a procedural language program so that each variable is assigned only one value</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">This paper also presents a methodology for proving specification correctness. The idea is based on generating scenarios that define values of variable [sic] for an applicable situation and using this to prove the specification [sic] satisfy a given requirement. This is contrasted with use of temporal logic for proving correctness of concurrent programs.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer programs</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Real-time data processing</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Software engineering</subfield></datafield><datafield tag="655" ind1=" " ind2="7"><subfield code="0">(DE-588)4113937-9</subfield><subfield code="a">Hochschulschrift</subfield><subfield code="2">gnd-content</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-002737840</subfield></datafield></record></collection> |
genre | (DE-588)4113937-9 Hochschulschrift gnd-content |
genre_facet | Hochschulschrift |
id | DE-604.BV004413020 |
illustrated | Illustrated |
indexdate | 2024-07-09T16:12:42Z |
institution | BVB |
language | English |
oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-002737840 |
oclc_num | 25464307 |
open_access_boolean | |
owner | DE-91G DE-BY-TUM |
owner_facet | DE-91G DE-BY-TUM |
physical | 68 S. graph. Darst. |
publishDate | 1989 |
publishDateSearch | 1989 |
publishDateSort | 1989 |
publisher | Dep. of Computer and Information Science, School of Engineering and Applied Science |
record_format | marc |
spelling | Song, Mitchell C. Verfasser aut Reverse software engineering of concurrent real time programs MS CIS 89 81 Philadelphia, Pa. Dep. of Computer and Information Science, School of Engineering and Applied Science 1989 68 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier Zugl.: Philadelphia, Pa., Univ., Diss. Abstract: "This paper presents an algorithm for translating concurrent procedural language programs into nonprocedural, mathematical language programs, called specifications. The goal is to achieve reuse of old existing programs in developing new systems, through having them explained automatically and facilitating their modification. Mathematical languages are widely believed to be superior to procedural languages. Unlike procedural languages, mathematical languages do not have 'side effects' and are oblivious to computer concepts. Thus mathematical languages free the user of having to 'think like a computer' when developing or modifying a program Its mathematical semantics make proving software correctness easier and improves software reliability. The specification can then be used to generate automatically highly efficient procedural language programs for computer system [sic]. The translation algorithm centers around the difference in the meaning of variables in procedural and mathematical languages. In a procedural language a variable may be assigned many values. In a mathematical language, however, a variable may be assigned only one value. The translation algorithm focuses on renaming variables in a procedural language program so that each variable is assigned only one value This paper also presents a methodology for proving specification correctness. The idea is based on generating scenarios that define values of variable [sic] for an applicable situation and using this to prove the specification [sic] satisfy a given requirement. This is contrasted with use of temporal logic for proving correctness of concurrent programs. Computer programs Real-time data processing Software engineering (DE-588)4113937-9 Hochschulschrift gnd-content |
spellingShingle | Song, Mitchell C. Reverse software engineering of concurrent real time programs Computer programs Real-time data processing Software engineering |
subject_GND | (DE-588)4113937-9 |
title | Reverse software engineering of concurrent real time programs |
title_alt | MS CIS 89 81 |
title_auth | Reverse software engineering of concurrent real time programs |
title_exact_search | Reverse software engineering of concurrent real time programs |
title_full | Reverse software engineering of concurrent real time programs |
title_fullStr | Reverse software engineering of concurrent real time programs |
title_full_unstemmed | Reverse software engineering of concurrent real time programs |
title_short | Reverse software engineering of concurrent real time programs |
title_sort | reverse software engineering of concurrent real time programs |
topic | Computer programs Real-time data processing Software engineering |
topic_facet | Computer programs Real-time data processing Software engineering Hochschulschrift |
work_keys_str_mv | AT songmitchellc reversesoftwareengineeringofconcurrentrealtimeprograms AT songmitchellc mscis8981 |