Logic Based Program Synthesis and Transformation [electronic resource] : 11th International Workshop, LOPSTR 2001 Paphos, Cyprus, November 28–30, 2001 Selected Papers / edited by Alberto Pettorossi.
Material type: TextSeries: Lecture Notes in Computer Science ; 2372Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg, 2002Description: VIII, 272 p. online resourceContent type: text Media type: computer Carrier type: online resourceISBN: 9783540456070Subject(s): Computer science | Logic design | Artificial intelligence | Computer Science | Logics and Meanings of Programs | Programming Techniques | Artificial Intelligence (incl. Robotics) | Mathematical Logic and Formal LanguagesAdditional physical formats: Printed edition:: No titleDDC classification: 005.1015113 LOC classification: QA76.9.L63QA76.5913QA76.63Online resources: Click here to access onlineCurrent library | Home library | Call number | Materials specified | URL | Status | Date due | Barcode |
---|---|---|---|---|---|---|---|
IMSc Library | IMSc Library | Link to resource | Available | EBK5474 |
Invited Speaker -- Static Analysis for Safe Destructive Updates in a Functional Language -- Program Transformation and Equivalence -- A Transformation Technique for Datalog Programs Based on Non-deterministic Constructs -- On Deforesting Parameters of Accumulating Maps -- Equivalence in Answer Set Programming -- Program Verificaion -- Proof Theory, Transformations, and Logic Programming for Debugging Security Protocols -- Abstract Conjunctive Partial Deduction Using Regular Types and Its Application to Model Checking -- Verification of Sets of Infinite State Processes Using Program Transformation -- Program Analysis -- When Size Does Matter -- Symbolic Profiling for Multi-paradigm Declarative Languages -- Program Development -- Correct Object-Oriented Systems in Computational Logic -- A Framework for Developing Embeddable Customized Logics -- Computing Environment-Aware Agent Behaviours with Logic Program Updates -- Program Synthesis -- Extracting General Recursive Program Schemes in Nuprl’s Type Theory -- Extracting Exact Time Bounds from Logical Proofs.
There are no comments on this title.