First Page | Document Content | |
---|---|---|
![]() Date: 2014-07-17 17:29:47Automated theorem proving Concolic testing Logic in computer science Java Pathfinder Symbolic execution Interprocedural optimization Control flow KeY Software bug Software engineering Formal methods Computing | Source URL: galois.comDownload Document from Source WebsiteFile Size: 161,41 KBShare Document on Facebook |
![]() | Using Java Pathfinder to Reason about Agent Systems Franco Raimondi Department of Computer Science Middlesex UniversityDocID: 1xTg2 - View Document |
![]() | Using Symbolic (Java) PathFinder at NASA Corina S. P˘as˘areanu Carnegie Mellon University/NASA Ames Research Center, Moffett Field, CA 94035, USA,DocID: 1s1qc - View Document |
![]() | Exhaustive Testing of Safety Critical JavaDocID: 1qTQs - View Document |
![]() | Symbolic Execution for Software Testing in Practice – Preliminary Assessment Patrice Godefroid Imperial College LondonDocID: 1pese - View Document |
![]() | PDF DocumentDocID: 1iKZC - View Document |