Logic based program synthesis and transformation : 11th International Workshop, LOPSTR 2001 Paphos, Cyprus, November 28 30, 2001 : Selected papers
Salvato in:
| Ente Autore: | |
|---|---|
| Altri autori: | |
| Natura: | Livre numérique |
| Lingua: | Anglais |
| Pubblicazione: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Serie: | Lecture notes in computer science
2372 |
| Soggetti: | |
| Accesso online: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Nota: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Logic based program synthesis and transformation, 11th International Workshop, LOPSTR 2001, Paphos, Cyprus, November 28-30, 2001, Selected papers, Alberto Pettorossi, ed, Berlin, Springer, 2002, 1 vol. (VIII-265 p.), Lecture notes in computer science, 3-540-43915-3 • Logic Based Program Synthesis and Transformation, Texte imprimé, 9783662197417 |
Sommario:
- 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.