1128 search results - page 47 / 226 » Little Engines of Proof |
FSTTCS
2006
Springer
15 years 1 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...
ICFEM
2000
Springer
15 years 1 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...
100
click to vote
AMAST
2008
Springer
14 years 11 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...
ICSE
2009
IEEE-ACM
14 years 7 months ago
2009
IEEE-ACM
Most system level software is written in C and executed concurrently. Because such software is often critical for system reliability, it is an ideal target for formal verification...
101
click to vote
IUI
2010
ACM
15 years 4 months ago
2010
ACM
Computer-based geometry systems have been widely used for teaching and learning, but largely based on mouse-andkeyboard interaction, these systems usually require users to draw fi...