[Logica-l] PhD scholarships at ANU

2019-04-02 Por tôpico Elaine Pimentel
Repassando


The Logic and Computation Group at the Research School of Computer
Science, The Australian National University in Canberra has a number
of PhD scholarship available for bright, enthusiastic doctoral
students in the following areas:

 - Logic in Computer Science (Ranald Clouston, Rajeev Gore, Dirk
Pattinson, Alwen Tiu)
- Non-Classical Logics (Ranald Clouston, Rajeev Gore, Dirk Pattinson,
John Slaney)
- Proof Theory (Rajeev Gore, Dirk Pattinson, Alwen Tiu)
- Automated Reasoning (Rajeev Gore)
- Probabilistic temporal logic and applications (Peter Baumgartner)
- Computer Aided Verification (Sergiy Bogomolov, Michael Norrish, Dirk
Pattinson)
- Interactive Theorem Proving (Michael Norrish, Dirk Pattinson)
- Computer Security Foundations (Alwen Tiu)
- Concurrency Theory (Alwen Tiu)
- Electronic Voting and Social Choice Theory (Rajeev Gore, Dirk Pattinson)
- Semantics Of Programming Languages (Ranald Clouston, Michael
Norrish, Dirk Pattinson)
- Type Theory (Ranald Clouston)

 Potential applicants are encouraged to consult the group’s web pages
at https://cecs.anu.edu.au/research/theory/logic/
and make direct contact with potential supervisors.

Students will be based at the Research School of Computer Science
within the Australian National University, Canberra. The studentship
is a tax-free allowance of A$ 27,082 (2018 rate) per year, tenable for
a maximum of 3.5 years.

Applications should be submitted electronically at
http://applyonline.anu.edu.au/
before the closing date, April 30, 2019. Further information about
graduate research within Computer Science at ANU, please see

https://cs.anu.edu.au/study/graduate-research .

The scholarships are open to individuals of any nationality. We are
based in Canberra, Australia, the top-ranking region of the 2014 OECD
quality of life survey
(http://www.canberra.com.au/canberra-the-worlds-most-liveable-city/).

 The ANU actively seeks to promote diversity in the workplace.
-- 
Elaine.
-
Elaine Pimentel  - DMAT/UFRN

Address: Departamento de Matemática
Universidade Federal do Rio Grande do Norte
Campus Universitário - Av. Senador Salgado Filho, s/nº
Lagoa Nova, CEP: 59.078-970 - Natal - RN

Phone: +55 84 3215-3820

http://sites.google.com/site/elainepimentel/
Lattes: http://lattes.cnpq.br/3298246411086415


-- 
Você está recebendo esta mensagem porque se inscreveu no grupo "LOGICA-L" dos 
Grupos do Google.
Para cancelar inscrição nesse grupo e parar de receber e-mails dele, envie um 
e-mail para logica-l+unsubscr...@dimap.ufrn.br.
Para postar neste grupo, envie um e-mail para logica-l@dimap.ufrn.br.
Visite este grupo em https://groups.google.com/a/dimap.ufrn.br/group/logica-l/.
Para ver esta discussão na web, acesse 
https://groups.google.com/a/dimap.ufrn.br/d/msgid/logica-l/CAHQVs%2BXRharPcyskoJ0jbNKzb4Ze4zObtgM-LbAs-RUz5gbCbQ%40mail.gmail.com.


[Logica-l] book on Proof Complexity

2019-04-02 Por tôpico Joao Marcos
Proof Complexity, by Jan Krajicek
“Let no one ignorant of logic enter.”
https://www.karlin.mff.cuni.cz/~krajicek/prf2.pdf

Acabou de ser publicado pela Cambridge University Press.

JM

-- 
Você está recebendo esta mensagem porque se inscreveu no grupo "LOGICA-L" dos 
Grupos do Google.
Para cancelar inscrição nesse grupo e parar de receber e-mails dele, envie um 
e-mail para logica-l+unsubscr...@dimap.ufrn.br.
Para postar neste grupo, envie um e-mail para logica-l@dimap.ufrn.br.
Visite este grupo em https://groups.google.com/a/dimap.ufrn.br/group/logica-l/.
Para ver esta discussão na web, acesse 
https://groups.google.com/a/dimap.ufrn.br/d/msgid/logica-l/CAO6j_LjxRon_yytw2NrqDbTTTguhukYTe2og5vavRV3jYav1cQ%40mail.gmail.com.


[Logica-l] Final CFP WPTE 2019

2019-04-02 Por tôpico Vivek Nigam
(Apologies for multiple copies)



  Sixth International Workshop on
Rewriting Techniques for Program Transformations and Evaluation

WPTE 2019

affiliated with FSCD 2019

  24 June, 2019, Dortmund, Germany

http://nigam.info/conferences/wpte2019/main.html


Important Dates
===

 * Submission of extended abstracts: April 15, 2019
 * Notification of acceptance: May 20, 2019
 * Final version for proceedings deadline: May 27, 2019
 * Workshop: June 24, 2019
 * Submission deadline for post proceedings:
September, 2019 (exact date to be announced)

Aims and Scope
==
The aim of WPTE is to bring together the researchers working on
program transformations,
evaluation, and operationally-based programming language semantics,
using rewriting
methods, in order to share the techniques and recent developments and
to exchange ideas
to encourage further activation of research in this area.

Topics of interest in the scope of this workshop include:

* Correctness of program transformations, optimizations and translations.
* Program transformations for proving termination, confluence and
other properties.
* Correctness of evaluation strategies.
* Operational semantics of programs, operationally-based program
equivalences such as
  contextual equivalences and bisimulations.
* Cost-models for reasoning about the optimizing power of
transformations and the costs
  of evaluation.
* Program transformations for verification and theorem proving purposes.
* Translation, simulation, equivalence of programs with different
formalisms, and
  evaluation strategies.
* Program transformations for applying rewriting techniques to
programs in specific
  programming languages.
* Program transformations for program inversions and program synthesis.
* Program transformation and evaluation for Haskell and Rewriting.

The programming languages of interest include pure, deterministic, impure,
nondeterministic, concurrent, parallel languages, and may employ
programming paradigms
such as functional, logical, typed, imperative, object-oriented, and
higher-order.

Invited Speakers
===
  * Maribel Fernandez, King's College London
  * René Thiemann, University of Innsbruck
  * Masahiko Sakai, Nagoya University


Paper Submissions
=
For the paper submission deadline an extended abstract of at most 10
pages is required
to be submitted.
The extended abstract may present original work or also work in progress.
However, for the formal post-proceedings (see below) full papers must
be submitted to
the post-proceedings deadline.
Based on the submissions the program committee will select the
presentations for the
workshop. All selected contributions will be included in the informal
proceedings
distributed to the workshop participants. One author of each accepted
extended abstract
is expected to present it at the workshop. Submissions must be
prepared in LaTeX using
the EPTCS macro package (http://style.eptcs.org/).

Formal Post-Proceedings
===
The WPTE post-proceedings will be published in
Electronic Proceedings in Theoretical Computer Science (http://eptcs.org/).
The authors of all presented contributions will have the opportunity
(but no obligation)
to submit a full paper for the formal post-proceedings.
These full-papers must represent original work and should not be
submitted to another
conference at the same time. Full-papers should not exceed 15 pages.
The submission
deadline for these post-proceedings will be after the workshop in
September 2019.
There will be a second round of reviewing for selecting papers to be published
in the formal proceedings.


Weblinks

* EasyChair Submission Website
 https://easychair.org/conferences/?conf=wpte2019

* Homepage of WPTE 2019
 http://nigam.info/conferences/wpte2019/main.html

* FSCD 2019
 http://easyconferences.eu/fscd2019/

Program Committee
=
Vivek Nigam (Chair), fortiss GmbH / Federal University of Paraíba
Joachim Niehren (co-Chair), Inria, Lille
Tajana Ban Kirigin, University of Rijeka
Stefan Ciobaca, Alexandru Ioan Cuza University, Iasi
Santiago Escobar, Universitat Politècnica de València
Jan Hoffmann, Carnegie Mellon University
Noaki Nishida, Nagoya University
Camilo Rocha, Pontificia Universidad Javeriana Cali
David Sabel, LMU Munich
Ulrich Schöpp, LMU Munich


-
Vivek Nigam
http://www.nigam.info/

-
Vivek Nigam
http://www.nigam.info/


-- 
Você está recebendo esta mensagem porque se inscreveu no grupo "LO