797 search results - page 56 / 160 » Eliminating Proofs from Programs |
CONCUR
1999
Springer
15 years 5 months ago
1999
Springer
Abstract. We present an in-depth discussion of the relationships between synchrony and asynchrony. Simple models of both paradigms are presented, and we state theorems which guaran...
121
Voted
FASE
2009
Springer
15 years 7 months ago
2009
Springer
Abstract. We present a new method for automatic generation of loop invariants for programs containing arrays. Unlike all previously known methods, our method allows one to generate...
LOPSTR
2004
Springer
15 years 6 months ago
2004
Springer
Abstract. Termination of binary CLP programs has recently become an important question in the termination analysis community. The reason for this is due to that a number of approac...
121
Voted
ICNC
2005
Springer
15 years 6 months ago
2005
Springer
The DARPA/MIT Lincoln Laboratory off-line intrusion detection evaluation data set is the most widely used public benchmark for testing intrusion detection systems. But the presence...
89
Voted
ICSE
2000
IEEE-ACM
15 years 4 months ago
2000
IEEE-ACM
Explicitly stated program invariants can help programmers by characterizing certain aspects of program execution and identifying program properties that must be preserved when mod...