swMATH177MaRDI QIDQ12944FDOQ12944
Author name not available (Why is that?)
Official website: http://dl.acm.org/citation.cfm?id=1081750
Cited In (only showing first 100 items - show all)
- A new framework for the computation of Hessians
- CompoSAT: specification-guided coverage for model finding
- CUTEst: a constrained and unconstrained testing environment with safe threads for mathematical optimization
- Path Feasibility Analysis for String-Manipulating Programs
- A dwindling filter line search method for unconstrained optimization
- Protocol Inference Using Static Path Profiles
- Formal testing for separation assurance
- An introduction to test specification in FQL
- Model Checking Software
- Behavioral interface specification languages
- Establishing flight software reliability: testing, model checking, constraint-solving, monitoring and learning
- SIPAMPL
- TENSOLVE
- MiBench
- NSIPS
- KLEE
- PGAPack
- UFO
- UniTESK
- ADL
- DART
- Euclide
- Eclat
- Korat
- PathCrawler
- Pex
- SANTE
- Rostra
- TestEra
- SIPAMPL
- TRACER
- Bandera
- Java PathFinder
- ConTest
- CBMC
- jEdit
- HighSpec
- CCured
- ArgoUML
- edge_push_sp
- SpecExplorer
- JPF-SE
- marga
- Perracotta
- QPLIB2014
- JCrasher
- log4j
- GanttProject
- YOGI
- Symbolic automata
- KLOVER
- FShell
- LINUOA
- LCTD
- LCTD: test-guided proofs for C programs on LLVM
- Sigma*
- MSV
- Looper
- Alloy*
- Sigma*
- StrSolve
- KLOVERA
- CATG
- Jalangi
- Pixy
- Symbiotic 2
- CIL
- Angelix
- jCUTE
- SymDIVINE
- BINSEC/SE
- LCT
- ExpoSE
- KOOL
- STP
- Software Model Checking: Searching for Computations in the Abstract or the Concrete
- Beginner's luck: a language for property-based generators
- Bugst
- Bordeaux
- CD2Alloy
- cddiff
- CompoSAT
- VERMEER
- Whispec
- WhyLine
- JaCoCo
- Con2colic
- QSYM
- SOBER
- Test selection for traces refinement
- Strategies for scalable symbolic execution-driven test generation for programs
- A generic framework for symbolic execution: a coinductive approach
- Mechanized semantics for the clight subset of the C language
- StarFinder
- RHLE Benchmarks
- A non-termination criterion for binary constraint logic programs
- Test generation from event system abstractions to cover their states and transitions
- Constraint programming for dynamic symbolic execution of JavaScript
- Not all bugs are created equal, but robust reachability can tell the difference
- Runtime Exception Detection in Java Programs Using Symbolic Execution
This page was built for software: CUTE
