154 search results - page 14 / 31 » Using Proofs by Coinduction to Find |
ICFP
2003
ACM
14 years 7 months ago
2003
ACM
Under the widely believed conjecture P=NP, NP-complete problems cannot be solved exactly using efficient polynomial time algorithms. Furthermore, any instance of a NP-complete pro...
SIROCCO
2010
13 years 9 months ago
2010
Abstract. We study strategies that minimize the instability of a faulttolerant consensus system. More precisely, we find the strategy than minimizes the number of output changes ov...
COMGEO
2010
ACM
13 years 8 months ago
2010
ACM
Using a technique that Tverberg and Vrecica [TV93] discovered to give a surprisingly simple proof of Tverberg's theorem, we show the following extension of the centerpoint th...
ICSE
2009
IEEE-ACM
13 years 5 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...
JANCL
2006
13 years 7 months ago
2006
We describe KAT-ML, an implementation of an interactive theorem prover for Kleene algebra with tests (KAT). The system is designed to reflect the natural style of reasoning with K...