Improved usability and performance of SMT solvers for debugging specifications

It is now common to construct an extended static checker or software verification system using an SMT theorem prover as the underlying logical verifier. SMT provers have improved significantly in performance over the last several years. However, their usability as a component of software checking an...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:International journal on software tools for technology transfer Ročník 12; číslo 6; s. 467 - 481
Hlavný autor: Cok, David R.
Médium: Journal Article Konferenčný príspevok..
Jazyk:English
Vydavateľské údaje: Berlin/Heidelberg Springer-Verlag 01.11.2010
Springer
Predmet:
Applied sciences
Checkers
Computer programs
Computer Science
Computer science; control theory; systems
Computer systems and distributed systems. User interface
Computer systems performance. Reliability
Construction
Evolution
Exact sciences and technology
Logic and foundations
Mathematical logic, foundations, set theory
Mathematics
Performance enhancement
Program verification (computers)
Proof theory and constructive mathematics
Sciences and techniques of general use
Software
Software Engineering
Software Engineering/Programming and Operating Systems
Solvers
Theory of Computation
Vstte 2008
Vacuity checking
Static checking
JML
ESC/Java
Specification
Verification
Spec#
ESC/Java2
Capability index
JAVA language
Modelling language
Database query
Redundancy
Debugging
Software component
Program verification
Software tool
Multithread
Theorem proving
Concurrency
Static analysis
Proof theory
Usability
Satisfiability
ISSN:1433-2779, 1433-2787
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:It is now common to construct an extended static checker or software verification system using an SMT theorem prover as the underlying logical verifier. SMT provers have improved significantly in performance over the last several years. However, their usability as a component of software checking and verification systems still has gaps. This paper describes investigations in two areas: the reporting of counterexample information and the testing of vacuity, both of which are important to realistic use of such tools for typical software development. The use of solvers in verification is more effective if the solvers support minimal unsatisfiable cores and incremental construction, evolution and querying of satisfying assignments; current solvers only partially support these capabilities.
Bibliografia:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:1433-2779
1433-2787
DOI:10.1007/s10009-010-0138-x