Sciweavers

4513 search results - page 481 / 903
» Logic programming with satisfiability
Sort
View
ECOOP
2000
Springer
15 years 9 months ago
Towards a Unified Programming Language
The goal of research in programming languages should be to develop languages that integrates the best of concepts and constructs from the various programming paradigms. We do not a...
Ole Lehrmann Madsen
POPL
1995
ACM
15 years 8 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
152
Voted
ENTCS
2008
170views more  ENTCS 2008»
15 years 5 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 5 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
15 years 11 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