Suchergebnisse - "Automatic Programming—program verification General Terms"

DSD-Crasher: A hybrid analysis tool for bug finding

Autoren: Christoph Csallner Tao Xie The Pennsylvania State University CiteSeerX Archives

Weitere Verfasser: Christoph Csallner Tao Xie The Pennsylvania State University CiteSeerX Archives

Quelle: http://www.cs.uoregon.edu/~yannis/dsd-tosem.pdf.

Schlagwörter: Categories and Subject Descriptors, D.2.4 [Software Engineering, Software/Program Verification—formal methods, reliability, D.2.5 [Software Engineering, Testing and Debugging— testing tools, I.2.2 [Artificial Intelligence, Automatic Programming—program verification General Terms, Verification Additional Key Words and Phrases, Automatic testing, bug finding, dynamic analysis, dynamic invariant detection

Dateibeschreibung: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.123.4597

Verfügbarkeit: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.123.4597
http://www.cs.uoregon.edu/~yannis/dsd-tosem.pdf

Programs]: Specifying and Verifying and Reasoning about Programs--logics ofprograms; mechanical

Autoren: A. P. Sistla E. M. Clarke The Pennsylvania State University CiteSeerX Archives

Weitere Verfasser: A. P. Sistla E. M. Clarke The Pennsylvania State University CiteSeerX Archives

Quelle: http://www.cs.cmu.edu/~emc/papers/Papers In Refereed Journals/The complexity of propositional linear temporal logics85.pdf.

Schlagwörter: veriJ?cation, 1.2.2 [Artificial Intelligence, Automatic Programming--program verification General Terms, Theory Additional Key Words and Phrases, Branching time temporal logic, decision procedures, linear time temporal logic, NP-complete, PSPACE-complete, satistiability

Dateibeschreibung: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.94.178; http://www.cs.cmu.edu/~emc/papers/Papers In Refereed Journals/The complexity of propositional linear temporal logics85.pdf

Verfügbarkeit: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.94.178
http://www.cs.cmu.edu/~emc/papers/Papers In Refereed Journals/The complexity of propositional linear temporal logics85.pdf

Inference of Field-Sensitive Reachability and Cyclicity.

Autoren: ZANARDINI, DAMIANO GENAIM, SAMIR

Quelle: ACM Transactions on Computational Logic; Jul2014, Vol. 15 Issue 4, p1-41, 41p

Schlagwörter: PROGRAMMING languages, MACHINE theory, DATA structures, INFORMATION theory, SEMANTICS

Formal Methods: Practice and Experience.

Autoren: WOODCOCK, JIM LARSEN, PETER GORM BICARREGUI, JUAN et al.

Quelle: ACM Computing Surveys; Oct2009, Vol. 41 Issue 4, p19:1-19:36, 36p, 4 Charts, 10 Graphs

Schlagwörter: FORMAL methods (Computer science), INDUSTRIAL surveys, SOFTWARE verification, USER-centered system design, SOFTWARE architecture