| 000 | 03664nam a22005055i 4500 | ||
|---|---|---|---|
| 001 | 978-3-031-45784-5 | ||
| 003 | DE-He213 | ||
| 005 | 20240730201503.0 | ||
| 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 | |
| 072 | 7 |
_aUYA _2bicssc |
|
| 072 | 7 |
_aCOM014000 _2bisacsh |
|
| 072 | 7 |
_aUYA _2thema |
|
| 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 forsystematic 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. _99832 |
|
| 650 | 1 | 4 |
_aComputer Science Logic and Foundations of Programming. _942203 |
| 700 | 1 |
_aGlück, Robert. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt _9167381 |
|
| 700 | 1 |
_aKafle, Bishoksan. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt _9167382 |
|
| 710 | 2 |
_aSpringerLink (Online service) _9167383 |
|
| 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 _923263 |
|
| 856 | 4 | 0 | _uhttps://doi.org/10.1007/978-3-031-45784-5 |
| 912 | _aZDB-2-SCS | ||
| 912 | _aZDB-2-SXCS | ||
| 912 | _aZDB-2-LNC | ||
| 942 | _cELN | ||
| 999 |
_c96558 _d96558 |
||