91 search results - page 11 / 19 » Reducts of Propositional Theories, Satisfiability Relations,... |
ICLP
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. In recent work, a general framework for specifying program correspondences under the answer-set semantics has been defined. The framework allows to define different not...
PPDP
2007
Springer
14 years 1 months ago
2007
Springer
Non-confluent and non-terminating rewrite systems are interesting from the point of view of programming. In particular, existing functional logic languages use such kind of rewri...
ICFP
2003
ACM
14 years 7 months ago
2003
ACM
I describe the mechanisation in HOL of some basic -calculus theory, using the axioms proposed by Gordon and Melham [4]. Using these as a foundation, I mechanised the proofs from C...
WCFLP
2005
ACM
14 years 1 months ago
2005
ACM
Program slicing is a well-known technique that extracts from a program those statements which are relevant to a particular criterion. While static slicing does not consider any in...
PPDP
2007
Springer
14 years 1 months ago
2007
Springer
We describe a semantic type soundness result, formalized in the Coq proof assistant, for a compiler from a simple imperative language with heap-allocated data into an idealized as...