Logic-Based Program Synthesis and Transformation 25th International Symposium, LOPSTR 2015, Siena, Italy, July 13-15, 2015. Revised Selected Papers
This book constitutes the thoroughly refereedpost-conference proceedings of the 25th International Symposium on Logic-BasedProgram Synthesis and Transformation, LOPSTR 2015, held in Siena, Italy, inJuly 2015.The 21 revised full papers presented together with 3invited talks were carefully reviewed an...
Saved in:
Main Author | |
---|---|
Format | eBook |
Language | English |
Published |
Cham
Springer Nature
2015
Springer International Publishing AG Springer |
Edition | 1 |
Series | LNCS sublibrary. SL 1, Theoretical computer science and general issues |
Subjects | |
Online Access | Get full text |
ISBN | 3319274368 9783319274362 331927435X 9783319274355 |
Cover
Abstract | This book constitutes the thoroughly refereedpost-conference proceedings of the 25th International Symposium on Logic-BasedProgram Synthesis and Transformation, LOPSTR 2015, held in Siena, Italy, inJuly 2015.The 21 revised full papers presented together with 3invited talks were carefully reviewed and selected from 30 submissions. The aimof the LOPSTR series is to stimulate and promote international research andcollaboration on logic-based program development. LOPSTR is open tocontributions in all aspects of logic-based program development, all stages ofthe software life cycle, and issues of both programming-in-the-small andprogramming-in-the-large. |
---|---|
AbstractList | This book constitutes the thoroughly refereedpost-conference proceedings of the 25th International Symposium on Logic-BasedProgram Synthesis and Transformation, LOPSTR 2015, held in Siena, Italy, inJuly 2015.The 21 revised full papers presented together with 3invited talks were carefully reviewed and selected from 30 submissions. The aimof the LOPSTR series is to stimulate and promote international research andcollaboration on logic-based program development. LOPSTR is open tocontributions in all aspects of logic-based program development, all stages ofthe software life cycle, and issues of both programming-in-the-small andprogramming-in-the-large. |
Author | Falaschi, Moreno |
Author_xml | – sequence: 1 fullname: Falaschi, Moreno |
BookMark | eNqN0EtLAzEUBeCID2xr_8PgRlwMJJP30pb6gIKCdT3cSZN27DSpc8fXv7e1Ii5dXQ58HDi3T45iiv6A9DlnttCCK3P4N5yQnuVcKqoVOyVDxGdKKZPWSmF7hE7Tonb5CNDPs4c2LVpYZ4-fsVt6rDGDOM9mLUQMqV1DV6d4Ro4DNOiHP3dAnq4ns_FtPr2_uRtfTXMouBUfuWGaW6u840ExY63QoDgY6px1FZWiClLMpZShEEBDYJpWANprVWy9ZHxALve9gCv_jsvUdFi-Nb5KaYWl1eZ3YbG1F3u7adPLq8eu_GbOx66FppyMxopTzjX7h5RSW2V3ned76QChqWNdrlPcvWezxFIKZqjR_AtJ12zt |
ContentType | eBook |
DBID | I4C |
DEWEY | 005.115 |
DatabaseName | Casalini Torrossa eBooks Institutional Catalogue |
DatabaseTitleList | |
DeliveryMethod | fulltext_linktorsrc |
Discipline | Computer Science |
EISBN | 3319274368 9783319274362 |
Edition | 1 1st ed. 2015 |
Editor | Falaschi, Moreno |
Editor_xml | – sequence: 1 fullname: Falaschi, Moreno |
ExternalDocumentID | 9783319274362 EBC6303371 EBC5579692 5418087 |
GroupedDBID | 0D6 0DA 38. AABBV AAGZE AAZAK AAZUS ABBVZ ABFTD ABMNI ACKNT AEDXK AEKFX AETDV AEZAY ALMA_UNASSIGNED_HOLDINGS APFYR AZZ BBABE CZZ I4C IEZ IY- LDH NUC SAO SBO SFQCF TMQGW TPJZQ TSXQS TWXRB Z7R Z7X Z83 Z88 AEJLV |
ID | FETCH-LOGICAL-a2394x-8173996ec3f6189947a63a80cc9cb054bf54d555f24a0ff170baa7e762f61513 |
ISBN | 3319274368 9783319274362 331927435X 9783319274355 |
IngestDate | Fri Nov 08 04:08:11 EST 2024 Fri May 30 22:02:50 EDT 2025 Fri May 30 23:22:13 EDT 2025 Tue Nov 14 22:53:14 EST 2023 |
IsPeerReviewed | false |
IsScholarly | false |
LCCallNum_Ident | Q |
Language | English |
LinkModel | OpenURL |
MergedId | FETCHMERGED-LOGICAL-a2394x-8173996ec3f6189947a63a80cc9cb054bf54d555f24a0ff170baa7e762f61513 |
OCLC | 933560761 |
PQID | EBC5579692 |
PageCount | 384 |
ParticipantIDs | askewsholts_vlebooks_9783319274362 proquest_ebookcentral_EBC6303371 proquest_ebookcentral_EBC5579692 casalini_monographs_5418087 |
PublicationCentury | 2000 |
PublicationDate | 2015 2015-12-16 |
PublicationDateYYYYMMDD | 2015-01-01 2015-12-16 |
PublicationDate_xml | – year: 2015 text: 2015 |
PublicationDecade | 2010 |
PublicationPlace | Cham |
PublicationPlace_xml | – name: Netherlands – name: Cham |
PublicationSeriesTitle | LNCS sublibrary. SL 1, Theoretical computer science and general issues |
PublicationYear | 2015 |
Publisher | Springer Nature Springer International Publishing AG Springer |
Publisher_xml | – name: Springer Nature – name: Springer International Publishing AG – name: Springer |
SSID | ssj0001599549 |
Score | 1.9622475 |
Snippet | This book constitutes the thoroughly refereedpost-conference proceedings of the 25th International Symposium on Logic-BasedProgram Synthesis and... |
SourceID | askewsholts proquest casalini |
SourceType | Aggregation Database Publisher |
SubjectTerms | Computer programming, programs, data Logic programming Software engineering |
Subtitle | 25th International Symposium, LOPSTR 2015, Siena, Italy, July 13-15, 2015. Revised Selected Papers |
TableOfContents | Intro -- Preface -- Organization -- Invited Talks -- Verification by Abstract Interpretation, Soundness and Abstract Induction -- Towards Verified Cryptographic Implementations -- Proof Checking and Logic Programming -- Contents -- Invited Talk -- Proof Checking and Logic Programming -- 1 Introduction -- 1.1 Validate Proofs, Not Provers -- 1.2 Proof Checking Vs Proof Reconstruction -- 1.3 The Community of Logic Programming -- 2 Proof Theory as a Framework -- 3 Focused Versions of Sequent Calculi -- 4 Foundational Proof Certificates -- 5 Proof Checking as Logic Programming -- 6 Non-determinism in Proof Checking -- 7 Conclusion -- References -- Semantics of Logic Languages -- On Dual Programs in Co-Logic Programming -- 1 Introduction -- 2 Preliminaries -- 3 Non-stratified Co-Logic Programs and Horn -calculus -- 3.1 Dual Programs of Non-Stratified Programs -- 3.2 Horn -Calculus and Its Fixpoint Semantics -- 4 Dual Programs in the Well-Founded Semantics -- 5 Related Work and Concluding Remarks -- References -- Equational Formulas and Pattern Operations in Initial Order-Sorted Algebras -- 1 Introduction -- 2 Preliminaries on Order-Sorted Algebra -- 3 The # Signature Transformation -- 3.1 Variations on the # Theme -- 4 Equational Formulas in Initial Order-Sorted Algebras -- 5 Pattern Operations in Initial Order-Sorted Algebras -- 6 Implementation and Experiments -- 7 Related Work and Conclusions -- References -- Efficient Compilation of Functional Logic Programs -- Compiling Collapsing Rules in Certain Constructor Systems -- 1 Introduction -- 2 Implementation Techniques -- 3 Detour on Need -- 4 Transformation -- 5 Ripping -- 6 Performance -- 7 Narrowing -- 8 Discussion and Related Work -- References -- From Boolean Equalities to Constraints -- 1 Motivation -- 2 Functional Logic Programming and Curry -- 3 Transforming Equalities 4 Propagating and Establishing Assumptions -- 4.1 Atomic Constructs -- 4.2 Composition -- 4.3 If -- 4.4 While -- 4.5 Down-propagating the Assumed Predicates -- 5 Derivation Examples -- 5.1 Evaluating Polynomials -- 5.2 Back to the Motivating Example -- 6 Conclusion -- References -- Program Debugging and Slicing -- A Generalized Model for Algorithmic Debugging -- 1 Introduction -- 1.1 Contributions of This Work -- 2 Some Problems Identified in Current Algorithmic Debuggers -- 3 Related Work -- 3.1 A Little Bit of History -- 3.2 Modern Implementations -- 4 Paradigm-Independent Redefinition of Algorithmic Debugging -- 4.1 The Execution Tree -- 4.2 Routine Tree -- 4.3 Search Strategies for AD -- 4.4 AD Transformations -- 4.5 An AD Scheme -- 5 Conclusion -- References -- Concolic Execution in Functional Programming by Program Instrumentation -- 1 Introduction -- 2 The Language -- 3 Instrumented Semantics -- 4 Program Instrumentation -- 5 Concolic Execution -- 6 Discussion -- References -- Memory Policy Analysis for Semantics Specifications in Maude -- 1 Introduction -- 2 Related Work -- 3 Preliminaries -- 3.1 Memory Policies -- 3.2 Semantics in Maude -- 4 Inferring Memory Policies -- 4.1 Maude Slicing -- 4.2 Inferring the Sorts for the Values in the Memory -- 4.3 Inferring the Functions Modifying the Memory -- 4.4 Inferring the Data-Flow Information -- 5 Prototype -- 6 Concluding Remarks and Future Work -- References -- Smart Environments -- SHIP - A Logic-Based Language and Tool to Program Smart Environments -- 1 Introduction -- 2 Running Example -- 3 Specification and Representation of States -- 3.1 Representation of States -- 3.2 ABox-Queries -- 4 Updates -- 4.1 ABox Update -- 4.2 Monitor Progression -- 5 Programming -- 5.1 Small-Step Semantics -- 6 Improvements -- 7 Related Work and Conclusion -- References -- Program Transformation Correctness of Context-Moving Transformations for Term Rewriting Systems -- 1 Introduction -- 2 Preliminaries -- 3 Context-Moving Transformation for TRSs -- 3.1 Correctness of the Context-Moving Transformation with Respect to Eager Evaluation Semantics -- 3.2 Correctness of the Context-Moving Transformation with Respect to Initial Algebra Semantics -- 4 Context-Splitting Transformation for TRSs -- 4.1 Correctness of the Context-Splitting Transformation with Respect to Initial Algebra Semantics -- 5 Automating the Context-Moving and Context-Splitting Transformations -- 6 Conclusion -- References -- Constraint Solving and Programming -- Why CP Portfolio Solvers Are (under)Utilized? Issues and Challenges -- 1 Introduction -- 2 Prediction Model -- 2.1 Dataset -- 2.2 Features -- 2.3 Solver Selection -- 3 Optimisation Problems -- 4 Parallelisation -- 5 Utilisation -- 5.1 SUNNY and sunny-cp -- 6 Related Work -- 7 Conclusions and Extensions -- References -- CHR in Action -- 1 Introduction -- 2 Related Work -- 3 Constraint Handling Rules -- 4 XPCE -- 5 Source-to-Source Transformation -- 6 Animation Using CHR -- 6.1 Linking CA Constraints to Graphical Objects -- 6.2 Transforming the Rules of the Original Program P -- 6.3 Implemented CHR Animation Library -- 7 Animation Example: Sorting -- 8 Conclusion and Future Work -- References -- Author Index 1 Introduction -- 2 The tccp language -- 2.1 The Concrete Denotational Semantics -- 3 The (finite) Abstract Semantics for tccp -- 3.1 The Abstract Semantics -- 3.2 From Infinite to Finite Semantics -- 4 Abstract Analysis with an Over-Approximation -- 5 Related Work -- 6 Conclusions and Future Work -- References -- A Global Occurrence Counting Analysis for Brane Calculi -- 1 Introduction -- 2 An Overview on Brane Calculus -- 3 Communication via Mobile Vesicles -- 4 The Abstraction -- 5 Our Analysis at Work -- 6 Conclusions -- References -- Using Dynamic Pushdown Networks to Automate a Modular Information-Flow Analysis -- 1 Introduction -- 2 Basic Notions and Notation -- 2.1 Model of Computation -- 2.2 Attacker Model and Definition of Security -- 2.3 Dynamic Pushdown Networks -- 2.4 Control Configurations and Modes -- 2.5 A Concrete Programming Language with Modes -- 3 A DPN-based Analysis for Sound Assumptions -- 4 An Inference for Sound Guarantees -- 5 A Type System for Information-Flow Security -- 6 Applying the Analysis -- 7 Related Work -- 8 Conclusion -- References -- Automated Verification -- Checking Java Assertions Using Automated Test-Case Generation -- 1 Introduction -- 2 Assertions and Automated Test-Case Generation -- 3 Program Transformation -- 4 Experiments -- 5 Conclusions -- References -- A Generic Intermediate Representation for Verification Condition Generation -- 1 Introduction -- 2 Imperative Languages -- 3 Functional Languages -- 4 The Intermediate Representacion -- 5 Determining the Invariant Locations -- 6 Generating the Verification Conditions -- 7 Conclusions and Related Work -- References -- Combining Top-Down and Bottom-Up Techniques in Program Derivation -- 1 Introduction -- 2 Motivating Example -- 3 Mixing Top-Down and Bottom-Up Approaches -- 3.1 Derivation Methodology -- 3.2 Incorporating the Bottom-Up Approach 4 Analysis of Required Values -- 5 Implementation -- 6 Practical Evaluation -- 7 Conclusions -- References -- Types and Security -- A Type-Theoretic Approach to Resolution -- 1 Introduction -- 2 A Type System for LP: Horn-Formulas as Types -- 3 Realizability Transformation -- 4 Structual Resolution -- 4.1 S-Resolution in the Type-Theoretic Setting -- 4.2 LP-Struct and LP-Unif -- 4.3 Realizability Transformation and LP-Struct -- 5 Conclusions and Future Work -- References -- A Typed Language for Events -- 1 Introduction -- 2 Preliminaries -- 3 Events as Typed Terms -- 3.1 Types and Terms -- 3.2 Typing Rules -- 4 Event History and Intervals -- 4.1 Time Expressions and Time Constraints -- 4.2 History of Events -- 5 A Prolog Implementation -- 5.1 Defining Events, Event Typing and Intervals -- 5.2 Application: Obligation Models -- 6 Related Work -- 7 Conclusions -- References -- Optimization -- Applying Sorting Networks to Synthesize Optimized Sorting Libraries -- 1 Introduction -- 2 Background -- 2.1 Quicksort with Insertion Sort for Base Case -- 2.2 Sorting Networks -- 2.3 Modern CPU Architectures -- 3 Quicksort with Sorting Networks for Base Case -- 4 Unrolling the Base Case -- 5 Implementing Sorting Networks Efficiently -- 6 Quicksort with Sorting Network Base Case -- 7 Conclusion -- References -- Impact of Accuracy Optimization on the Convergence of Numerical Iterative Methods -- 1 Introduction -- 2 Program Transformation for Numerical Accuracy -- 2.1 Floating-Point Arithmetic and Error Bound Computation -- 2.2 Transformation of Expressions -- 2.3 Transformation of Commands -- 3 Case Studies -- 3.1 Linear Systems of Equations -- 3.2 Zero Finding -- 3.3 Eigenvalue Computation -- 3.4 Iterative Gram-Schmidt Method -- 3.5 Performance Analysis -- 4 Conclusion -- References -- Static Analysis -- Abstract Analysis of Universal Properties for tccp |
Title | Logic-Based Program Synthesis and Transformation |
URI | http://digital.casalini.it/9783319274362 https://ebookcentral.proquest.com/lib/[SITE_ID]/detail.action?docID=5579692 https://ebookcentral.proquest.com/lib/[SITE_ID]/detail.action?docID=6303371 https://www.vlebooks.com/vleweb/product/openreader?id=none&isbn=9783319274362 |
Volume | 9527 |
hasFullText | 1 |
inHoldings | 1 |
isFullTextHit | |
isPrint | |
link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV3fb9MwELZge2Ev_BZlgCzEW5IqiePEQeIBqk5jKgPRDu0tchJ7SEA3LRmi_B38wdzZTtMUhICXqk3SNPV38X2-3HdHyLNc1JGu4zwQIlcBMGIRlMAagoQlZZ1Wac5SFDi_OU4PT5KjU37atbh36pK2HFfff6sr-R9UYRvgiirZf0B2fVLYAO8BX3gFhOF1i_yuPzrlMk5YAXqgusuwwtoDQOawvohJitwgpDZ7I-btx60A4Hz1BZO2bKvj2dt388V7D1w1NyFRuOcNsXwN9HzlpNQrL2KB3Y_Hjc2jBbyIxrTTwauRF6p_QHSAKs3K9A2G2eNSLc_tLIbVlZsXs-PJ3GswDmYDn9585kU2a6lXV1au7YTXCZDw353ZYtmesZpB5CLimAVihZWDyOVgRctgSoCFMrO1e7spOue2gMBWaeyN49ENX88yWH7vvpwezT70cTasqJbkKOvpTu0KL_U_tUf2ZPMJnAo4nLZBhiIbicLUXxy0YR2LW2RXoRTlNrmmlnfIza4BB3Xz8V3yY8MOqLMDurYDCiNFh3bwnKIV0IEV0LUV-NTaAMVh9KmxAJ8a_H2K6FODvm_2j6nDnnbYU4v9PXJyMF1MDgPXZiOQMcuTb4GIMqCpqaqYTiNYfyeZTJkUYVXlVQmUvtQ8qTnnOk5kqHWUhaWUmQI3qpEPs_tkZ3m-VA8IFXWtNVMZE1ondV3lQiupgCYJXpeVCEfk6cZAF18_m4yAphgAOSL73fgXcMPayu1NwZNIhCIbEdpBUphvuyTmYvpqwlFYncd_OiQFysay6OHfXMg-udGb7SOy015eqcdAQdvyibOynyF0hm8 |
linkProvider | Library Specific Holdings |
openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=book&rft.title=Logic-based+program+synthesis+and+transformation%3A+25th+International+Symposium%2C+LOPSTR+2015%2C+Siena%2C+Italy%2C+July+13-15%2C+2015.+Revised+selected+papers&rft.au=Falaschi%2C+Moreno&rft.series=LNCS+sublibrary.+SL+1%2C+Theoretical+computer+science+and+general+issues&rft.date=2015-12-16&rft.pub=Springer&rft.isbn=9783319274355&rft.volume=9527&rft.externalDocID=9783319274362 |
thumbnail_m | http://utb.summon.serialssolutions.com/2.0.0/image/custom?url=https%3A%2F%2Fvle.dmmserver.com%2Fmedia%2F640%2F97833192%2F9783319274362.jpg |