Sciweavers

1821 search results - page 54 / 365
» Security-Aware Program Transformations
Sort
View
SIGADA
2007
Springer
14 years 3 months ago
Using SPARK for a beginner's course on reasoning about imperative programs
Teaching beginners predicate transformer semantics for imperative languages is not a trivial task. For Computer Science majors, the teaching of the theoretical material must be su...
Kung-Kiu Lau
SCP
2008
115views more  SCP 2008»
13 years 8 months ago
Goto elimination in program algebra
This paper shows that program algebra (PGA) [8] offers a mathematical and systematic framework for reasoning about correctness and equivalence of algorithms and transformation rul...
Thuy Duong Vu
LOPSTR
2009
Springer
14 years 3 months ago
The Dependency Triple Framework for Termination of Logic Programs
We show how to combine the two most powerful approaches for automated termination analysis of logic programs (LPs): the direct approach which operates directly on LPs and the trans...
Peter Schneider-Kamp, Jürgen Giesl, Manh Than...
APLAS
2004
ACM
14 years 2 months ago
An Implementation Scheme for XML Transformation Languages Through Derivation of Stream Processors
We propose a new implementation scheme for XML transformation languages through derivation of stream processors. Most of XML transformation languages are implemented as tree manipu...
Keisuke Nakano
ESOP
2004
Springer
14 years 2 months ago
Answer Type Polymorphism in Call-by-Name Continuation Passing
Abstract. This paper studies continuations by means of a polymorphic type system. The traditional call-by-name continuation passing style transform admits a typing in which some an...
Hayo Thielecke