René David

	2011
53		René David: A short proof that adding some permutation rules to β preserves SN. Theor. Comput. Sci. 412(11): 1022-1026 (2011)
	2010
52		René David, Karim Nour: Strong normalization results by translation. Ann. Pure Appl. Logic 161(9): 1171-1179 (2010)
	2009
51		René David, Marek Zaionc: Counting proofs in propositional logic. Arch. Math. Log. 48(2): 185-199 (2009)
50		René David, Christophe Raffalli, Guillaume Theyssier, Katarzyna Grygiel, Jakub Kozik, Marek Zaionc: Some properties of random lambda terms CoRR abs/0903.5505: (2009)
49		René David: A short proof that adding some permutation rules to beta preserves SN CoRR abs/0904.2955: (2009)
48		René David: A direct proof of the confluence of combinatory strong reduction CoRR abs/0905.2545: (2009)
47		René David, Marek Zaionc: Counting proofs in propositional logic CoRR abs/0905.2880: (2009)
46		René David, Karim Nour: Strong normalization results by translation CoRR abs/0905.2892: (2009)
45		René David: A direct proof of the confluence of combinatory strong reduction. Theor. Comput. Sci. 410(42): 4204-4215 (2009)
	2007
44		René David, Karim Nour: An Arithmetical Proof of the Strong Normalization for the lambda -Calculus with Recursive Equations on Types. TLCA 2007: 84-101
43		René David, Karim Nour: Arithmetical Proofs of Strong Normalization Results for Symmetric ?-calculi. Fundam. Inform. 77(4): 489-510 (2007)
	2005
42		René David, Karim Nour: Arithmetical Proofs of Strong Normalization Results for the Symmetric lambda-µ-Calculus. TLCA 2005: 162-178
41		Pierre Lescanne, René David, Marek Zaionc: Preface. Electr. Notes Theor. Comput. Sci. 140: 1 (2005)
40		René 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)
39		René David, Georges Mounier: An intuitionistic [lambda]-calculus with exceptions. J. Funct. Program. 15(1): 33-52 (2005)
	2004
38		René David, Christophe Raffalli: An experiment concerning mathematical proofs on computers with French undergraduate students. J. Applied Logic 2(2): 219-239 (2004)
	2003
37		René David, Bruno Guillaume: Strong Normalization of the Typed gammaws-Calculus. CSL 2003: 155-168
36		René David, Hassane Alla: Reachability Graph for Autonomous Continuous Petri Nets. POSTA 2003: 63-70
35		René David, Karim Nour: A short proof of the strong normalization of classical natural deduction with disjunction. J. Symb. Log. 68(4): 1277-1288 (2003)
34		René David: Decidability results for primitive recursive algorithms. Theor. Comput. Sci. 300(1-3): 477-504 (2003)
	2002
33		René David, Patrick Girard, Christian Landrault, Serge Pravossoudovitch, Arnaud Virazel: On Using Efficient Test Sequences for BIST. VTS 2002: 145-152
32		René 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
31		René David, Patrick Girard, Christian Landrault, Serge Pravossoudovitch, Arnaud Virazel: Random Adjacent Sequences: An Efficient Solution for Logic BIST. VLSI-SOC 2001: 413-424
30		René David: Normalization without reducibility. Ann. Pure Appl. Logic 107(1-3): 121-130 (2001)
29		René David, Hassane Alla: On Hybrid Petri Nets. Discrete Event Dynamic Systems 11(1-2): 9-40 (2001)
28		René David: Computing with Böhm Trees. Fundam. Inform. 45(1-2): 53-77 (2001)
27		Arnaud 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)
26		René David, Walter Py: lambda mu - Calculus and Böhm's Theorem. J. Symb. Log. 66(1): 407-413 (2001)
25		René David, Bruno Guillaume: A lambda-calculus with explicit weakening and explicit substitution. Mathematical Structures in Computer Science 11(1): 169-206 (2001)
24		René David: On the asymptotic behaviour of primitive recursive algorithms. Theor. Comput. Sci. 266(1-2): 159-193 (2001)
	2000
23		Moez Yeddes, Hassane Alla, René David: The Partition Method for the Order - Insensitivity in a Synchronous Distributed Systems. ISCC 2000: 635-640
	1999
22		René David: Every Unsolvable lambda Term has a Decoration. TLCA 1999: 98-113
	1998
21		Hassane Alla, René David: Continuous and Hybrid Petri Nets. Journal of Circuits, Systems, and Computers 8(1): 159-188 (1998)
20		Hassane Alla, René David: A Modelling and Analysis Tool for Discrete Events Systems: Continuous Petri Net. Perform. Eval. 33(3): 175-199 (1998)
	1997
19		René David: Test Length for Random Testing of Sequential Machines Application to RAMs. Asian Test Symposium 1997: 392-397
18		René David, Karim Nour: A Syntactical Proof of the Operational Equivalence of Two Lambda-Terms. Theor. Comput. Sci. 180(1-2): 371-375 (1997)
	1995
17		René David, Karim Nour: Storage Operators and Directed Lambda-Calculus. J. Symb. Log. 60(4): 1054-1086 (1995)
	1994
16		René David, Hassane Alla: Petri nets for modeling of dynamic systems: A survey. Automatica 30(2): 175-202 (1994)
15		René David: The Inf Function in the System F. Theor. Comput. Sci. 135(2): 423-431 (1994)
	1992
14		René David, Hassane Alla: Petri nets and grafcet - tools for modelling discrete event systems. Prentice Hall 1992: I-XII, 1-339
	1991
13		René 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

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

Colors in the list of coauthors

Last update Tue May 29 20:41:18 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page