Automated Deduction - CADE-25 [[electronic resource] ] : 25th International Conference on Automated Deduction, Berlin, Germany, August 1-7, 2015, Proceedings / / edited by Amy P. Felty, Aart Middeldorp |
Edizione | [1st ed. 2015.] |
Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2015 |
Descrizione fisica | 1 online resource (XXVIII, 640 p. 93 illus.) |
Disciplina | 511.36028563 |
Collana | Lecture Notes in Artificial Intelligence |
Soggetto topico |
Optical data processing
Artificial intelligence Algorithms Application software Computers Pattern recognition Image Processing and Computer Vision Artificial Intelligence Algorithm Analysis and Problem Complexity Information Systems Applications (incl. Internet) Computation by Abstract Devices Pattern Recognition |
ISBN | 3-319-21401-2 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Automated deduction.- Foundations -- Applications -- Implementations.- Practical experience. |
Record Nr. | UNINA-9910485052603321 |
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2015 | ||
![]() | ||
Lo trovi qui: Univ. Federico II | ||
|
Automated Deduction - CADE-25 [[electronic resource] ] : 25th International Conference on Automated Deduction, Berlin, Germany, August 1-7, 2015, Proceedings / / edited by Amy P. Felty, Aart Middeldorp |
Edizione | [1st ed. 2015.] |
Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2015 |
Descrizione fisica | 1 online resource (XXVIII, 640 p. 93 illus.) |
Disciplina | 511.36028563 |
Collana | Lecture Notes in Artificial Intelligence |
Soggetto topico |
Optical data processing
Artificial intelligence Algorithms Application software Computers Pattern recognition Image Processing and Computer Vision Artificial Intelligence Algorithm Analysis and Problem Complexity Information Systems Applications (incl. Internet) Computation by Abstract Devices Pattern Recognition |
ISBN | 3-319-21401-2 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Automated deduction.- Foundations -- Applications -- Implementations.- Practical experience. |
Record Nr. | UNISA-996204581903316 |
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2015 | ||
![]() | ||
Lo trovi qui: Univ. di Salerno | ||
|
Automated Deduction – CADE 26 [[electronic resource] ] : 26th International Conference on Automated Deduction, Gothenburg, Sweden, August 6–11, 2017, Proceedings / / edited by Leonardo de Moura |
Edizione | [1st ed. 2017.] |
Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2017 |
Descrizione fisica | 1 online resource (XI, 582 p. 87 illus.) |
Disciplina | 511.36028563 |
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 |
ISBN | 3-319-63046-6 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Automated deduction -- Including foundations -- Applications.-Implementations -- Practical experience. |
Record Nr. | UNINA-9910483401903321 |
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2017 | ||
![]() | ||
Lo trovi qui: Univ. Federico II | ||
|
Automated Deduction – CADE 26 [[electronic resource] ] : 26th International Conference on Automated Deduction, Gothenburg, Sweden, August 6–11, 2017, Proceedings / / edited by Leonardo de Moura |
Edizione | [1st ed. 2017.] |
Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2017 |
Descrizione fisica | 1 online resource (XI, 582 p. 87 illus.) |
Disciplina | 511.36028563 |
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 |
ISBN | 3-319-63046-6 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Automated deduction -- Including foundations -- Applications.-Implementations -- Practical experience. |
Record Nr. | UNISA-996466306303316 |
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2017 | ||
![]() | ||
Lo trovi qui: Univ. di Salerno | ||
|
Automated Deduction – CADE 27 [[electronic resource] ] : 27th International Conference on Automated Deduction, Natal, Brazil, August 27–30, 2019, Proceedings / / edited by Pascal Fontaine |
Edizione | [1st ed. 2019.] |
Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2019 |
Descrizione fisica | 1 online resource (XXIII, 582 p. 1901 illus., 56 illus. in color.) |
Disciplina | 511.36028563 |
Collana | Lecture Notes in Artificial Intelligence |
Soggetto topico |
Artificial intelligence
Software engineering Computer system failures Mathematical logic Computer logic Artificial Intelligence Software Engineering System Performance and Evaluation Mathematical Logic and Formal Languages Logics and Meanings of Programs |
ISBN | 3-030-29436-6 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Automated Reasoning for Security Protocols -- Computer Deduction and (Formal) Proofs in Mathematics -- From Counter-Model-based Quantifier Instantiation to Quantifier Elimination in SMT -- The CADE-27 ATP System Competition - CASC-27 -- Unification modulo Lists with Reverse - Relation with Certain Word Equations -- On the Width of Regular Classes of Finite Structures -- Extending SMT solvers to Higher-Order Logic -- Superposition with Lambdas -- Restricted Combinatory Unification -- dLi: Definite Descriptions in Differential Dynamic Logic -- SPASS-SATT { A CDCL(LA) Solver -- GRUNGE: A Grand Unified ATP Challenge -- Model Completeness, Covers and Superposition -- A Tableaux Calculus for Default Intuitionistic Logic -- NIL: Learning Nonlinear Interpolants -- ENIGMA-NG: Efficient Neural and Gradient-Boosted Inference Guidance for E -- Towards Physical Hybrid Systems -- SCL -- Clause Learning from Simple Models -- Names are not just Sound and Smoke: Word Embeddings for Axiom Selection -- Computing Expected Runtimes for Constant Probability Programs -- Automatic Generation of Logical Models with AGES -- Automata Terms in a Lazy WSkS Decision Procedure -- Confluence by Critical Pair Analysis Revisited -- Composing Proof Terms -- Combining ProVerif and Automated Theorem Provers for Security Protocol Verification -- Towards Bit-Width-Independent Proofs in SMT Solvers -- On Invariant Synthesis for Parametric Systems -- The Aspect Calculus -- Uniform Substitution At One Fell Swoop -- A Formally Verified Abstract Account of Gödel's Incompleteness Theorems -- Old or Heavy? Decaying Gracefully with Age/Weight Shapes -- Induction in Saturation-Based Proof Search -- Faster, Higher, Stronger: E 2.3 -- Certified Equational Reasoning via Ordered Completion -- JGXYZ - An ATP System for Gap and Glut Logics -- GKC: a Reasoning System for Large Knowledge Bases -- Optimization Modulo the Theory of Floating-Point Numbers -- FAME(Q): An Automated Tool for Forgetting in Description Logics with Qualified Number Restrictions. . |
Record Nr. | UNINA-9910349305403321 |
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2019 | ||
![]() | ||
Lo trovi qui: Univ. Federico II | ||
|
Automated Deduction – CADE 27 [[electronic resource] ] : 27th International Conference on Automated Deduction, Natal, Brazil, August 27–30, 2019, Proceedings / / edited by Pascal Fontaine |
Edizione | [1st ed. 2019.] |
Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2019 |
Descrizione fisica | 1 online resource (XXIII, 582 p. 1901 illus., 56 illus. in color.) |
Disciplina | 511.36028563 |
Collana | Lecture Notes in Artificial Intelligence |
Soggetto topico |
Artificial intelligence
Software engineering Computer system failures Mathematical logic Computer logic Artificial Intelligence Software Engineering System Performance and Evaluation Mathematical Logic and Formal Languages Logics and Meanings of Programs |
ISBN | 3-030-29436-6 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Automated Reasoning for Security Protocols -- Computer Deduction and (Formal) Proofs in Mathematics -- From Counter-Model-based Quantifier Instantiation to Quantifier Elimination in SMT -- The CADE-27 ATP System Competition - CASC-27 -- Unification modulo Lists with Reverse - Relation with Certain Word Equations -- On the Width of Regular Classes of Finite Structures -- Extending SMT solvers to Higher-Order Logic -- Superposition with Lambdas -- Restricted Combinatory Unification -- dLi: Definite Descriptions in Differential Dynamic Logic -- SPASS-SATT { A CDCL(LA) Solver -- GRUNGE: A Grand Unified ATP Challenge -- Model Completeness, Covers and Superposition -- A Tableaux Calculus for Default Intuitionistic Logic -- NIL: Learning Nonlinear Interpolants -- ENIGMA-NG: Efficient Neural and Gradient-Boosted Inference Guidance for E -- Towards Physical Hybrid Systems -- SCL -- Clause Learning from Simple Models -- Names are not just Sound and Smoke: Word Embeddings for Axiom Selection -- Computing Expected Runtimes for Constant Probability Programs -- Automatic Generation of Logical Models with AGES -- Automata Terms in a Lazy WSkS Decision Procedure -- Confluence by Critical Pair Analysis Revisited -- Composing Proof Terms -- Combining ProVerif and Automated Theorem Provers for Security Protocol Verification -- Towards Bit-Width-Independent Proofs in SMT Solvers -- On Invariant Synthesis for Parametric Systems -- The Aspect Calculus -- Uniform Substitution At One Fell Swoop -- A Formally Verified Abstract Account of Gödel's Incompleteness Theorems -- Old or Heavy? Decaying Gracefully with Age/Weight Shapes -- Induction in Saturation-Based Proof Search -- Faster, Higher, Stronger: E 2.3 -- Certified Equational Reasoning via Ordered Completion -- JGXYZ - An ATP System for Gap and Glut Logics -- GKC: a Reasoning System for Large Knowledge Bases -- Optimization Modulo the Theory of Floating-Point Numbers -- FAME(Q): An Automated Tool for Forgetting in Description Logics with Qualified Number Restrictions. . |
Record Nr. | UNISA-996466439203316 |
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2019 | ||
![]() | ||
Lo trovi qui: Univ. di Salerno | ||
|
Automated Reasoning with Analytic Tableaux and Related Methods [[electronic resource] ] : 26th International Conference, TABLEAUX 2017, Brasília, Brazil, September 25–28, 2017, Proceedings / / edited by Renate A. Schmidt, Cláudia Nalon |
Edizione | [1st ed. 2017.] |
Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2017 |
Descrizione fisica | 1 online resource (XII, 381 p. 75 illus.) |
Disciplina | 511.36028563 |
Collana | Lecture Notes in Artificial Intelligence |
Soggetto topico |
Artificial intelligence
Mathematical logic Computer programming Software engineering Programming languages (Electronic computers) Computer logic Artificial Intelligence Mathematical Logic and Formal Languages Programming Techniques Software Engineering Programming Languages, Compilers, Interpreters Logics and Meanings of Programs |
ISBN | 3-319-66902-8 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Sequents systems -- Tableaux -- Transitive closure and cyclic proofs -- Formalization and complexity. |
Record Nr. | UNISA-996466251803316 |
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2017 | ||
![]() | ||
Lo trovi qui: Univ. di Salerno | ||
|
Automated Reasoning with Analytic Tableaux and Related Methods [[electronic resource] ] : 26th International Conference, TABLEAUX 2017, Brasília, Brazil, September 25–28, 2017, Proceedings / / edited by Renate A. Schmidt, Cláudia Nalon |
Edizione | [1st ed. 2017.] |
Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2017 |
Descrizione fisica | 1 online resource (XII, 381 p. 75 illus.) |
Disciplina | 511.36028563 |
Collana | Lecture Notes in Artificial Intelligence |
Soggetto topico |
Artificial intelligence
Mathematical logic Computer programming Software engineering Programming languages (Electronic computers) Computer logic Artificial Intelligence Mathematical Logic and Formal Languages Programming Techniques Software Engineering Programming Languages, Compilers, Interpreters Logics and Meanings of Programs |
ISBN | 3-319-66902-8 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Sequents systems -- Tableaux -- Transitive closure and cyclic proofs -- Formalization and complexity. |
Record Nr. | UNINA-9910482960003321 |
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2017 | ||
![]() | ||
Lo trovi qui: Univ. Federico II | ||
|
Automated Technology for Verification and Analysis [[electronic resource] ] : 5th International Symposium, ATVA 2007 Tokyo, Japan, October 22-25, 2007 Proceedings / / edited by Kedar Namjoshi, Tomohiro Yoneda, Teruo Higashino, Yoshio Okamura |
Edizione | [1st ed. 2007.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2007 |
Descrizione fisica | 1 online resource (XIV, 570 p.) |
Disciplina | 511.36028563 |
Collana | Programming and Software Engineering |
Soggetto topico |
Computer-aided engineering
Computer logic Computers Computer communication systems Special purpose computers Software engineering Computer-Aided Engineering (CAD, CAE) and Design Logics and Meanings of Programs Information Systems and Communication Service Computer Communication Networks Special Purpose and Application-Based Systems Software Engineering |
ISBN | 3-540-75596-9 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Invited Talks -- Policies and Proofs for Code Auditing -- Recent Trend in Industry and Expectation to DA Research -- Toward Property-Driven Abstraction for Heap Manipulating Programs -- Branching vs. Linear Time: Semantical Perspective -- Regular Papers -- Mind the Shapes: Abstraction Refinement Via Topology Invariants -- Complete SAT-Based Model Checking for Context-Free Processes -- Bounded Model Checking of Analog and Mixed-Signal Circuits Using an SMT Solver -- Model Checking Contracts – A Case Study -- On the Efficient Computation of the Minimal Coverability Set for Petri Nets -- Analog/Mixed-Signal Circuit Verification Using Models Generated from Simulation Traces -- Automatic Merge-Point Detection for Sequential Equivalence Checking of System-Level and RTL Descriptions -- Proving Termination of Tree Manipulating Programs -- Symbolic Fault Tree Analysis for Reactive Systems -- Computing Game Values for Crash Games -- Timed Control with Observation Based and Stuttering Invariant Strategies -- Deciding Simulations on Probabilistic Automata -- Mechanizing the Powerset Construction for Restricted Classes of ?-Automata -- Verifying Heap-Manipulating Programs in an SMT Framework -- A Generic Constructive Solution for Concurrent Games with Expressive Constraints on Strategies -- Distributed Synthesis for Alternating-Time Logics -- Timeout and Calendar Based Finite State Modeling and Verification of Real-Time Systems -- Efficient Approximate Verification of Promela Models Via Symmetry Markers -- Latticed Simulation Relations and Games -- Providing Evidence of Likely Being on Time: Counterexample Generation for CTMC Model Checking -- Assertion-Based Proof Checking of Chang-Roberts Leader Election in PVS -- Continuous Petri Nets: Expressive Power and Decidability Issues -- Quantifying the Discord: Order Discrepancies in Message Sequence Charts -- A Formal Methodology to Test Complex Heterogeneous Systems -- A New Approach to Bounded Model Checking for Branching Time Logics -- Exact State Set Representations in the Verification of Linear Hybrid Systems with Large Discrete State Space -- A Compositional Semantics for Dynamic Fault Trees in Terms of Interactive Markov Chains -- 3-Valued Circuit SAT for STE with Automatic Refinement -- Bounded Synthesis -- Short Papers -- Formal Modeling and Verification of High-Availability Protocol for Network Security Appliances -- A Brief Introduction to -- On-the-Fly Model Checking of Fair Non-repudiation Protocols -- Model Checking Bounded Prioritized Time Petri Nets -- Using Patterns and Composite Propositions to Automate the Generation of LTL Specifications -- Pruning State Spaces with Extended Beam Search -- Using Counterexample Analysis to Minimize the Number of Predicates for Predicate Abstraction. |
Record Nr. | UNISA-996465920803316 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2007 | ||
![]() | ||
Lo trovi qui: Univ. di Salerno | ||
|
Automated Technology for Verification and Analysis [[electronic resource] ] : 5th International Symposium, ATVA 2007 Tokyo, Japan, October 22-25, 2007 Proceedings / / edited by Kedar Namjoshi, Tomohiro Yoneda, Teruo Higashino, Yoshio Okamura |
Edizione | [1st ed. 2007.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2007 |
Descrizione fisica | 1 online resource (XIV, 570 p.) |
Disciplina | 511.36028563 |
Collana | Programming and Software Engineering |
Soggetto topico |
Computer-aided engineering
Computer logic Computers Computer communication systems Special purpose computers Software engineering Computer-Aided Engineering (CAD, CAE) and Design Logics and Meanings of Programs Information Systems and Communication Service Computer Communication Networks Special Purpose and Application-Based Systems Software Engineering |
ISBN | 3-540-75596-9 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Invited Talks -- Policies and Proofs for Code Auditing -- Recent Trend in Industry and Expectation to DA Research -- Toward Property-Driven Abstraction for Heap Manipulating Programs -- Branching vs. Linear Time: Semantical Perspective -- Regular Papers -- Mind the Shapes: Abstraction Refinement Via Topology Invariants -- Complete SAT-Based Model Checking for Context-Free Processes -- Bounded Model Checking of Analog and Mixed-Signal Circuits Using an SMT Solver -- Model Checking Contracts – A Case Study -- On the Efficient Computation of the Minimal Coverability Set for Petri Nets -- Analog/Mixed-Signal Circuit Verification Using Models Generated from Simulation Traces -- Automatic Merge-Point Detection for Sequential Equivalence Checking of System-Level and RTL Descriptions -- Proving Termination of Tree Manipulating Programs -- Symbolic Fault Tree Analysis for Reactive Systems -- Computing Game Values for Crash Games -- Timed Control with Observation Based and Stuttering Invariant Strategies -- Deciding Simulations on Probabilistic Automata -- Mechanizing the Powerset Construction for Restricted Classes of ?-Automata -- Verifying Heap-Manipulating Programs in an SMT Framework -- A Generic Constructive Solution for Concurrent Games with Expressive Constraints on Strategies -- Distributed Synthesis for Alternating-Time Logics -- Timeout and Calendar Based Finite State Modeling and Verification of Real-Time Systems -- Efficient Approximate Verification of Promela Models Via Symmetry Markers -- Latticed Simulation Relations and Games -- Providing Evidence of Likely Being on Time: Counterexample Generation for CTMC Model Checking -- Assertion-Based Proof Checking of Chang-Roberts Leader Election in PVS -- Continuous Petri Nets: Expressive Power and Decidability Issues -- Quantifying the Discord: Order Discrepancies in Message Sequence Charts -- A Formal Methodology to Test Complex Heterogeneous Systems -- A New Approach to Bounded Model Checking for Branching Time Logics -- Exact State Set Representations in the Verification of Linear Hybrid Systems with Large Discrete State Space -- A Compositional Semantics for Dynamic Fault Trees in Terms of Interactive Markov Chains -- 3-Valued Circuit SAT for STE with Automatic Refinement -- Bounded Synthesis -- Short Papers -- Formal Modeling and Verification of High-Availability Protocol for Network Security Appliances -- A Brief Introduction to -- On-the-Fly Model Checking of Fair Non-repudiation Protocols -- Model Checking Bounded Prioritized Time Petri Nets -- Using Patterns and Composite Propositions to Automate the Generation of LTL Specifications -- Pruning State Spaces with Extended Beam Search -- Using Counterexample Analysis to Minimize the Number of Predicates for Predicate Abstraction. |
Record Nr. | UNINA-9910768161103321 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2007 | ||
![]() | ||
Lo trovi qui: Univ. Federico II | ||
|