Vai al contenuto principale della pagina

Certified programs and proofs : first International Conference, CPP 2011, Kenting, Taiwan, December 7-9, 2011. Proceedings / Jean-Pierre Jouannaud, Zhong Shao (eds.).



(Visualizza formato Marc21)    (visualizza in BIBRAME 2.0)

Creatore: CPP (Conference) (1st : 2011 : Kʻen-ting, Taiwan)
Titolo: Certified programs and proofs : first International Conference, CPP 2011, Kenting, Taiwan, December 7-9, 2011. Proceedings / Jean-Pierre Jouannaud, Zhong Shao (eds.).
Link to work: Certified programs and proofs Visualizza cluster
Pubblicazione: Berlin ; New York : Springer, ©2011
Estensione: 1 online resource (xv, 399 pages).
Tipo formato: computer
Tipo contenuto: text
Tipo supporto: online resource
Disciplina: 004.01/51
Titolo uniforme di collana: Lecture notes in computer science 7086.
LNCS sublibrary. SL 1, Theoretical computer science and general issues.
Index term-Uncontrolled: Computer science
Software engineering
Logic design
Artificial intelligence
Logics and Meanings of Programs
Mathematical Logic and Formal Languages
Programming Languages, Compilers, Interpreters
Symbolic and Algebraic Manipulation
Artificial Intelligence (incl. Robotics)
Soggetto non controllato: Computer science
Software engineering
Logic design
Artificial intelligence
Logics and Meanings of Programs
Mathematical Logic and Formal Languages
Programming Languages, Compilers, Interpreters
Symbolic and Algebraic Manipulation
Artificial Intelligence (incl. Robotics)
Termine d'indicizzazione-Occupazione: Computer science
Software engineering
Logic design
Artificial intelligence
Logics and Meanings of Programs
Mathematical Logic and Formal Languages
Programming Languages, Compilers, Interpreters
Symbolic and Algebraic Manipulation
Artificial Intelligence (incl. Robotics)
Classificazione LOC: QA76.9.M35 C37 2011eb
Creatori/Collaboratori: Jouannaud, Jean-Pierre
Shao, Zhong, , 1968-
Contenuto supplementare: Includes bibliographical references and author index.
Nota di contenuto: Intro; Title; Preface; Organization; Table of Contents; APLAS/CPP Invited Talks; Engineering Theories with Z3; Introduction; References; Algebra, Logic, Locality, Concurrency; References; Session 1: Logic and Types; Constructive Formalization of Hybrid Logic with Eventualities; Introduction; Propositional Logic; Mathematical Development; Decidability, Finite Types and Finite Sets; Formalization of Propositional Logic; Modal Logic; Mathematical Development; Demo Theorem; Formalization of Modal Logic; Hybrid Logic; Mathematical Development; Demo Theorem for Hybrid Logic
Formalization of Hybrid LogicConclusions; References; Proof-Carrying Code in a Session-Typed Process Calculus; Introduction; Dependent Session Types; Proof Irrelevance; Affirmation; Progress and Preservation; Concluding Remarks; References; Session 2: Certificates; Automated Certification of Implicit Induction Proofs; Introduction; Background and Notations; Noetherian Induction for Implicit Induction Proofs; Case Study: Validation of a Conformance Algorithm for the ABR Protocol; The Spike Specification; An Example of Implicit Induction Proof; Certifying Implicit Induction Proofs
ImprovementsConclusions and Future Work; References; A Proposal for Broad Spectrum Proof Certificates; Introduction; Proof Theory and Proof Certificates; The Basics of Sequent Calculus; Encoding Computation with the Sequent Calculus; Focused Proof Systems; LKF: A Focused Proof System for Classical Logic; Positive and Negative Macro Inference Rules; Some Examples of Proof Certificates; Non-Matrix Proof Systems; Fixed Points and Equality; Computation and Model Checking; Related Work; Future Work; Conclusion; References; Session 3: Invited Talk
Univalent Semantics of Constructive Type TheoriesSession 4: Formalization; Formalization of Wu's Simple Method in Coq; Introduction; Related Work; Overview of Wu's Method; Cartesian Geometry; Rings and Ideals; Pseudo-Division and Pseudo-Remainder; Formalization in Coq; Algebraization; Certified Implementation; Benchmark; Conclusion; References; Reasoning about Constants in Nominal Isabelle or How to Formalize the Second Fixed Point Theorem; Introduction; Nominal Logic Preliminaries; Lambda Terms and Conversion; Defining -Constants with Nominal Isabelle; Basic Constants in -Calculus
The Proof of the Second Fixed Point TheoremConclusion; Related Work; References; Simple, Functional, Sound and Complete Parsing for All Context-Free Grammars; Introduction; Types and Substrings; Grammars and Parse Trees; Parse Trees and the Parsing Context; Terminal Parsers and Parser Combinators; Updating the Parsing Context; Termination, Soundness and Prefix-Soundness; Completeness and Prefix-Completeness; Parser Generator Completeness; Implementation Issues; Related Work; Conclusion; References; A Decision Procedure for Regular Expression Equivalence in Type Theory
Sommario/riassunto: Annotation This book constitutes the referred proceedings of the First International Conference on Certified Programs and Proofs, CPP 2011, held in Kenting, Taiwan, in December 2011. The 24 revised regular papers presented together with 4 invited talks were carefully reviewed and selected from 49 submissions. They are organized in topical sections on logic and types, certificates, formalization, proof assistants, teaching, programming languages, hardware certification, miscellaneous, and proof perls.
Collana: Lecture notes in computer science, 0302-9743 ; 7086
LNCS sublibrary. SL 1, Theoretical computer science and general issues
ISBN: 9783642253799
3642253792
9783642253782
Formato: Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione: Inglese
Record Nr.: a9408466
Localizzazioni e accesso elettronico https://stanford.idm.oclc.org/login?url=http://link.springer.com/10.1007/978-3-642-25379-9
Lo trovi qui: Stanford University
Item: Permalink to OPAC
Altra ed. diverso supporto: Printed edition: 9783642253782