Daikon
From MaRDI portal
Cited in
(99)- Mathematics for reasoning about loop functions
- Beaver
- Texada
- DeepLog
- CLN2INV
- Valigator
- Symstra
- jContractor
- WoLFram
- GeoSteiner
- Effective use of SMT solvers for program equivalence checking through invariant-sketching and query-decomposition
- Omnibus
- Cheddar
- Automated verification of functional correctness of race-free GPU programs
- Relational program reasoning using compiler IR
- How the design of JML accommodates both runtime assertion checking and formal verification
- ClawZ
- JCML
- XMPP
- SANTE
- Korat
- JUnit
- Rostra
- Eclat
- iFEST
- Unified graphical co-modeling, analysis and verification of cyber-physical systems by combining AADL and simulink/stateflow
- Survey on mining signal temporal logic specifications
- Ymer
- SATORI
- Cetus
- libalf
- LearnLib
- Pinapa
- HANNIBAL
- PASSAT
- LOOP
- tptp2X
- ArgoUML
- Programming by predicates: a formal model for interactive synthesis
- Towards light-weight probabilistic model checking
- Symbolic abstract contract synthesis in a rewriting framework
- LOOPUS
- JCrasher
- AspectC++
- Dynamic inference of polymorphic lock types
- DynaMate
- Specification and verification challenges for sequential object-oriented programs
- A formalization of programs in first-order logic with a discrete linear order
- ADABU
- RALib
- Automatic inference of access permissions
- Inferring canonical register automata
- MuACOsm
- Policy-centric protection of OS kernel from vulnerable loadable kernel modules
- Using fault screeners for software error detection
- c2i
- Houdini
- VS3
- PySMT
- Zelus
- KindSpec
- SyPet
- CodeHint
- JSketch
- Sigma*
- Jessie
- IDP3
- Falcon
- FlashExtract
- IODINE
- On invariant checking
- BlinkFill
- JCML: A specification language for the runtime verification of Java card programs
- A versatile concept for the analysis of loops
- Automata Learning through Counterexample Guided Abstraction Refinement
- Collaborative verification and testing with explicit assumptions
- Learning register automata: from languages to program structures
- Verifying array manipulating programs with full-program induction
- Specification and runtime verification of Java card programs
- Model checking merged program traces
- From invariant checking to invariant inference using randomized search
- ANNA
- Learning shape analysis
- Rely
- Quick specifications for the busy programmer
- White-Box Testing by Combining Deduction-Based Specification Extraction and Black-Box Testing
- KERNELC
- Robustness and usability in modern design flows
- A Hybrid Approach to Modeling Biological Systems
- SOBER
- Locust
- SeLoger
- AALpy
- Code2Inv
- Clang Static Analyzer
- Reflexive transitive invariant relations: A basis for computing loop functions
- Active learning for extended finite state machines
- Test-data generation for control coverage by proof
- Verification and falsification of programs with loops using predicate abstraction
This page was built for software: Daikon
