The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
René David: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. René David, Hassane Alla
    Autonomous And Timed Continous Petri Nets. [Citation Graph (0, 0)][DBLP]
    Applications and Theory of Petri Nets, 1991, pp:71-90 [Conf]
  2. René David
    Test Length for Random Testing of Sequential Machines Application to RAMs. [Citation Graph (0, 0)][DBLP]
    Asian Test Symposium, 1997, pp:392-397 [Conf]
  3. René David, Bruno Guillaume
    Strong Normalization of the Typed gammaws-Calculus. [Citation Graph (0, 0)][DBLP]
    CSL, 2003, pp:155-168 [Conf]
  4. Pascale Fosse, René David
    Random Testing of Memories. [Citation Graph (0, 0)][DBLP]
    GI Jahrestagung, 1977, pp:139-153 [Conf]
  5. René David, Patrick Girard, Christian Landrault, Serge Pravossoudovitch, Arnaud Virazel
    Random Adjacent Sequences: An Efficient Solution for Logic BIST. [Citation Graph (0, 0)][DBLP]
    VLSI-SOC, 2001, pp:413-424 [Conf]
  6. Moez Yeddes, Hassane Alla, René David
    The Partition Method for the Order - Insensitivity in a Synchronous Distributed Systems. [Citation Graph (0, 0)][DBLP]
    ISCC, 2000, pp:635-640 [Conf]
  7. René David, Hassane Alla
    Reachability Graph for Autonomous Continuous Petri Nets. [Citation Graph (0, 0)][DBLP]
    POSTA, 2003, pp:63-70 [Conf]
  8. René David
    Every Unsolvable lambda Term has a Decoration. [Citation Graph (0, 0)][DBLP]
    TLCA, 1999, pp:98-113 [Conf]
  9. René David, Karim Nour
    Arithmetical Proofs of Strong Normalization Results for the Symmetric lambda-µ-Calculus. [Citation Graph (0, 0)][DBLP]
    TLCA, 2005, pp:162-178 [Conf]
  10. René David, Patrick Girard, Christian Landrault, Serge Pravossoudovitch, Arnaud Virazel
    On Using Efficient Test Sequences for BIST. [Citation Graph (0, 0)][DBLP]
    VTS, 2002, pp:145-152 [Conf]
  11. René David
    Normalization without reducibility. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 2001, v:107, n:1-3, pp:121-130 [Journal]
  12. René David, Karim Nour
    Why the Usual Candidates of Reducibility Do Not Work for the Symmetric lamba-my-calculus. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2005, v:140, n:, pp:101-111 [Journal]
  13. Pierre Lescanne, René David, Marek Zaionc
    Preface. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2005, v:140, n:, pp:1- [Journal]
  14. René David
    Computing with Böhm Trees. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 2001, v:45, n:1-2, pp:53-77 [Journal]
  15. René David, Christophe Raffalli
    An experiment concerning mathematical proofs on computers with French undergraduate students. [Citation Graph (0, 0)][DBLP]
    J. Applied Logic, 2004, v:2, n:2, pp:219-239 [Journal]
  16. Hassane Alla, René David
    Continuous and Hybrid Petri Nets. [Citation Graph (0, 0)][DBLP]
    Journal of Circuits, Systems, and Computers, 1998, v:8, n:1, pp:159-188 [Journal]
  17. René David, Georges Mounier
    An intuitionistic [lambda]-calculus with exceptions. [Citation Graph (0, 0)][DBLP]
    J. Funct. Program., 2005, v:15, n:1, pp:33-52 [Journal]
  18. René David
    A Result of Relative Consistency About the Predicate WO(delta, kappa). [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1980, v:45, n:3, pp:483-492 [Journal]
  19. René David, Karim Nour
    Storage Operators and Directed Lambda-Calculus. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1995, v:60, n:4, pp:1054-1086 [Journal]
  20. René David, Walter Py
    lambda mu - Calculus and Böhm's Theorem. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 2001, v:66, n:1, pp:407-413 [Journal]
  21. René David, Bruno Guillaume
    A lambda-calculus with explicit weakening and explicit substitution. [Citation Graph (0, 0)][DBLP]
    Mathematical Structures in Computer Science, 2001, v:11, n:1, pp:169-206 [Journal]
  22. Hassane Alla, René David
    A Modelling and Analysis Tool for Discrete Events Systems: Continuous Petri Net. [Citation Graph (0, 0)][DBLP]
    Perform. Eval., 1998, v:33, n:3, pp:175-199 [Journal]
  23. René David
    Modular Design of Asynchronous Circuits Defined by Graphs. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1977, v:26, n:8, pp:727-737 [Journal]
  24. René David
    A Totally Self-Checking 1-Out-of-3 Checker. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1978, v:27, n:6, pp:570-572 [Journal]
  25. René David
    Testing by Feedback Shift Register. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1980, v:29, n:7, pp:668-673 [Journal]
  26. René David
    Signature Analysis for Multiple-Output Circuits. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1986, v:35, n:9, pp:830-837 [Journal]
  27. René David
    Comments on "Signature Analysis for Multiple Output Circuits". [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1990, v:39, n:2, pp:287-288 [Journal]
  28. René David, Gérard Blanchet
    About Random Fault Detection of Combinational Networks. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1976, v:25, n:6, pp:659-664 [Journal]
  29. René David, Antoine Fuentes
    Fault Diagnosis of RAM's from Random Testing Experiments. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1990, v:39, n:2, pp:220-229 [Journal]
  30. René David, Antoine Fuentes, Bernard Courtois
    Random Pattern Testing Versus Deterministic Testing of RAM's. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1989, v:38, n:5, pp:637-650 [Journal]
  31. René David, Pascale Thévenod-Fosse
    Minimal Detecting Transition Sequences: Application to Random Testing. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1980, v:29, n:6, pp:514-518 [Journal]
  32. René David, Kenneth Wagner
    Analysis of Detection Probability and Some Applications. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1990, v:39, n:10, pp:1284-1291 [Journal]
  33. René David
    On the asymptotic behaviour of primitive recursive algorithms. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:266, n:1-2, pp:159-193 [Journal]
  34. René David
    Decidability results for primitive recursive algorithms. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:300, n:1-3, pp:477-504 [Journal]
  35. René David
    The Inf Function in the System F. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1994, v:135, n:2, pp:423-431 [Journal]
  36. René David, Karim Nour
    A Syntactical Proof of the Operational Equivalence of Two Lambda-Terms. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1997, v:180, n:1-2, pp:371-375 [Journal]
  37. René David, Karim Nour
    An Arithmetical Proof of the Strong Normalization for the lambda -Calculus with Recursive Equations on Types. [Citation Graph (0, 0)][DBLP]
    TLCA, 2007, pp:84-101 [Conf]
  38. René David, Karim Nour
    Arithmetical Proofs of Strong Normalization Results for Symmetric ?-calculi. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 2007, v:77, n:4, pp:489-510 [Journal]

  39. Counting proofs in propositional logic. [Citation Graph (, )][DBLP]


  40. Some properties of random lambda terms [Citation Graph (, )][DBLP]


  41. A short proof that adding some permutation rules to beta preserves SN [Citation Graph (, )][DBLP]


  42. A direct proof of the confluence of combinatory strong reduction [Citation Graph (, )][DBLP]


  43. Counting proofs in propositional logic [Citation Graph (, )][DBLP]


  44. Strong normalization results by translation [Citation Graph (, )][DBLP]


Search in 0.003secs, Finished in 0.307secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002