Logic-Based Program Synthesis and Transformation 33rd International Symposium, LOPSTR 2023, Cascais, Portugal, October 23-24, 2023, Proceedings / [electronic resource] :
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, 14330 1611-3349 ; .
- Lecture Notes in Computer Science, 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 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.
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.
9783031457845
10.1007/978-3-031-45784-5 doi
Computer science.
Computer Science Logic and Foundations of Programming.
QA75.5-76.95
004.0151
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 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.
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.
9783031457845
10.1007/978-3-031-45784-5 doi
Computer science.
Computer Science Logic and Foundations of Programming.
QA75.5-76.95
004.0151