2000 search results - page 63 / 400 » Program Transformation and Proof Transformation |
156
click to vote
APLAS
2009
ACM
16 years 22 hour ago
2009
ACM
Restricting destructive update to values of a distinguished reference type prevents functions from being polymorphic in the mutability of their arguments. This restriction makes it...
159
click to vote
ICLP
1999
Springer
15 years 9 months ago
1999
Springer
We introduce the notion of bounded nondeterminism for logic programs and queries. A program and a query have bounded nondeterminism if there are finitely many refutations for the...
144
click to vote
FOAL
2007
ACM
15 years 9 months ago
2007
ACM
The goal of this work is to treat safety and security policies as requirements to be composed in an aspectual style with a developing application. Policies can be expressed either...
278
click to vote
POPL
2009
ACM
16 years 6 months ago
2009
ACM
We propose a new verification method for temporal properties of higher-order functional programs, which takes advantage of Ong's recent result on the decidability of the mode...
139
click to vote
CSMR
2003
IEEE
15 years 10 months ago
2003
IEEE
The paper addresses two problems in software maintenance. Firstly, some maintenance tasks require modifications of the grammar. A change in a grammar can make syntax and transfor...