Sciweavers

526 search results - page 6 / 106
» Towards the Verifying Compiler
Sort
View
JAR
2008
124views more  JAR 2008»
13 years 9 months ago
Formal Verification of a C-like Memory Model and Its Uses for Verifying Program Transformations
This article presents the formal verification, using the Coq proof assistant, of a memory model for low-level imperative languages such as C and compiler intermediate languages. Be...
Xavier Leroy, Sandrine Blazy
DAC
2005
ACM
14 years 10 months ago
Towards scalable flow and context sensitive pointer analysis
Pointer analysis, a classic problem in software program analysis, has emerged as an important problem to solve in design automation, at a time when complex designs, specified in t...
Jianwen Zhu
ICFP
2010
ACM
13 years 9 months ago
ReCaml: execution state as the cornerstone of reconfigurations
Most current techniques fail to achieve the dynamic update of recursive functions. A focus on execution states appears to be essential in order to implement dynamic update in this...
Jérémy Buisson, Fabien Dagnat
TOPLAS
2008
101views more  TOPLAS 2008»
13 years 9 months ago
Verifying policy-based web services security
WS-SecurityPolicy is a declarative language for configuring web services security mechanisms. We describe a formal semantics for WS-SecurityPolicy and propose a more abstract lang...
Karthikeyan Bhargavan, Cédric Fournet, Andr...
DATE
2005
IEEE
115views Hardware» more  DATE 2005»
14 years 3 months ago
An Infrastructure to Functionally Test Designs Generated by Compilers Targeting FPGAs
This paper presents an infrastructure to test the functionality of the specific architectures output by a highlevel compiler targeting dynamically reconfigurable hardware. It resu...
Rui Rodrigues, João M. P. Cardoso