2012 Spring

Welcome to the homepage of CSE645 (Spring 2012) Seminar in Languages!

General Information

Course description: We will read papers and discuss research ranging from high-level specifications (such as logic, rules, and sets) to algorithms and methods for efficient implementations, with applications in semantic web, program analysis, security, and services.

Instructors: Michael Kifer, David Warren, Paul Fodor (contact: paul.fodor@stonybrook.edu), and Annie Liu

Hours: Thursday 2:20-3:40PM, in CS 1310 Executive Conference Room.

Topics

We will select papers from the following list (don't have to cover all) and possibly other interesting ones as they come up.

Defeasible Logic

1. Well-founded semantics for defeasible logic.

Frederick Maier and Donald Nute. 2011.

http://www.springerlink.com/content/q27776400vk78375

Abduction

1. a. Interpretation as abduction.

Jerry R. Hobbs, Mark Stickel, Paul Martin, and Douglas Edwards. 1988.

http://www.aclweb.org/anthology/P/P88/P88-1012.pdf (short version)

b. Jerry R. Hobbs, Mark Stickel, Douglas Appelt, and Paul Martin.

Artificial Intelligence, v63, 1993.

http://www.isi.edu/~hobbs/interp-abduct-ai.pdf (long version)

2. Abduction in well-founded semantics and generalized stable models via tabled dual programs.

Alferes, Pereira, Swift. 2004.

http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.134.3580

Secure information flow

1. Language-based information-flow security.

Sabelfeld, A and Myers, A C

IEEE Journal on Selected Areas in Communications, v2, n1, 2003.

http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=1159651

2. Abstract non-interference: parameterizing non-interference by abstract interpretation

Giacobazzi, Roberto and Mastroeni, Isabella. POPL 2004.

http://doi.acm.org/10.1145/964001.964017

Type Inference

1. Type inference with polymorphic recursion.

Henglein, F. TOPLAS, v 15, n 2, p 253-289, 1993.

http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.42.3091&rep=rep1&type=pdf

2. The ins and outs of gradual type inference.

Aseem Rastogi, Avik Chaudhuri, and Basil Hosmer. POPL 2012.

http://www.cs.umd.edu/~avik/projects/iogti/paper.pdf

Cut

1. RedAlert: Determinacy inference for Prolog.

Jael Krienera1 and Andy King, ICLP 2012.

http://journals.cambridge.org/action/displayAbstract?fromPage=online&aid=8320667

Abstract Interpretation

1. An abstract interpreter expressed using logic rules. David Warren.

Termination analysis

1. Terminyzer. Senlin Liang and Michael Kifer.

Inductive Dfinitions

1. The FO(.) Knowledge Base System project: an integrationproject.

Marc Denecker (guest lecture)

Co-induction

1. Logic, Co-induction and Infinite Computations.

Gopal Gupta (guest lecture)

papers:

Coinductive Logic Programming and Its Applications

Negation in Coninductive Logic Programming

Schedule

2/2 Organizational meeting

2/9 Senlin

Terminyzer

2/16 Aseem

The ins and outs of gradual type inference

2/23 rescheduled for candidate talk by Elaine Shi, in rm 2311

Cloud Data Protection for the Masses

3/1 David

An abstract interpreter expressed using logic rules

3/8 Paul

RedAlert

3/15 Bo

Language-based information-flow security

3/22 Aseem

Type inference with polymorphic recursion

3/23 Gopal Gupta, guest lecture, Friday 11am in 2311A

Logic, Co-induction and Infinite Computations

3/26 Marc Denecker, guest lecture, Monday

The FO(.) Knowledge Base System project: an integration project

4/5 Spring break

4/12 Vikas

Interpretation as abduction

4/19 Ken

Abduction in well-founded semantics and generalized stable models via tabled dual programs

4/26 Jon

Abstract non-interference: parameterizing non-interference by abstract interpretation

5/3 Michael

Well-founded semantics for defeasible logic

5/? Spyros

his ISMVL12 paper on probabilistic LP

? Spyros

DynPal