Program verification and Prolog:
Abstract: "We show here that verification of Prolog programs can be systematically carried out within a simple framework which comprises syntactic analysis, declarative semantics, modes and types. We apply these techniques to study termination, partial correctness, occur-check freedom, absence...
Gespeichert in:
1. Verfasser: | |
---|---|
Format: | Buch |
Sprache: | English |
Veröffentlicht: |
Amsterdam
1994
|
Schriftenreihe: | Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS
94,11 |
Schlagworte: | |
Zusammenfassung: | Abstract: "We show here that verification of Prolog programs can be systematically carried out within a simple framework which comprises syntactic analysis, declarative semantics, modes and types. We apply these techniques to study termination, partial correctness, occur-check freedom, absence of errors and absence of floundering. Finally, we discuss which aspects of these techniques can be automated." |
Beschreibung: | 35 S. |
Internformat
MARC
LEADER | 00000nam a2200000 cb4500 | ||
---|---|---|---|
001 | BV010157073 | ||
003 | DE-604 | ||
005 | 19960325 | ||
007 | t | ||
008 | 950427s1994 |||| 00||| engod | ||
035 | |a (OCoLC)31484088 | ||
035 | |a (DE-599)BVBBV010157073 | ||
040 | |a DE-604 |b ger |e rakddb | ||
041 | 0 | |a eng | |
100 | 1 | |a Apt, Krzysztof R. |d 1949- |e Verfasser |0 (DE-588)110139763 |4 aut | |
245 | 1 | 0 | |a Program verification and Prolog |c K. R. Apt |
264 | 1 | |a Amsterdam |c 1994 | |
300 | |a 35 S. | ||
336 | |b txt |2 rdacontent | ||
337 | |b n |2 rdamedia | ||
338 | |b nc |2 rdacarrier | ||
490 | 1 | |a Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS |v 94,11 | |
520 | 3 | |a Abstract: "We show here that verification of Prolog programs can be systematically carried out within a simple framework which comprises syntactic analysis, declarative semantics, modes and types. We apply these techniques to study termination, partial correctness, occur-check freedom, absence of errors and absence of floundering. Finally, we discuss which aspects of these techniques can be automated." | |
650 | 4 | |a Logic programming | |
810 | 2 | |a Department of Computer Science: Report CS |t Centrum voor Wiskunde en Informatica <Amsterdam> |v 94,11 |w (DE-604)BV008928356 |9 94,11 | |
999 | |a oai:aleph.bib-bvb.de:BVB01-006747104 |
Datensatz im Suchindex
_version_ | 1804124554050666496 |
---|---|
any_adam_object | |
author | Apt, Krzysztof R. 1949- |
author_GND | (DE-588)110139763 |
author_facet | Apt, Krzysztof R. 1949- |
author_role | aut |
author_sort | Apt, Krzysztof R. 1949- |
author_variant | k r a kr kra |
building | Verbundindex |
bvnumber | BV010157073 |
ctrlnum | (OCoLC)31484088 (DE-599)BVBBV010157073 |
format | Book |
fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01340nam a2200277 cb4500</leader><controlfield tag="001">BV010157073</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">19960325 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">950427s1994 |||| 00||| engod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)31484088</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV010157073</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="100" ind1="1" ind2=" "><subfield code="a">Apt, Krzysztof R.</subfield><subfield code="d">1949-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)110139763</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Program verification and Prolog</subfield><subfield code="c">K. R. Apt</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Amsterdam</subfield><subfield code="c">1994</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">35 S.</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">Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS</subfield><subfield code="v">94,11</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "We show here that verification of Prolog programs can be systematically carried out within a simple framework which comprises syntactic analysis, declarative semantics, modes and types. We apply these techniques to study termination, partial correctness, occur-check freedom, absence of errors and absence of floundering. Finally, we discuss which aspects of these techniques can be automated."</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Logic programming</subfield></datafield><datafield tag="810" ind1="2" ind2=" "><subfield code="a">Department of Computer Science: Report CS</subfield><subfield code="t">Centrum voor Wiskunde en Informatica <Amsterdam></subfield><subfield code="v">94,11</subfield><subfield code="w">(DE-604)BV008928356</subfield><subfield code="9">94,11</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-006747104</subfield></datafield></record></collection> |
id | DE-604.BV010157073 |
illustrated | Not Illustrated |
indexdate | 2024-07-09T17:47:30Z |
institution | BVB |
language | English |
oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-006747104 |
oclc_num | 31484088 |
open_access_boolean | |
physical | 35 S. |
publishDate | 1994 |
publishDateSearch | 1994 |
publishDateSort | 1994 |
record_format | marc |
series2 | Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS |
spelling | Apt, Krzysztof R. 1949- Verfasser (DE-588)110139763 aut Program verification and Prolog K. R. Apt Amsterdam 1994 35 S. txt rdacontent n rdamedia nc rdacarrier Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS 94,11 Abstract: "We show here that verification of Prolog programs can be systematically carried out within a simple framework which comprises syntactic analysis, declarative semantics, modes and types. We apply these techniques to study termination, partial correctness, occur-check freedom, absence of errors and absence of floundering. Finally, we discuss which aspects of these techniques can be automated." Logic programming Department of Computer Science: Report CS Centrum voor Wiskunde en Informatica <Amsterdam> 94,11 (DE-604)BV008928356 94,11 |
spellingShingle | Apt, Krzysztof R. 1949- Program verification and Prolog Logic programming |
title | Program verification and Prolog |
title_auth | Program verification and Prolog |
title_exact_search | Program verification and Prolog |
title_full | Program verification and Prolog K. R. Apt |
title_fullStr | Program verification and Prolog K. R. Apt |
title_full_unstemmed | Program verification and Prolog K. R. Apt |
title_short | Program verification and Prolog |
title_sort | program verification and prolog |
topic | Logic programming |
topic_facet | Logic programming |
volume_link | (DE-604)BV008928356 |
work_keys_str_mv | AT aptkrzysztofr programverificationandprolog |