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.
25 Years of Model Checking [[electronic resource] ] : History, Achievements, Perspectives / / edited by Orna Grumberg, Helmut Veith
| 25 Years of Model Checking [[electronic resource] ] : History, Achievements, Perspectives / / edited by Orna Grumberg, Helmut Veith |
| Edizione | [1st ed. 2008.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2008 |
| Descrizione fisica | 1 online resource (VII, 234 p.) |
| Disciplina | 005.131 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Software engineering
Compilers (Computer programs) Computer science Computer programming Machine theory Software Engineering Compilers and Interpreters Computer Science Logic and Foundations of Programming Programming Techniques Formal Languages and Automata Theory |
| ISBN | 3-540-69850-7 |
| Classificazione |
DAT 003f
DAT 325f DAT 540f SS 4800 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | The Birth of Model Checking -- The Beginning of Model Checking: A Personal Perspective -- Verification Technology Transfer -- New Challenges in Model Checking -- A Retrospective on Mur? -- Model Checking: From Tools to Theory -- Value Iteration -- Fifteen Years of Formal Property Verification in Intel -- A View from the Engine Room: Computational Support for Symbolic Model Checking -- From Church and Prior to PSL -- On the Merits of Temporal Testers -- DESIGN AND SYNTHESIS OF SYNCHRONIZATION SKELETONS USING BRANCHING TIME TEMPORAL LOGIC -- SPECIFICATION AND VERIFICATION OF CONURRENT SYSTEMS IN CESAR. |
| Record Nr. | UNISA-996465393403316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2008 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
25 Years of Model Checking : History, Achievements, Perspectives / / edited by Orna Grumberg, Helmut Veith
| 25 Years of Model Checking : History, Achievements, Perspectives / / edited by Orna Grumberg, Helmut Veith |
| Edizione | [1st ed. 2008.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2008 |
| Descrizione fisica | 1 online resource (VII, 234 p.) |
| Disciplina | 005.131 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Software engineering
Compilers (Computer programs) Computer science Computer programming Machine theory Software Engineering Compilers and Interpreters Computer Science Logic and Foundations of Programming Programming Techniques Formal Languages and Automata Theory |
| ISBN | 3-540-69850-7 |
| Classificazione |
DAT 003f
DAT 325f DAT 540f SS 4800 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | The Birth of Model Checking -- The Beginning of Model Checking: A Personal Perspective -- Verification Technology Transfer -- New Challenges in Model Checking -- A Retrospective on Mur? -- Model Checking: From Tools to Theory -- Value Iteration -- Fifteen Years of Formal Property Verification in Intel -- A View from the Engine Room: Computational Support for Symbolic Model Checking -- From Church and Prior to PSL -- On the Merits of Temporal Testers -- DESIGN AND SYNTHESIS OF SYNCHRONIZATION SKELETONS USING BRANCHING TIME TEMPORAL LOGIC -- SPECIFICATION AND VERIFICATION OF CONURRENT SYSTEMS IN CESAR. |
| Record Nr. | UNINA-9910767508103321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2008 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Computer Aided Verification [[electronic resource] ] : 25th International Conference, CAV 2013, Saint Petersburg, Russia, July 13-19, 2013, Proceedings / / edited by Natasha Sharygina, Helmut Veith
| Computer Aided Verification [[electronic resource] ] : 25th International Conference, CAV 2013, Saint Petersburg, Russia, July 13-19, 2013, Proceedings / / edited by Natasha Sharygina, Helmut Veith |
| Edizione | [1st ed. 2013.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 |
| Descrizione fisica | 1 online resource (XXII, 1015 p. 237 illus.) |
| Disciplina | 005.14 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science
Software engineering Computers, Special purpose Computer Science Logic and Foundations of Programming Software Engineering Special Purpose and Application-Based Systems |
| ISBN | 3-642-39799-9 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Automata Networks -- Model-Checking Signal Transduction Networks through Decreasing Reachability Sets -- TTP: Tool for Tumor Progression -- Exploring Parameter Space of Stochastic Biochemical Systems using Quantitative Model Checking -- Parameterized Verification of Asynchronous Shared-Memory Systems -- Partial Orders for Efficient BMC of Concurrent Software -- Incremental, Inductive Coverability -- Automatic linearizability proofs of concurrent objects with cooperating -- Updates -- Duet: Static Analysis for Unbounded Parallelism -- SVA and PSL Local Variables -- A Practical Approach -- Formal Verification of Hardware Synthesis -- CacBDD: A BDD Package with Dynamic Cache Management -- Distributed Explicit State Model Checking of Deadlock Freedom -- Exponential-Condition-Based Barrier Certificate Generation for Safety -- Verification of Hybrid Systems -- Efficient Robust Monitoring for STL -- Abstraction based Model-Checking of Stability of Hybrid Systems -- Faster Algorithms for Markov Decision Processes with Low Tree width -- Automata with Generalized Rabin Pairs for Probabilistic Model Checking and LTL Synthesis -- Importance Splitting for Statistical Model Checking Rare Properties -- Minimal Sets over Monotone Predicates in Boolean Formulae -- Smten: Automatic Translation of High-level Symbolic Computations into SMT Queries -- QUAIL: a quantitative security analyzer for imperative code -- Effectively Propositional Reasoning about Reachability in Linked Data Structures -- Learning Universally Quantified Invariants of Linear Data Structures -- GOAL for Games, Omega-Automata, and Logics -- Efficient synthesis for concurrency using semantics-preserving Transformations. |
| Record Nr. | UNISA-996466042903316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Computer Aided Verification [[electronic resource] ] : 25th International Conference, CAV 2013, Saint Petersburg, Russia, July 13-19, 2013, Proceedings / / edited by Natasha Sharygina, Helmut Veith
| Computer Aided Verification [[electronic resource] ] : 25th International Conference, CAV 2013, Saint Petersburg, Russia, July 13-19, 2013, Proceedings / / edited by Natasha Sharygina, Helmut Veith |
| Edizione | [1st ed. 2013.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 |
| Descrizione fisica | 1 online resource (XXII, 1015 p. 237 illus.) |
| Disciplina | 005.14 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science
Software engineering Computers, Special purpose Computer Science Logic and Foundations of Programming Software Engineering Special Purpose and Application-Based Systems |
| ISBN | 3-642-39799-9 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Automata Networks -- Model-Checking Signal Transduction Networks through Decreasing Reachability Sets -- TTP: Tool for Tumor Progression -- Exploring Parameter Space of Stochastic Biochemical Systems using Quantitative Model Checking -- Parameterized Verification of Asynchronous Shared-Memory Systems -- Partial Orders for Efficient BMC of Concurrent Software -- Incremental, Inductive Coverability -- Automatic linearizability proofs of concurrent objects with cooperating -- Updates -- Duet: Static Analysis for Unbounded Parallelism -- SVA and PSL Local Variables -- A Practical Approach -- Formal Verification of Hardware Synthesis -- CacBDD: A BDD Package with Dynamic Cache Management -- Distributed Explicit State Model Checking of Deadlock Freedom -- Exponential-Condition-Based Barrier Certificate Generation for Safety -- Verification of Hybrid Systems -- Efficient Robust Monitoring for STL -- Abstraction based Model-Checking of Stability of Hybrid Systems -- Faster Algorithms for Markov Decision Processes with Low Tree width -- Automata with Generalized Rabin Pairs for Probabilistic Model Checking and LTL Synthesis -- Importance Splitting for Statistical Model Checking Rare Properties -- Minimal Sets over Monotone Predicates in Boolean Formulae -- Smten: Automatic Translation of High-level Symbolic Computations into SMT Queries -- QUAIL: a quantitative security analyzer for imperative code -- Effectively Propositional Reasoning about Reachability in Linked Data Structures -- Learning Universally Quantified Invariants of Linear Data Structures -- GOAL for Games, Omega-Automata, and Logics -- Efficient synthesis for concurrency using semantics-preserving Transformations. |
| Record Nr. | UNINA-9910483521103321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Computer Science Logic [[electronic resource] ] : 24th International Workshop, CSL 2010, 19th Annual Conference of the EACSL, Brno, Czech Republic, August 23-27, 2010, Proceedings / / edited by Anuj Dawar, Helmut Veith
| Computer Science Logic [[electronic resource] ] : 24th International Workshop, CSL 2010, 19th Annual Conference of the EACSL, Brno, Czech Republic, August 23-27, 2010, Proceedings / / edited by Anuj Dawar, Helmut Veith |
| Edizione | [1st ed. 2010.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2010 |
| Descrizione fisica | 1 online resource (XIV, 548 p. 64 illus.) |
| Disciplina | 004.015113 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science
Computer programming Software engineering Machine theory Artificial intelligence Theory of Computation Programming Techniques Software Engineering Computer Science Logic and Foundations of Programming Formal Languages and Automata Theory Artificial Intelligence |
| ISBN |
1-280-38839-0
9786613566317 3-642-15205-8 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Talks -- Degrees of Security: Protocol Guarantees in the Face of Compromising Adversaries -- Definability in Games -- From Feasible Proofs to Feasible Computations -- Tree Dualities for Constraint Satisfaction -- Ordered Sets in the Calculus of Data Structures -- Abductive, Inductive and Deductive Reasoning about Resources -- Constraint Solving for Program Verification: Theory and Practice by Example -- Contributed Papers -- Tableau Calculi for over minspaces -- A Resolution Mechanism for Prenex Gödel Logic -- Efficient Enumeration for Conjunctive Queries over X-underbar Structures -- A Formalisation of the Normal Forms of Context-Free Grammars in HOL4 -- Automata vs. Logics on Data Words -- Graded Computation Tree Logic with Binary Coding -- Exact Exploration and Hanging Algorithms -- Embedding Deduction Modulo into a Prover -- Exponentials with Infinite Multiplicities -- Classical and Intuitionistic Subexponential Logics Are Equally Expressive -- On Slicewise Monotone Parameterized Problems and Optimal Proof Systems for TAUT -- A Logic of Sequentiality -- Environment and Classical Channels in Categorical Quantum Mechanics -- Formal Theories for Linear Algebra -- Energy and Mean-Payoff Games with Imperfect Information -- Randomisation and Derandomisation in Descriptive Complexity Theory -- Towards a Canonical Classical Natural Deduction System -- Coordination Logic -- Second-Order Equational Logic (Extended Abstract) -- Fibrational Induction Rules for Initial Algebras -- A Sequent Calculus with Implicit Term Representation -- New Algorithm for Weak Monadic Second-Order Logic on Inductive Structures -- The Structural ?-Calculus -- The Isomorphism Problem for ?-Automatic Trees -- Complexity Results for Modal Dependence Logic -- The Complexity of Positive First-Order Logic without Equality II: The Four-Element Case -- On the Computability of Region-Based Euclidean Logics -- Inductive-Inductive Definitions -- Quantified Differential Dynamic Logic for Distributed Hybrid Systems -- Untyping Typed Algebraic Structures and Colouring Proof Nets of Cyclic Linear Logic -- Two-Variable Logic with Two Order Relations -- Signature Extensions Preserve Termination -- Coq Modulo Theory -- Ackermann Award -- The Ackermann Award 2010. |
| Record Nr. | UNISA-996466570003316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2010 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Computer Science Logic : 24th International Workshop, CSL 2010, 19th Annual Conference of the EACSL, Brno, Czech Republic, August 23-27, 2010, Proceedings / / edited by Anuj Dawar, Helmut Veith
| Computer Science Logic : 24th International Workshop, CSL 2010, 19th Annual Conference of the EACSL, Brno, Czech Republic, August 23-27, 2010, Proceedings / / edited by Anuj Dawar, Helmut Veith |
| Edizione | [1st ed. 2010.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2010 |
| Descrizione fisica | 1 online resource (XIV, 548 p. 64 illus.) |
| Disciplina | 004.015113 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science
Computer programming Software engineering Machine theory Artificial intelligence Theory of Computation Programming Techniques Software Engineering Computer Science Logic and Foundations of Programming Formal Languages and Automata Theory Artificial Intelligence |
| ISBN |
1-280-38839-0
9786613566317 3-642-15205-8 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Talks -- Degrees of Security: Protocol Guarantees in the Face of Compromising Adversaries -- Definability in Games -- From Feasible Proofs to Feasible Computations -- Tree Dualities for Constraint Satisfaction -- Ordered Sets in the Calculus of Data Structures -- Abductive, Inductive and Deductive Reasoning about Resources -- Constraint Solving for Program Verification: Theory and Practice by Example -- Contributed Papers -- Tableau Calculi for over minspaces -- A Resolution Mechanism for Prenex Gödel Logic -- Efficient Enumeration for Conjunctive Queries over X-underbar Structures -- A Formalisation of the Normal Forms of Context-Free Grammars in HOL4 -- Automata vs. Logics on Data Words -- Graded Computation Tree Logic with Binary Coding -- Exact Exploration and Hanging Algorithms -- Embedding Deduction Modulo into a Prover -- Exponentials with Infinite Multiplicities -- Classical and Intuitionistic Subexponential Logics Are Equally Expressive -- On Slicewise Monotone Parameterized Problems and Optimal Proof Systems for TAUT -- A Logic of Sequentiality -- Environment and Classical Channels in Categorical Quantum Mechanics -- Formal Theories for Linear Algebra -- Energy and Mean-Payoff Games with Imperfect Information -- Randomisation and Derandomisation in Descriptive Complexity Theory -- Towards a Canonical Classical Natural Deduction System -- Coordination Logic -- Second-Order Equational Logic (Extended Abstract) -- Fibrational Induction Rules for Initial Algebras -- A Sequent Calculus with Implicit Term Representation -- New Algorithm for Weak Monadic Second-Order Logic on Inductive Structures -- The Structural ?-Calculus -- The Isomorphism Problem for ?-Automatic Trees -- Complexity Results for Modal Dependence Logic -- The Complexity of Positive First-Order Logic without Equality II: The Four-Element Case -- On the Computability of Region-Based Euclidean Logics -- Inductive-Inductive Definitions -- Quantified Differential Dynamic Logic for Distributed Hybrid Systems -- Untyping Typed Algebraic Structures and Colouring Proof Nets of Cyclic Linear Logic -- Two-Variable Logic with Two Order Relations -- Signature Extensions Preserve Termination -- Coq Modulo Theory -- Ackermann Award -- The Ackermann Award 2010. |
| Record Nr. | UNINA-9910482993203321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2010 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Handbook of Model Checking / / edited by Edmund M. Clarke, Thomas A. Henzinger, Helmut Veith, Roderick Bloem
| Handbook of Model Checking / / edited by Edmund M. Clarke, Thomas A. Henzinger, Helmut Veith, Roderick Bloem |
| Edizione | [1st ed. 2018.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2018 |
| Descrizione fisica | 1 online resource (XXIV, 1210 p. 220 illus., 6 illus. in color.) |
| Disciplina | 004.0151 |
| Soggetto topico |
Computers
Software engineering Mathematical logic Computer science—Mathematics Computer software—Reusability Quality control Reliability Industrial safety Theory of Computation Software Engineering/Programming and Operating Systems Mathematical Logic and Foundations Mathematics of Computing Performance and Reliability Quality Control, Reliability, Safety and Risk |
| ISBN | 3-319-10575-2 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Introduction to Model Checking -- Temporal Logic and Fair Discrete Systems -- Modeling for Verification -- Automata Theory and Model Checking -- Explicit-State Model Checking -- Partial-Order Reduction -- Binary Decision Diagrams -- BDD-Based Symbolic Model Checking -- Propositional SAT Solving -- SAT-Based Model Checking -- Satisfiability Modulo Theories -- Compositional Reasoning -- Abstraction and Abstraction Refinement -- Interpolation and Model Checking -- Predicate Abstraction for Program Verification -- Combining Model Checking and Data-Flow Analysis -- Model Checking Procedural Programs -- Model Checking Concurrent Programs -- Combining Model Checking and Testing -- Combining Model Checking and Deduction -- Model Checking Parameterized Systems -- Model Checking Security Protocols -- Transfer of Model Checking to Industrial Practice -- Functional Specification of Hardware via Temporal Logic -- Symbolic Trajectory Evaluation -- The mu-calculus and Model Checking -- Graph Games and Reactive Synthesis -- Model Checking Probabilistic Systems -- Model Checking Real-Time Systems -- Verification of Hybrid Systems -- Symbolic Model Checking in Non-Boolean Domains -- Process Algebra and Model Checking. |
| Record Nr. | UNINA-9910299458803321 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2018 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Logic for Programming, Artificial Intelligence, and Reasoning [[electronic resource] ] : 15th International Conference, LPAR 2008, Doha, Qatar, November 22-27, 2008, Proceedings / / edited by Iliano Cervesato, Helmut Veith, Andrei Voronkov
| Logic for Programming, Artificial Intelligence, and Reasoning [[electronic resource] ] : 15th International Conference, LPAR 2008, Doha, Qatar, November 22-27, 2008, Proceedings / / edited by Iliano Cervesato, Helmut Veith, Andrei Voronkov |
| Edizione | [1st ed. 2008.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2008 |
| Descrizione fisica | 1 online resource (XIV, 714 p.) |
| Disciplina | 005.115 |
| Collana | Lecture Notes in Artificial Intelligence |
| Soggetto topico |
Artificial intelligence
Software engineering Computer programming Computer logic Mathematical logic Artificial Intelligence Software Engineering/Programming and Operating Systems Programming Techniques Software Engineering Logics and Meanings of Programs Mathematical Logic and Formal Languages |
| ISBN | 3-540-89439-X |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Session 1. Constraint Solving -- Symmetry Breaking for Maximum Satisfiability -- Efficient Generation of Unsatisfiability Proofs and Cores in SAT -- Justification-Based Local Search with Adaptive Noise Strategies -- The Max-Atom Problem and Its Relevance -- Session 2. Knowledge Representation 1 -- Towards Practical Feasibility of Core Computation in Data Exchange -- Data-Oblivious Stream Productivity -- Reasoning about XML with Temporal Logics and Automata -- Distributed Consistency-Based Diagnosis -- Session 3. Proof-Theory 1 -- From One Session to Many: Dynamic Tags for Security Protocols -- A Conditional Logical Framework -- Nominal Renaming Sets -- Imogen: Focusing the Polarized Inverse Method for Intuitionistic Propositional Logic -- Invited Talk -- Model Checking – My 27-Year Quest to Overcome the State Explosion Problem -- Session 4. Automata -- On the Relative Succinctness of Nondeterministic Büchi and co-Büchi Word Automata -- Recurrent Reachability Analysis in Regular Model Checking -- Alternation Elimination by Complementation (Extended Abstract) -- Discounted Properties of Probabilistic Pushdown Automata -- Session 5. Linear Arithmetic -- A Quantifier Elimination Algorithm for Linear Real Arithmetic -- (LIA) - Model Evolution with Linear Integer Arithmetic Constraints -- A Constraint Sequent Calculus for First-Order Logic with Linear Integer Arithmetic -- Encoding Queues in Satisfiability Modulo Theories Based Bounded Model Checking -- Session 6. Verification -- On Bounded Reachability of Programs with Set Comprehensions -- Program Complexity in Hierarchical Module Checking -- Valigator: A Verification Tool with Bound and Invariant Generation -- Reveal: A Formal Verification Tool for Verilog Designs -- Invited Talks -- A Formal Language for Cryptographic Pseudocode -- Reasoning Using Knots -- Session 7. Knowledge Representation 2 -- Role Conjunctions in Expressive Description Logics -- Default Logics with Preference Order: Principles and Characterisations -- On Computing Constraint Abduction Answers -- Fast Counting with Bounded Treewidth -- Session 8. Proof-Theory 2 -- Cut Elimination for First Order Gödel Logic by Hyperclause Resolution -- Focusing Strategies in the Sequent Calculus of Synthetic Connectives -- An Algorithmic Interpretation of a Deep Inference System -- Weak ??-Normalization and Normalization by Evaluation for System F -- Session 9. Quantified Constraints -- Variable Dependencies of Quantified CSPs -- Treewidth: A Useful Marker of Empirical Hardness in Quantified Boolean Logic Encodings -- Tractable Quantified Constraint Satisfaction Problems over Positive Temporal Templates -- A Logic of Singly Indexed Arrays -- Session 10. Modal and Temporal Logics -- On the Computational Complexity of Spatial Logics with Connectedness Constraints -- Decidable and Undecidable Fragments of Halpern and Shoham’s Interval Temporal Logic: Towards a Complete Classification -- The Variable Hierarchy for the Lattice ?-Calculus -- A Formalised Lower Bound on Undirected Graph Reachability -- Session 11. Rewriting -- Improving Context-Sensitive Dependency Pairs -- Complexity, Graphs, and the Dependency Pair Method -- Uncurrying for Termination -- Approximating Term Rewriting Systems: A Horn Clause Specification and Its Implementation -- A Higher-Order Iterative Path Ordering -- Variable Dependencies of Quantified CSPs. |
| Record Nr. | UNISA-996466348903316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2008 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Logic for Programming, Artificial Intelligence, and Reasoning : 15th International Conference, LPAR 2008, Doha, Qatar, November 22-27, 2008, Proceedings / / edited by Iliano Cervesato, Helmut Veith, Andrei Voronkov
| Logic for Programming, Artificial Intelligence, and Reasoning : 15th International Conference, LPAR 2008, Doha, Qatar, November 22-27, 2008, Proceedings / / edited by Iliano Cervesato, Helmut Veith, Andrei Voronkov |
| Edizione | [1st ed. 2008.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2008 |
| Descrizione fisica | 1 online resource (XIV, 714 p.) |
| Disciplina | 005.115 |
| Collana | Lecture Notes in Artificial Intelligence |
| Soggetto topico |
Artificial intelligence
Software engineering Computer programming Computer logic Mathematical logic Artificial Intelligence Software Engineering/Programming and Operating Systems Programming Techniques Software Engineering Logics and Meanings of Programs Mathematical Logic and Formal Languages |
| ISBN | 3-540-89439-X |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Session 1. Constraint Solving -- Symmetry Breaking for Maximum Satisfiability -- Efficient Generation of Unsatisfiability Proofs and Cores in SAT -- Justification-Based Local Search with Adaptive Noise Strategies -- The Max-Atom Problem and Its Relevance -- Session 2. Knowledge Representation 1 -- Towards Practical Feasibility of Core Computation in Data Exchange -- Data-Oblivious Stream Productivity -- Reasoning about XML with Temporal Logics and Automata -- Distributed Consistency-Based Diagnosis -- Session 3. Proof-Theory 1 -- From One Session to Many: Dynamic Tags for Security Protocols -- A Conditional Logical Framework -- Nominal Renaming Sets -- Imogen: Focusing the Polarized Inverse Method for Intuitionistic Propositional Logic -- Invited Talk -- Model Checking – My 27-Year Quest to Overcome the State Explosion Problem -- Session 4. Automata -- On the Relative Succinctness of Nondeterministic Büchi and co-Büchi Word Automata -- Recurrent Reachability Analysis in Regular Model Checking -- Alternation Elimination by Complementation (Extended Abstract) -- Discounted Properties of Probabilistic Pushdown Automata -- Session 5. Linear Arithmetic -- A Quantifier Elimination Algorithm for Linear Real Arithmetic -- (LIA) - Model Evolution with Linear Integer Arithmetic Constraints -- A Constraint Sequent Calculus for First-Order Logic with Linear Integer Arithmetic -- Encoding Queues in Satisfiability Modulo Theories Based Bounded Model Checking -- Session 6. Verification -- On Bounded Reachability of Programs with Set Comprehensions -- Program Complexity in Hierarchical Module Checking -- Valigator: A Verification Tool with Bound and Invariant Generation -- Reveal: A Formal Verification Tool for Verilog Designs -- Invited Talks -- A Formal Language for Cryptographic Pseudocode -- Reasoning Using Knots -- Session 7. Knowledge Representation 2 -- Role Conjunctions in Expressive Description Logics -- Default Logics with Preference Order: Principles and Characterisations -- On Computing Constraint Abduction Answers -- Fast Counting with Bounded Treewidth -- Session 8. Proof-Theory 2 -- Cut Elimination for First Order Gödel Logic by Hyperclause Resolution -- Focusing Strategies in the Sequent Calculus of Synthetic Connectives -- An Algorithmic Interpretation of a Deep Inference System -- Weak ??-Normalization and Normalization by Evaluation for System F -- Session 9. Quantified Constraints -- Variable Dependencies of Quantified CSPs -- Treewidth: A Useful Marker of Empirical Hardness in Quantified Boolean Logic Encodings -- Tractable Quantified Constraint Satisfaction Problems over Positive Temporal Templates -- A Logic of Singly Indexed Arrays -- Session 10. Modal and Temporal Logics -- On the Computational Complexity of Spatial Logics with Connectedness Constraints -- Decidable and Undecidable Fragments of Halpern and Shoham’s Interval Temporal Logic: Towards a Complete Classification -- The Variable Hierarchy for the Lattice ?-Calculus -- A Formalised Lower Bound on Undirected Graph Reachability -- Session 11. Rewriting -- Improving Context-Sensitive Dependency Pairs -- Complexity, Graphs, and the Dependency Pair Method -- Uncurrying for Termination -- Approximating Term Rewriting Systems: A Horn Clause Specification and Its Implementation -- A Higher-Order Iterative Path Ordering -- Variable Dependencies of Quantified CSPs. |
| Record Nr. | UNINA-9910767539703321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2008 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||