The K framework, based on rewriting logic semantics, provides a powerful logic for deļ¬ning the semantics of programming languages. While most work in this area has focused on deļ...
Abstract. The recently proposed notion of an elementary set yielded a reļ¬nement of the theorem on loop formulas, telling us that the stable models of a disjunctive logic program ...
Veriļ¬cation of programs requires reasoning about sets of program states. In case of programs manipulating pointers, program states are pointer graphs. Veriļ¬cation of such prog...
Abstract. In previous research, we presented a dynamicprogramming-based EM (expectation-maximization) algorithm for parameterized logic programs, which is based on the structure sh...
Example Guided Abstraction Refinement (CEGAR) [6] framework. A number of wellengineered software model-checkers are available, e.g., SLAM [1] and BLAST [12]. Why build another one?...