1226 search results - page 35 / 246 » Proofs, Programs and Abstract Complexity |
133
click to vote
ENTCS
2006
15 years 2 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...
SIGSOFT
1996
ACM
15 years 6 months ago
1996
ACM
Abstractions in Large Systems William G. Griswold, Member, IEEE, Morison I. Chen, Robert W. Bowdidge, Jenny L. Cabaniss, Van B. Nguyen, and J. David Morgenthaler Restructuring soft...
116
click to vote
MICS
2010
15 years 12 days ago
2010
Abstract. There is something of a discontinuity at the heart of popular tactical theorem provers. Low-level, fully-checked mechanical proofs are large trees consisting of primitive...
110
click to vote
LOPSTR
2004
Springer
15 years 7 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...
148
click to vote
ECCC
2011
14 years 9 months ago
2011
We develop a new technique for proving lower bounds in property testing, by showing a strong connection between testing and communication complexity. We give a simple scheme for r...