Automated Theorem Proving in Software Engineering:
The growing demand for high quality, safety, and security of software systems can only be met by rigorous application of formal methods during software design. Tools for formal methods in general, however, do not provide a sufficient level of automatic processing. This book methodically investigates...
Gespeichert in:
1. Verfasser: | |
---|---|
Format: | Elektronisch E-Book |
Sprache: | English |
Veröffentlicht: |
Berlin, Heidelberg
Springer Berlin Heidelberg
2001
|
Ausgabe: | 1st ed. 2001 |
Schlagworte: | |
Online-Zugang: | UBY01 Volltext |
Zusammenfassung: | The growing demand for high quality, safety, and security of software systems can only be met by rigorous application of formal methods during software design. Tools for formal methods in general, however, do not provide a sufficient level of automatic processing. This book methodically investigates the potential of first-order logic automated theorem provers for applications in software engineering. Illustrated by complete case studies on verification of communication and security protocols and logic-based component reuse, the book characterizes proof tasks to allow an assessment of the provers capabilities. Necessary techniques and extensions, e.g., for handling inductive and modal proof tasks, or for controlling the prover, are covered in detail. The book demonstrates that state-of-the-art automated theorem provers are capable of automatically handling important tasks during the development of high-quality software and it provides many helpful techniques for increasing practical usability of the automated theorem prover for successful applications |
Beschreibung: | 1 Online-Ressource (XIV, 228 p) |
ISBN: | 9783662226469 |
DOI: | 10.1007/978-3-662-22646-9 |
Internformat
MARC
LEADER | 00000nmm a2200000zc 4500 | ||
---|---|---|---|
001 | BV047064791 | ||
003 | DE-604 | ||
005 | 00000000000000.0 | ||
007 | cr|uuu---uuuuu | ||
008 | 201216s2001 |||| o||u| ||||||eng d | ||
020 | |a 9783662226469 |9 978-3-662-22646-9 | ||
024 | 7 | |a 10.1007/978-3-662-22646-9 |2 doi | |
035 | |a (ZDB-2-SCS)978-3-662-22646-9 | ||
035 | |a (OCoLC)1227477582 | ||
035 | |a (DE-599)BVBBV047064791 | ||
040 | |a DE-604 |b ger |e aacr | ||
041 | 0 | |a eng | |
049 | |a DE-706 | ||
082 | 0 | |a 006.3 |2 23 | |
084 | |a ST 230 |0 (DE-625)143617: |2 rvk | ||
084 | |a ST 304 |0 (DE-625)143653: |2 rvk | ||
100 | 1 | |a Schumann, Johann M. |e Verfasser |4 aut | |
245 | 1 | 0 | |a Automated Theorem Proving in Software Engineering |c by Johann M. Schumann |
250 | |a 1st ed. 2001 | ||
264 | 1 | |a Berlin, Heidelberg |b Springer Berlin Heidelberg |c 2001 | |
300 | |a 1 Online-Ressource (XIV, 228 p) | ||
336 | |b txt |2 rdacontent | ||
337 | |b c |2 rdamedia | ||
338 | |b cr |2 rdacarrier | ||
520 | |a The growing demand for high quality, safety, and security of software systems can only be met by rigorous application of formal methods during software design. Tools for formal methods in general, however, do not provide a sufficient level of automatic processing. This book methodically investigates the potential of first-order logic automated theorem provers for applications in software engineering. Illustrated by complete case studies on verification of communication and security protocols and logic-based component reuse, the book characterizes proof tasks to allow an assessment of the provers capabilities. Necessary techniques and extensions, e.g., for handling inductive and modal proof tasks, or for controlling the prover, are covered in detail. The book demonstrates that state-of-the-art automated theorem provers are capable of automatically handling important tasks during the development of high-quality software and it provides many helpful techniques for increasing practical usability of the automated theorem prover for successful applications | ||
650 | 4 | |a Artificial Intelligence | |
650 | 4 | |a Software Engineering | |
650 | 4 | |a Mathematical Logic and Formal Languages | |
650 | 4 | |a Operating Systems | |
650 | 4 | |a Management of Computing and Information Systems | |
650 | 4 | |a Computer Communication Networks | |
650 | 4 | |a Artificial intelligence | |
650 | 4 | |a Software engineering | |
650 | 4 | |a Mathematical logic | |
650 | 4 | |a Operating systems (Computers) | |
650 | 4 | |a Management information systems | |
650 | 4 | |a Computer science | |
650 | 4 | |a Computer communication systems | |
650 | 0 | 7 | |a Software Engineering |0 (DE-588)4116521-4 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Automatisches Beweisverfahren |0 (DE-588)4069034-9 |2 gnd |9 rswk-swf |
655 | 7 | |0 (DE-588)4113937-9 |a Hochschulschrift |2 gnd-content | |
689 | 0 | 0 | |a Automatisches Beweisverfahren |0 (DE-588)4069034-9 |D s |
689 | 0 | 1 | |a Software Engineering |0 (DE-588)4116521-4 |D s |
689 | 0 | |5 DE-604 | |
776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |z 9783642087592 |
776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |z 9783540679899 |
776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |z 9783662226476 |
856 | 4 | 0 | |u https://doi.org/10.1007/978-3-662-22646-9 |x Verlag |z URL des Eerstveröffentlichers |3 Volltext |
912 | |a ZDB-2-SCS | ||
940 | 1 | |q ZDB-2-SCS_2000/2004 | |
999 | |a oai:aleph.bib-bvb.de:BVB01-032471902 | ||
966 | e | |u https://doi.org/10.1007/978-3-662-22646-9 |l UBY01 |p ZDB-2-SCS |q ZDB-2-SCS_2000/2004 |x Verlag |3 Volltext |
Datensatz im Suchindex
_version_ | 1804182063288418304 |
---|---|
adam_txt | |
any_adam_object | |
any_adam_object_boolean | |
author | Schumann, Johann M. |
author_facet | Schumann, Johann M. |
author_role | aut |
author_sort | Schumann, Johann M. |
author_variant | j m s jm jms |
building | Verbundindex |
bvnumber | BV047064791 |
classification_rvk | ST 230 ST 304 |
collection | ZDB-2-SCS |
ctrlnum | (ZDB-2-SCS)978-3-662-22646-9 (OCoLC)1227477582 (DE-599)BVBBV047064791 |
dewey-full | 006.3 |
dewey-hundreds | 000 - Computer science, information, general works |
dewey-ones | 006 - Special computer methods |
dewey-raw | 006.3 |
dewey-search | 006.3 |
dewey-sort | 16.3 |
dewey-tens | 000 - Computer science, information, general works |
discipline | Informatik |
discipline_str_mv | Informatik |
doi_str_mv | 10.1007/978-3-662-22646-9 |
edition | 1st ed. 2001 |
format | Electronic eBook |
fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>03509nmm a2200649zc 4500</leader><controlfield tag="001">BV047064791</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">201216s2001 |||| o||u| ||||||eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9783662226469</subfield><subfield code="9">978-3-662-22646-9</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/978-3-662-22646-9</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ZDB-2-SCS)978-3-662-22646-9</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)1227477582</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV047064791</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">aacr</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-706</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">006.3</subfield><subfield code="2">23</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 230</subfield><subfield code="0">(DE-625)143617:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 304</subfield><subfield code="0">(DE-625)143653:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Schumann, Johann M.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Automated Theorem Proving in Software Engineering</subfield><subfield code="c">by Johann M. Schumann</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">1st ed. 2001</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Berlin, Heidelberg</subfield><subfield code="b">Springer Berlin Heidelberg</subfield><subfield code="c">2001</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource (XIV, 228 p)</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">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">The growing demand for high quality, safety, and security of software systems can only be met by rigorous application of formal methods during software design. Tools for formal methods in general, however, do not provide a sufficient level of automatic processing. This book methodically investigates the potential of first-order logic automated theorem provers for applications in software engineering. Illustrated by complete case studies on verification of communication and security protocols and logic-based component reuse, the book characterizes proof tasks to allow an assessment of the provers capabilities. Necessary techniques and extensions, e.g., for handling inductive and modal proof tasks, or for controlling the prover, are covered in detail. The book demonstrates that state-of-the-art automated theorem provers are capable of automatically handling important tasks during the development of high-quality software and it provides many helpful techniques for increasing practical usability of the automated theorem prover for successful applications</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Artificial Intelligence</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Software Engineering</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Mathematical Logic and Formal Languages</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Operating Systems</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Management of Computing and Information Systems</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer Communication Networks</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Artificial intelligence</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Software engineering</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Mathematical logic</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Operating systems (Computers)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Management information systems</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer science</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer communication systems</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Software Engineering</subfield><subfield code="0">(DE-588)4116521-4</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Automatisches Beweisverfahren</subfield><subfield code="0">(DE-588)4069034-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</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="689" ind1="0" ind2="0"><subfield code="a">Automatisches Beweisverfahren</subfield><subfield code="0">(DE-588)4069034-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Software Engineering</subfield><subfield code="0">(DE-588)4116521-4</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druck-Ausgabe</subfield><subfield code="z">9783642087592</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druck-Ausgabe</subfield><subfield code="z">9783540679899</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druck-Ausgabe</subfield><subfield code="z">9783662226476</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1007/978-3-662-22646-9</subfield><subfield code="x">Verlag</subfield><subfield code="z">URL des Eerstveröffentlichers</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-2-SCS</subfield></datafield><datafield tag="940" ind1="1" ind2=" "><subfield code="q">ZDB-2-SCS_2000/2004</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-032471902</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-662-22646-9</subfield><subfield code="l">UBY01</subfield><subfield code="p">ZDB-2-SCS</subfield><subfield code="q">ZDB-2-SCS_2000/2004</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield></record></collection> |
genre | (DE-588)4113937-9 Hochschulschrift gnd-content |
genre_facet | Hochschulschrift |
id | DE-604.BV047064791 |
illustrated | Not Illustrated |
index_date | 2024-07-03T16:12:23Z |
indexdate | 2024-07-10T09:01:35Z |
institution | BVB |
isbn | 9783662226469 |
language | English |
oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-032471902 |
oclc_num | 1227477582 |
open_access_boolean | |
owner | DE-706 |
owner_facet | DE-706 |
physical | 1 Online-Ressource (XIV, 228 p) |
psigel | ZDB-2-SCS ZDB-2-SCS_2000/2004 ZDB-2-SCS ZDB-2-SCS_2000/2004 |
publishDate | 2001 |
publishDateSearch | 2001 |
publishDateSort | 2001 |
publisher | Springer Berlin Heidelberg |
record_format | marc |
spelling | Schumann, Johann M. Verfasser aut Automated Theorem Proving in Software Engineering by Johann M. Schumann 1st ed. 2001 Berlin, Heidelberg Springer Berlin Heidelberg 2001 1 Online-Ressource (XIV, 228 p) txt rdacontent c rdamedia cr rdacarrier The growing demand for high quality, safety, and security of software systems can only be met by rigorous application of formal methods during software design. Tools for formal methods in general, however, do not provide a sufficient level of automatic processing. This book methodically investigates the potential of first-order logic automated theorem provers for applications in software engineering. Illustrated by complete case studies on verification of communication and security protocols and logic-based component reuse, the book characterizes proof tasks to allow an assessment of the provers capabilities. Necessary techniques and extensions, e.g., for handling inductive and modal proof tasks, or for controlling the prover, are covered in detail. The book demonstrates that state-of-the-art automated theorem provers are capable of automatically handling important tasks during the development of high-quality software and it provides many helpful techniques for increasing practical usability of the automated theorem prover for successful applications Artificial Intelligence Software Engineering Mathematical Logic and Formal Languages Operating Systems Management of Computing and Information Systems Computer Communication Networks Artificial intelligence Software engineering Mathematical logic Operating systems (Computers) Management information systems Computer science Computer communication systems Software Engineering (DE-588)4116521-4 gnd rswk-swf Automatisches Beweisverfahren (DE-588)4069034-9 gnd rswk-swf (DE-588)4113937-9 Hochschulschrift gnd-content Automatisches Beweisverfahren (DE-588)4069034-9 s Software Engineering (DE-588)4116521-4 s DE-604 Erscheint auch als Druck-Ausgabe 9783642087592 Erscheint auch als Druck-Ausgabe 9783540679899 Erscheint auch als Druck-Ausgabe 9783662226476 https://doi.org/10.1007/978-3-662-22646-9 Verlag URL des Eerstveröffentlichers Volltext |
spellingShingle | Schumann, Johann M. Automated Theorem Proving in Software Engineering Artificial Intelligence Software Engineering Mathematical Logic and Formal Languages Operating Systems Management of Computing and Information Systems Computer Communication Networks Artificial intelligence Software engineering Mathematical logic Operating systems (Computers) Management information systems Computer science Computer communication systems Software Engineering (DE-588)4116521-4 gnd Automatisches Beweisverfahren (DE-588)4069034-9 gnd |
subject_GND | (DE-588)4116521-4 (DE-588)4069034-9 (DE-588)4113937-9 |
title | Automated Theorem Proving in Software Engineering |
title_auth | Automated Theorem Proving in Software Engineering |
title_exact_search | Automated Theorem Proving in Software Engineering |
title_exact_search_txtP | Automated Theorem Proving in Software Engineering |
title_full | Automated Theorem Proving in Software Engineering by Johann M. Schumann |
title_fullStr | Automated Theorem Proving in Software Engineering by Johann M. Schumann |
title_full_unstemmed | Automated Theorem Proving in Software Engineering by Johann M. Schumann |
title_short | Automated Theorem Proving in Software Engineering |
title_sort | automated theorem proving in software engineering |
topic | Artificial Intelligence Software Engineering Mathematical Logic and Formal Languages Operating Systems Management of Computing and Information Systems Computer Communication Networks Artificial intelligence Software engineering Mathematical logic Operating systems (Computers) Management information systems Computer science Computer communication systems Software Engineering (DE-588)4116521-4 gnd Automatisches Beweisverfahren (DE-588)4069034-9 gnd |
topic_facet | Artificial Intelligence Software Engineering Mathematical Logic and Formal Languages Operating Systems Management of Computing and Information Systems Computer Communication Networks Artificial intelligence Software engineering Mathematical logic Operating systems (Computers) Management information systems Computer science Computer communication systems Automatisches Beweisverfahren Hochschulschrift |
url | https://doi.org/10.1007/978-3-662-22646-9 |
work_keys_str_mv | AT schumannjohannm automatedtheoremprovinginsoftwareengineering |