swMATH19490MaRDI QIDQ31317FDOQ31317
Author name not available (Why is that?)
Official website: http://dl.acm.org/citation.cfm?id=730008
Cited In (49)
- Loop summarization using state and transition invariants
- Verifying array manipulating programs with full-program induction
- A learning-based approach to synthesizing invariants for incomplete verification engines
- Code2Inv
- iDFlakies
- RHLE Benchmarks
- Class invariants as abstract interpretation of trace semantics
- Inferring Loop Invariants Using Postconditions
- Verifying relative safety, accuracy, and termination for program approximations
- Automated verification of functional correctness of race-free GPU programs
- From invariant checking to invariant inference using randomized search
- Predicate abstraction for program verification
- An integrated approach to high integrity software verification
- Guiding Craig interpolation with domain-specific abstractions
- Modular inference of subprogram contracts for safety checking
- Complexity and Algorithms for Monomial and Clausal Predicate Abstraction
- UFO
- ACL2s
- SPEED
- eVolCheck
- InvGen
- libalf
- TVLA
- Traffic 4
- Mercator
- SymDiff
- CSSV
- c2i
- ExplainHoudini
- VS3
- CodeHint
- SyPet
- ACCEPT
- Chisel
- EnerJ
- FlexJava
- FlashExtract
- Green
- BlinkFill
- Jass
- ANNA
- Rely
- Learning inductive invariants by sampling from frequency distributions
- CLN2INV
- Specification and verification challenges for sequential object-oriented programs
- Automatic inference of access permissions
- Programming by predicates: a formal model for interactive synthesis
- ExplainHoudini: making Houdini inference transparent
- Quantified data automata for linear data structures: a register automaton model with applications to learning invariants of programs manipulating arrays and lists
This page was built for software: Houdini
