Raja Natarajan

Suneel Sarswat

Proceedings of the 12th International Conference on Interactive Theorem Proving, 2021

2020

A constructive formalization of the weak perfect graph theorem.

[BibT_eX]

[DOI]

Proceedings of the 9th ACM SIGPLAN International Conference on Certified Programs and Proofs, 2020

2019

Towards a Constructive Formalization of Perfect Graph Theorems.

[BibT_eX]

[DOI]

Proceedings of the Logic and Its Applications - 8th Indian Conference, 2019

2017

An Outline of Separation Logic.

[BibT_eX]

[DOI]

CoRR, 2017

2009

Social processes, program verification and all that.

[BibT_eX]

[DOI]

Andrea Asperti

Herman Geuvers

Math. Struct. Comput. Sci., 2009

2008

On Attending Conferences.

[BibT_eX]

[DOI]

Computer, 2008

2006

A closer look at constraints as processes.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2006

Actors as a Coordinating Model of Computation.

[BibT_eX]

[DOI]

Informatica (Slovenia), 2006

2005

A Negation-free Proof of Cantor's Theorem.

[BibT_eX]

[DOI]

Notre Dame J. Formal Log., 2005

2004

Type Systems for Concurrent Programming Calculi.

[BibT_eX]

Informatica (Slovenia), 2004

1998

Mobile Computation: Calculus and Languages (A Tutorial).

[BibT_eX]

[DOI]

Proceedings of the Advances in Computing Science, 1998

1997

Combinatory Formaulations of Concurrent Languages.

[BibT_eX]

[DOI]

ACM Trans. Program. Lang. Syst., 1997

1996

Actors as a Coordinating Model of Computation (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Perspectives of System Informatics, 1996

1995

The Quine-Bernays Combinatory Calculus.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 1995

Combinatory Formulations of Concurrent Languages.

[BibT_eX]

[DOI]