dblp.uni-trier.dewww.uni-trier.de

René David Vis

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

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

Coauthor Index

1Hassane Alla [13] [18] [19] [21] [27] [33]
2Gérard Blanchet [1]
3Bernard Courtois [9]
4Pascale Fosse [3]
5Antoine Fuentes [9] [11]
6Patrick Girard [25] [29] [30] [31]
7Katarzyna Grygiel [46]
8Bruno Guillaume [23] [34]
9Jakub Kozik [46]
10Christian Landrault [25] [29] [30] [31]
11Pierre Lescanne [38]
12Georges Mounier [36]
13Karim Nour [15] [16] [37] [39] [40] [41] [42]
14Serge Pravossoudovitch [25] [29] [30] [31]
15Walter Py [24]
16Christophe Raffalli [35] [46]
17Pascale Thévenod-Fosse [7]
18Guillaume Theyssier [46]
19Arnaud Virazel [25] [29] [30] [31]
20Kenneth Wagner [12]
21Moez Yeddes [21]
22Marek Zaionc [38] [43] [46]

Colors in the list of coauthors

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)