000 04593nam a22006015i 4500
001 978-3-540-25951-0
003 DE-He213
005 20160624101907.0
007 cr nn 008mamaa
008 121227s2004 gw | s |||| 0|eng d
020 _a9783540259510
_9978-3-540-25951-0
024 7 _a10.1007/b98187
_2doi
050 4 _aQA76.9.L63
050 4 _aQA76.5913
050 4 _aQA76.63
072 7 _aUM
_2bicssc
072 7 _aUYF
_2bicssc
072 7 _aCOM051000
_2bisacsh
072 7 _aCOM036000
_2bisacsh
082 0 4 _a005.1015113
_223
245 1 0 _aProgram Development in Computational Logic
_h[electronic resource] :
_bA Decade of Research Advances in Logic-Based Program Development /
_cedited by Maurice Bruynooghe, Kung-Kiu Lau.
260 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c2004.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c2004.
300 _aVIII, 539 p.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v3049
505 0 _aSpecification and Synthesis -- Specifying Compositional Units for Correct Program Development in Computational Logic -- Synthesis of Programs in Computational Logic -- Developing Logic Programs from Specifications Using Stepwise Refinement -- Semantics -- Declarative Semantics of Input Consuming Logic Programs -- On the Semantics of Logic Program Composition -- Analysis -- Analysing Logic Programs by Reasoning Backwards -- Binding-Time Analysis for Mercury -- A Generic Framework for Context-Sensitive Analysis of Modular Programs -- Transformation and Specialisation -- Unfold/Fold Transformations for Automated Verification of Parameterized Concurrent Systems -- Transformation Rules for Locally Stratified Constraint Logic Programs -- Specialising Interpreters Using Offline Partial Deduction -- Termination -- Characterisations of Termination in Logic Programming -- On the Inference of Natural Level Mappings -- Proving Termination for Logic Programs by the Query-Mapping Pairs Approach -- Systems -- Herbrand Constraints in HAL.
520 _a1 The tenth anniversary of the LOPSTR symposium provided the incentive for this volume. LOPSTR started in 1991 as a workshop on logic program synthesis and transformation, but later it broadened its scope to logic-based program development in general, that is, program development in computational logic, and hence the title of this volume. The motivating force behind LOPSTR has been the belief that declarative paradigms such as logic programming are better suited to program development tasks than traditional non-declarative ones such as the imperative paradigm. Speci?cation, synthesis, transformation or specialization, analysis, debugging and veri?cation can all be given logical foundations, thus providing a unifying framework for the whole development process. In the past 10 years or so, such a theoretical framework has indeed begun to emerge. Even tools have been implemented for analysis, veri?cation and speci- ization. However,itisfairtosaythatsofarthefocushaslargelybeenonprogrammi- in-the-small. So the future challenge is to apply or extend these techniques to programming-in-the-large, in order to tackle software engineering in the real world. Returning to this volume, our aim is to present a collection of papers that re?ect signi?cant research e?orts over the past 10 years. These papers cover the wholedevelopmentprocess:speci?cation,synthesis,analysis,transformationand specialization, as well as semantics and systems.
650 0 _aComputer science.
650 0 _aSoftware engineering.
650 0 _aLogic design.
650 0 _aArtificial intelligence.
650 1 4 _aComputer Science.
650 2 4 _aLogics and Meanings of Programs.
650 2 4 _aProgramming Techniques.
650 2 4 _aMathematical Logic and Formal Languages.
650 2 4 _aArtificial Intelligence (incl. Robotics).
650 2 4 _aSoftware Engineering.
650 2 4 _aProgramming Languages, Compilers, Interpreters.
700 1 _aBruynooghe, Maurice.
_eeditor.
700 1 _aLau, Kung-Kiu.
_eeditor.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9783540221524
786 _dSpringer
830 0 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v3049
856 4 0 _uhttp://dx.doi.org/10.1007/b98187
942 _2EBK3214
_cEBK
999 _c32508
_d32508