77 search results - page 13 / 16 » Building BSP Programs Using the Refinement Calculus |
CSL
2005
Springer
14 years 1 months ago
2005
Springer
In previous work we presented a foundational calculus for spatially distributed computing based on intuitionistic modal logic. With the modalities P and Q we were able to capture t...
AMAST
2008
Springer
13 years 10 months ago
2008
Springer
The Hoare approach to program verification relies on the construction and discharge of verification conditions (VCs) but offers no support to trace, analyze, and understand the VCs...
ICFP
2010
ACM
13 years 9 months ago
2010
ACM
We show how the binary encoding and decoding of typed data and typed programs can be understood, programmed, and verified with the help of question-answer games. The encoding of a...
TCAD
2010
13 years 2 months ago
2010
The growing complexity of systems and their implementation into silicon encourages designers to look for model designs at higher levels of abstraction and then incrementally build ...
PLDI
2010
ACM
14 years 5 months ago
2010
ACM
A number of programming languages use rich type systems to verify security properties of code. Some of these languages are meant for source programming, but programs written in th...