Welcome!
To use the personalized features of this site, please log in or register.
If you have forgotten your username or password, we can help.
My Menu
Marked Items 
Alerts
Order History
Saved Items
All
Favorites
    
Book Chapter Printable view
Infinite Games and Verification

Infinite Games and Verification

Extended Abstract of a Tutorial
Book SeriesLecture Notes in Computer Science
PublisherSpringer Berlin / Heidelberg
ISSN0302-9743 (Print) 1611-3349 (Online)
VolumeVolume 2404/2002
BookComputer Aided Verification
DOI10.1007/3-540-45657-0
Copyright2002
ISBN978-3-540-43997-4
DOI10.1007/3-540-45657-0_5
Pages58-65
Subject CollectionComputer Science
SpringerLink DateSaturday, January 12, 2008
Add to marked items

Infinite Games and Verification
Extended Abstract of a Tutorial

Wolfgang Thomas6 Contact Information

(6)  Lehrstuhl für Informatik VII, RWTH Aachen, 52056 Aachen, Germany
Abstract
The purpose of this tutorial is to survey the essentials of the algorithmic theory of infinite games, its role in automatic program synthesis and verification, and some challenges of current research.

Contact Information Wolfgang Thomas
Email: thomas@informatik.rwth-aachen.de
Fulltext Preview (Small, Large)
Image of the first page of the fulltext

References secured to subscribers.
more options
Find


Export this chapter
Export this chapter as RIS | Text
 
Frequently asked questions | General information on journals and books | Send us your feedback | Impressum | Contact
© Springer. Part of Springer Science+Business Media
Privacy, Disclaimer, Terms and Conditions, © Copyright Information
Remote Address: 38.107.191.108 • Server: mpweb17
HTTP User Agent: CCBot/1.0 (+http://www.commoncrawl.org/bot.html)