Cantitate/Preț
Produs

Logic-Based Program Synthesis and Transformation: 16th International Symposium, LOPSTR 2006, Venice, Italy, July 12-14, 2006, Revised Selected Papers: Lecture Notes in Computer Science, cartea 4407

Editat de Germán Puebla
en Limba Engleză Paperback – 16 mar 2007

Din seria Lecture Notes in Computer Science

Preț: 31830 lei

Preț vechi: 39788 lei
-20%

Puncte Express: 477

Carte tipărită la comandă

Livrare economică 27 iulie-10 august

Livrare prin curier în România Termenul estimat este afișat lângă disponibilitate.
Transport gratuit de la 40000 lei Plată online sau ramburs, în funcție de opțiunile comenzii.
Retur gratuit în 14 zile Comandă securizată și suport în română.

Specificații

ISBN-13: 9783540714095
ISBN-10: 354071409X
Pagini: 237
Ilustrații: VIII, 240 p.
Dimensiuni: 155 x 235 x 17 mm
Greutate: 0.38 kg
Ediția:2007
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seriile Lecture Notes in Computer Science, Theoretical Computer Science and General Issues

Locul publicării:Berlin, Heidelberg, Germany

Public țintă

Research

Cuprins

Invited Talks.- How to Talk to a Human: The Semantic Web and the Clash of the Titans.- CHESS: Systematic Stress Testing of Concurrent Software.- Program Development.- ARM: Automatic Rule Miner.- Constructing Consensus Logic Programs.- Partial Evaluation and Program Transformation.- Supervising Offline Partial Evaluation of Logic Programs Using Online Techniques.- Improving Offline Narrowing-Driven Partial Evaluation Using Size-Change Graphs.- Towards Description and Optimization of Abstract Machines in an Extension of Prolog.- Security and Synthesis.- Combining Different Proof Techniques for Verifying Information Flow Security.- On the Automated Synthesis of Proof-Carrying Temporal Reference Monitors.- Synthesis of Asynchronous Systems.- Debugging and Testing.- A Comparative Study of Algorithmic Debugging Strategies.- A Program Transformation for Tracing Functional Logic Computations.- Termination and Analysis.- Automated Termination Analysis for Logic Programs by Term Rewriting.- Detecting Non-termination of Term Rewriting Systems Using an Unfolding Operator.- Polytool: Proving Termination Automatically Based on Polynomial Interpretations.- Grids: A Domain for Analyzing the Distribution of Numerical Values.