Jan Springintveld

According to our database1, Jan Springintveld authored at least 10 papers between 1993 and 2005.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2005
A computer checked algebraic verification of a distributed summation algorithm.
Formal Aspects Comput., 2005

2001
Testing timed automata.
Theor. Comput. Sci., 2001

Focus points and convergent process operators: a proof strategy for protocol verification.
J. Log. Algebraic Methods Program., 2001

1998
Exploiting Symmetry in Protocol Testing.
Proceedings of the Formal Description Techniques and Protocol Specification, 1998

1996
A Simple Proof of the Undecidability of Inhabitation in lambda<i>P</i>.
J. Funct. Program., 1996

Minimizable Timed Automata.
Proceedings of the Formal Techniques in Real-Time and Fault-Tolerant Systems, 1996

1995
Third-Order Matching in the Presence of Type Constructors.
Proceedings of the Typed Lambda Calculi and Applications, 1995

Third-Order Matching in the Polymorphic Lambda Calculus.
Proceedings of the Higher-Order Algebra, 1995

1994
A Computer-Checked Verification of Milner's Scheduler.
Proceedings of the Theoretical Aspects of Computer Software, 1994

1993
Lower and Upper Bounds for Reductions of Types in Lambda-omega and Lambda-P.
Proceedings of the Typed Lambda Calculi and Applications, 1993


  Loading...