Implementing the change of data structures with SPECTRUM in the framework of KORSO development graphs:
Abstract: "Data structures are algebraically specified with abstract data types in the specification language SPECTRUM. Structures of specifications are depicted in the Development-Graphs like in the BMFT- Project : KORSO. These graphs contain refinement relations, which have to be proved. In t...
Saved in:
| Main Author: | |
|---|---|
| Format: | Book |
| Language: | German |
| Published: |
München
1995
|
| Series: | Technische Universität <München>: TUM-I
9511 |
| Subjects: | |
| Online Access: | Inhaltsverzeichnis |
| Summary: | Abstract: "Data structures are algebraically specified with abstract data types in the specification language SPECTRUM. Structures of specifications are depicted in the Development-Graphs like in the BMFT- Project : KORSO. These graphs contain refinement relations, which have to be proved. In this paper a general method for changing data structures is demonstrated on the example of sets and sequences. The focus lays on proving the involved refinement relations with the theorem prover Isabelle. A simple method is given to support such proofs." |
| Physical Description: | 49 S. graph. Darst. |
Staff View
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV010841170 | ||
| 003 | DE-604 | ||
| 005 | 20040416 | ||
| 007 | t | ||
| 008 | 960701s1995 gw d||| t||| 00||| ger d | ||
| 016 | 7 | |a 947799281 |2 DE-101 | |
| 035 | |a (OCoLC)36577123 | ||
| 035 | |a (DE-599)BVBBV010841170 | ||
| 040 | |a DE-604 |b ger |e rakwb | ||
| 041 | 0 | |a ger | |
| 044 | |a gw |c DE | ||
| 049 | |a DE-12 |a DE-91G | ||
| 088 | |a TUM I 9511 | ||
| 100 | 1 | |a Slotosch, Oscar |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Implementing the change of data structures with SPECTRUM in the framework of KORSO development graphs |c Oscar Slotosch |
| 264 | 1 | |a München |c 1995 | |
| 300 | |a 49 S. |b graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Technische Universität <München>: TUM-I |v 9511 | |
| 520 | 3 | |a Abstract: "Data structures are algebraically specified with abstract data types in the specification language SPECTRUM. Structures of specifications are depicted in the Development-Graphs like in the BMFT- Project : KORSO. These graphs contain refinement relations, which have to be proved. In this paper a general method for changing data structures is demonstrated on the example of sets and sequences. The focus lays on proving the involved refinement relations with the theorem prover Isabelle. A simple method is given to support such proofs." | |
| 650 | 4 | |a Abstract data types (Computer science) | |
| 650 | 4 | |a Automatic theorem proving | |
| 650 | 4 | |a Data structures (Computer science) | |
| 650 | 4 | |a Sequences (Mathematics) | |
| 830 | 0 | |a Technische Universität <München>: TUM-I |v 9511 |w (DE-604)BV006185376 |9 9511 | |
| 856 | 4 | 2 | |m DNB Datenaustausch |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=007246857&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
Record in the Search Index
| _version_ | 1805067581203152896 |
|---|---|
| adam_text |
CONTENTS
1
INTRODUCTION
3
2
METHOD
FOR
THE
CHANGE
OF
DATA
STRUCTURES
3
2.1
SYNTACTIC
STEPS
.
4
2.2
PROOF
OBLIGATIONS
.
4
2.3
DEVELOPMENT
GRAPH
.
5
2.4
EXECUTABILITY
OF
THE
CONSTRUCTION
.
6
3
EXAMPLE
SET
BY
SEQUENCES
6
3.1
SPECIFICATIONS
.
6
3.1.1
SET
.
7
3.1.2
SEQUENCE
.
7
3.2
GENERATED
SCHEMES
.
8
3.2.1
EXTENSION
OF
SEQUENCES
FOR
SETS
.
9
3.2.2
RESTRICTION
OF
SEQUENCES
FOR
SETS
.
9
3.2.3
HOMOMORPHISM
AND
EQUALITY
.
9
3.2.4
GENERATE
SETS
BY
SEQUENCES
.
10
3.2.5
INVARIANCE
OF
THE
CORRESPONDING
FUNCTIONS
.
11
3.2.6
CONGRUENCE
OF
THE
EQUALITY
FOR
THE
CORRESPONDING
FUNCTIONS
.
11
3.3
THEORIES
OF
THE
SPECIFICATIONS
.
11
3.3.1
SETS
.
12
3.3.2
SEQUENCES
.
13
3.3.3
EXTENSION
OF
SEQUENCES
FOR
SETS
.
15
3.3.4
RESTRICTION
OF
SEQUENCES
FOR
SETS
.
16
3.3.5
HOMOMORPHISM
AND
EQUALITY
.
17
3.3.6
GENERATE
SETS
BY
SEQUENCES
.
17
3.3.7
INVARIANCE
OF
THE
CORRESPONDING
FUNCTIONS
.
18
3.3.8
CONGRUENCE
OF
THE
EQUALITY
FOR
THE
CORRESPONDING
FUNCTIONS
.
18
3.4
PROOF
OBLIGATIONS
.
19
3.4.1
SET
WITH
SET.BY.SEQ
.
19
3.4.2
SET
'
S
CONGRUENCE
.
21
3.4.3
SET
'
S
INVARIANCE
.
22
4
PROOF
OF
THE
EXAMPLE
23
4.1
PROOF
METHOD
AND
MANAGEMENT
.
23
4.2
GENERAL
LEMMAS
.
25
4.2.1
LEMMAS
FOR
SPECHOLCF
.
25
4.2.2
LEMMAS
FOR
SEQ
.
29
4.2.3
LEMMAS
FOR
SEQJEXT
.
33
4.2.4
LEMMAS
FOR
SEQJR.EP
.
33
4.2.5
LEMMAS
FOR
SEQ-EQ
.
34
4.2.6
LEMMAS
FOR
SET.BY.SEQ
.
35
4.3
PROOF
OF
SET
AXIOMS
.
35
4.3.1
PROOF
OF
SET.GEN
.
35
4.3.2
PROOF
OF
SET-EXH
.
37
4.3.3
PROOF
OF
THE
AXIOM
SETL
.
37
4.3.4
PROOF
OF
THE
AXIOM
SET2
.
37
4.3.5
PROOF
OF
THE
AXIOM
SET3
.
38
4.3.6
PROOF
OF
THE
AXIOM
SET4
.
39
4.3.7
PROOF
OF
THE
AXIOM
SET5
.
40
4.3.8
PROOF
OF
THE
AXIOM
SET-DEF
.
42
4.3.9
PROOF
OF
THE
AXIOM
SET-STRICT
.
42
4.3.10
PROOF
OF
THE
AXIOM
SET-TOTAL
.
42
4.4
PROOF
OF
CONGRUENCE
RELATION
.
43
4.4.1
PROOF
OF
THE
AXIOM
SYM
.
.
44
4.4.2
PROOF
OF
THE
AXIOM
REFL
.
44
4.4.3
PROOF
OF
THE
AXIOM
TRANS
.
44
4.4.1
PROOF
OF
THE
AXIOM
CONG-ADD-X
.
45
4.4.5
PROOF
OF
THE
AXIOM
CONG_HAS_X
.
46 |
| any_adam_object | 1 |
| author | Slotosch, Oscar |
| author_facet | Slotosch, Oscar |
| author_role | aut |
| author_sort | Slotosch, Oscar |
| author_variant | o s os |
| building | Verbundindex |
| bvnumber | BV010841170 |
| ctrlnum | (OCoLC)36577123 (DE-599)BVBBV010841170 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00000nam a2200000 cb4500</leader><controlfield tag="001">BV010841170</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20040416</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">960701s1995 gw d||| t||| 00||| ger d</controlfield><datafield tag="016" ind1="7" ind2=" "><subfield code="a">947799281</subfield><subfield code="2">DE-101</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)36577123</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV010841170</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">ger</subfield></datafield><datafield tag="044" ind1=" " ind2=" "><subfield code="a">gw</subfield><subfield code="c">DE</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-12</subfield><subfield code="a">DE-91G</subfield></datafield><datafield tag="088" ind1=" " ind2=" "><subfield code="a">TUM I 9511</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Slotosch, Oscar</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Implementing the change of data structures with SPECTRUM in the framework of KORSO development graphs</subfield><subfield code="c">Oscar Slotosch</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">München</subfield><subfield code="c">1995</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">49 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="490" ind1="1" ind2=" "><subfield code="a">Technische Universität <München>: TUM-I</subfield><subfield code="v">9511</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "Data structures are algebraically specified with abstract data types in the specification language SPECTRUM. Structures of specifications are depicted in the Development-Graphs like in the BMFT- Project : KORSO. These graphs contain refinement relations, which have to be proved. In this paper a general method for changing data structures is demonstrated on the example of sets and sequences. The focus lays on proving the involved refinement relations with the theorem prover Isabelle. A simple method is given to support such proofs."</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Abstract data types (Computer science)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Automatic theorem proving</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Data structures (Computer science)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Sequences (Mathematics)</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Technische Universität <München>: TUM-I</subfield><subfield code="v">9511</subfield><subfield code="w">(DE-604)BV006185376</subfield><subfield code="9">9511</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">DNB Datenaustausch</subfield><subfield code="q">application/pdf</subfield><subfield code="u">http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=007246857&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield></record></collection> |
| id | DE-604.BV010841170 |
| illustrated | Illustrated |
| indexdate | 2024-07-20T03:36:29Z |
| institution | BVB |
| language | German |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-007246857 |
| oclc_num | 36577123 |
| open_access_boolean | |
| owner | DE-12 DE-91G DE-BY-TUM |
| owner_facet | DE-12 DE-91G DE-BY-TUM |
| physical | 49 S. graph. Darst. |
| publishDate | 1995 |
| publishDateSearch | 1995 |
| publishDateSort | 1995 |
| record_format | marc |
| series | Technische Universität <München>: TUM-I |
| series2 | Technische Universität <München>: TUM-I |
| spelling | Slotosch, Oscar Verfasser aut Implementing the change of data structures with SPECTRUM in the framework of KORSO development graphs Oscar Slotosch München 1995 49 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier Technische Universität <München>: TUM-I 9511 Abstract: "Data structures are algebraically specified with abstract data types in the specification language SPECTRUM. Structures of specifications are depicted in the Development-Graphs like in the BMFT- Project : KORSO. These graphs contain refinement relations, which have to be proved. In this paper a general method for changing data structures is demonstrated on the example of sets and sequences. The focus lays on proving the involved refinement relations with the theorem prover Isabelle. A simple method is given to support such proofs." Abstract data types (Computer science) Automatic theorem proving Data structures (Computer science) Sequences (Mathematics) Technische Universität <München>: TUM-I 9511 (DE-604)BV006185376 9511 DNB Datenaustausch application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=007246857&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis |
| spellingShingle | Slotosch, Oscar Implementing the change of data structures with SPECTRUM in the framework of KORSO development graphs Technische Universität <München>: TUM-I Abstract data types (Computer science) Automatic theorem proving Data structures (Computer science) Sequences (Mathematics) |
| title | Implementing the change of data structures with SPECTRUM in the framework of KORSO development graphs |
| title_auth | Implementing the change of data structures with SPECTRUM in the framework of KORSO development graphs |
| title_exact_search | Implementing the change of data structures with SPECTRUM in the framework of KORSO development graphs |
| title_full | Implementing the change of data structures with SPECTRUM in the framework of KORSO development graphs Oscar Slotosch |
| title_fullStr | Implementing the change of data structures with SPECTRUM in the framework of KORSO development graphs Oscar Slotosch |
| title_full_unstemmed | Implementing the change of data structures with SPECTRUM in the framework of KORSO development graphs Oscar Slotosch |
| title_short | Implementing the change of data structures with SPECTRUM in the framework of KORSO development graphs |
| title_sort | implementing the change of data structures with spectrum in the framework of korso development graphs |
| topic | Abstract data types (Computer science) Automatic theorem proving Data structures (Computer science) Sequences (Mathematics) |
| topic_facet | Abstract data types (Computer science) Automatic theorem proving Data structures (Computer science) Sequences (Mathematics) |
| url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=007246857&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| volume_link | (DE-604)BV006185376 |
| work_keys_str_mv | AT slotoschoscar implementingthechangeofdatastructureswithspectrumintheframeworkofkorsodevelopmentgraphs |