Logic-based program synthesis and transformation [electronic resource] : 26th international symposium, LOPSTR 2016, Edinburgh, UK, September 6–8, 2016, revised selected papers
| 000 | 00000cam u2200205 a 4500 | |
| 001 | 000045995224 | |
| 005 | 20190829105319 | |
| 006 | m d | |
| 007 | cr | |
| 008 | 190820s2017 sz a ob 101 0 eng d | |
| 020 | ▼a 9783319631387 | |
| 020 | ▼a 9783319631394 (e-book) | |
| 040 | ▼a 211009 ▼c 211009 ▼d 211009 | |
| 050 | 0 0 | ▼a QA76.63 |
| 082 | 0 4 | ▼a 005.1/15 ▼2 23 |
| 084 | ▼a 005.115 ▼2 DDCK | |
| 090 | ▼a 005.115 | |
| 245 | 0 0 | ▼a Logic-based program synthesis and transformation ▼h [electronic resource] : ▼b 26th international symposium, LOPSTR 2016, Edinburgh, UK, September 6–8, 2016, revised selected papers / ▼c Manuel V. Hermenegildo, Pedro Lopez-Garcia, editors. |
| 246 | 3 0 | ▼a LOPSTR 2016 |
| 260 | ▼a Cham : ▼b Springer, ▼c c2017. | |
| 300 | ▼a 1 online resource (xvi, 361 p.) : ▼b ill. | |
| 490 | 1 | ▼a LNCS Sublibrary. SL1, Theoretical Computer Science and General Issues |
| 490 | 1 | ▼a Lecture Notes in Computer Science ; ▼v 10184 |
| 500 | ▼a Title from e-Book title page. | |
| 504 | ▼a Includes bibliographical references and index. | |
| 505 | 0 | ▼a Partial Evaluation of Order-sorted Equational Programs modulo Axioms -- A Formal, Resource Consumption-Preserving Translation of Actors to Haskell -- Verification of Time-Aware Business Processes using Constrained Horn Clauses -- MiniZinc with Strings -- Slicing Concurrent Constraint Programs -- A New Functional-Logic Compiler for Curry: Sprite -- lpopt: A Rule Optimization Tool for Answer Set Programming -- Symbolic Execution and Thresholding for Efficiently Tuning Fuzzy Logic Programs -- Hierarchical Shape Abstraction for Analysis of Free List Memory Allocators -- A Productivity Checker for Logic Programming -- Symbolic Abstract Contract Synthesis in a Rewriting Framework -- On the Completeness of Selective Uni_cation in Concolic Testing of Logic Programs -- CurryCheck: Checking Properties of Curry Programs -- A Hiking Trip Through the Orders of Magnitude: Deriving Efficient Generators for Closed Simply-Typed Lambda Terms and Normal Forms -- A Reversible Semantics for Erlang -- Scaling Bounded Model Checking By Transforming Programs With Arrays -- Coinductive Soundness of Corecursive Type Class Resolution -- Nominal Unification of Higher Order Expressions with Recursive Let -- Automata Theory Approach to Predicate Intuitionistic Logic. |
| 520 | ▼a This book constitutes the thoroughly refereed post-conference proceedings of the 26th International Symposium on Logic-Based Program Synthesis and Transformation, LOPSTR 2016, held in Edinburgh, UK, in September 2016. The 20 revised full papers presented together with the abstracts of 3 invited talks were carefully reviewed and selected from 38 submissions. The aim of the LOPSTR series is to stimulate and promote international research and collaboration on logic-based program development. LOPSTR is open to contributions in all aspects of logic-based program development, all stages of the software life cycle, and issues of both programming-in-the-small and programming-in-the-large. LOPSTR traditionally solicits contributions, in any language paradigm, in the areas of synthesis, specification, transformation, analysis and verification, specialization, testing and certification, composition, program/model manipulation, optimization, transformational techniques in SE, inversion, applications, and tools. | |
| 530 | ▼a Issued also as a book. | |
| 538 | ▼a Mode of access: World Wide Web. | |
| 650 | 0 | ▼a Logic programming ▼v Congresses. |
| 650 | 0 | ▼a Program transformation (Computer programming) ▼v Congresses. |
| 650 | 0 | ▼a Computational complexity ▼v Congresses. |
| 700 | 1 | ▼a Hermenegildo, Manuel V. |
| 700 | 1 | ▼a Lopez-Garcia, Pedro. |
| 711 | 2 | ▼a LOPSTR (Symposium) ▼n (26th : ▼d 2016 : ▼c Edinburgh, UK). |
| 830 | 0 | ▼a LNCS Sublibrary. ▼n SL1, ▼p Theoretical Computer Science and General Issues. |
| 830 | 0 | ▼a Lecture Notes in Computer Science ; ▼v 10184. |
| 856 | 4 0 | ▼u https://oca.korea.ac.kr/link.n2s?url=https://doi.org/10.1007/978-3-319-63139-4 |
| 945 | ▼a KLPA | |
| 991 | ▼a E-Book(소장) |
소장정보
| No. | 소장처 | 청구기호 | 등록번호 | 도서상태 | 반납예정일 | 예약 | 서비스 |
|---|---|---|---|---|---|---|---|
| No. 1 | 소장처 중앙도서관/e-Book 컬렉션/ | 청구기호 CR 005.115 | 등록번호 E14017564 | 도서상태 대출불가(열람가능) | 반납예정일 | 예약 | 서비스 |
컨텐츠정보
책소개
Partial Evaluation of Order-sorted Equational Programs modulo Axioms.- A Formal, Resource Consumption-Preserving Translation of Actors to Haskell.- Verification of Time-Aware Business Processes using Constrained Horn Clauses.- MiniZinc with Strings.- Slicing Concurrent Constraint Programs.- A New Functional-Logic Compiler for Curry: Sprite.- lpopt: A Rule Optimization Tool for Answer Set Programming.- Symbolic Execution and Thresholding for Efficiently Tuning Fuzzy Logic Programs.- Hierarchical Shape Abstraction for Analysis of Free List Memory Allocators.- A Productivity Checker for Logic Programming.- Symbolic Abstract Contract Synthesis in a Rewriting Framework.- On the Completeness of Selective Uni_cation in Concolic Testing of Logic Programs.- CurryCheck: Checking Properties of Curry Programs.- A Hiking Trip Through the Orders of Magnitude: Deriving Efficient Generators for Closed Simply-Typed Lambda Terms and Normal Forms.- A Reversible Semantics for Erlang.- Scaling Bounded Model Checking By Transforming Programs With Arrays.- Coinductive Soundness of Corecursive Type Class Resolution.- Nominal Unification of Higher Order Expressions with Recursive Let.- Automata Theory Approach to Predicate Intuitionistic Logic.
정보제공 :
목차
Partial Evaluation of Order-sorted Equational Programs modulo Axioms.- A Formal, Resource Consumption-Preserving Translation of Actors to Haskell.- Verification of Time-Aware Business Processes using Constrained Horn Clauses.- MiniZinc with Strings.- Slicing Concurrent Constraint Programs.- A New Functional-Logic Compiler for Curry: Sprite.- lpopt: A Rule Optimization Tool for Answer Set Programming.- Symbolic Execution and Thresholding for Efficiently Tuning Fuzzy Logic Programs.- Hierarchical Shape Abstraction for Analysis of Free List Memory Allocators.- A Productivity Checker for Logic Programming.- Symbolic Abstract Contract Synthesis in a Rewriting Framework.- On the Completeness of Selective Uni_cation in Concolic Testing of Logic Programs.- CurryCheck: Checking Properties of Curry Programs.- A Hiking Trip Through the Orders of Magnitude: Deriving Efficient Generators for Closed Simply-Typed Lambda Terms and Normal Forms.- A Reversible Semantics for Erlang.- Scaling Bounded Model Checking By Transforming Programs With Arrays.- Coinductive Soundness of Corecursive Type Class Resolution.- Nominal Unification of Higher Order Expressions with Recursive Let.- Automata Theory Approach to Predicate Intuitionistic Logic.
정보제공 :
