Proceedings Fifteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.99CB36332)
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By IEEE Comput. Soc

0769507255

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Some strategies for proving theorems with a model checker abstract of invited talk

Proceedings Fifteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.99CB36332) ◽

10.1109/lics.2000.855778 ◽

2005 ◽

Author(s):

K.L. McMillan

Keyword(s):

Model Checker

Download Full-text

The curry-howard correspondence in set theory

Proceedings Fifteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.99CB36332) ◽

10.1109/lics.2000.855779 ◽

2005 ◽

Author(s):

J.-L. Krivine

Keyword(s):

Set Theory

Download Full-text

From the church-turing thesis to the first-order algorithm theorem

Proceedings Fifteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.99CB36332) ◽

10.1109/lics.2000.855766 ◽

2005 ◽

Author(s):

S.A. Kripke

Keyword(s):

First Order ◽

The Church ◽

Order Algorithm

Download Full-text

Satisfiability testing: recent developments and challenge problems

Proceedings Fifteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.99CB36332) ◽

10.1109/lics.2000.855767 ◽

2005 ◽

Cited By ~ 1

Author(s):

B. Selman

Keyword(s):

Recent Developments

Download Full-text

A modality for recursion

Proceedings Fifteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.99CB36332) ◽

10.1109/lics.2000.855774 ◽

2002 ◽

Cited By ~ 22

Author(s):

H. Nakano

Download Full-text

Models for name-passing processes: interleaving and causal

Proceedings Fifteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.99CB36332) ◽

10.1109/lics.2000.855781 ◽

2002 ◽

Cited By ~ 12

Author(s):

G.L. Cattani ◽

P. Sewell

Download Full-text

Efficient and flexible matching of recursive types

Proceedings Fifteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.99CB36332) ◽

10.1109/lics.2000.855786 ◽

2002 ◽

Cited By ~ 2

Author(s):

J. Palsberg ◽

Tian Zhao

Keyword(s):

Flexible Matching

Download Full-text

A static calculus of dependencies for the λ-cube

Proceedings Fifteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.99CB36332) ◽

10.1109/lics.2000.855775 ◽

2002 ◽

Author(s):

F. Prost

Download Full-text

A complete axiomatization of interval temporal logic with infinite time

Proceedings Fifteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.99CB36332) ◽

10.1109/lics.2000.855773 ◽

2002 ◽

Cited By ~ 9

Author(s):

B.C. Moszkowski

Keyword(s):

Temporal Logic ◽

Infinite Time ◽

Interval Temporal Logic ◽

Complete Axiomatization

Download Full-text

A syntactical analysis of non-size-increasing polynomial time computation

Proceedings Fifteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.99CB36332) ◽

10.1109/lics.2000.855758 ◽

2002 ◽

Cited By ~ 5

Author(s):

K. Aehlig ◽

H. Schwichtenberg

Keyword(s):

Polynomial Time ◽

Syntactical Analysis

Download Full-text

Proceedings Fifteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.99CB36332)Latest Publications

TOTAL DOCUMENTS

H-INDEX

Published By IEEE Comput. Soc

Some strategies for proving theorems with a model checker abstract of invited talk

The curry-howard correspondence in set theory

From the church-turing thesis to the first-order algorithm theorem

Satisfiability testing: recent developments and challenge problems

A modality for recursion

Models for name-passing processes: interleaving and causal

Efficient and flexible matching of recursive types

A static calculus of dependencies for the λ-cube

A complete axiomatization of interval temporal logic with infinite time

A syntactical analysis of non-size-increasing polynomial time computation

Proceedings Fifteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.99CB36332)
Latest Publications