Sciweavers

297 search results - page 49 / 60
» ATS: A Language That Combines Programming with Theorem Provi...
Sort
View
270
Voted
POPL
2008
ACM
16 years 6 months ago
Cyclic proofs of program termination in separation logic
We propose a novel approach to proving the termination of heapmanipulating programs, which combines separation logic with cyclic proof within a Hoare-style proof system. Judgement...
James Brotherston, Richard Bornat, Cristiano Calca...
PPDP
2007
Springer
15 years 12 months ago
A simple rewrite notion for call-time choice semantics
Non-confluent and non-terminating rewrite systems are interesting from the point of view of programming. In particular, existing functional logic languages use such kind of rewri...
Francisco Javier López-Fraguas, Juan Rodr&i...
139
Voted
FOAL
2009
ACM
16 years 11 days ago
A machine-checked model of safe composition
Programs of a software product line can be synthesized by composing features which implement some unit of program functionality. In most product lines, only some combination of fe...
Benjamin Delaware, William R. Cook, Don S. Batory
162
Voted
PPOPP
2003
ACM
15 years 11 months ago
Hybrid dynamic data race detection
We present a new method for dynamically detecting potential data races in multithreaded programs. Our method improves on the state of the art in accuracy, in usability, and in ove...
Robert O'Callahan, Jong-Deok Choi
160
Voted
CIKM
2007
Springer
16 years 1 days ago
Reasoning about vague topological information
Topological information plays a fundamental role in the human perception of spatial configurations and is thereby one of the most prominent geographical features in natural langu...
Steven Schockaert, Martine De Cock