Back to Results
First PageMeta Content
Mathematical logic / Automated theorem proving / Formal methods / Metalogic / KeY / Resolution / First-order logic / Model theory / Well-formed formula / Logic / Mathematics / Theoretical computer science


Applications of Feasible Path Analysis to Program Testing Allen Goldberg, T.C. Wang, David Zimmerman* Kestrel Institute 3260 Hillview Avenue
Add to Reading List

Document Date: 2008-11-03 13:00:07

Open Document

File Size: 68,31 KB

Share Result on Facebook

City

Palo Alto / /

Company

Boeing / Reasoning Systems Incorporated. / /

/

Facility

Kestrel Institute / Software Refinery / At Kestrel Institute / David Zimmerman* Kestrel Institute / /

IndustryTerm

safety-critical software / program analysis systems / adequate solution / software testing / depth-first search / greedy algorithm / program analyzer computing program / /

Organization

Kestrel Institute / David Zimmerman* Kestrel Institute / Research and Development Division / /

Person

David Zimmerman / Allen Goldberg / /

Position

author / Symbolic Evaluator / natural deduction controller / /

ProgrammingLanguage

Ada / COBOL / Lisp / /

Technology

greedy algorithm / key enabling technology / /

SocialTag