2000 search results - page 197 / 400 » Program Transformation and Proof Transformation |
124
click to vote
CSL
1989
Springer
15 years 8 months ago
1989
Springer
We generalize algebraic operational semantics from sequential languages to distributed, concurrent languages using Occam as an example. Elsewhere, we will discuss applications to ...
177
Voted
RTA
2010
Springer
15 years 7 months ago
2010
Springer
We present an automated approach to prove termination of Java Bytecode (JBC) programs by automatically transforming them to term rewrite systems (TRSs). In this way, the numerous t...
122
click to vote
FLOPS
2008
Springer
15 years 5 months ago
2008
Springer
Abstract. In this paper, we propose more flexible applicability conditions for the folding rule that increase the power of existing unfold/fold systems for normal logic programs. O...
104
click to vote
ACL
1996
15 years 5 months ago
1996
Off-line compilation of logic grammars using Magic allows an incorporation of filtering into the logic underlying the grammar. The explicit definite clause characterization of fil...
135
Voted
ENTCS
2008
15 years 4 months ago
2008
In this paper, we present the implementation in Tom of a de Bruijn indices generalization allowing the representation of term-graphs over an algebraic signature. By adding pattern...