소장자료
LDR | 03706nam a22004815i 4500 | ||
001 | 0100795002▲ | ||
003 | DE-He213▲ | ||
005 | 20240305134610▲ | ||
007 | cr nn 008mamaa▲ | ||
008 | 231015s2023 sz | s |||| 0|eng d▲ | ||
020 | ▼a9783031457845▼9978-3-031-45784-5▲ | ||
024 | 7 | ▼a10.1007/978-3-031-45784-5▼2doi▲ | |
050 | 4 | ▼aQA75.5-76.95▲ | |
082 | 0 | 4 | ▼a004.0151▼223▲ |
245 | 1 | 0 | ▼aLogic-Based Program Synthesis and Transformation▼h[electronic resource] :▼b33rd International Symposium, LOPSTR 2023, Cascais, Portugal, October 23-24, 2023, Proceedings /▼cedited by Robert Glück, Bishoksan Kafle.▲ |
250 | ▼a1st ed. 2023.▲ | ||
264 | 1 | ▼aCham :▼bSpringer Nature Switzerland :▼bImprint: Springer,▼c2023.▲ | |
300 | ▼aXII, 211 p. 45 illus., 11 illus. in color.▼bonline resource.▲ | ||
336 | ▼atext▼btxt▼2rdacontent▲ | ||
337 | ▼acomputer▼bc▼2rdamedia▲ | ||
338 | ▼aonline resource▼bcr▼2rdacarrier▲ | ||
347 | ▼atext file▼bPDF▼2rda▲ | ||
490 | 1 | ▼aLecture Notes in Computer Science,▼x1611-3349 ;▼v14330▲ | |
505 | 0 | ▼aK eynotes -- Unification modulo equational theories in languages with binding operators -- Horn Clauses Analysis, Transformation and Synthesis -- Design Datalog Templates for Synthesizing Bidirectional Programs from Tabular Examples -- Transforming big-step to small-step semantics using interpreter specialisation -- Constrained Horn Clauses Satisfiability via Catamorphic Abstractions -- Static analysis and Type systems -- A reusable machine-calculus for automated resource analyses -- Approach for Designing and Composing Abstract Domains -- A Logical Interpretation of Asynchronous Multiparty Compatibility -- Relational Solver for Java Generics Type System -- Unification and substitution in (C)LP -- Predicate Anti-unification in (Constraint) Logic Programming -- A term matching algorithm and substitution generality -- Knowledge representation and AI-based learning -- A novel EGs-based framework for systematic propositional-formula simplification -- From Static to Dynamic Access Control Policies via Attribute-Based Category Mining -- Towards a Certified Proof Checker for Deep Neural Network Verification.▲ | |
520 | ▼aThis book constitutes the refereed proceedings of the 33rd International Symposium on Logic-Based Program Synthesis and Transformation, LOPSTR 2023, held in Cascais, Portugal, during October 23-24, 2023. The 8 full papers and 4 short papers included in this book were carefully reviewed and selected from 29 submissions. They were organized in topical sections as follows: Horn Clauses Analysis, Transformation and Synthesis; Static analysis and Type systems; Unification and substitution in (C)LP; and Knowledge representation and AI-based learning.▲ | ||
650 | 0 | ▼aComputer science.▲ | |
650 | 1 | 4 | ▼aComputer Science Logic and Foundations of Programming.▲ |
700 | 1 | ▼aGlück, Robert.▼eeditor.▼0(orcid)0000-0001-6990-3935▼1https://orcid.org/0000-0001-6990-3935▼4edt▼4http://id.loc.gov/vocabulary/relators/edt▲ | |
700 | 1 | ▼aKafle, Bishoksan.▼eeditor.▼0(orcid)0000-0001-5191-1216▼1https://orcid.org/0000-0001-5191-1216▼4edt▼4http://id.loc.gov/vocabulary/relators/edt▲ | |
710 | 2 | ▼aSpringerLink (Online service)▲ | |
773 | 0 | ▼tSpringer Nature eBook▲ | |
776 | 0 | 8 | ▼iPrinted edition:▼z9783031457838▲ |
776 | 0 | 8 | ▼iPrinted edition:▼z9783031457852▲ |
830 | 0 | ▼aLecture Notes in Computer Science,▼x1611-3349 ;▼v14330▲ | |
856 | 4 | 0 | ▼uhttps://doi.org/10.1007/978-3-031-45784-5▲ |

Logic-Based Program Synthesis and Transformation[electronic resource] : 33rd International Symposium, LOPSTR 2023, Cascais, Portugal, October 23-24, 2023, Proceedings
자료유형
국외eBook
서명/책임사항
Logic-Based Program Synthesis and Transformation [electronic resource] : 33rd International Symposium, LOPSTR 2023, Cascais, Portugal, October 23-24, 2023, Proceedings / edited by Robert Glück, Bishoksan Kafle.
판사항
1st ed. 2023.
형태사항
XII, 211 p. 45 illus., 11 illus. in color. online resource.
총서사항
Lecture Notes in Computer Science , 1611-3349 ; 14330
Lecture Notes in Computer Science , 1611-3349 ; 14330
Lecture Notes in Computer Science , 1611-3349 ; 14330
내용주기
K eynotes -- Unification modulo equational theories in languages with binding operators -- Horn Clauses Analysis, Transformation and Synthesis -- Design Datalog Templates for Synthesizing Bidirectional Programs from Tabular Examples -- Transforming big-step to small-step semantics using interpreter specialisation -- Constrained Horn Clauses Satisfiability via Catamorphic Abstractions -- Static analysis and Type systems -- A reusable machine-calculus for automated resource analyses -- Approach for Designing and Composing Abstract Domains -- A Logical Interpretation of Asynchronous Multiparty Compatibility -- Relational Solver for Java Generics Type System -- Unification and substitution in (C)LP -- Predicate Anti-unification in (Constraint) Logic Programming -- A term matching algorithm and substitution generality -- Knowledge representation and AI-based learning -- A novel EGs-based framework for systematic propositional-formula simplification -- From Static to Dynamic Access Control Policies via Attribute-Based Category Mining -- Towards a Certified Proof Checker for Deep Neural Network Verification.
요약주기
This book constitutes the refereed proceedings of the 33rd International Symposium on Logic-Based Program Synthesis and Transformation, LOPSTR 2023, held in Cascais, Portugal, during October 23-24, 2023. The 8 full papers and 4 short papers included in this book were carefully reviewed and selected from 29 submissions. They were organized in topical sections as follows: Horn Clauses Analysis, Transformation and Synthesis; Static analysis and Type systems; Unification and substitution in (C)LP; and Knowledge representation and AI-based learning.
ISBN
9783031457845
관련 인기대출 도서