Sciweavers

378 search results - page 15 / 76
» Higher-order transformation of logic programs
Sort
View
ASIAN
1999
Springer
99views Algorithms» more  ASIAN 1999»
15 years 1 months ago
Beyond Tamaki-Sato Style Unfold/Fold Transformations for Normal Logic Programs
Unfold/fold transformation systems for logic programs have been extensively investigated. Existing unfold/fold transformation systems for normal logic programs allow only Tamaki-Sa...
Abhik Roychoudhury, K. Narayan Kumar, C. R. Ramakr...
87
Voted
CORR
2010
Springer
137views Education» more  CORR 2010»
14 years 9 months ago
Verification of Java Bytecode using Analysis and Transformation of Logic Programs
State of the art analyzers in the Logic Programming (LP) paradigm are nowadays mature and sophisticated. They allow inferring a wide variety of global properties including terminat...
Elvira Albert, Miguel Gómez-Zamalloa, Laure...
LOPSTR
2001
Springer
15 years 2 months ago
Proof Theory, Transformations, and Logic Programming for Debugging Security Protocols
In this paper we define a sequent calculus to formally specify, simulate, debug and verify security protocols. In our sequents we distinguish between the current knowledge of prin...
Giorgio Delzanno, Sandro Etalle
59
Voted
LOPSTR
2000
Springer
15 years 1 months ago
Higher-order transformation of logic programs
Silvija Seres, J. Michael Spivey