Theorem proving in higher order logics : 11th international conference, TPHOLs '98, Canberra, Australia, September 27-October 1, 1998 : proceedings

This book constitutes the refereed proceedings of the 11th International Conference on Theorem Proving in Higher Order Logics, TPHOLs '98, held in Canberra, Australia, in September/October 1998. The 26 revised full papers presented were carefully reviewed and selected from a total of 52 submiss...

Descripció completa

Guardat en:
Dades bibliogràfiques
Autor corporatiu: International conference on theorem proving in higher order logics :Canberra
Altres autors: Grundy, Jim, 1968- (Director editorial), Newey, Malcolm, 19..- (Director editorial)
Format: Livre numérique
Idioma:Anglais
Publicat: Berlin [etc.] : Springer [20..].
Cham : Springer Nature
Col·lecció:Lecture notes in computer science 1479
Matèries:
Accés en línia:Accès sur la plateforme de l'éditeur
Accès sur la plateforme Istex
Accès Université d'Orléans
Accès INSA CVL
Nota: Archives Springer e-books (Licence nationale)
Archives Springer e-books (Licence nationale)
Autres localisations: Voir dans le Sudoc
Edition sous un autre format:• Theorem proving in higher order logics, 11th international conference, TPHOLs '98, Canberra, Australia, September 27-October 1, 1998, proceedings, Jim Grundy, Malcolm Newey, eds, 1998, Berlin, Springer, 1 vol. (VIII-496 p.), Lecture notes in computer science, 3-540-64987-5
• Theorem Proving in Higher Order Logics, Texte imprimé, 9783662212592
LEADER 04829nam a22004457a 4500
001 944201
008 110927q2000 xxe ||| |||| 00| 0 eng d
009 PPN155178792
020 |a 9783540498018 (PDF) 
041 0 |a eng 
082 |a 004.015113 
082 |a 004 
111 2 |a International conference on theorem proving in higher order logics  |n (11  |d  :1998  |c  :Canberra). 
245 1 0 |a Theorem proving in higher order logics :  |b 11th international conference, TPHOLs '98, Canberra, Australia, September 27-October 1, 1998 : proceedings   |c [edited by] Jim Grundy, Malcolm Newey. 
260 |a Berlin [etc.] :  |b Springer. 
260 |a Cham :  |b Springer Nature,  |c [20..]. 
490 0 |a Lecture notes in computer science  |v 1479  |x 1611-3349 
500 |a Archives Springer e-books (Licence nationale) 
500 |a Archives Springer e-books (Licence nationale) 
505 0 |a Verified lexical analysis -- Extending window inference -- Program abstraction in a higher-order logic framework -- The village telephone system: A case study in formal software engineering -- Generating embeddings from denotational descriptions -- An interface between CLAM and HOL -- Classical propositional decidability via Nuprl proof extraction -- A comparison of PVS and Isabelle/HOL -- Adding external decision procedures to HOL90 securely -- Formalizing basic first order model theory -- Formalizing Dijkstra -- Mechanical verification of total correctness through diversion verification conditions -- A type annotation scheme for Nuprl -- Verifying a garbage collection algorithm -- Hot: A concurrent automated theorem prover based on higher-order tableaux -- Free variables and subexpressions in higher-order meta logic -- An LPO-based termination ordering for higher-order terms without ?-abstraction -- Proving isomorphism of first-order logic proof systems in HOL -- Exploiting parallelism in interactive theorem provers -- I/O automata and beyond: Temporal logic and abstraction in Isabelle -- Object-oriented verification based on record subtyping in Higher-Order Logic -- On the effectiveness of theorem proving guided discovery of formal assertions for a register allocator in a high-level synthesis system -- Co-inductive axiomatization of a synchronous language -- Formal specification and theorem proving breakthroughs in geometric modeling -- A tool for data refinement -- Mechanizing relevant logics with HOL -- Case studies in meta-level theorem proving -- Formalization of graph search algorithms and its applications. 
506 |a Accès en ligne pour les établissements français bénéficiaires des licences nationales 
506 |a Accès soumis à abonnement pour tout autre établissement 
506 |a Conditions particulières de réutilisation pour les bénéficiaires des licences nationales. https://www.licencesnationales.fr/springer-nature-ebooks-contrat-licence-ln-2017 
520 |a This book constitutes the refereed proceedings of the 11th International Conference on Theorem Proving in Higher Order Logics, TPHOLs '98, held in Canberra, Australia, in September/October 1998. The 26 revised full papers presented were carefully reviewed and selected from a total of 52 submissions. Also included are two invited papers. The papers address all current aspects of theorem proving in higher order logics and formal verification and program analysis. Besides the HOL system, the theorem provers Coq, Isabelle, LAMBDA, LEGO, NuPrl, and PVS are discussed. 
650 |a Génie logiciel 
650 |a Informatique 
650 |a Intelligence artificielle 
650 |a Logique symbolique et mathématique 
650 |a Théorèmes  |x Démonstration automatique 
650 |a Structure logique 
650 |a Actes de congrès 
700 1 |a Grundy, Jim,  |d 1968-  |4 pbd 
700 1 |a Newey, Malcolm,  |d 19..-  |4 pbd 
776 0 |0 035993871  |t Theorem proving in higher order logics  |o 11th international conference, TPHOLs '98, Canberra, Australia, September 27-October 1, 1998  |o proceedings  |f Jim Grundy, Malcolm Newey, eds  |d 1998  |c Berlin  |n Springer  |p 1 vol. (VIII-496 p.)  |s Lecture notes in computer science  |z 3-540-64987-5 
776 0 |t Theorem Proving in Higher Order Logics  |b Texte imprimé  |z 9783662212592 
856 4 |q PDF  |u https://doi.org/10.1007/BFb0055125  |z Accès sur la plateforme de l'éditeur 
856 4 |u https://revue-sommaire.istex.fr/ark:/67375/8Q1-3VNM8DKZ-8  |z Accès sur la plateforme Istex 
856 4 |5 452349901:747893411  |u https://ezproxy.univ-orleans.fr/login?url=https://doi.org/10.1007/BFb0055125  |z Accès Université d'Orléans 
856 4 |5 180339901:75090643X  |u https://ezproxy.insa-cvl.fr/login?qurl=https://doi.org/10.1007/BFb0055125  |z Accès INSA CVL 
997 |0 944201  |1 Livre numérique  |a Ressource numérique  |b INSA  |b ENSA  |c 0/Bibliothèque numérique/  |c 1/Bibliothèque numérique/Autre ressource numérique/