The SCEAS System
Navigation Menu

Search the dblp DataBase


Hans Olsén: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Laurent Fribourg, Hans Olsén
    Proving Safety Properties of Infinite State Systems by Compilation into Presburger Arithmetic. [Citation Graph (0, 0)][DBLP]
    CONCUR, 1997, pp:213-227 [Conf]
  2. Laurent Fribourg, Hans Olsén
    A Unifying View of Structural Induction and Computation Induction for Logic Programs. [Citation Graph (0, 0)][DBLP]
    LOPSTR, 1992, pp:46-60 [Conf]
  3. Laurent Fribourg, Hans Olsén
    Reductions of Petri Nets and Unfolding of Propositional Logic Programs. [Citation Graph (0, 0)][DBLP]
    LOPSTR, 1996, pp:187-203 [Conf]
  4. Laurent Fribourg, Hans Olsén
    A Decompositional Approach for Computing Least Fixed-Points of Datalog Programs with Z-Counters. [Citation Graph (0, 0)][DBLP]
    Constraints, 1997, v:2, n:3/4, pp:305-335 [Journal]
  5. Laurent Fribourg, Hans Olsén
    Reachability sets of parameterized rings as regular languages. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 1997, v:9, n:, pp:- [Journal]

Search in 0.001secs, Finished in 0.002secs
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
System created by [] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002