LEADER 06098nam 22007575 450 001 996465794803316 005 20200630022704.0 010 $a3-540-48346-2 024 7 $a10.1007/3-540-57826-9 035 $a(CKB)1000000000234090 035 $a(SSID)ssj0000323780 035 $a(PQKBManifestationID)11241061 035 $a(PQKBTitleCode)TC0000323780 035 $a(PQKBWorkID)10300892 035 $a(PQKB)10695650 035 $a(DE-He213)978-3-540-48346-5 035 $a(PPN)155197193 035 $a(EXLCZ)991000000000234090 100 $a20121227d1994 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aHigher Order Logic Theorem Proving and Its Applications$b[electronic resource] $e6th International Workshop, HUG '93, Vancouver, B.C., Canada, August 11-13, 1993. Proceedings /$fedited by Jeffrey J. Joyce, Carl-Johan H. Seger 205 $a1st ed. 1994. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d1994. 215 $a1 online resource (X, 526 p.) 225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v780 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-57826-9 327 $aProgram verification using HOL-UNITY -- Graph model of LAMBDA in higher order logic -- Mechanizing a programming logic for the concurrent programming language microSR in HOL -- Reasoning with the formal definition of standard ML in HOL -- HOL-ML -- Structure and behaviour in hardware verification -- Degrees of formality in shallow embedding hardware description languages in HOL -- A functional approach for formalizing regular hardware structures -- A proof development system for the HOL theorem prover -- A HOL package for reasoning about relations defined by mutual induction -- A broader class of trees for recursive type definitions for HOL -- Some theorems we should prove -- Using PVS to prove some theorems of David Parnas -- Extending the HOL theorem prover with a computer algebra system to reason about the reals -- The HOL-Voss system: Model-checking inside a general-purpose theorem-prover -- Linking Higher Order Logic to a VLSI CAD system -- Alternative proof procedures for finite-state machines in higher-order logic -- A formalization of abstraction in LAMBDA -- Report on the UCD microcoded Viper verification project -- Verification of the Tamarack-3 microprocessor in a hybrid verification environment -- Abstraction techniques for modeling real-world interface chips -- Implementing a methodology for formally verifying RISC processors in HOL -- Domain theory in HOL -- Predicates, temporal logic, and simulations -- Formalization of variables access constraints to support compositionality of liveness properties -- The semantics of statecharts in HOL -- Value-passing CCS in HOL -- TPS: An interactive and automatic tool for proving theorems of type theory -- Modelling bit vectors in HOL: The word library -- Eliminating higher-order quantifiers to obtain decision procedures for hardware verification -- Toward a super duper hardware tactic -- A mechanisation of name-carrying syntax up to alpha-conversion -- A HOL decision procedure for elementary real algebra -- AC unification in HOL90 -- Server-process restrictiveness in HOL -- Safety in railway signalling data: A behavioural analysis -- On the style of mechanical proving -- From abstract data types to shift registers: -- Verification in higher order logic of mutual exclusion algorithm -- Using Isabelle to prove simple theorems. 330 $aThis volume constitutes the refereed proceedings of the 1993 Higher-Order Logic User's Group Workshop, held at the University of British Columbia in August 1993. The workshop was sponsored by the Centre for Integrated Computer System Research. It was the sixth in the series of annual international workshops dedicated to the topic of Higher-Order Logic theorem proving, its usage in the HOL system, and its applications. The volume contains 40 papers, including an invited paper by David Parnas, McMaster University, Canada, entitled "Some theorems we should prove". 410 0$aLecture Notes in Computer Science,$x0302-9743 ;$v780 606 $aComputers 606 $aComputer logic 606 $aMathematical logic 606 $aArtificial intelligence 606 $aSoftware engineering 606 $aArithmetic and logic units, Computer 606 $aTheory of Computation$3https://scigraph.springernature.com/ontologies/product-market-codes/I16005 606 $aLogics and Meanings of Programs$3https://scigraph.springernature.com/ontologies/product-market-codes/I1603X 606 $aMathematical Logic and Formal Languages$3https://scigraph.springernature.com/ontologies/product-market-codes/I16048 606 $aArtificial Intelligence$3https://scigraph.springernature.com/ontologies/product-market-codes/I21000 606 $aSoftware Engineering$3https://scigraph.springernature.com/ontologies/product-market-codes/I14029 606 $aArithmetic and Logic Structures$3https://scigraph.springernature.com/ontologies/product-market-codes/I12026 615 0$aComputers. 615 0$aComputer logic. 615 0$aMathematical logic. 615 0$aArtificial intelligence. 615 0$aSoftware engineering. 615 0$aArithmetic and logic units, Computer. 615 14$aTheory of Computation. 615 24$aLogics and Meanings of Programs. 615 24$aMathematical Logic and Formal Languages. 615 24$aArtificial Intelligence. 615 24$aSoftware Engineering. 615 24$aArithmetic and Logic Structures. 676 $a004/.01/5113 702 $aJoyce$b Jeffrey J$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aSeger$b Carl-Johan H$4edt$4http://id.loc.gov/vocabulary/relators/edt 712 12$aHOL User's Group Workshop$d(6th :$f1993 :$eVancouver, B.C.) 906 $aBOOK 912 $a996465794803316 996 $aHigher order logic theorem proving and its applications$91381960 997 $aUNISA