Skip to Content.
Sympa Menu

coq-club - [Coq-Club] Re: Graph algorithms

coq-club AT inria.fr

Subject: The Coq mailing list

List archive

[Coq-Club] Re: Graph algorithms


chronological Thread 
  • From: Masami Hagiya <hagiya AT is.s.u-tokyo.ac.jp>
  • To: piotr AT cs.ualberta.ca
  • Cc: qed AT mcs.anl.gov, coq-club AT pauillac.inria.fr, info-hol AT phirewall.cs.byu.edu, isabelle-users AT cl.cam.ac.uk, imps AT hygelac.cas.mcmaster.ca, nuprllist AT cs.cornell.edu, pvs AT csl.sri.com, nqthm-users AT cs.utexas.edu, nuprl AT cs.cornell.edu
  • Subject: [Coq-Club] Re: Graph algorithms
  • Date: Sat, 08 May 2004 10:46:23 +0900 (JST)
  • List-archive: <http://pauillac.inria.fr/pipermail/coq-club/>

Dear Piotr,

How are you?  How about the following?

Mitsuharu Yamamoto, Koichi Takahashi, Masami Hagiya,
Shin-ya Nishizaki and Tetsuo Tamai:
Formalization of Graph Search Algorithms and Its Applications,
Theorem Proving in Higher Order Logics,
11th International Conference, TPHOLs'98,
Canberra, Australia, September/October 1998, Proceedings
(Jim Grundy, Malcolm Newey, eds.)
Lecture Notes in Computer Science, Springer-Verlag, Vol.1479, 1998,
pp.479-496.

-- Masami




Archive powered by MhonArc 2.6.16.

Top of Page