<--- Back to Details
First PageDocument Content
Coverity / Software testing / Source code / Software bug / Code coverage / Computer security / Static program analysis / ChecKing / Open source software security / Software engineering / Software quality / Computer programming
Date: 2010-02-10 12:36:42
Coverity
Software testing
Source code
Software bug
Code coverage
Computer security
Static program analysis
ChecKing
Open source software security
Software engineering
Software quality
Computer programming

Add to Reading List

Source URL: coverity.com

Download Document from Source Website

Share Document on Facebook

Similar Documents

Finite automata / Abstract algebra / Algebra / Finite-state transducer / Mathematics / Theoretical computer science / Finite-state machine / Semigroup action / Kazhdan's property / Tree transducer

Lipschitz Robustness of Finite-state Transducers Thomas A. Henzinger, Jan Otop, Roopsha Samanta IST Austria Abstract We investigate the problem of checking if a finite-state transducer is robust to uncertainty in

DocID: 1xW24 - View Document

Computing / Computer programming / C / Data types / Pointer / Hooking / Exec / Nm / Struct

Executable Counterexamples in Software Model Checking J. Gennari1 and A. Gurfinkel2 and T. Kahsai3 and J. A. Navas4 and E. J. Schwartz1 Presenter: Natarajan Shankar4 1 Carnegie

DocID: 1xVWH - View Document

Model checkers / Computing / Theoretical computer science / Software engineering / Formal methods / Promela / SPIN model checker / Model checking / Guard / Certificate / Formal verification / Printf format string

Increasing Usability of Spin-based C Code Verification Using a Harness Definition Language Leveraging Model-driven Code Checking to Practitioners Daniel Ratiu Andreas Ulrich

DocID: 1xVPm - View Document

Mathematics / Temporal logic / Mathematical analysis / Mathematical logic / Formal languages / Model theory / Generalized functions / Computation tree logic / Logic in computer science / Linear temporal logic / Interpretation / IP

Stochastic Model Checking? Marta Kwiatkowska, Gethin Norman, and David Parker School of Computer Science, University of Birmingham Edgbaston, Birmingham B15 2TT, United Kingdom Abstract. This tutorial presents an overvi

DocID: 1xVOF - View Document

Finite automata / DFA minimization / Deterministic automaton / Finite-state machine / Theoretical computer science / Muller automaton / Bchi automaton

Unbounded Model-Checking with Interpolation for Regular Language Constraints Graeme Gange, Jorge A. Navas, Peter J. Stuckey, Harald Søndergaard, and Peter Schachte The University of Melbourne {ggange,jnavas,pjs,harald,s

DocID: 1xVMq - View Document