1 option
Logic Based Program Synthesis and Transformation : 14th International Symposium, LOPSTR 2004, Verona, Italy, August 26-28, 2004, Revised Selected Papers / edited by Sandro Etalle.
SpringerLink Books Lecture Notes In Computer Science (LNCS) (1997-2024) Available online
View online- Format:
- Book
- Series:
- Computer Science (Springer-11645)
- LNCS sublibrary. Theoretical computer science and general issues ; SL 1, 3573.
- Theoretical Computer Science and General Issues ; 3573
- Language:
- English
- Subjects (All):
- Computer logic.
- Computer programming.
- Logic, Symbolic and mathematical.
- Artificial intelligence.
- Logics and Meanings of Programs.
- Programming Techniques.
- Mathematical Logic and Formal Languages.
- Artificial Intelligence.
- Local Subjects:
- Logics and Meanings of Programs.
- Programming Techniques.
- Mathematical Logic and Formal Languages.
- Artificial Intelligence.
- Physical Description:
- 1 online resource (VIII, 284 pages).
- Edition:
- First edition 2005.
- Contained In:
- Springer eBooks
- Place of Publication:
- Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2005.
- System Details:
- text file PDF
- Contents:
- Verification and Analysis
- Searching Semantically Equivalent Code Fragments in Logic Programs
- Determinacy Analysis for Logic Programs Using Mode and Type Information
- Mechanical Verification of Automatic Synthesis of Fault-Tolerant Programs
- Fully Automatic Binding-Time Analysis for Prolog
- Theory and Security
- Logical Mobility and Locality Types
- Unwinding Conditions for Security in Imperative Languages
- Natural Rewriting for General Term Rewriting Systems
- Transformations
- Negation Elimination for Finite PCFGs
- Specialization of Concurrent Guarded Multi-set Transformation Rules
- Efficient Local Unfolding with Ancestor Stacks for Full Prolog
- Program Development
- Schema-Guided Synthesis of Imperative Programs by Constraint Solving
- Run-Time Profiling of Functional Logic Programs
- Constructive Specifications for Compositional Units
- Termination
- Input-Termination of Logic Programs
- On Termination of Binary CLP Programs
- Program Development and Synthesis
- From Natural Semantics to Abstract Machines
- Graph-Based Proof Counting and Enumeration with Applications for Program Fragment Synthesis.
- Other Format:
- Printed edition:
- ISBN:
- 978-3-540-31683-1
- 9783540316831
- Access Restriction:
- Restricted for use by site license.
The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.