Sciweavers

6740 search results - page 722 / 1348
» Using Classification as a Programming Language
Sort
View
APLAS
2005
ACM
16 years 19 days ago
Symbolic Execution with Separation Logic
We describe a sound method for automatically proving Hoare triples for loop-free code in Separation Logic, for certain preconditions and postconditions (symbolic heaps). The method...
Josh Berdine, Cristiano Calcagno, Peter W. O'Hearn
ISCOPE
1997
Springer
15 years 11 months ago
The Design and Evolution of the MPI-2 C++ Interface
The original specification for the Message Passing Interface (MPI) included language bindings for C and Fortran 77. C++ programs that used MPI were thus required to use the C bin...
Jeffrey M. Squyres, William Saphir, Andrew Lumsdai...
CAV
2004
Springer
77views Hardware» more  CAV 2004»
16 years 14 days ago
Understanding Counterexamples with explain
The counterexamples produced by model checkers are often lengthy and difficult to understand. In practical verification, showing the existence of a (potential) bug is not enough: ...
Alex Groce, Daniel Kroening, Flavio Lerda
ENTCS
2007
96views more  ENTCS 2007»
15 years 7 months ago
Synchrony vs Asynchrony in Communication Primitives
We study, from the expressiveness point of view, the impact of synchrony in the communication primitives that arise when combining together some common and useful programming feat...
Daniele Gorla
LISP
1998
57views more  LISP 1998»
15 years 6 months ago
A Generalization of Jumps and Labels
This paper describes a new language feature that is a hybrid of labels and procedures. It is closely related to jumping out of a functional subroutine, and includes conventional la...
Peter J. Landin