Sciweavers

378 search results - page 33 / 76
» Higher-order transformation of logic programs
Sort
View
ICST
2009
IEEE
14 years 3 months ago
Transforming and Selecting Functional Test Cases for Security Policy Testing
In this paper, we consider typical applications in which the business logic is separated from the access control logic, implemented in an independent component, called the Policy ...
Tejeddine Mouelhi, Yves Le Traon, Benoit Baudry
POPL
2005
ACM
14 years 8 months ago
Automated soundness proofs for dataflow analyses and transformations via local rules
We present Rhodium, a new language for writing compiler optimizations that can be automatically proved sound. Unlike our previous work on Cobalt, Rhodium expresses optimizations u...
Sorin Lerner, Todd D. Millstein, Erika Rice, Craig...
SFP
2004
13 years 10 months ago
A graphic functional-dataflow language
NiMo (Nets in Motion) is a visual environment aimed to support totally graphic programming in Data Flow style, with a strong functional inspiration. Solutions of growing complexit...
Silvia Clerici, Cristina Zoltan
CC
2003
Springer
250views System Software» more  CC 2003»
14 years 1 months ago
Automatic Detection of Uninitialized Variables
vel Meta-Reasoning with Higher-Order Abstract Syntax Alberto Momigliano, Simon Ambler. A Normalisation Result for Higher-Order Calculi with Explicit Substitutions Eduardo Bonelli. ...
Thi Viet Nga Nguyen, François Irigoin, Cori...
TPHOL
1997
IEEE
14 years 21 days ago
An Isabelle-Based Theorem Prover for VDM-SL
This note lists references which address –in some way or another– the problems relating to formal manipulation of logical expressions where terms can fail to denote. Reference...
Sten Agerholm, Jacob Frost