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.
Advances in cryptology - asiacrypt 2007 : 13th international conference on the theory and application of cryptology and information security, kuching, malaysia, december 2-6, 2007, proceedings / / edited by Kaoru Kurosawa
| Advances in cryptology - asiacrypt 2007 : 13th international conference on the theory and application of cryptology and information security, kuching, malaysia, december 2-6, 2007, proceedings / / edited by Kaoru Kurosawa |
| Edizione | [1st ed. 2007.] |
| Pubbl/distr/stampa | Berlin, Germany : , : Springer, , [2007] |
| Descrizione fisica | 1 online resource (XIV, 583 p.) |
| Disciplina | 005.8 |
| Collana | Security and Cryptology |
| Soggetto topico |
Computer security
Cryptography |
| ISBN | 3-540-76900-5 |
| Classificazione |
510
DAT 465f SS 4800 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Number Theory and Elliptic Curve -- A Kilobit Special Number Field Sieve Factorization -- When e-th Roots Become Easier Than Factoring -- Faster Addition and Doubling on Elliptic Curves -- Protocol -- A Non-interactive Shuffle with Pairing Based Verifiability -- On Privacy Models for RFID -- Invited Talk I -- Obtaining Universally Compoable Security: Towards the Bare Bones of Trust -- A Simple Variant of the Merkle-Damgård Scheme with a Permutation -- Seven-Property-Preserving Iterated Hashing: ROX -- How to Build a Hash Function from Any Collision-Resistant Function -- Fully Anonymous Group Signatures Without Random Oracles -- Group Encryption -- Identity-Based Broadcast Encryption with Constant Size Ciphertexts and Private Keys -- Boosting Merkle-Damgård Hashing for Message Authentication -- On Efficient Message Authentication Via Block Cipher Design Techniques -- Symmetric Key Cryptography on Modern Graphics Hardware -- Multiparty Computation I -- Blind Identity-Based Encryption and Simulatable Oblivious Transfer -- Multi-party Indirect Indexing and Applications -- Two-Party Computing with Encrypted Data -- Known-Key Distinguishers for Some Block Ciphers -- Generic Attacks on Unbalanced Feistel Schemes with Expanding Functions -- On Tweaking Luby-Rackoff Blockciphers -- Multiparty Computation II -- Secure Protocols with Asymmetric Trust -- Simple and Efficient Perfectly-Secure Asynchronous MPC -- Efficient Byzantine Agreement with Faulty Minority -- Information-Theoretic Security Without an Honest Majority -- Black-Box Extension Fields and the Inexistence of Field-Homomorphic One-Way Permutations -- Concurrent Statistical Zero-Knowledge Arguments for NP from One Way Functions -- Anonymous Quantum Communication -- Invited Talk II -- Authenticated Key Exchange and Key Encapsulation in the Standard Model -- Miniature CCA2 PK Encryption: Tight Security Without Redundancy -- Bounded CCA2-Secure Encryption -- Relations Among Notions of Non-malleability for Encryption -- Cryptanalysis of the Tiger Hash Function -- Cryptanalysis of Grindahl -- A Key Recovery Attack on Edon80. |
| Record Nr. | UNISA-996465496803316 |
| Berlin, Germany : , : Springer, , [2007] | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Advances in Cryptology – ASIACRYPT 2007 : 13th International Conference on the Theory and Application of Cryptology and Information Security, Kuching, Malaysia, December 2-6, 2007, Proceedings / / edited by Kaoru Kurosawa
| Advances in Cryptology – ASIACRYPT 2007 : 13th International Conference on the Theory and Application of Cryptology and Information Security, Kuching, Malaysia, December 2-6, 2007, Proceedings / / edited by Kaoru Kurosawa |
| Edizione | [1st ed. 2007.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2007 |
| Descrizione fisica | 1 online resource (XIV, 583 p.) |
| Disciplina | 005.8 |
| Collana | Security and Cryptology |
| Soggetto topico |
Coding theory
Information theory Cryptography Data encryption (Computer science) Data protection Algorithms Electronic data processing - Management Computer networks Coding and Information Theory Cryptology Data and Information Security IT Operations Computer Communication Networks |
| ISBN | 3-540-76900-5 |
| Classificazione |
510
DAT 465f SS 4800 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Number Theory and Elliptic Curve -- A Kilobit Special Number Field Sieve Factorization -- When e-th Roots Become Easier Than Factoring -- Faster Addition and Doubling on Elliptic Curves -- Protocol -- A Non-interactive Shuffle with Pairing Based Verifiability -- On Privacy Models for RFID -- Invited Talk I -- Obtaining Universally Compoable Security: Towards the Bare Bones of Trust -- A Simple Variant of the Merkle-Damgård Scheme with a Permutation -- Seven-Property-Preserving Iterated Hashing: ROX -- How to Build a Hash Function from Any Collision-Resistant Function -- Fully Anonymous Group Signatures Without Random Oracles -- Group Encryption -- Identity-Based Broadcast Encryption with Constant Size Ciphertexts and Private Keys -- Boosting Merkle-Damgård Hashing for Message Authentication -- On Efficient Message Authentication Via Block Cipher Design Techniques -- Symmetric Key Cryptography on Modern Graphics Hardware -- Multiparty Computation I -- Blind Identity-Based Encryption and Simulatable Oblivious Transfer -- Multi-party Indirect Indexing and Applications -- Two-Party Computing with Encrypted Data -- Known-Key Distinguishers for Some Block Ciphers -- Generic Attacks on Unbalanced Feistel Schemes with Expanding Functions -- On Tweaking Luby-Rackoff Blockciphers -- Multiparty Computation II -- Secure Protocols with Asymmetric Trust -- Simple and Efficient Perfectly-Secure Asynchronous MPC -- Efficient Byzantine Agreement with Faulty Minority -- Information-Theoretic Security Without an Honest Majority -- Black-Box Extension Fields and the Inexistence of Field-Homomorphic One-Way Permutations -- Concurrent Statistical Zero-Knowledge Arguments for NP from One Way Functions -- Anonymous Quantum Communication -- Invited Talk II -- Authenticated Key Exchange and Key Encapsulation in the StandardModel -- Miniature CCA2 PK Encryption: Tight Security Without Redundancy -- Bounded CCA2-Secure Encryption -- Relations Among Notions of Non-malleability for Encryption -- Cryptanalysis of the Tiger Hash Function -- Cryptanalysis of Grindahl -- A Key Recovery Attack on Edon80. |
| Record Nr. | UNINA-9910483450203321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2007 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Advances in mathematical sciences : CRM's 25 years / Luc Vinet (ed.)
| Advances in mathematical sciences : CRM's 25 years / Luc Vinet (ed.) |
| Autore | Vinet, Luc |
| Pubbl/distr/stampa | Providence, RI : American Mathematical Society, 1997 |
| Descrizione fisica | x, 491 p. ; 25 cm. |
| Collana | CRM Proceedings and lecture notes ; 11 |
| Soggetto topico | Mathematics |
| ISBN | 0821806866 |
| Classificazione |
510
510(082.2) QA7.A233 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNISALENTO-991000801789707536 |
Vinet, Luc
|
||
| Providence, RI : American Mathematical Society, 1997 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. del Salento | ||
| ||
Approximations and endomorphism algebras of modules [[electronic resource] /] / by Rüdiger Göbel and Jan Trlifaj
| Approximations and endomorphism algebras of modules [[electronic resource] /] / by Rüdiger Göbel and Jan Trlifaj |
| Autore | Göbel R (Rüdiger), <1940-> |
| Pubbl/distr/stampa | Berlin ; ; New York, : Walter de Gruyter, 2006 |
| Descrizione fisica | 1 online resource (664 p.) |
| Disciplina | 512/.42 |
| Altri autori (Persone) | TrlifajJan |
| Collana | De Gruyter expositions in mathematics |
| Soggetto topico |
Modules (Algebra)
Moduli theory Approximation theory |
| Soggetto non controllato | Algebra, ideal, module, ring, indecomposable module |
| ISBN |
1-282-19483-6
9786612194832 3-11-019972-6 |
| Classificazione |
510
SK 150 SK 230 SK 820 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Front matter -- Contents -- Chapter 1. Some useful classes of modules -- Chapter 2. Approximations of modules -- Chapter 3. Complete cotorsion pairs -- Chapter 4. Deconstruction of cotorsion pairs -- Chapter 5. Tilting approximations -- Chapter 6. 1-tilting modules and their applications -- Chapter 7. Tilting approximations and the finitistic dimension conjectures -- Chapter 8. Cotilting modules -- Chapter 9. The Black Box and its relatives -- Chapter 10. Independence results for cotorsion pairs -- Chapter 11. The lattice of cotorsion pairs -- Chapter 12. Realizing algebras - by algebraically independent elements and by prediction principles -- Chapter 13. E(R)-algebras -- Chapter 14. Modules with distinguished submodules -- Chapter 15. Some useful classes of algebras -- Backmatter |
| Record Nr. | UNINA-9910784286503321 |
|
Göbel R (Rüdiger), <1940->
|
||
| Berlin ; ; New York, : Walter de Gruyter, 2006 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Approximations and endomorphism algebras of modules / / by Rudiger Gobel and Jan Trlifaj
| Approximations and endomorphism algebras of modules / / by Rudiger Gobel and Jan Trlifaj |
| Autore | Göbel R (Rüdiger), <1940-> |
| Edizione | [1st ed.] |
| Pubbl/distr/stampa | Berlin ; ; New York, : Walter de Gruyter, 2006 |
| Descrizione fisica | 1 online resource (664 p.) |
| Disciplina | 512/.42 |
| Altri autori (Persone) | TrlifajJan |
| Collana | De Gruyter expositions in mathematics |
| Soggetto topico |
Modules (Algebra)
Moduli theory Approximation theory |
| ISBN |
9786612194832
9781282194830 1282194836 9783110199727 3110199726 |
| Classificazione |
510
SK 150 SK 230 SK 820 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Front matter -- Contents -- Chapter 1. Some useful classes of modules -- Chapter 2. Approximations of modules -- Chapter 3. Complete cotorsion pairs -- Chapter 4. Deconstruction of cotorsion pairs -- Chapter 5. Tilting approximations -- Chapter 6. 1-tilting modules and their applications -- Chapter 7. Tilting approximations and the finitistic dimension conjectures -- Chapter 8. Cotilting modules -- Chapter 9. The Black Box and its relatives -- Chapter 10. Independence results for cotorsion pairs -- Chapter 11. The lattice of cotorsion pairs -- Chapter 12. Realizing algebras - by algebraically independent elements and by prediction principles -- Chapter 13. E(R)-algebras -- Chapter 14. Modules with distinguished submodules -- Chapter 15. Some useful classes of algebras -- Backmatter |
| Record Nr. | UNINA-9910973934903321 |
|
Göbel R (Rüdiger), <1940->
|
||
| Berlin ; ; New York, : Walter de Gruyter, 2006 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Automated deduction - CADE-22 : 22nd International Conference on Automated Deduction, Montreal, Canada, August 2-7, 2009 : proceedings / / Renate A. Schmidt
| Automated deduction - CADE-22 : 22nd International Conference on Automated Deduction, Montreal, Canada, August 2-7, 2009 : proceedings / / Renate A. Schmidt |
| Edizione | [1st ed. 2009.] |
| Pubbl/distr/stampa | Berlin, Germany ; ; New York, New York : , : Springer, , [2009] |
| Descrizione fisica | 1 online resource (515 p.) |
| Disciplina | 006.3 |
| Collana |
Lecture notes in computer science
Lecture notes in artificial intelligence LNCS sublibrary. SL 7, Artificial intelligence |
| Soggetto topico |
Logic, Symbolic and mathematical
Automatic theorem proving |
| ISBN |
1-282-33197-3
9786612331978 3-642-02959-0 |
| Classificazione |
DAT 706f
DAT 716f SS 4800 004 510 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Session 1. Invited Talk -- Integrated Reasoning and Proof Choice Point Selection in the Jahob System – Mechanisms for Program Survival -- Session 2. Combinations and Extensions -- Superposition and Model Evolution Combined -- On Deciding Satisfiability by DPLL( ) and Unsound Theorem Proving -- Combinable Extensions of Abelian Groups -- Locality Results for Certain Extensions of Theories with Bridging Functions -- Session 3. Minimal Unsatisfiability and Automated Reasoning Support -- Axiom Pinpointing in Lightweight Description Logics via Horn-SAT Encoding and Conflict Analysis -- Does This Set of Clauses Overlap with at Least One MUS? -- Progress in the Development of Automated Theorem Proving for Higher-Order Logic -- Session 4. System Descriptions -- System Description: H-PILoT -- SPASS Version 3.5 -- Dei: A Theorem Prover for Terms with Integer Exponents -- veriT: An Open, Trustable and Efficient SMT-Solver -- Divvy: An ATP Meta-system Based on Axiom Relevance Ordering -- Session 5. Invited Talk -- Instantiation-Based Automated Reasoning: From Theory to Practice -- Session 6. Interpolation and Predicate Abstraction -- Interpolant Generation for UTVPI -- Ground Interpolation for Combined Theories -- Interpolation and Symbol Elimination -- Complexity and Algorithms for Monomial and Clausal Predicate Abstraction -- Session 7. Resolution-Based Systems for Non-classical Logics -- Efficient Intuitionistic Theorem Proving with the Polarized Inverse Method -- A Refined Resolution Calculus for CTL -- Fair Derivations in Monodic Temporal Reasoning -- Session 8. Termination Analysis and Constraint Solving -- A Term Rewriting Approach to the Automated Termination Analysis of Imperative Programs -- Solving Non-linear Polynomial Arithmetic via SAT Modulo Linear Arithmetic -- Session 9. Invited Talk -- Building Theorem Provers -- Session 10. Rewriting, Termination and Productivity -- Termination Analysis by Dependency Pairs and Inductive Theorem Proving -- Beyond Dependency Graphs -- Computing Knowledge in Security Protocols under Convergent Equational Theories -- Complexity of Fractran and Productivity -- Session 11. Models -- Automated Inference of Finite Unsatisfiability -- Decidability Results for Saturation-Based Model Building -- Session 12. Modal Tableaux with Global Caching -- A Tableau Calculus for Regular Grammar Logics with Converse -- An Optimal On-the-Fly Tableau-Based Decision Procedure for PDL-Satisfiability -- Session 13. Arithmetic -- Volume Computation for Boolean Combination of Linear Arithmetic Constraints -- A Generalization of Semenov’s Theorem to Automata over Real Numbers -- Real World Verification. |
| Altri titoli varianti | CADE 22 |
| Record Nr. | UNISA-996465837603316 |
| Berlin, Germany ; ; New York, New York : , : Springer, , [2009] | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Automated Deduction -- CADE-24 [[electronic resource] ] : 24th International Conference on Automated Deduction, Lake Placid, NY, USA, June 9-14, 2013, Proceedings / / edited by Maria Paola Bonacina
| Automated Deduction -- CADE-24 [[electronic resource] ] : 24th International Conference on Automated Deduction, Lake Placid, NY, USA, June 9-14, 2013, Proceedings / / edited by Maria Paola Bonacina |
| Edizione | [1st ed. 2013.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 |
| Descrizione fisica | 1 online resource (XVI, 466 p. 95 illus.) : digital |
| Disciplina | 511.3 |
| Collana | Lecture Notes in Artificial Intelligence |
| Soggetto topico |
Artificial intelligence
Mathematical logic Computer logic Software engineering Algorithms Artificial Intelligence Mathematical Logic and Formal Languages Logics and Meanings of Programs Software Engineering Algorithm Analysis and Problem Complexity |
| Soggetto genere / forma |
Kongress2013.Lake Placid, NY
Conference papers and proceedings. |
| ISBN | 3-642-38574-5 |
| Classificazione |
004
510 DAT 706f DAT 716f SS 4800 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | One Logic to Use Them All -- The Tree Width of Separation Logic with Recursive Definitions -- Hierarchic Superposition with Weak Abstraction -- Completeness and Decidability Results for First-Order Clauses with Indices -- A Proof Procedure for Hybrid Logic with Binders, Transitivity and Relation Hierarchies -- Tractable Inference Systems: An Extension with a Deducibility Predicate -- Computing Tiny Clause Normal Forms -- System Description: E-KRHyper 1.4 Extensions for Unique Names and Description Logic -- Analysing Vote Counting Algorithms via Logic: And Its Application to the CADE Election Scheme -- Automated Reasoning, Fast and Slow -- Foundational Proof Certificates in First-Order Logic -- Computation in Real Closed Infinitesimal and Transcendental Extensions of the Rationals -- A Symbiosis of Interval Constraint Propagation and Cylindrical Algebraic Decomposition -- dReal: An SMT Solver for Nonlinear Theories over the Reals -- Solving Difference Constraints over Modular Arithmetic -- Asymmetric Unification: A New Unification Paradigm for Cryptographic Protocol Analysis -- Hierarchical Combination -- PRocH: Proof Reconstruction for HOL Light -- An Improved BDD Method for Intuitionistic Propositional Logic: BDDIntKt System Description -- Towards Modularly Comparing Programs Using Automated Theorem Provers -- Reuse in Software Verification by Abstract Method Calls -- Dynamic Logic with Trace Semantics -- Temporalizing Ontology-Based Data Access -- Verifying Refutations with Extended Resolution -- Hierarchical Reasoning and Model Generation for the Verification of Parametric Hybrid Systems -- Quantifier Instantiation Techniques for Finite Model Finding in SMT -- Automating Inductive Proofs Using Theory Exploration -- E-MaLeS 1.1 -- TFF1: The TPTP Typed First-Order Form with Rank-1 Polymorphism -- Propositional Temporal Proving with Reductions to a SAT Problem -- InKreSAT: Modal Reasoning via Incremental Reduction to SAT -- bv2epr: A Tool for Polynomially Translating Quantifier-Free Bit-Vector Formulas into EPR -- The 481 Ways to Split a Clause and Deal with Propositional Variables. |
| Record Nr. | UNISA-996465852703316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Automated Deduction -- CADE-24 : 24th International Conference on Automated Deduction, Lake Placid, NY, USA, June 9-14, 2013, Proceedings / / edited by Maria Paola Bonacina
| Automated Deduction -- CADE-24 : 24th International Conference on Automated Deduction, Lake Placid, NY, USA, June 9-14, 2013, Proceedings / / edited by Maria Paola Bonacina |
| Edizione | [1st ed. 2013.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 |
| Descrizione fisica | 1 online resource (XVI, 466 p. 95 illus.) : digital |
| Disciplina | 511.3 |
| Collana | Lecture Notes in Artificial Intelligence |
| Soggetto topico |
Artificial intelligence
Machine theory Computer science Software engineering Algorithms Artificial Intelligence Formal Languages and Automata Theory Computer Science Logic and Foundations of Programming Software Engineering |
| ISBN | 3-642-38574-5 |
| Classificazione |
004
510 DAT 706f DAT 716f SS 4800 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | One Logic to Use Them All -- The Tree Width of Separation Logic with Recursive Definitions -- Hierarchic Superposition with Weak Abstraction -- Completeness and Decidability Results for First-Order Clauses with Indices -- A Proof Procedure for Hybrid Logic with Binders, Transitivity and Relation Hierarchies -- Tractable Inference Systems: An Extension with a Deducibility Predicate -- Computing Tiny Clause Normal Forms -- System Description: E-KRHyper 1.4 Extensions for Unique Names and Description Logic -- Analysing Vote Counting Algorithms via Logic: And Its Application to the CADE Election Scheme -- Automated Reasoning, Fast and Slow -- Foundational Proof Certificates in First-Order Logic -- Computation in Real Closed Infinitesimal and Transcendental Extensions of the Rationals -- A Symbiosis of Interval Constraint Propagation and Cylindrical Algebraic Decomposition -- dReal: An SMT Solver for Nonlinear Theories over the Reals -- Solving Difference Constraints over Modular Arithmetic -- Asymmetric Unification: A New Unification Paradigm for Cryptographic Protocol Analysis -- Hierarchical Combination -- PRocH: Proof Reconstruction for HOL Light -- An Improved BDD Method for Intuitionistic Propositional Logic: BDDIntKt System Description -- Towards Modularly Comparing Programs Using Automated Theorem Provers -- Reuse in Software Verification by Abstract Method Calls -- Dynamic Logic with Trace Semantics -- Temporalizing Ontology-Based Data Access -- Verifying Refutations with Extended Resolution -- Hierarchical Reasoning and Model Generation for the Verification of Parametric Hybrid Systems -- Quantifier Instantiation Techniques for Finite Model Finding in SMT -- Automating Inductive Proofs Using Theory Exploration -- E-MaLeS 1.1 -- TFF1: The TPTP Typed First-Order Form with Rank-1 Polymorphism -- Propositional Temporal Proving with Reductions to a SAT Problem -- InKreSAT: Modal Reasoning via Incremental Reduction to SAT -- bv2epr: A Tool for Polynomially Translating Quantifier-Free Bit-Vector Formulas into EPR -- The 481 Ways to Split a Clause and Deal with Propositional Variables. |
| Record Nr. | UNINA-9910483964403321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Automated Deduction – CADE-22 : 22nd International Conference on Automated Deduction, Montreal, Canada, August 2-7, 2009. Proceedings / / edited by Renate Schmidt
| Automated Deduction – CADE-22 : 22nd International Conference on Automated Deduction, Montreal, Canada, August 2-7, 2009. Proceedings / / edited by Renate Schmidt |
| Edizione | [1st ed. 2009.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2009 |
| Descrizione fisica | 1 online resource (515 p.) |
| Disciplina | 006.3 |
| Collana | Lecture Notes in Artificial Intelligence |
| Soggetto topico |
Artificial intelligence
Compilers (Computer programs) Computer programming Machine theory Computer science Software engineering Artificial Intelligence Compilers and Interpreters Programming Techniques Formal Languages and Automata Theory Computer Science Logic and Foundations of Programming Software Engineering |
| ISBN |
1-282-33197-3
9786612331978 3-642-02959-0 |
| Classificazione |
DAT 706f
DAT 716f SS 4800 004 510 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Session 1. Invited Talk -- Integrated Reasoning and Proof Choice Point Selection in the Jahob System – Mechanisms for Program Survival -- Session 2. Combinations and Extensions -- Superposition and Model Evolution Combined -- On Deciding Satisfiability by DPLL( ) and Unsound Theorem Proving -- Combinable Extensions of Abelian Groups -- Locality Results for Certain Extensions of Theories with Bridging Functions -- Session 3. Minimal Unsatisfiability and Automated Reasoning Support -- Axiom Pinpointing in Lightweight Description Logics via Horn-SAT Encoding and Conflict Analysis -- Does This Set of Clauses Overlap with at Least One MUS? -- Progress in the Development of Automated Theorem Proving for Higher-Order Logic -- Session 4. System Descriptions -- System Description: H-PILoT -- SPASS Version 3.5 -- Dei: A Theorem Prover for Terms with Integer Exponents -- veriT: An Open, Trustable and Efficient SMT-Solver -- Divvy: An ATP Meta-system Based on Axiom Relevance Ordering -- Session 5. Invited Talk -- Instantiation-Based Automated Reasoning: From Theory to Practice -- Session 6. Interpolation and Predicate Abstraction -- Interpolant Generation for UTVPI -- Ground Interpolation for Combined Theories -- Interpolation and Symbol Elimination -- Complexity and Algorithms for Monomial and Clausal Predicate Abstraction -- Session 7. Resolution-Based Systems for Non-classical Logics -- Efficient Intuitionistic Theorem Proving with the Polarized Inverse Method -- A Refined Resolution Calculus for CTL -- Fair Derivations in Monodic Temporal Reasoning -- Session 8. Termination Analysis and Constraint Solving -- A Term Rewriting Approach to the Automated Termination Analysis of Imperative Programs -- Solving Non-linear Polynomial Arithmetic via SAT Modulo Linear Arithmetic -- Session 9. Invited Talk.-Building Theorem Provers -- Session 10. Rewriting, Termination and Productivity -- Termination Analysis by Dependency Pairs and Inductive Theorem Proving -- Beyond Dependency Graphs -- Computing Knowledge in Security Protocols under Convergent Equational Theories -- Complexity of Fractran and Productivity -- Session 11. Models -- Automated Inference of Finite Unsatisfiability -- Decidability Results for Saturation-Based Model Building -- Session 12. Modal Tableaux with Global Caching -- A Tableau Calculus for Regular Grammar Logics with Converse -- An Optimal On-the-Fly Tableau-Based Decision Procedure for PDL-Satisfiability -- Session 13. Arithmetic -- Volume Computation for Boolean Combination of Linear Arithmetic Constraints -- A Generalization of Semenov’s Theorem to Automata over Real Numbers -- Real World Verification. |
| Record Nr. | UNINA-9910483050003321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2009 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Combinatorial number theory revisited [[electronic resource] ] : proceedings of the 'Integers Conference 2007', Carrollton, Georgia, USA, October 24-27, 2007 / / editors, B. Landman ... [et al.]
| Combinatorial number theory revisited [[electronic resource] ] : proceedings of the 'Integers Conference 2007', Carrollton, Georgia, USA, October 24-27, 2007 / / editors, B. Landman ... [et al.] |
| Pubbl/distr/stampa | Berlin ; ; New York, : Walter de Gruyter, c2009 |
| Descrizione fisica | 1 online resource (207 p.) |
| Disciplina | 512.78 |
| Altri autori (Persone) | LandmanBruce M. <1951-> |
| Collana | De Gruyter Proceedings in Mathematics |
| Soggetto topico |
Combinatorial number theory
Number theory |
| Soggetto non controllato |
Additive Number Theory
Combinatorial Game Theory Hypergraphs Multiplicative Number Theory Probabilistic Number Theory Ramsey Theory |
| ISBN |
1-282-10251-6
9786612102516 3-11-020850-4 |
| Classificazione |
510
SK 180 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Frontmatter -- Table of contents -- The Finite Heine Transformation -- Finding Almost Squares III -- Sums and Differences of the Coordinates of Points on Modular Hyperbolas -- Self Generating Sets and Numeration Systems -- Small Sets Satisfying the Central Sets Theorem -- Column-to-Row Operations on Partitions: The Envelopes -- On the Euler Product of Some Zeta Functions -- On the Range of the Iterated Euler Function -- Frobenius Numbers of Generalized Fibonacci Semigroups -- Combinatorics of Ramanujan-Slater Type Identities -- A Mock Theta Function for the Delta-function -- On the Density of Integral Sets with Missing Differences -- On Pseudosquares and Pseudopowers -- Maier Matrices Beyond Z -- Linear Equations Involving Iterates of σ (N) -- Heron Sequences and Their Modifications -- Backmatter |
| Record Nr. | UNINA-9910782830203321 |
| Berlin ; ; New York, : Walter de Gruyter, c2009 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
