Sciweavers

3047 search results - page 581 / 610
» On the Meaning of Logical Completeness
Sort
View
ICSE
2005
IEEE-ACM
14 years 8 months ago
Verifying safety policies with size properties and alias controls
Many software properties can be analysed through a relational size analysis on each function's inputs and outputs. Such relational analysis (through a form of dependent typin...
Wei-Ngan Chin, Siau-Cheng Khoo, Shengchao Qin, Cor...
ICFP
2008
ACM
14 years 8 months ago
Mixin' up the ML module system
ML modules provide hierarchical namespace management, as well as fine-grained control over the propagation of type information, but they do not allow modules to be broken up into ...
Derek Dreyer, Andreas Rossberg
ICFP
2007
ACM
14 years 8 months ago
A type system for recursive modules
There has been much work in recent years on extending ML with recursive modules. One of the most difficult problems in the development of such an extension is the double vision pr...
Derek Dreyer
ICFP
2007
ACM
14 years 8 months ago
Termination analysis and call graph construction for higher-order functional programs
The analysis and verification of higher-order programs raises the issue of control-flow analysis for higher-order languages. The problem of constructing an accurate call graph for...
Damien Sereni
ICFP
2005
ACM
14 years 8 months ago
Modular verification of concurrent assembly code with dynamic thread creation and termination
Proof-carrying code (PCC) is a general framework that can, in principle, verify safety properties of arbitrary machine-language programs. Existing PCC systems and typed assembly l...
Xinyu Feng, Zhong Shao