Info
- Utilizzare la checkbox di selezione a fianco di ciascun documento per attivare le funzionalità di stampa, invio email, download nei formati disponibili del (i) record.
Automated Reasoning [[electronic resource] ] : First International Joint Conference, IJCAR 2001 Siena, Italy, June 18-23, 2001 Proceedings / / edited by Rajeev Gore, Alexander Leitsch, Tobias Nipkow
| Automated Reasoning [[electronic resource] ] : First International Joint Conference, IJCAR 2001 Siena, Italy, June 18-23, 2001 Proceedings / / edited by Rajeev Gore, Alexander Leitsch, Tobias Nipkow |
| Edizione | [1st ed. 2001.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2001 |
| Descrizione fisica | 1 online resource (XIII, 712 p.) |
| Disciplina | 006.3/33 |
| Collana | Lecture Notes in Artificial Intelligence |
| Soggetto topico |
Artificial intelligence
Mathematical logic Computer logic Software engineering Artificial Intelligence Mathematical Logic and Formal Languages Logics and Meanings of Programs Software Engineering Mathematical Logic and Foundations |
| ISBN | 3-540-45744-5 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Talks -- Program Termination Analysis by Size-Change Graphs (Abstract) -- SET Cardholder Registration: The Secrecy Proofs -- SET Cardholder Registration: The Secrecy Proofs -- Algorithms, Datastructures, and other Issues in Efficient Automated Deduction -- Algorithms, Datastructures, and other Issues in Efficient Automated Deduction -- Description, Modal and temporal Logics -- The Description Logic ALCNH R + Extended with Concrete Domains: A Practically Motivated Approach -- NExpTime-Complete Description Logics with Concrete Domains -- Exploiting Pseudo Models for TBox and ABox Reasoning in Expressive Description Logics -- Exploiting Pseudo Models for TBox and ABox Reasoning in Expressive Description Logics -- The Hybrid ?-Calculus -- The Hybrid ?-Calculus -- The Inverse Method Implements the Automata Approach for Modal Satisfiability -- The Inverse Method Implements the Automata Approach for Modal Satisfiability -- Deduction-Based Decision Procedure for a Clausal Miniscoped Fragment of FTL -- Deduction-Based Decision Procedure for a Clausal Miniscoped Fragment of FTL -- Tableaux for Temporal Description Logic with Constant Domains -- Tableaux for Temporal Description Logic with Constant Domains -- Free-Variable Tableaux for Constant-Domain Quantified Modal Logics with Rigid and Non-rigid Designation -- Free-Variable Tableaux for Constant-Domain Quantified Modal Logics with Rigid and Non-rigid Designation -- Saturation Based Theorem Proving, Applications, and Data Structures -- Instructing Equational Set-Reasoning with Otter -- NP-Completeness of Refutability by Literal-Once Resolution -- Ordered Resolution vs. Connection Graph resolution -- A Model-Based Completeness Proof of Extended Narrowing and Resolution -- A Model-Based Completeness Proof of Extended Narrowing and Resolution -- A Resolution-Based Decision Procedure for the Two-Variable Fragment with Equality -- A Resolution-Based Decision Procedure for the Two-Variable Fragment with Equality -- Superposition and Chaining for Totally Ordered Divisible Abelian Groups -- Superposition and Chaining for Totally Ordered Divisible Abelian Groups -- Context Trees -- Context Trees -- On the Evaluation of Indexing Techniques for Theorem Proving -- On the Evaluation of Indexing Techniques for Theorem Proving -- Logic Programming and Nonmonotonic Reasoning -- Preferred Extensions of Argumentation Frameworks: Query, Answering, and Computation -- Bunched Logic Programming -- A Top-Down Procedure for Disjunctive Well-Founded Semantics -- A Second-Order Theorem Prover Applied to Circumscription -- NoMoRe: A System for Non-Monotonic Reasoning with Logic Programs under Answer Set Semantics -- NoMoRe: A System for Non-Monotonic Reasoning with Logic Programs under Answer Set Semantics -- Propositional Satisfiability and Quantified Boolean Logic -- Conditional Pure Literal Graphs -- Evaluating Search Heuristics and Optimization Techniques in Propositional Satisfiability -- QuBE: A System for Deciding Quantified Boolean Formulas Satisfiability -- System Abstract: E 0.61 -- Vampire 1.1 -- DCTP - A Disconnection Calculus Theorem Prover - System Abstract -- DCTP - A Disconnection Calculus Theorem Prover - System Abstract -- Logical Frameworks, Higher-Order Logic, Interactive Theorem Proving -- More On Implicit Syntax -- Termination and Reduction Checking for Higher-Order Logic Programs -- P.rex: An Interactive Proof Explainer -- JProver: Integrating Connection-Based Theorem Proving into Interactive Proof Assistants -- Semantic Guidance -- The eXtended Least Number Heuristic -- System Description: SCOTT-5 -- Combination of Distributed Search and Multi-Search in Peers-mcd.d -- Lotrec: The Generic Tableau Prover for Modal and Description Logics -- The modprof Theorem Prover -- A New System and Methodology for Generating Random Modal Formulae -- Equational Theorem Proving and Term Rewriting -- Decidable Classes of Inductive Theorems -- Automated Incremental Termination Proofs for Hierarchically Defined Term Rewriting Systems -- Decidability and Complexity of Finitely Closable Linear Equational Theories -- A New Meta-Complexity Theorem for Bottom-Up Logic Programs -- Tableau, Sequent, Natural Deduction Calculi and Proof Theory -- Canonical Propositional Gentzen-Type Systems -- Incremental Closure of Free Variable Tableaux -- Deriving Modular Programs from Short Proofs -- A General Method for Using Schematizations in Automated Deduction -- Automata, Specification, Verification, and Logics of Programs -- Approximating Dependency Graphs Using Tree Automata Techniques -- On the Use of Weak Automata for Deciding Linear Arithmetic with Integer and Real Variables -- A Sequent Calculus for First-Order Dynamic Logic with Trace Modalities -- Flaw Detection in Formal Specifications -- CCE: Testing Ground Joinability -- System Description: RDL Rewrite and Decision Procedure Laboratory -- lolliCoP — A Linear Logic Implementation of a Lean Connection-Method Theorem Prover for First-Order Classical Logic -- Nonclassical Logics -- Muscadet 2.3: A Knowledge-Based Theorem Prover Based on Natural Deduction -- Hilberticus - A Tool Deciding an Elementary Sublanguage of Set Theory -- STRIP: Structural Sharing for Efficient Proof-Search -- RACER System Description. |
| Record Nr. | UNINA-9910143596303321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2001 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Automated Reasoning [[electronic resource] ] : First International Joint Conference, IJCAR 2001 Siena, Italy, June 18-23, 2001 Proceedings / / edited by Rajeev Gore, Alexander Leitsch, Tobias Nipkow
| Automated Reasoning [[electronic resource] ] : First International Joint Conference, IJCAR 2001 Siena, Italy, June 18-23, 2001 Proceedings / / edited by Rajeev Gore, Alexander Leitsch, Tobias Nipkow |
| Edizione | [1st ed. 2001.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2001 |
| Descrizione fisica | 1 online resource (XIII, 712 p.) |
| Disciplina | 006.3/33 |
| Collana | Lecture Notes in Artificial Intelligence |
| Soggetto topico |
Artificial intelligence
Mathematical logic Computer logic Software engineering Artificial Intelligence Mathematical Logic and Formal Languages Logics and Meanings of Programs Software Engineering Mathematical Logic and Foundations |
| ISBN | 3-540-45744-5 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Talks -- Program Termination Analysis by Size-Change Graphs (Abstract) -- SET Cardholder Registration: The Secrecy Proofs -- SET Cardholder Registration: The Secrecy Proofs -- Algorithms, Datastructures, and other Issues in Efficient Automated Deduction -- Algorithms, Datastructures, and other Issues in Efficient Automated Deduction -- Description, Modal and temporal Logics -- The Description Logic ALCNH R + Extended with Concrete Domains: A Practically Motivated Approach -- NExpTime-Complete Description Logics with Concrete Domains -- Exploiting Pseudo Models for TBox and ABox Reasoning in Expressive Description Logics -- Exploiting Pseudo Models for TBox and ABox Reasoning in Expressive Description Logics -- The Hybrid ?-Calculus -- The Hybrid ?-Calculus -- The Inverse Method Implements the Automata Approach for Modal Satisfiability -- The Inverse Method Implements the Automata Approach for Modal Satisfiability -- Deduction-Based Decision Procedure for a Clausal Miniscoped Fragment of FTL -- Deduction-Based Decision Procedure for a Clausal Miniscoped Fragment of FTL -- Tableaux for Temporal Description Logic with Constant Domains -- Tableaux for Temporal Description Logic with Constant Domains -- Free-Variable Tableaux for Constant-Domain Quantified Modal Logics with Rigid and Non-rigid Designation -- Free-Variable Tableaux for Constant-Domain Quantified Modal Logics with Rigid and Non-rigid Designation -- Saturation Based Theorem Proving, Applications, and Data Structures -- Instructing Equational Set-Reasoning with Otter -- NP-Completeness of Refutability by Literal-Once Resolution -- Ordered Resolution vs. Connection Graph resolution -- A Model-Based Completeness Proof of Extended Narrowing and Resolution -- A Model-Based Completeness Proof of Extended Narrowing and Resolution -- A Resolution-Based Decision Procedure for the Two-Variable Fragment with Equality -- A Resolution-Based Decision Procedure for the Two-Variable Fragment with Equality -- Superposition and Chaining for Totally Ordered Divisible Abelian Groups -- Superposition and Chaining for Totally Ordered Divisible Abelian Groups -- Context Trees -- Context Trees -- On the Evaluation of Indexing Techniques for Theorem Proving -- On the Evaluation of Indexing Techniques for Theorem Proving -- Logic Programming and Nonmonotonic Reasoning -- Preferred Extensions of Argumentation Frameworks: Query, Answering, and Computation -- Bunched Logic Programming -- A Top-Down Procedure for Disjunctive Well-Founded Semantics -- A Second-Order Theorem Prover Applied to Circumscription -- NoMoRe: A System for Non-Monotonic Reasoning with Logic Programs under Answer Set Semantics -- NoMoRe: A System for Non-Monotonic Reasoning with Logic Programs under Answer Set Semantics -- Propositional Satisfiability and Quantified Boolean Logic -- Conditional Pure Literal Graphs -- Evaluating Search Heuristics and Optimization Techniques in Propositional Satisfiability -- QuBE: A System for Deciding Quantified Boolean Formulas Satisfiability -- System Abstract: E 0.61 -- Vampire 1.1 -- DCTP - A Disconnection Calculus Theorem Prover - System Abstract -- DCTP - A Disconnection Calculus Theorem Prover - System Abstract -- Logical Frameworks, Higher-Order Logic, Interactive Theorem Proving -- More On Implicit Syntax -- Termination and Reduction Checking for Higher-Order Logic Programs -- P.rex: An Interactive Proof Explainer -- JProver: Integrating Connection-Based Theorem Proving into Interactive Proof Assistants -- Semantic Guidance -- The eXtended Least Number Heuristic -- System Description: SCOTT-5 -- Combination of Distributed Search and Multi-Search in Peers-mcd.d -- Lotrec: The Generic Tableau Prover for Modal and Description Logics -- The modprof Theorem Prover -- A New System and Methodology for Generating Random Modal Formulae -- Equational Theorem Proving and Term Rewriting -- Decidable Classes of Inductive Theorems -- Automated Incremental Termination Proofs for Hierarchically Defined Term Rewriting Systems -- Decidability and Complexity of Finitely Closable Linear Equational Theories -- A New Meta-Complexity Theorem for Bottom-Up Logic Programs -- Tableau, Sequent, Natural Deduction Calculi and Proof Theory -- Canonical Propositional Gentzen-Type Systems -- Incremental Closure of Free Variable Tableaux -- Deriving Modular Programs from Short Proofs -- A General Method for Using Schematizations in Automated Deduction -- Automata, Specification, Verification, and Logics of Programs -- Approximating Dependency Graphs Using Tree Automata Techniques -- On the Use of Weak Automata for Deciding Linear Arithmetic with Integer and Real Variables -- A Sequent Calculus for First-Order Dynamic Logic with Trace Modalities -- Flaw Detection in Formal Specifications -- CCE: Testing Ground Joinability -- System Description: RDL Rewrite and Decision Procedure Laboratory -- lolliCoP — A Linear Logic Implementation of a Lean Connection-Method Theorem Prover for First-Order Classical Logic -- Nonclassical Logics -- Muscadet 2.3: A Knowledge-Based Theorem Prover Based on Natural Deduction -- Hilberticus - A Tool Deciding an Elementary Sublanguage of Set Theory -- STRIP: Structural Sharing for Efficient Proof-Search -- RACER System Description. |
| Record Nr. | UNISA-996466069003316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2001 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
FM 2006: Formal Methods [[electronic resource] ] : 14th International Symposium on Formal Methods, Hamilton, Canada, August 21-27, 2006, Proceedings / / edited by Jayadev Misra, Tobias Nipkow, Emil Sekerinski
| FM 2006: Formal Methods [[electronic resource] ] : 14th International Symposium on Formal Methods, Hamilton, Canada, August 21-27, 2006, Proceedings / / edited by Jayadev Misra, Tobias Nipkow, Emil Sekerinski |
| Edizione | [1st ed. 2006.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2006 |
| Descrizione fisica | 1 online resource (XV, 620 p.) |
| Disciplina | 005.3 |
| Collana | Programming and Software Engineering |
| Soggetto topico |
Software engineering
Computer logic Programming languages (Electronic computers) Computer programming Mathematical logic Software Engineering/Programming and Operating Systems Software Engineering Logics and Meanings of Programs Programming Languages, Compilers, Interpreters Programming Techniques Mathematical Logic and Formal Languages |
| ISBN | 3-540-37216-4 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Talk -- The Embedded Systems Design Challenge -- Interactive Verification -- The Mondex Challenge: Machine Checked Proofs for an Electronic Purse -- Interactive Verification of Medical Guidelines -- Certifying Airport Security Regulations Using the Focal Environment -- Proving Safety Properties of an Aircraft Landing Protocol Using I/O Automata and the PVS Theorem Prover: A Case Study -- Invited Talk -- Validating the Microsoft Hypervisor -- Formal Modelling of Systems -- Interface Input/Output Automata -- Properties of Behavioural Model Merging -- Automatic Translation from Circus to Java -- Quantitative Refinement and Model Checking for the Analysis of Probabilistic Systems -- Real Time -- Modeling and Validating Distributed Embedded Real-Time Systems with VDM++ -- Towards Modularized Verification of Distributed Time-Triggered Systems -- Industrial Experience -- A Story About Formal Methods Adoption by a Railway Signaling Manufacturer -- Partially Introducing Formal Methods into Object-Oriented Development: Case Studies Using a Metrics-Driven Approach -- Specification Refinement -- Compositional Class Refinement in Object-Z -- A Proposal for Records in Event-B -- Pointfree Factorization of Operation Refinement -- A Formal Template Language Enabling Metaproof -- Progrmming Languages -- Dynamic Frames: Support for Framing, Dependencies and Sharing Without Restrictions -- Type-Safe Two-Level Data Transformation -- Algebra -- Feature Algebra -- Education -- Using Domain-Independent Problems for Introducing Formal Methods -- Formal Modelling of Systems -- Compositional Binding in Network Domains -- Formal Modeling of Communication Protocols by Graph Transformation -- Feature Specification and Static Analysis for Interaction Resolution -- A Fully General Operational Semantics for UML 2.0 Sequence Diagrams with Potential and Mandatory Choice -- Formal Aspects of Java -- Towards Automatic Exception Safety Verification -- Enforcer – Efficient Failure Injection -- Automated Boundary Test Generation from JML Specifications -- Formal Reasoning About Non-atomic Java Card Methods in Dynamic Logic -- Programming Languages -- Formal Verification of a C Compiler Front-End -- A Memory Model Sensitive Checker for C# -- Changing Programs Correctly: Refactoring with Specifications -- Mechanical Verification of Recursive Procedures Manipulating Pointers Using Separation Logic -- Model Checking -- Model-Based Variable and Transition Orderings for Efficient Symbolic Model Checking -- Exact and Approximate Strategies for Symmetry Reduction in Model Checking -- Monitoring Distributed Controllers: When an Efficient LTL Algorithm on Sequences Is Needed to Model-Check Traces -- PSL Model Checking and Run-Time Verification Via Testers -- Industry Day: Abstracts of Invited Talks -- Formal Methods for Security: Lightweight Plug-In or New Engineering Discipline -- Formal Methods in the Security Business: Exotic Flowers Thriving in an Expanding Niche -- Connector-Based Software Development: Deriving Secure Protocols -- Model-Based Security Engineering for Real -- Cost Effective Software Engineering for Security -- Formal Methods and Cryptography -- Verified Software Grand Challenge. |
| Record Nr. | UNINA-9910484505003321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2006 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
FM 2006: Formal Methods [[electronic resource] ] : 14th International Symposium on Formal Methods, Hamilton, Canada, August 21-27, 2006, Proceedings / / edited by Jayadev Misra, Tobias Nipkow, Emil Sekerinski
| FM 2006: Formal Methods [[electronic resource] ] : 14th International Symposium on Formal Methods, Hamilton, Canada, August 21-27, 2006, Proceedings / / edited by Jayadev Misra, Tobias Nipkow, Emil Sekerinski |
| Edizione | [1st ed. 2006.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2006 |
| Descrizione fisica | 1 online resource (XV, 620 p.) |
| Disciplina | 005.3 |
| Collana | Programming and Software Engineering |
| Soggetto topico |
Software engineering
Computer logic Programming languages (Electronic computers) Computer programming Mathematical logic Software Engineering/Programming and Operating Systems Software Engineering Logics and Meanings of Programs Programming Languages, Compilers, Interpreters Programming Techniques Mathematical Logic and Formal Languages |
| ISBN | 3-540-37216-4 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Talk -- The Embedded Systems Design Challenge -- Interactive Verification -- The Mondex Challenge: Machine Checked Proofs for an Electronic Purse -- Interactive Verification of Medical Guidelines -- Certifying Airport Security Regulations Using the Focal Environment -- Proving Safety Properties of an Aircraft Landing Protocol Using I/O Automata and the PVS Theorem Prover: A Case Study -- Invited Talk -- Validating the Microsoft Hypervisor -- Formal Modelling of Systems -- Interface Input/Output Automata -- Properties of Behavioural Model Merging -- Automatic Translation from Circus to Java -- Quantitative Refinement and Model Checking for the Analysis of Probabilistic Systems -- Real Time -- Modeling and Validating Distributed Embedded Real-Time Systems with VDM++ -- Towards Modularized Verification of Distributed Time-Triggered Systems -- Industrial Experience -- A Story About Formal Methods Adoption by a Railway Signaling Manufacturer -- Partially Introducing Formal Methods into Object-Oriented Development: Case Studies Using a Metrics-Driven Approach -- Specification Refinement -- Compositional Class Refinement in Object-Z -- A Proposal for Records in Event-B -- Pointfree Factorization of Operation Refinement -- A Formal Template Language Enabling Metaproof -- Progrmming Languages -- Dynamic Frames: Support for Framing, Dependencies and Sharing Without Restrictions -- Type-Safe Two-Level Data Transformation -- Algebra -- Feature Algebra -- Education -- Using Domain-Independent Problems for Introducing Formal Methods -- Formal Modelling of Systems -- Compositional Binding in Network Domains -- Formal Modeling of Communication Protocols by Graph Transformation -- Feature Specification and Static Analysis for Interaction Resolution -- A Fully General Operational Semantics for UML 2.0 Sequence Diagrams with Potential and Mandatory Choice -- Formal Aspects of Java -- Towards Automatic Exception Safety Verification -- Enforcer – Efficient Failure Injection -- Automated Boundary Test Generation from JML Specifications -- Formal Reasoning About Non-atomic Java Card Methods in Dynamic Logic -- Programming Languages -- Formal Verification of a C Compiler Front-End -- A Memory Model Sensitive Checker for C# -- Changing Programs Correctly: Refactoring with Specifications -- Mechanical Verification of Recursive Procedures Manipulating Pointers Using Separation Logic -- Model Checking -- Model-Based Variable and Transition Orderings for Efficient Symbolic Model Checking -- Exact and Approximate Strategies for Symmetry Reduction in Model Checking -- Monitoring Distributed Controllers: When an Efficient LTL Algorithm on Sequences Is Needed to Model-Check Traces -- PSL Model Checking and Run-Time Verification Via Testers -- Industry Day: Abstracts of Invited Talks -- Formal Methods for Security: Lightweight Plug-In or New Engineering Discipline -- Formal Methods in the Security Business: Exotic Flowers Thriving in an Expanding Niche -- Connector-Based Software Development: Deriving Secure Protocols -- Model-Based Security Engineering for Real -- Cost Effective Software Engineering for Security -- Formal Methods and Cryptography -- Verified Software Grand Challenge. |
| Record Nr. | UNISA-996465585503316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2006 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Higher-Order Algebra, Logic, and Term Rewriting [[electronic resource] ] : First International Workshop, HOA '93, Amsterdam, The Netherlands, September 23 - 24, 1993. Selected Papers / / edited by Jan Heering, Karl Meinke, Bernhard Möller, Tobias Nipkow
| Higher-Order Algebra, Logic, and Term Rewriting [[electronic resource] ] : First International Workshop, HOA '93, Amsterdam, The Netherlands, September 23 - 24, 1993. Selected Papers / / edited by Jan Heering, Karl Meinke, Bernhard Möller, Tobias Nipkow |
| Edizione | [1st ed. 1994.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1994 |
| Descrizione fisica | 1 online resource (IX, 351 p.) |
| Disciplina | 005.1/01/5113 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Programming languages (Electronic computers)
Computers Mathematical logic Computer logic Programming Languages, Compilers, Interpreters Theory of Computation Mathematical Logic and Formal Languages Logics and Meanings of Programs Mathematical Logic and Foundations |
| ISBN | 3-540-48579-1 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Interaction systems -- Strong normalization of typeable rewrite systems -- A transformation system combining partial evaluation with term rewriting -- Prototyping relational specifications using higher-order objects -- Origin tracking for higher-order term rewriting systems -- Theory interpretation in simple type theory -- The semantics of SPECTRUM -- ATLAS: A typed language for algebraic specification -- Compilation of Combinatory Reduction Systems -- Specification and verification in higher order algebra: A case study of convolution -- Ordered and continuous models of higher-order specifications -- Rewriting properties of combinators for rudimentary linear logic -- Comparing combinatory reduction systems and higher-order rewrite systems -- Termination proofs for higher-order rewrite systems -- Extensions of initial models and their second-order proof systems. |
| Record Nr. | UNISA-996466092403316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1994 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Theorem Proving in Higher Order Logics [[electronic resource] ] : 22nd International Conference, TPHOLs 2009, Munich, Germany, August 17-20, 2009, Proceedings / / edited by Stefan Berghofer, Tobias Nipkow, Christian Urban, Makarius Wenzel
| Theorem Proving in Higher Order Logics [[electronic resource] ] : 22nd International Conference, TPHOLs 2009, Munich, Germany, August 17-20, 2009, Proceedings / / edited by Stefan Berghofer, Tobias Nipkow, Christian Urban, Makarius Wenzel |
| Edizione | [1st ed. 2009.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2009 |
| Descrizione fisica | 1 online resource (XI, 517 p.) |
| Disciplina | 004.0151 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science
Machine theory Computer science—Mathematics Discrete mathematics Algorithms Theory of Computation Formal Languages and Automata Theory Computer Science Logic and Foundations of Programming Mathematics of Computing Discrete Mathematics in Computer Science |
| ISBN | 3-642-03359-8 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Papers -- Let’s Get Physical: Models and Methods for Real-World Security Protocols -- VCC: A Practical System for Verifying Concurrent C -- Without Loss of Generality -- Invited Tutorials -- HOL Light: An Overview -- A Brief Overview of Mizar -- A Brief Overview of Agda – A Functional Language with Dependent Types -- The Twelf Proof Assistant -- Regular Papers -- Hints in Unification -- Psi-calculi in Isabelle -- Some Domain Theory and Denotational Semantics in Coq -- Turning Inductive into Equational Specifications -- Formalizing the Logic-Automaton Connection -- Extended First-Order Logic -- Formalising Observer Theory for Environment-Sensitive Bisimulation -- Formal Certification of a Resource-Aware Language Implementation -- A Certified Data Race Analysis for a Java-like Language -- Formal Analysis of Optical Waveguides in HOL -- The HOL-Omega Logic -- A Purely Definitional Universal Domain -- Types, Maps and Separation Logic -- Acyclic Preferences and Existence of Sequential Nash Equilibria: A Formal and Constructive Equivalence -- Formalising FinFuns – Generating Code for Functions as Data from Isabelle/HOL -- Packaging Mathematical Structures -- Practical Tactics for Separation Logic -- Verified LISP Implementations on ARM, x86 and PowerPC -- Trace-Based Coinductive Operational Semantics for While -- A Better x86 Memory Model: x86-TSO -- Formal Verification of Exact Computations Using Newton’s Method -- Construction of Büchi Automata for LTL Model Checking Verified in Isabelle/HOL -- A Hoare Logic for the State Monad -- Certification of Termination Proofs Using CeTA -- A Formalisation of Smallfoot in HOL -- Liveness Reasoning with Isabelle/HOL -- Mind the Gap. |
| Record Nr. | UNISA-996465644003316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2009 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Theorem Proving in Higher Order Logics [[electronic resource] ] : 22nd International Conference, TPHOLs 2009, Munich, Germany, August 17-20, 2009, Proceedings / / edited by Stefan Berghofer, Tobias Nipkow, Christian Urban, Makarius Wenzel
| Theorem Proving in Higher Order Logics [[electronic resource] ] : 22nd International Conference, TPHOLs 2009, Munich, Germany, August 17-20, 2009, Proceedings / / edited by Stefan Berghofer, Tobias Nipkow, Christian Urban, Makarius Wenzel |
| Edizione | [1st ed. 2009.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2009 |
| Descrizione fisica | 1 online resource (XI, 517 p.) |
| Disciplina | 004.0151 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science
Machine theory Computer science—Mathematics Discrete mathematics Algorithms Theory of Computation Formal Languages and Automata Theory Computer Science Logic and Foundations of Programming Mathematics of Computing Discrete Mathematics in Computer Science |
| ISBN | 3-642-03359-8 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Papers -- Let’s Get Physical: Models and Methods for Real-World Security Protocols -- VCC: A Practical System for Verifying Concurrent C -- Without Loss of Generality -- Invited Tutorials -- HOL Light: An Overview -- A Brief Overview of Mizar -- A Brief Overview of Agda – A Functional Language with Dependent Types -- The Twelf Proof Assistant -- Regular Papers -- Hints in Unification -- Psi-calculi in Isabelle -- Some Domain Theory and Denotational Semantics in Coq -- Turning Inductive into Equational Specifications -- Formalizing the Logic-Automaton Connection -- Extended First-Order Logic -- Formalising Observer Theory for Environment-Sensitive Bisimulation -- Formal Certification of a Resource-Aware Language Implementation -- A Certified Data Race Analysis for a Java-like Language -- Formal Analysis of Optical Waveguides in HOL -- The HOL-Omega Logic -- A Purely Definitional Universal Domain -- Types, Maps and Separation Logic -- Acyclic Preferences and Existence of Sequential Nash Equilibria: A Formal and Constructive Equivalence -- Formalising FinFuns – Generating Code for Functions as Data from Isabelle/HOL -- Packaging Mathematical Structures -- Practical Tactics for Separation Logic -- Verified LISP Implementations on ARM, x86 and PowerPC -- Trace-Based Coinductive Operational Semantics for While -- A Better x86 Memory Model: x86-TSO -- Formal Verification of Exact Computations Using Newton’s Method -- Construction of Büchi Automata for LTL Model Checking Verified in Isabelle/HOL -- A Hoare Logic for the State Monad -- Certification of Termination Proofs Using CeTA -- A Formalisation of Smallfoot in HOL -- Liveness Reasoning with Isabelle/HOL -- Mind the Gap. |
| Record Nr. | UNINA-9910484509503321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2009 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Types for Proofs and Programs [[electronic resource] ] : International Workshop TYPES '93, Nijmegen, The Netherlands, May 24 - 28, 1993. Selected Papers / / edited by Henk Barendregt, Tobias Nipkow
| Types for Proofs and Programs [[electronic resource] ] : International Workshop TYPES '93, Nijmegen, The Netherlands, May 24 - 28, 1993. Selected Papers / / edited by Henk Barendregt, Tobias Nipkow |
| Edizione | [1st ed. 1994.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1994 |
| Descrizione fisica | 1 online resource (IX, 395 p.) |
| Disciplina | 005.1/01/5113 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computers
Software engineering Mathematical logic Computer logic Artificial intelligence Theory of Computation Software Engineering/Programming and Operating Systems Mathematical Logic and Formal Languages Logics and Meanings of Programs Artificial Intelligence |
| ISBN | 3-540-48440-X |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Proving strong normalization of CC by modifying realizability semantics -- Checking algorithms for Pure Type Systems -- Infinite objects in type theory -- Conservativity between logics and typed ? calculi -- Logic of refinement types -- Proof-checking a data link protocol -- Elimination of extensionality in Martin-Löf type theory -- Programming with streams in Coq a case study: The Sieve of Eratosthenes -- The Alf proof editor and its proof engine -- Encoding Z-style Schemas in type theory -- The expressive power of Structural Operational Semantics with explicit assumptions -- Developing certified programs in the system Coq the program tactic -- Closure under alpha-conversion -- Machine Deduction -- Type theory and the informal language of mathematics -- Semantics for abstract clauses. |
| Record Nr. | UNISA-996466249703316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1994 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||