198 search results - page 13 / 40 » Modal Proofs as Distributed Programs (Extended Abstract) |
ICLP
2005
Springer
14 years 2 months ago
2005
Springer
We present a methodology for the modeling of complex program behavior in CLP. In the first part we present an informal description about how to represent a system in CLP. At its ...
ICFP
2003
ACM
14 years 8 months ago
2003
ACM
We have verified several versions of the CPS transformation in Isabelle/HOL. In our verification we adopted first-order abstract syntax with variable names so that the formalizati...
PLSA
1994
14 years 20 days ago
1994
Computer language paradigms offer linguistic abstractions and proof theories for expressing program implementations. Similarly, system architectures offer the hardware abstractions...
IPPS
1996
IEEE
14 years 22 days ago
1996
IEEE
In many concurrent programming languages programs are difficult to extend and modify. This is because changes in a concurrent program (either through modification or extension) re...
IPPS
1998
IEEE
14 years 25 days ago
1998
IEEE
Abstract. We extend the refinement calculus to permit the derivation of programs in the Bulk Synchronous Parallelism (BSP) style. This demonstrates that formal approaches developed...