Tests and Proofs 2009 | 2 Feb 2009 14:10
Picon

Tests and Proofs 2009 - Call for Papers

(Apologies for multiple copies)

Call for Papers
===============

TAP: Tests And Proofs

The Third International Conference on Tests And Proofs (TAP) will be 
held at ETH Zurich, Switzerland on 2 and 3 July 2009 as part of the 
TOOLS EUROPE week.

The TAP conference is devoted to the convergence of proofs and tests. It 
combines ideas from both sides for the advancement of software quality.

Purpose and Scope
-----------------
To prove the correctness of a program is to demonstrate, through 
impeccable mathematical techniques, that it has no bugs; to test a 
program is to run it with the expectation of discovering bugs. The two 
techniques seem contradictory: if you have proved your program, it's 
fruitless to comb it for bugs; and if you are testing it, that is surely 
a sign that you have given up on any hope to prove its correctness.

Accordingly, proofs and tests have, since the onset of software 
engineering research, been pursued by distinct communities using rather 
different techniques and tools.

And yet the development of both approaches leads to the discovery of 
common issues and to the realization that each may need the other. The 
emergence of model checking has been one of the first signs that 
(Continue reading)

Joerg Siekmann | 2 Feb 2009 10:25
Picon
Favicon

Job-Openings in e-learning

Please find enclosed job descriptions for research assistants 
(post doc and/or PhDs) in the area of ITS (Intelligent Tutor 
Systems).
Jörg Siekmann

-- 
Prof. Dr. Joerg Siekmann
Saarland University                          Tel: 
+49-681-302-5275
German Research Centre for                   Fax: 
+49-681-302-2235
Artificial Intelligence (DFKI)             Email: 
joerg.siekmann <at> dfki.de
Campus D3 2, Stuhlsatzenhausweg 3            WWW: 
www-ags.dfki.uni-sb.de/
66123 Saarbruecken, Germany
-------------------------------------------------------------
Deutsches Forschungszentrum fuer Kuenstliche Intelligenz GmbH
Firmensitz: Trippstadter Strasse 122, D-67663 Kaiserslautern

Geschaeftsfuehrung:
Prof. Dr. Dr. h.c. mult. Wolfgang Wahlster (CEO)
Dr. Walter Olthoff

Vorsitzender des Aufsichtsrats:
Prof. Dr. h.c. Hans A. Aukes

Amtsgericht Kaiserslautern, HRB 2313
-------------------------------------------------------------
(Continue reading)

Christian Urban | 2 Feb 2009 19:15
Picon
Favicon

TPHOLs'09 Last Call for Papers


    LAST CALL FOR PAPERS: TPHOLs 2009

The 22th International Conference on
Theorem Proving in Higher Order Logics

17 - 20 August 2009 in Munich, Germany

  ******************************
  *  http://tphols.in.tum.de/  *
  ******************************

TPHOLs is a series of international conferences that started in 1988.
It brings together researchers working in all areas of interactive
theorem proving.  The conference will be held on 17 - 20 August
2009 in Munich. As in previous years, the formal proceedings of
TPHOLs will appear as a volume of LNCS.

Important Dates
---------------
Submission:              8 March 2009
Author notification:     4 May 2009
Camera-ready papers due: 5 June 2009

Website for submissions
http://www.easychair.org/conferences/?conf=tphols2009

Submission for the emerging
trends section:          11 May 2009

(Continue reading)

Tom Ridge | 3 Feb 2009 14:59
Picon
Picon
Favicon

CALCULEMUS 2009 - Final Call for Full Papers

----------------------------------------------
 CALCULEMUS 2009 - Final Call for Full Papers
----------------------------------------------
16th Symposium on the Integration of
Symbolic Computation and Mechanised Reasoning

6-7 July 2009, Joint with CICM'09, Ontario, Canada.

http://www.calculemus.net/meetings/ontario09/

Calculemus is a series of conferences dedicated to the integration of
computer algebra systems (CAS) and systems for mechanised reasoning, the
interactive theorem provers or proof assistants (PA) and the automated
theorem provers (ATP).

Currently, symbolic computation is divided into several (more or less)
independent branches: traditional ones (e.g., computer algebra and
mechanised reasoning) as well as newly emerging ones (on user
interfaces, knowledge management, theory exploration, etc.) The main
concern of the Calculemus community is to bring these developments
together in order to facilitate the theory, design, and implementation
of integrated systems for computer mathematics that will routinely be
used by mathematicians, computer scientists and engineers in their every
day business.

We seek original research papers for the upcoming Calculemus meeting,
which will be held jointly with MKM 2009 (confederated in the
Conferences on Intelligent Computer Mathematics, CICM 2009) in Ontario,
Canada.

(Continue reading)

Jeremy Bem | 3 Feb 2009 22:29
Picon

goals in HOL Light

Hi,

I'm trying to understand HOL Light.  The forward reasoning subsystem seems quite simple and lovely, but I'm confused by the backward reasoning.  In particular, the source file tactics.ml opens with the key definition:

type goal = (string * thm) list * term

How does it make sense that the hypotheses are *theorems*?  I would have expected them to be terms, since generally speaking a hypothesis is not something that has already been proved.

When I saw that there is a function "set_goal" that does take a list of terms (by simply mapping each term t to the theorem t |- t), and also that the function "print_goal" only prints the *conclusion* of each hypothesis, my guess was that the hypotheses are simply encoded as theorems of the form t |- t for some unknown technical reason.  However, a quick hack revealed that at least internally, HOL Light uses hypotheses that are not of this form.

Thanks for your help,
Jeremy

------------------------------------------------------------------------------
Create and Deploy Rich Internet Apps outside the browser with Adobe(R)AIR(TM)
software. With Adobe AIR, Ajax developers can use existing skills and code to
build responsive, highly engaging applications that combine the power of local
resources and data with the reach of the web. Download the Adobe AIR SDK and
Ajax docs to start building applications today-http://p.sf.net/sfu/adobe-com
_______________________________________________
hol-info mailing list
hol-info <at> lists.sourceforge.net
https://lists.sourceforge.net/lists/listinfo/hol-info
Richard Waldinger | 3 Feb 2009 20:33

[isabelle] TPHOLs'09 Last Call for Papers


    LAST CALL FOR PAPERS: TPHOLs 2009

The 22th International Conference on
Theorem Proving in Higher Order Logics

17 - 20 August 2009 in Munich, Germany

  ******************************
  *  http://tphols.in.tum.de/  *
  ******************************

TPHOLs is a series of international conferences that started in 1988.
It brings together researchers working in all areas of interactive
theorem proving.  The conference will be held on 17 - 20 August
2009 in Munich. As in previous years, the formal proceedings of
TPHOLs will appear as a volume of LNCS.

Important Dates
---------------
Submission:              8 March 2009
Author notification:     4 May 2009
Camera-ready papers due: 5 June 2009

Website for submissions
http://www.easychair.org/conferences/?conf=tphols2009

Submission for the emerging
trends section:          11 May 2009

Conference:              17 - 20 August 2009

Topics
------

The program committee welcomes submissions on all aspects of theorem
proving in higher order logics, on related topics in theorem proving
and verification, and on relevant applications. The topics include, but
are not limited to, the following:

  Specification and verification of hardware: microprocessors, memory
  systems, buses, pipelines, etc; formal semantics of hardware design
  languages; synthesis; formal design flows.

  Specification and verification of software: program verification,
  refinement, and synthesis for functional, declarative and imperative
  languages; formal semantics of programming languages; compiler and
  operating system verification; proof carrying code.

  Industrial application of theorem provers.

  Formalization of mathematical theories.

  Advances in theorem prover technology: proof automation and decision
  procedures, induction, combination of deductive and algorithmic
  approaches, incorporation of theorem provers into larger systems,
  combination of theorem provers with other provers and tools.

  Other topics, including: user interfaces for theorem provers;  
development
  and extension of higher order logics.

  Proof Pearls: concise and elegant presentations of interesting  
examples.

Relevant research involving interactive first-order systems, such as  
ACL2
and Mizar, is also welcome. All authors are reminded that their work
should  be presented in a way that users of other systems can  
understand.

Papers should be no more than 16 pages in length and are to be submitted
in PDF format. Submissions must describe original unpublished work not
submitted for publication elsewhere. They must conform to the LNCS style
preferably using LaTeX2e. The proceedings are to be published as a  
volume
in the Lecture Notes in Computer Science series and will be available to
participants at the conference.

Authors of accepted papers are expected to present their paper at the
conference.

As has been custom in previous years there will be an emerging trends
section. Submissions under this section will not be formally  
refereed, but
their content and relevance will be reviewed. Those submissions accepted
will be published in a technical report of the TU München, which will  
also
be available at the conference. Authors of accepted papers in this  
section
are expected to present a brief outline of their work at the conference
and to prepare a poster for display at the conference venue.

Invited Speakers
----------------
David Basin      ETH Zurich
John Harrison    Intel
Wolfram Schulte  Microsoft Research

Programme Committee
-------------------
Thorsten Altenkirch        Nottingham University
David Aspinall             Edinburgh University
Jeremy Avigad              Carnegie Mellon University
Gilles Barthe              IMDEA
Christoph Benzmüller       Saarland University
Peter Dybjer               Chalmers University
Jean-Christophe Filliâtre  CNRS
Georges Gonthier           Microsoft Research
Mike Gordon                Cambridge University
Jim Grundy                 Intel
Reiner Hähnle              Chalmers University
Joe Hurd                   Galois
Gerwin Klein               NICTA
Xavier Leroy               INRIA
Pete Manolios              Northeastern University
César Muñoz                National Institute of Aerospace
Tobias Nipkow (co-chair)   TU München
Michael Norrish            NICTA
Sam Owre                   SRI International
Larry Paulson              Cambridge University
Frank Pfenning             Carnegie Mellon University
Randy Pollack              Edinburgh University
Sofiène Tahar              Concordia University
Laurent Théry              INRIA
Christian Urban (co-chair) TU München
Freek Wiedijk              Radboud University Nijmegen

Affiliated Events
-----------------

- Workshop on Programming Languages for Mechanized Mathematics
   Systems (PLMMS)

- Coq Users Meeting

- Isabelle Developers Workshop

Organizers
----------

Stefan Berghofer
Tobias Nipkow
Christian Urban
Makarius Wenzel

Jeremy Bem | 6 Feb 2009 04:35
Picon

Re: goals in HOL Light

To make my question more concrete, here's an example.

In arith.ml there is a theorem "LT_LE" which states:
     !m n. (m < n) <=> (m <= n) /\ ~(m = n)
Replaying the proof until just before "POP_ASSUM MP_TAC", I get to this state:
     # p();;
     val it : goalstack = 1 subgoal (2 total)
       0 [`n < n`]
     `F`
This looks straightforward, but the goal printer is hiding information:
     # snd (List.hd (fst (top_realgoal ())));;
     val it : thm = m < n, m = n |- n < n
What do these extra terms mean?

Thanks again,
Jeremy

------------------------------------------------------------------------------
Create and Deploy Rich Internet Apps outside the browser with Adobe(R)AIR(TM)
software. With Adobe AIR, Ajax developers can use existing skills and code to
build responsive, highly engaging applications that combine the power of local
resources and data with the reach of the web. Download the Adobe AIR SDK and
Ajax docs to start building applications today-http://p.sf.net/sfu/adobe-com
_______________________________________________
hol-info mailing list
hol-info <at> lists.sourceforge.net
https://lists.sourceforge.net/lists/listinfo/hol-info
John Harrison | 6 Feb 2009 16:39
Picon
Picon
Favicon

Re: goals in HOL Light


Hi Jeremy,

| What do these extra terms mean?

The HOL Light system of goals is a bit different from the traditional
LCF one. The tradition is that a goal is a pair consisting of a list of
terms (the assumptions) and another term (the desired conclusion). In
HOL Light there are two differences: assumptions are actually theorems
not terms, and assumptions are associated with a label, so that you
can use assumptions by name (LABEL_TAC "*", USE_THEN "*" etc.). 

The extra terms you spotted arise because the "assumption" theorems,
as theorems, may themselves have assumptions (somewhat confusingly).
In practice the assumptions start life as simply "p |- p", when the
assumptions end up on the assumption list as a result of ASSUME_TAC
or similar tactics. But as a result of further forward inference on
assumptions, their conclusions may change while retaining their
original hypotheses. 

The original reason for this somewhat confusing arrangement was to
make forward inference on assumptions really correspond to forward
inference in the eventual proof prroduced by the kernel. By contrast,
in the traditional style, this involves forward inference on a
temporary theorem p |- p followed by discharging the assumption
p by context. I don't believe this is really very important, but
I've stuck with this arrangment ever since. For the most part it
is invisible to the user in day-to-day tactic proofs.

John.

------------------------------------------------------------------------------
Create and Deploy Rich Internet Apps outside the browser with Adobe(R)AIR(TM)
software. With Adobe AIR, Ajax developers can use existing skills and code to
build responsive, highly engaging applications that combine the power of local
resources and data with the reach of the web. Download the Adobe AIR SDK and
Ajax docs to start building applications today-http://p.sf.net/sfu/adobe-com
Lu Zhao | 6 Feb 2009 23:41
Picon
Favicon

Tex Package for \HOLTokenEquiv

Hi,

I'm using EmitTeX to convert a HOL theorem into a TeX string, the
function print_theorem_as_tex generates a token: \HOLTokenEquiv. Which
package should I add in order for Tex to recognize this command except
holtexbasic and holtex? Where to get it?

Thanks.
Lu

------------------------------------------------------------------------------
Create and Deploy Rich Internet Apps outside the browser with Adobe(R)AIR(TM)
software. With Adobe AIR, Ajax developers can use existing skills and code to
build responsive, highly engaging applications that combine the power of local
resources and data with the reach of the web. Download the Adobe AIR SDK and
Ajax docs to start building applications today-http://p.sf.net/sfu/adobe-com
Florian Rabe | 7 Feb 2009 00:32
Picon
Favicon

First call for papers: Module and Libraries for Proof Assistants

		   First International Workshop on
	  Modules and Libraries for Proof Assistants
			      (MLPA'09)
	    http://www.itu.dk/~carsten/mlpa-09.html

		       Affiliated with CADE-22
		 Montreal, Canada, August 2-7, 2009

			   CALL FOR PAPERS

-----------------------------------------------------------------------

Important Dates:

Abstract Submission     27 April  2009
Submission deadline:     4 May    2009
Author Notification:     8 June   2009
Final Version:           6 July   2009
Workshop day             3 August 2009

-----------------------------------------------------------------------

MLPA'09 is the first international workshop on modules and libraries
for proof assistants.

Over the last twenty years, users of proof assistants and automated
theorem provers have created large libraries of formal proofs and
mathematical knowledge.  Module systems help with the tedious tasks of
organizing, sharing, and maintaining libraries.  In the view of the
ever increasing complexity of this network of information, module
systems offer many of the answers to the practical problems that proof
assistant system developers face today and can therefore be seen as an
emerging research for the automated deduction community.

The proposed workshop aims to attract and bring together researchers
and practitioners with background and experience in module systems from
different logic based systems, such as theorem provers, proof
assistants, and programming languages.  Because it is affiliated with
CADE, the workshop will provide the fertile venue for the exchange of
ideas and experiences and has the potential to impact the way we organize
proofs and programs in the future.

The broad aim of the proposed workshop is to run a short, but highly
focused meeting, which will provide researchers with a forum to review
state-of-the-art results and techniques, from theory to practice of
module systems and to present recent and new progress in:

* The design of module systems for programming languages and proof
  systems.

* The implementation of formal digital libraries.

* System descriptions of existing module systems, for example ML
  modules, type classes, Coq's, or Agda's module system.

* Case studies regarding information retrieval, sharing, and
  management of change.

* Experience reports of industrial practitioners, using HOL,
  Isabell/HOL, PVS, or other proof assistants.

Program Committee:

    * Stefan Berghofer, Technische Universität München, Germany
    * Derek Dreyer, MPI-SWS, Saarbruecken, Germany
    * Hugo Herbelin, INRIA, France
    * Conor McBride, University of Nottingham, Great Britain
    * Till Mossakowski, German Research Center for Artificial Intelligence
    * Ulf Norell, Chalmers University, Sweden
    * Randy Pollack, University of Edinburgh, Great Britain
    * Florian Rabe, Jacobs University, Bremen, Germany
    * Carsten Schuermann, IT University of Copenhagen, Denmark

Paper Submissions:

http://www.easychair.org/conferences/?conf=mlpa09

Three categories of papers are solicited:

* Category A: Detailed and technical accounts of new research: up to
  fifteen pages including bibliography.

* Category B: Shorter accounts of work in progress and proposed
  further directions, including discussion papers: up to eight pages
  including bibliography and appendices.

* Category C: System descriptions presenting an implemented tool and
  its novel features: up to six pages. A demonstration is expected to
  accompany the presentation.

Submission is electronic in postscript or PDF format. Submitted papers
must conform to the ENTCS style preferrably using LaTeX2e. For further
information and submission instructions, see the MLPA web page:
http://www.itu.dk/~carsten/mlpa-09.html

Proceedings are to be published as a volume in the Electronic Notes in
Theoretical Computer Science (ENTCS) series and will be available to
participants at the workshop.

Authors of accepted papers are expected to present their paper at
the workshop.

Organizers:

Florian Rabe                        Carsten Schuermann
f.rabe at jacobs-university.de      carsten at itu.dk
Jacobs University                   IT University of Copenhagen
Bremen, Germany		      	Copenhagen, Denmark

------------------------------------------------------------------------------
Create and Deploy Rich Internet Apps outside the browser with Adobe(R)AIR(TM)
software. With Adobe AIR, Ajax developers can use existing skills and code to
build responsive, highly engaging applications that combine the power of local
resources and data with the reach of the web. Download the Adobe AIR SDK and
Ajax docs to start building applications today-http://p.sf.net/sfu/adobe-com
_______________________________________________
hol-info mailing list
hol-info <at> lists.sourceforge.net
https://lists.sourceforge.net/lists/listinfo/hol-info

Gmane