Sciweavers

POPL
2012
ACM
12 years 8 months ago
The marriage of bisimulations and Kripke logical relations
There has been great progress in recent years on developing effective techniques for reasoning about program equivalence in ML-like languages—that is, languages that combine fea...
Chung-Kil Hur, Derek Dreyer, Georg Neis, Viktor Va...
FOIKS
2008
Springer
14 years 2 months ago
Alternative Characterizations for Program Equivalence under Answer-Set Semantics Based on Unfounded Sets
Logic programs under answer-set semantics constitute an important tool for declarative problem solving. In recent years, two research issues received growing attention. On the one ...
Martin Gebser, Torsten Schaub, Hans Tompits, Stefa...
FM
2008
Springer
192views Formal Methods» more  FM 2008»
14 years 2 months ago
CoVaC: Compiler Validation by Program Analysis of the Cross-Product
Abstract. The paper presents a deductive framework for proving program equivalence and its application to automatic verification of transformations performed by optimizing compiler...
Anna Zaks, Amir Pnueli
LPNMR
2007
Springer
14 years 6 months ago
Alternative Characterizations for Program Equivalence under Answer-Set Semantics: Preliminary Report
Logic programs under answer-set semantics constitute an important tool for declarative problem solving. In recent years, two research issues received growing attention. On the one ...
Martin Gebser, Torsten Schaub, Hans Tompits, Stefa...
LPNMR
2009
Springer
14 years 7 months ago
Casting Away Disjunction and Negation under a Generalisation of Strong Equivalence with Projection
Abstract. In answer-set programming (ASP), many notions of program equivalence have been introduced and formally analysed. A particular line of research in this direction aims at s...
Jörg Pührer, Hans Tompits