4099 search results - page 166 / 820 » A Framework for Interactive Proof |
162
click to vote
FSTTCS
2006
Springer
15 years 9 months ago
2006
Springer
Termination is one of the most interesting problems when dealing with context-sensitive rewrite systems. Although there is a good number of techniques for proving termination of co...
152
click to vote
ICFEM
2000
Springer
15 years 9 months ago
2000
Springer
Retrenchment is presented in a simple relational framework as a more flexible development concept than refinement for capturing the early preformal stages of development, and brie...
183
click to vote
AMAST
2008
Springer
15 years 7 months ago
2008
Springer
Several proof systems allow the formal verification of Java programs, and a specification language was specifically designed for Java. However, none of these systems support generi...
169
click to vote
ENTCS
2006
15 years 5 months ago
2006
Parkinson, Bornat, and Calcagno recently introduced a logic for partial correctness in which program variables are treated as resource, generalizing earlier work based on separati...
164
click to vote
TCS
2008
15 years 5 months ago
2008
Type systems and program logics are often conceived to be at opposing ends of the spectrum of formal software analyses. In this paper we show that a flow-sensitive type system ensu...