Sciweavers

899 search results - page 87 / 180
» A CTL-Based Logic for Program Abstractions
Sort
View
ICFP
2008
ACM
16 years 16 days ago
Ynot: dependent types for imperative programs
We describe an axiomatic extension to the Coq proof assistant, that supports writing, reasoning about, and extracting higher-order, dependently-typed programs with side-effects. C...
Aleksandar Nanevski, Greg Morrisett, Avraham Shinn...
135
Voted
ICFP
2010
ACM
15 years 1 months ago
A fresh look at programming with names and binders
A wide range of computer programs, including compilers and theorem provers, manipulate data structures that involve names and binding. However, the design of programming idioms wh...
Nicolas Pouillard, François Pottier
ICIW
2007
IEEE
15 years 4 months ago
Type-Based Static and Dynamic Website Verification
Abstract-- Maintaining large websites and verifying their semantic content is a difficult task. In this paper we propose a framework for syntactic validation, semantic verification...
Jorge Coelho, Mário Florido
CATS
2006
15 years 2 months ago
Mechanically Verifying Correctness of CPS Compilation
In this paper, we study the formalization of one-pass call-by-value CPS compilation using higher-order abstract syntax. In particular, we verify mechanically that the source progr...
Ye Henry Tian
109
Voted
JFPLC
2000
15 years 1 months ago
Preuves infinies en Programmation logique
ABSTRACT. This paper focuses on the assignment of meaning to some nonterminating SLD derivations in logic programming. Several approaches have been developped by considering infini...
Mathieu Jaume