429 search results - page 64 / 86 » Theorem Proving Languages for Verification |
POPL
2006
ACM
14 years 9 months ago
2006
ACM
Functional programmers often reason about programs as if they were written in a total language, expecting the results to carry over to non-total (partial) languages. We justify su...
POPL
2008
ACM
14 years 9 months ago
2008
ACM
Software transactions have received significant attention as a way to simplify shared-memory concurrent programming, but insufficient focus has been given to the precise meaning o...
LICS
1991
IEEE
14 years 7 days ago
1991
IEEE
When logic programming is based on the proof theory of intuitionistic logic, it is natural to allow implications in goals and in the bodies of clauses. Attempting to prove a goal ...
POPL
2001
ACM
14 years 9 months ago
2001
ACM
This paper addresses the design and verification of infrastructure for mobile computation. In particular, we study language primitives for communication between mobile agents. The...
ICFP
2003
ACM
14 years 8 months ago
2003
ACM
The shift and reset operators, proposed by Danvy and Filinski, are powerful control primitives for capturing delimited continuations. Delimited continuation is a similar concept a...