NASA Logo

NTRS

NTRS - NASA Technical Reports Server

Collections About News Help Login

Press Enter or click the Search button to begin your search.

Back to Results
A Tool for Intersecting Context-Free Grammars and Its ApplicationsThis paper describes a tool for intersecting context-free grammars. Since this problem is undecidable the tool follows a refinement-based approach and implements a novel refinement which is complete for regularly separable grammars. We show its effectiveness for safety verification of recursive multi-threaded programs.



Document ID
20150022106
Acquisition Source
Ames Research Center
Document Type
Conference Paper
Authors
Gange, Graeme (Melbourne Univ. Victoria, Australia)
Navas, Jorge A. (SGT, Inc. Moffett Field, CA, United States)
Schachte, Peter (Melbourne Univ. Victoria, Australia)
Sondergaard, Harald (Melbourne Univ. Victoria, Australia)
Stuckey, Peter J. (Melbourne Univ. Victoria, Australia)
Date Acquired
December 1, 2015
Publication Date
June 30, 2015
Subject Category
Computer Programming And Software
Report/Patent Number
ARC-E-DAA-TN24297
Report Number: ARC-E-DAA-TN24297
Meeting Information
Meeting: NASA Formal Methods Symposium
Location: Pasadena, CA
Country: United States
Start Date: April 27, 2015
End Date: April 29, 2015
Sponsors: Jet Propulsion Lab., California Inst. of Tech.
Funding Number(s)
CONTRACT_GRANT: NNA14AA60C
Distribution Limits
Public
Copyright
Public Use Permitted.
Keywords
Context Free Grammar
Concurrent Verification
Regularly Separable

Related Records

There are no records associated with this record.
No Preview Available