NASA Logo

NTRS

NTRS - NASA Technical Reports Server

Back to Results
On LimitsIn the last 3 decades or so, the size of systems we have been able to verify formally with automated tools has increased dramatically. At each point in this development, we encountered a different set of limits -- many of which we were eventually able to overcome. Today, we may have reached some limits that may be much harder to conquer. The problem I will discuss is the following: given a hypothetical machine with infinite memory that is seamlessly shared among infinitely many CPUs (or CPU cores), what is the largest problem size that we could solve?
Document ID
20080022207
Acquisition Source
Langley Research Center
Document Type
Conference Paper
Authors
Holzmann, Gerard J.
(Jet Propulsion Lab., California Inst. of Tech. Pasadena, CA, United States)
Date Acquired
August 24, 2013
Publication Date
April 30, 2008
Publication Information
Publication: Proceedings of the Sixth NASA Langley Formal Methods Workshop
Subject Category
Mathematical And Computer Sciences (General)
Distribution Limits
Public
Copyright
Other

Available Downloads

There are no available downloads for this record.
No Preview Available