|
|
|
|
| LEADER |
02850nam a22005655i 4500 |
| 001 |
7424 |
| 003 |
DE-He213 |
| 005 |
20130725192658.0 |
| 007 |
cr nn 008mamaa |
| 008 |
100301s2009 gw | s |||| 0|eng d |
| 020 |
# |
# |
|a 9783642033599
|9 978-3-642-03359-9
|
| 024 |
7 |
# |
|a 10.1007/978-3-642-03359-9
|2 doi
|
| 050 |
# |
4 |
|a QA8.9-QA10.3
|
| 072 |
# |
7 |
|a UYA
|2 bicssc
|
| 072 |
# |
7 |
|a MAT018000
|2 bisacsh
|
| 072 |
# |
7 |
|a COM051010
|2 bisacsh
|
| 082 |
0 |
4 |
|a 005.131
|2 23
|
| 100 |
1 |
# |
|a Berghofer, Stefan.
|e editor.
|
| 245 |
1 |
0 |
|a Theorem Proving in Higher Order Logics
|b 22nd International Conference, TPHOLs 2009, Munich, Germany, August 17-20, 2009. Proceedings /
|c edited by Stefan Berghofer, Tobias Nipkow, Christian Urban, Makarius Wenzel.
|h [electronic resource] :
|
| 264 |
# |
1 |
|a Berlin, Heidelberg :
|b Springer Berlin Heidelberg,
|c 2009.
|
| 300 |
# |
# |
|b online resource.
|
| 336 |
# |
# |
|a text
|b txt
|2 rdacontent
|
| 337 |
# |
# |
|a computer
|b c
|2 rdamedia
|
| 338 |
# |
# |
|a online resource
|b cr
|2 rdacarrier
|
| 347 |
# |
# |
|a text file
|b PDF
|2 rda
|
| 490 |
1 |
# |
|a Lecture Notes in Computer Science,
|v 5674
|x 0302-9743 ;
|
| 520 |
# |
# |
|a This book constitutes the refereed proceedings of the 22nd International Conference on Theorem Proving in Higher Order Logics, TPHOLs 200, held in Munich, Germany, in August 2009. The 26 revised full papers presented together with 1 proof pearl, 4 tool presentations, and 3 invited papers were carefully reviewed and selected from 55 submissions. The papers cover all aspects of theorem proving in higher order logics as well as related topics in theorem proving and verification such as formal semantics of specification, modeling, and programming languages, specification and verification of hardware and software, formalization of mathematical theories, advances in theorem prover technology, as well as industrial application of theorem provers.
|
| 650 |
# |
0 |
|a Computer science.
|
| 650 |
# |
0 |
|a Computer software.
|
| 650 |
# |
0 |
|a Logic design.
|
| 650 |
# |
0 |
|a Computational complexity.
|
| 650 |
1 |
4 |
|a Computer Science.
|
| 650 |
2 |
4 |
|a Mathematical Logic and Formal Languages.
|
| 650 |
2 |
4 |
|a Logics and Meanings of Programs.
|
| 650 |
2 |
4 |
|a Mathematics of Computing.
|
| 650 |
2 |
4 |
|a Discrete Mathematics in Computer Science.
|
| 650 |
2 |
4 |
|a Algorithm Analysis and Problem Complexity.
|
| 650 |
2 |
4 |
|a Models and Principles.
|
| 700 |
1 |
# |
|a Nipkow, Tobias.
|e editor.
|
| 700 |
1 |
# |
|a Urban, Christian.
|e editor.
|
| 700 |
1 |
# |
|a Wenzel, Makarius.
|e editor.
|
| 710 |
2 |
# |
|a SpringerLink (Online service)
|
| 773 |
0 |
# |
|t Springer eBooks
|
| 776 |
0 |
8 |
|i Printed edition:
|z 9783642033582
|
| 830 |
# |
0 |
|a Lecture Notes in Computer Science,
|v 5674
|x 0302-9743 ;
|
| 856 |
4 |
0 |
|u https://ezaccess.library.uitm.edu.my/login?url=http://dx.doi.org/10.1007/978-3-642-03359-9
|
| 912 |
# |
# |
|a ZDB-2-SCS
|
| 912 |
# |
# |
|a ZDB-2-LNC
|
| 950 |
# |
# |
|a Computer Science (Springer-11645)
|