Sciweavers

198 search results - page 5 / 40
» Modal Proofs as Distributed Programs (Extended Abstract)
Sort
View
PLDI
1998
ACM
14 years 24 days ago
Run-time Code Generation and Modal-ML
This paper presents a typed programming language and compiler for run-time code generation. The language, called ML2, extends ML with modal operators in the style of the Mini-ML2 ...
Philip Wickline, Peter Lee, Frank Pfenning
CADE
2008
Springer
14 years 8 months ago
Compositional Proofs with Symbolic Execution
Abstract. A proof method is described which combines compositional proofs of interleaved parallel programs with the intuitive and highly automatic strategy of symbolic execution. A...
Simon Bäumler, Florian Nafz, Michael Balser, ...
LPAR
2005
Springer
14 years 2 months ago
Towards Automated Proof Support for Probabilistic Distributed Systems
Abstract. The mechanisation of proofs for probabilistic systems is particularly challenging due to the verification of real-valued properties that probability entails: experience ...
Annabelle McIver, Tjark Weber
ICFP
2002
ACM
14 years 8 months ago
Meta-programming with names and necessity
Meta-programming is a discipline of writing programs in a certain programming language that generate, manipulate or execute programs written in another language. In a typed settin...
Aleksandar Nanevski
TACAS
2012
Springer
316views Algorithms» more  TACAS 2012»
12 years 4 months ago
Compositional Termination Proofs for Multi-threaded Programs
Abstract. Automated verification of multi-threaded programs is difficult. Direct treatment of all possible thread interleavings by reasoning about the program globally is a prohib...
Corneliu Popeea, Andrey Rybalchenko