528 search results - page 48 / 106 » Transition Logic Revisited |
139
click to vote
RTA
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. Declarative debugging is a semi-automatic technique that starts from an incorrect computation and locates a program fragment responsible for the error by building a tree ...
118
click to vote
IPPS
2007
IEEE
15 years 8 months ago
2007
IEEE
A compositional method for estimating software reliability of many threaded programs is developed. The method uses estimates of the reliability of individual modules and the proba...
112
click to vote
ANLP
2000
15 years 3 months ago
2000
The process of documenting designs is tedious and often error-prone. We discuss a system that automatically generates documentation for the single step transition behavior of Stat...
JELIA
1990
Springer
15 years 6 months ago
1990
Springer
In Floyd-Hoare logic, programs are dynamic while assertions are static (hold at states). In action logic the two notions become one, with programs viewed as on-the-fly assertions ...
109
click to vote
TPHOL
2007
IEEE
15 years 8 months ago
2007
IEEE
Abstract. In this proof pearl, we demonstrate the power of higherorder encodings in the logical framework Twelf[PS99] by investigating proofs about an algorithmic specification of...