Sciweavers

4257 search results - page 500 / 852
» The Logical Modularity of Programs
Sort
View
184
Voted
POPL
1995
ACM
15 years 10 months ago
Parametric Program Slicing
Program slicing is a technique for isolating computational threads in programs. In this paper, we show how to mechanically extract a family of practical algorithms for computing s...
John Field, G. Ramalingam, Frank Tip
ENTCS
2008
170views more  ENTCS 2008»
15 years 7 months ago
A Coq Library for Verification of Concurrent Programs
Thanks to recent advances, modern proof assistants now enable verification of realistic sequential programs. However, regarding the concurrency paradigm, previous work essentially...
Reynald Affeldt, Naoki Kobayashi
POPL
2006
ACM
16 years 7 months ago
Formal certification of a compiler back-end or: programming a compiler with a proof assistant
This paper reports on the development and formal certification (proof of semantic preservation) of a compiler from Cminor (a Clike imperative language) to PowerPC assembly code, u...
Xavier Leroy
LICS
2009
IEEE
16 years 1 months ago
Pointer Programs and Undirected Reachability
Pointer programs are a model of structured computation within logspace. They capture the common description of logspace algorithms as programs that take as input some structured d...
Martin Hofmann, Ulrich Schöpp
AGP
2003
IEEE
16 years 4 days ago
Reasoning about the Semantic Web using Answer Set Programming
The paper discusses some innovative aspects related to the integration of a framework based on Answer Set Programming in an Information Retrieval Agent, namely, the Global Search A...
Giovambattista Ianni, Francesco Calimeri, Vincenzi...