2008 · 53 citations · 17 references
ComputingComputer EngineeringComputer ScienceAlgorithmsFormal MethodsSchedulingAssertion-based VerificationDesign For TestabilityModel CheckingSoftware TestingExplorationPartial-order ReductionSystemc Modeling
A SystemC simulation kernel consists of a deterministic implementation of the scheduler, whose specification is non-deterministic. To leverage testing of a SystemC TLM design, we focus on automatically exploring all possible behaviors of the design for a given data input. We combine static and dynamic partial order reduction techniques with SystemC semantics to intelligently explore a subset of the possible traces, while still being provably sufficient for detecting deadlocks and safety property violations. We have implemented our exploration algorithm in a framework called Satya and have applied it to a variety of examples including the TAC benchmark. Using Satya, we automatically found an assertion violation in a benchmark distributed as a part of the OSCI repository.
17
Gerard J. Holzmann · IEEE Transactions on Software Engineering · 1997 · 3.8K citations
Model checking for programming languages using VeriSoft
Patrice Godefroid · 1997 · 829 citations · Full text
Automatic predicate abstraction of C programs
Thomas Ball, Rupak Majumdar, Todd Millstein et al. · ACM SIGPLAN Notices · 2012 · 703 citations
Dynamic partial-order reduction for model checking software
Cormac Flanagan, Patrice Godefroid · 2005 · 641 citations · Full text
Lukai Cai, Daniel D. Gajski · 2003 · 527 citations