378 search results - page 40 / 76 » Higher-order transformation of logic programs |
IPPS
1998
IEEE
15 years 2 months ago
1998
IEEE
We study the automation of the verification of Unity programs with infinite or parameterized state space. This paper presents methods allowing the transformation of some second-ord...
ICLP
2001
Springer
15 years 2 months ago
2001
Springer
We formally characterize alternating fixed points of boolean equation systems as models of (propositional) normal logic programs. To this end, we introduce the notion of a preferr...
SAS
2007
Springer
15 years 3 months ago
2007
Springer
Denotational static analysis of Java bytecode has a nice and clean compositional definition and an efficient implementation with binary decision diagrams. But it models only the f...
FCCM
2003
IEEE
15 years 3 months ago
2003
IEEE
Hybrid architectures, which are composed of a conventional processor closely coupled with reconfigurable logic, seem to combine the advantages of both types of hardware. They pres...
PPDP
2007
Springer
15 years 3 months ago
2007
Springer
Program transformation is an appealing technique which allows to improve run-time efficiency, space-consumption and more generally to optimize a given program. Essentially it con...