Home | Amazing | Today | Tags | Publishers | Years | Search 
Compiler Specification and Verification (Lecture Notes in Computer Science)
Compiler Specification and Verification (Lecture Notes in Computer Science)

About four years ago David Luckham hinted to me the possibility of verifying a "real" compiler. At that time the idea seemed unrealistic, even absurd. After looking closer at the problem and getting more familiar with the possibilities of the Stanford verifier a verified compiler appeared not so impossible after all. In...

Algorithms in Modern Mathematics and Computer Science: Proceedings, Urgench
Algorithms in Modern Mathematics and Computer Science: Proceedings, Urgench

Some TIME ago a group of mathematicians and computer scientists (including the editors of this volume) thought of making a scientific pilgrimage to the birthplace of al-Khw&rizmf, the outstanding ninth-century mathematician who gave his name to the word "algorithm". As his name indicates, al-Khwarizmi came from the Khorezm...

Verifying Concurrent Processes Using Temporal Logic (Lecture Notes in Computer Science) (v. 129)
Verifying Concurrent Processes Using Temporal Logic (Lecture Notes in Computer Science) (v. 129)

Concurrent processes can exhibit extremely complicated behavior, and neither informal reasoning nor testing is reliable enough to establish their correctness. In this thesis, we develop a new technique for the verification of parallel programs. The technique is stated in terms of axioms and inference rules, and it is used to prove...

The Design of Dynamic Data Structures (Lecture Notes in Computer Science) (v. 156)
The Design of Dynamic Data Structures (Lecture Notes in Computer Science) (v. 156)

In numerous computer applications there is a need of storing large sets of objects in such a way that some questions about those objects can be answered efficiently. Data structures that store such sets of objects can be either static (built for a fixed set of objects) or dynamic (insertions of new objects and deletions of existing objects...

Programming Languages and their Definition: Selected Papers (Lecture Notes in Computer Science) (v. 177)
Programming Languages and their Definition: Selected Papers (Lecture Notes in Computer Science) (v. 177)

The IBM Vienna Laboratory has made a significant contribution to the work on the semantic description of computer systems. Both the operational semantics descriptions ("VDL") and the later work on denotational semantics ("Meta-IV", "VEM") contain interesting scientific ideas. Partly because of the large...

Single Quantum Dots: Fundamentals, Applications and New Concepts (Topics in Applied Physics)
Single Quantum Dots: Fundamentals, Applications and New Concepts (Topics in Applied Physics)

Special focus is given to the optical and electronic properties of single quantum dots due to their potential applications in devices operating with single electrons and/or single photons. This includes quantum dots in electric and magnetic fields, cavity-quantum electrodynamics, nonclassical light generation, and coherent optical control of...

Transfixation: Atlas of Anatomical Sections for the External Fixation of Limbs
Transfixation: Atlas of Anatomical Sections for the External Fixation of Limbs
The past 25 years have seen a progressive improvement in external fixation techniques in terms of patient acceptability, ease of appli cation and apparatus stability. The recent awareness in Europe of the method, application and excellent results of the technique pio neered by G. A. Ilizarov has caused a rapid increase here in...
Unobstructed Shortest Paths in Polyhedral Environments (Lecture Notes in Computer Science)
Unobstructed Shortest Paths in Polyhedral Environments (Lecture Notes in Computer Science)

The study of minimum paths on or around polyhedra in Euclidean 3-space is of growing importance in robotics. This work presents new algorithms based on extensions of the Voronoi diagram. Since experience with new algo- rithms is also important, this work also describes a workbench to allow experimentation.

This book is...

Higher Recursion Theory (Perspectives in Mathematical Logic)
Higher Recursion Theory (Perspectives in Mathematical Logic)

Hyperarithmetic theory is the first step beyond classical recursion theory. It is the primary source of ideas and examples in higher recursion theory. It is also a crossroad for several areas of mathematical logic: in set theory it is an initial segment of Godel's L; in model theory, the least admissible set after ; in descriptive set...

Atlas of Upper Gastrointestinal and Hepato-Pancreato-Biliary Surgery
Atlas of Upper Gastrointestinal and Hepato-Pancreato-Biliary Surgery

This atlas covers in detail the technical aspects of all important procedures of the upper abdomen (esophagus, duodenum, stomach, liver, biliary system, pancreas, portal hypertension and spleen) including general, oncologic and transplantation surgery. Each procedure is associated with a short comment regarding indications of the various...

Logical and Relational Learning (Cognitive Technologies)
Logical and Relational Learning (Cognitive Technologies)

I use the term logical and relational learning to refer to the subfield of artificial intelligence, machine learning and data mining that is concerned with learning in expressive logical or relational representations. It is the union of inductive logic programming, (statistical) relational learning and multi-relational data mining, which all...

Cataract and Refractive Surgery (Essentials in Ophthalmology)
Cataract and Refractive Surgery (Essentials in Ophthalmology)

The topic of the second volume of the series in "Essentials in Ophthalmology" is cataract and refractive surgery, a realm of ophthalmic care that has undergone revolutionary changes in the past 10 years. Worldwide, the removal of the opaque crystalline lens is the most frequently performed surgical intervention in the human body,...

Result Page: Previous 3152 3153 3154 3155 3156 3157 3158 3159 3160 3161 3162 3163 3164 3165 3166 3167 3168 3169 3170 3171 3172 Next 
©2024 LearnIT (support@pdfchm.net) - Privacy Policy