| 000 | 03113nam a22005655i 4500 | ||
|---|---|---|---|
| 001 | 978-3-642-17172-7 | ||
| 003 | DE-He213 | ||
| 005 | 20140220084550.0 | ||
| 007 | cr nn 008mamaa | ||
| 008 | 101031s2010 gw | s |||| 0|eng d | ||
| 020 |
_a9783642171727 _9978-3-642-17172-7 |
||
| 024 | 7 |
_a10.1007/978-3-642-17172-7 _2doi |
|
| 050 | 4 | _aQA76.758 | |
| 072 | 7 |
_aUMZ _2bicssc |
|
| 072 | 7 |
_aCOM051230 _2bisacsh |
|
| 082 | 0 | 4 |
_a005.1 _223 |
| 100 | 1 |
_aSiegler, Simon. _eeditor. |
|
| 245 | 1 | 0 |
_aVerification, Induction, Termination Analysis _h[electronic resource] : _bFestschrift for Christoph Walther on the Occasion of His 60th Birthday / _cedited by Simon Siegler, Nathan Wasser. |
| 264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c2010. |
|
| 300 |
_aXI, 145p. 30 illus. _bonline resource. |
||
| 336 |
_atext _btxt _2rdacontent |
||
| 337 |
_acomputer _bc _2rdamedia |
||
| 338 |
_aonline resource _bcr _2rdacarrier |
||
| 347 |
_atext file _bPDF _2rda |
||
| 490 | 1 |
_aLecture Notes in Computer Science, _x0302-9743 ; _v6463 |
|
| 505 | 0 | _aProgramming Inductive Proofs -- Termination Graphs for Java Bytecode -- Specifying and Verifying Organizational Security Properties in First-Order Logic -- Change Management for Heterogeneous Development Graphs -- The VATES-Diamond as a Verifier’s Best Friend -- Dynamic Rippling, Middle-Out Reasoning and Lemma Discovery -- Verifying the Modal Logic Cube Is an Easy Task (For Higher-Order Automated Reasoners) -- Second-Order Programs with Preconditions. | |
| 520 | _aThis Festschrift volume, published in honor of Christoph Walther, contains contributions written by some of his colleagues, former students, and friends. In celebration of the 60th birthdays of Alejandro P. Buchmann, Sorin A. Huss and Christoph Walther, a colloquium was held on November 19th, 2010 in Darmstadt, Germany. The articles collected herein cover some of the main topics of Christoph Walther's research interests, such as formal modeling, theorem proving, induction, and termination analysis. Together they give a good overall perspective on the formal verification of the correctness of software systems. | ||
| 650 | 0 | _aComputer science. | |
| 650 | 0 | _aComputer Communication Networks. | |
| 650 | 0 | _aSoftware engineering. | |
| 650 | 0 | _aLogic design. | |
| 650 | 0 | _aInformation systems. | |
| 650 | 0 | _aArtificial intelligence. | |
| 650 | 1 | 4 | _aComputer Science. |
| 650 | 2 | 4 | _aSoftware Engineering. |
| 650 | 2 | 4 | _aComputer Communication Networks. |
| 650 | 2 | 4 | _aLogics and Meanings of Programs. |
| 650 | 2 | 4 | _aArtificial Intelligence (incl. Robotics). |
| 650 | 2 | 4 | _aMathematical Logic and Formal Languages. |
| 650 | 2 | 4 | _aInformation Systems Applications (incl.Internet). |
| 700 | 1 |
_aWasser, Nathan. _eeditor. |
|
| 710 | 2 | _aSpringerLink (Online service) | |
| 773 | 0 | _tSpringer eBooks | |
| 776 | 0 | 8 |
_iPrinted edition: _z9783642171710 |
| 830 | 0 |
_aLecture Notes in Computer Science, _x0302-9743 ; _v6463 |
|
| 856 | 4 | 0 | _uhttp://dx.doi.org/10.1007/978-3-642-17172-7 |
| 912 | _aZDB-2-SCS | ||
| 912 | _aZDB-2-LNC | ||
| 999 |
_c112893 _d112893 |
||