Hans Olsén

According to our database1, Hans Olsén authored at least 5 papers between 1992 and 1997.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

1997
Reachability sets of parameterized rings as regular languages.
Proceedings of the Second International Workshop on Verification of Infinite State Systems, 1997

A Decompositional Approach for Computing Least Fixed-Points of Datalog Programs with Z-Counters.
Constraints An Int. J., 1997

Proving Safety Properties of Infinite State Systems by Compilation into Presburger Arithmetic.
Proceedings of the CONCUR '97: Concurrency Theory, 1997

1996
Reductions of Petri Nets and Unfolding of Propositional Logic Programs.
Proceedings of the Logic Programming Synthesis and Transformation, 1996

1992
A Unifying View of Structural Induction and Computation Induction for Logic Programs.
Proceedings of the Logic Program Synthesis and Transformation, 1992


  Loading...