My Account Log in

1 option

Logic Based Program Synthesis and Transformation : 13th International Symposium LOPSTR 2003, Uppsala, Sweden, August 25-27, 2003, Revised Selected Papers / edited by Maurice Bruynooghe.

LIBRA Q341 .P7 2004
Loading location information...

Available from offsite location This item is stored in our repository but can be checked out.

Log in to request item
Format:
Book
Contributor:
Bruynooghe, M. (Maurice), editor.
SpringerLink (Online service)
Series:
Computer Science (Springer-11645)
Lecture notes in computer science 0302-9743 ; 3018.
Lecture Notes in Computer Science, 0302-9743 ; 3018
Language:
English
Subjects (All):
Software engineering.
Computer logic.
Computer programming.
Logic, Symbolic and mathematical.
Artificial intelligence.
Software Engineering/Programming and Operating Systems.
Logics and Meanings of Programs.
Programming Techniques.
Mathematical Logic and Formal Languages.
Artificial Intelligence.
Local Subjects:
Software Engineering/Programming and Operating Systems.
Logics and Meanings of Programs.
Programming Techniques.
Mathematical Logic and Formal Languages.
Artificial Intelligence.
Physical Description:
1 online resource (X, 238 pages).
Edition:
First edition 2004.
Contained In:
Springer eBooks
Place of Publication:
Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2004.
System Details:
text file PDF
Summary:
This volume contains selected papers from LOPSTR 2003, the 13th Inter- tional Symposium on Logic-Based Program Synthesis and Transformation. The LOPSTR series is devoted to research in logic-based program development. P- ticular topics of interest are speci?cation, synthesis, veri?cation, transformation, specialization, analysis, optimization, composition, reuse, component-based so- ware development, agent-based software development, software architectures, design patterns and frameworks, program re?nement and logics for re?nement, proofs as programs, and applications and tools. LOPSTR 2003 took place at the University of Uppsala from August 25 to August 27 as part of PLI 2003 (Principles, Logics, and Implementations of High- Level Programming Languages). PLI was an ACM-organized confederation of conferences and workshops with ICFP 2003 (ACM-SIGPLAN International C- ference on Functional Programming) and PPDP 2003 (ACM-SIGPLAN Inter- tional Conference on Principles and Practice of Declarative Programming) as the main events. The LOPSTR community pro?ted from the shared lectures of the invited speakers, and the active scienti?c discussions enabled by the co-location. LOPSTR 2003 was the thirteenth in a series of events. Past events were held in Manchester, UK (1991, 1992, 1998), Louvain-la-Neuve, Belgium (1993), Pisa, Italy (1994), Arnhem, The Netherlands (1995), Stockholm, Sweden (1996), L- ven, Belgium (1997), Venice, Italy (1999), London, UK (2000), Paphos, Cyprus (2001), and Madrid, Spain (2002).
Contents:
Invited Talk
Inductive Theorem Proving by Program Specialisation: Generating Proofs for Isabelle Using Ecce
Specification and Synthesis
Predicate Synthesis from Inductive Proof Attempt of Faulty Conjectures
Correct OO Systems in Computational Logic
Specification and Synthesis of Hybrid Automata for Physics-Based Animation
Adding Concrete Syntax to a Prolog-Based Program Synthesis System
Verification
Formal Development and Verification of Approximation Algorithms Using Auxiliary Variables
Formal Reasoning about Efficient Data Structures: A Case Study in ACL2
Analysis
A Program Transformation for Backwards Analysis of Logic Programs
An Efficient Staging Algorithm for Binding-Time Analysis
Proving Termination with Adornments
Transformation and Specialisation
Constructively Characterizing Fold and Unfold
Deterministic Higher-Order Patterns for Program Transformation
From Interpreter to Logic Engine by Defunctionalization
Linearization by Program Transformation
Continuation Semantics as Horn Clauses
Constraints
Simplification of Database Integrity Constraints Revisited: A Transformational Approach
Integration and Optimization of Rule-Based Constraint Solvers
Introducing esra, a Relational Language for Modelling Combinatorial Problems.
Other Format:
Printed edition:
ISBN:
978-3-540-25938-1
9783540259381
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.

Find

Home Release notes

My Account

Shelf Request an item Bookmarks Fines and fees Settings

Guides

Using the Find catalog Using Articles+ Using your account