407 search results - page 49 / 82 » Automatic Correctness Proofs for Logic Program Transformatio... |
ANLP
2000
13 years 9 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...
FM
2009
Springer
14 years 2 months ago
2009
Springer
Verification methods for memory-manipulating C programs need to address not only well-typed programs that respect invariants such as the split heap memory model, but also programs...
AGTIVE
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. In runtime monitoring, a programmer specifies code to execute whenever a sequence of events occurs during program execution. Previous and related work has shown that runt...
SAS
2001
Springer
14 years 3 days ago
2001
Springer
Abstract. Logic languages based on the theory of rational, possibly infinite, trees have much appeal in that rational trees allow for faster unification (due to the omission of t...
LICS
2007
IEEE
14 years 2 months ago
2007
IEEE
tion and Abstract Separation Logic Cristiano Calcagno Imperial College, London Peter W. O’Hearn Queen Mary, University of London Hongseok Yang Queen Mary, University of London S...