Central to the problem frames approach is the distinction of three different descriptions: requirements R, domain assumptions W and specifications S, tied together with the socall...
Thein Than Tun, Jon G. Hall, Lucia Rapanotti, Karl...
A number of researchers have proposed the use of Boolean satisfiability solvers for verifying C programs. They encode correctness checks as Boolean formulas using finitization: ...
Tracing computations is a widely used methodology for program debugging. Lazy languages, in particular, pose new demands on tracing techniques since following the actual trace of ...
Statically analyzing requirements specifications to assure that they possess desirable properties is an important activity in any rigorous software development project. The analys...