197 search results - page 14 / 40 » Reduction Semantics and Formal Analysis of Orc Programs |
POPL
2012
ACM
12 years 3 months ago
2012
ACM
There has been great interest in creating probabilistic programming languages to simplify the coding of statistical tasks; however, there still does not exist a formal language th...
CC
1998
Springer
13 years 12 months ago
1998
Springer
Abstract. Flow logic offers a compact and versatile notation for expressing the acceptability of solutions to program analysis problems. In contrast to previous logical formulation...
AGP
1996
IEEE
13 years 11 months ago
1996
IEEE
Compositional semantics allow to reason about programs in an incremental way, thus providing the formal base for the development of modular data-flow analyses. The major drawback ...
FM
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. The paper presents a deductive framework for proving program equivalence and its application to automatic verification of transformations performed by optimizing compiler...
CAV
2007
Springer
14 years 1 months ago
2007
Springer
Bounded context switch reachability analysis is a useful and efficient approach for detecting bugs in multithreaded programs. In this paper, we address the application of this app...