default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRené David
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2014
[j42]René David, Karim Nour:
About the range property for H. Log. Methods Comput. Sci. 10(1) (2014)- 2011
- [j41]René David:
A short proof that adding some permutation rules to β preserves SN. Theor. Comput. Sci. 412(11): 1022-1026 (2011) - 2010
- [j40]René David, Karim Nour:
Strong normalization results by translation. Ann. Pure Appl. Log. 161(9): 1171-1179 (2010) - [i5]René David:
A short proof that adding some permutation rules to β preserves SN. CoRR abs/1011.1335 (2010)
2000 – 2009
- 2009
- [j39]René David, Marek Zaionc:
Counting proofs in propositional logic. Arch. Math. Log. 48(2): 185-199 (2009) - [j38]René David, Christophe Raffalli, Guillaume Theyssier, Katarzyna Grygiel, Jakub Kozik
, Marek Zaionc:
Some properties of random lambda terms. Log. Methods Comput. Sci. 9(1) (2009) - [j37]René David:
A direct proof of the confluence of combinatory strong reduction. Theor. Comput. Sci. 410(42): 4204-4215 (2009) - [i4]René David:
A short proof that adding some permutation rules to beta preserves SN. CoRR abs/0904.2955 (2009) - [i3]René David:
A direct proof of the confluence of combinatory strong reduction. CoRR abs/0905.2545 (2009) - [i2]René David, Marek Zaionc:
Counting proofs in propositional logic. CoRR abs/0905.2880 (2009) - [i1]René David, Karim Nour:
Strong normalization results by translation. CoRR abs/0905.2892 (2009) - 2007
- [j36]René David, Karim Nour:
Arithmetical Proofs of Strong Normalization Results for Symmetric ?-calculi. Fundam. Informaticae 77(4): 489-510 (2007) - [c22]René David, Karim Nour:
An Arithmetical Proof of the Strong Normalization for the lambda -Calculus with Recursive Equations on Types. TLCA 2007: 84-101 - 2005
- [j35]René David, Georges Mounier:
An intuitionistic [lambda]-calculus with exceptions. J. Funct. Program. 15(1): 33-52 (2005) - [c21]René David, Karim Nour:
Arithmetical Proofs of Strong Normalization Results for the Symmetric lambda-µ-Calculus. TLCA 2005: 162-178 - [e1]Pierre Lescanne, René David, Marek Zaionc:
Proceedings of the Second Workshop on Computational Logic and Applications, CLA 2004, Lyon, France, June 17-18, 2004. Electronic Notes in Theoretical Computer Science 140, Elsevier 2005 [contents] - 2004
- [j34]René David, Christophe Raffalli:
An experiment concerning mathematical proofs on computers with French undergraduate students. J. Appl. Log. 2(2): 219-239 (2004) - [c20]Pierre Lescanne, René David, Marek Zaionc:
Preface. CLA 2004: 1 - [c19]René David, Karim Nour:
Why the Usual Candidates of Reducibility Do Not Work for the Symmetric lamba-my-calculus. CLA 2004: 101-111 - 2003
- [j33]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) - [j32]René David:
Decidability results for primitive recursive algorithms. Theor. Comput. Sci. 300(1-3): 477-504 (2003) - [c18]René David, Bruno Guillaume:
Strong Normalization of the Typed gammaws-Calculus. CSL 2003: 155-168 - [c17]René David, Hassane Alla:
Reachability Graph for Autonomous Continuous Petri Nets. POSTA 2003: 63-70 - 2002
- [j31]René David, Patrick Girard, Christian Landrault, Serge Pravossoudovitch, Arnaud Virazel:
Hardware Generation of Random Single Input Change Test Sequences. J. Electron. Test. 18(2): 145-157 (2002) - [c16]René David, Patrick Girard, Christian Landrault, Serge Pravossoudovitch, Arnaud Virazel:
On Using Efficient Test Sequences for BIST. VTS 2002: 145-152 - 2001
- [j30]René David:
Normalization without reducibility. Ann. Pure Appl. Log. 107(1-3): 121-130 (2001) - [j29]René David, Hassane Alla:
On Hybrid Petri Nets. Discret. Event Dyn. Syst. 11(1-2): 9-40 (2001) - [j28]Arnaud Virazel, René David, Patrick Girard, Christian Landrault, Serge Pravossoudovitch:
Delay Fault Testing: Choosing Between Random SIC and Random MIC Test Sequences. J. Electron. Test. 17(3-4): 233-241 (2001) - [j27]René David:
Computing with Böhm Trees. Fundam. Informaticae 45(1-2): 53-77 (2001) - [j26]René David, Walter Py:
lambda mu - Calculus and Böhm's Theorem. J. Symb. Log. 66(1): 407-413 (2001) - [j25]René David, Bruno Guillaume:
A lambda-calculus with explicit weakening and explicit substitution. Math. Struct. Comput. Sci. 11(1): 169-206 (2001) - [j24]René David:
On the asymptotic behaviour of primitive recursive algorithms. Theor. Comput. Sci. 266(1-2): 159-193 (2001) - [c15]René David, Patrick Girard, Christian Landrault, Serge Pravossoudovitch, Arnaud Virazel:
On hardware generation of random single input change test sequences. ETW 2001: 117-123 - [c14]René David, Patrick Girard, Christian Landrault, Serge Pravossoudovitch, Arnaud Virazel:
Random Adjacent Sequences: An Efficient Solution for Logic BIST. VLSI-SOC 2001: 413-424 - 2000
- [c13]Arnaud Virazel, René David, Patrick Girard, Christian Landrault, Serge Pravossoudovitch:
Delay fault testing: choosing between random SIC and random MIC test sequences. ETW 2000: 9-14 - [c12]Moez Yeddes, Hassane Alla, René David:
The Partition Method for the Order - Insensitivity in a Synchronous Distributed Systems. ISCC 2000: 635-640
1990 – 1999
- 1999
- [j23]François Charbonnier, Hassane Alla, René David:
Discrete-event dynamic systems. IEEE Trans. Control. Syst. Technol. 7(2): 175-187 (1999) - [c11]René David:
Every Unsolvable lambda Term has a Decoration. TLCA 1999: 98-113 - 1998
- [j22]Hassane Alla, René David:
Continuous and Hybrid Petri Nets. J. Circuits Syst. Comput. 8(1): 159-188 (1998) - [j21]Hassane Alla, René David:
A Modelling and Analysis Tool for Discrete Events Systems: Continuous Petri Net. Perform. Evaluation 33(3): 175-199 (1998) - 1997
- [j20]René David, Janusz A. Brzozowski, Helmut Jürgensen:
Testing for Bounded Faults in RAMs. J. Electron. Test. 10(3): 197-214 (1997) - [j19]René David, Karim Nour:
A Syntactical Proof of the Operational Equivalence of Two Lambda-Terms. Theor. Comput. Sci. 180(1-2): 371-375 (1997) - [c10]René David:
Test Length for Random Testing of Sequential Machines Application to RAMs. Asian Test Symposium 1997: 392-397 - [c9]René David:
Modeling of hybrid systems using continuous and hybrid Petri nets. PNPM 1997: 47-58 - 1996
- [c8]Sophie Crépaux-Motte, Mireille Jacomino, René David:
An algebraic method for delay fault testing. VTS 1996: 308-315 - 1995
- [j18]René David, Karim Nour:
Storage Operators and Directed Lambda-Calculus. J. Symb. Log. 60(4): 1054-1086 (1995) - [j17]René David:
Grafcet: a powerful tool for specification of logic controllers. IEEE Trans. Control. Syst. Technol. 3(3): 253-268 (1995) - 1994
- [j16]René David, Hassane Alla:
Petri nets for modeling of dynamic systems: A survey. Autom. 30(2): 175-202 (1994) - [j15]René David:
The Inf Function in the System F. Theor. Comput. Sci. 135(2): 423-431 (1994) - [c7]Sophie Crépaux-Motte, Mireille Jacomino, René David:
On robustness of required random test length with regard to fault occurrence hypotheses. VTS 1994: 348-355 - 1993
- [j14]Jean Le Bail, Hassane Alla, René David:
Asymptotic continuous Petri nets. Discret. Event Dyn. Syst. 2(3-4): 235-263 (1993) - 1992
- [b3]René David, Hassane Alla:
Petri nets and grafcet - tools for modelling discrete event systems. Prentice Hall 1992, ISBN 978-0-13-327537-7, pp. I-XII, 1-339 - [c6]Jean Le Bail, Hassane Alla, René David:
Asymptotic continuous Petri nets: an efficient approximation of discrete event systems. ICRA 1992: 1050-1056 - 1991
- [c5]René David, Hassane Alla:
Autonomous And Timed Continous Petri Nets. Applications and Theory of Petri Nets 1991: 71-90 - 1990
- [j13]René David, Antoine Fuentes:
Fault Diagnosis of RAM's from Random Testing Experiments. IEEE Trans. Computers 39(2): 220-229 (1990) - [j12]René David:
Comments on "Signature Analysis for Multiple Output Circuits". IEEE Trans. Computers 39(2): 287-288 (1990) - [j11]René David, Kenneth Wagner:
Analysis of Detection Probability and Some Applications. IEEE Trans. Computers 39(10): 1284-1291 (1990)
1980 – 1989
- 1989
- [j10]René David, Antoine Fuentes, Bernard Courtois:
Random Pattern Testing Versus Deterministic Testing of RAM's. IEEE Trans. Computers 38(5): 637-650 (1989) - [c4]Mireille Jacomino, René David:
A new approach of test confidence estimation. FTCS 1989: 307-314 - 1987
- [c3]Mireille Jacomino, J. L. Rainard, René David:
Fault Detection By Consumption Measurement in CMOS Circuits. Fehlertolerierende Rechensysteme 1987: 83-94 - [c2]Claude Terracol, René David:
An aggregation method for performance evaluation of transfer lines with unreliable machines and finite buffers. ICRA 1987: 1333-1338 - 1986
- [j9]René David:
Signature Analysis for Multiple-Output Circuits. IEEE Trans. Computers 35(9): 830-837 (1986) - 1982
- [j8]René David:
A very absolute Π21 real singleton. Ann. Math. Log. 23(2-3): 101-120 (1982) - [j7]René David:
Δ31 reals. Ann. Math. Log. 23(2-3): 121-125 (1982) - 1980
- [j6]René David:
A Result of Relative Consistency About the Predicate WO(delta, kappa). J. Symb. Log. 45(3): 483-492 (1980) - [j5]René David, Pascale Thévenod-Fosse:
Minimal Detecting Transition Sequences: Application to Random Testing. IEEE Trans. Computers 29(6): 514-518 (1980) - [j4]René David:
Testing by Feedback Shift Register. IEEE Trans. Computers 29(7): 668-673 (1980)
1970 – 1979
- 1978
- [j3]René David:
A Totally Self-Checking 1-Out-of-3 Checker. IEEE Trans. Computers 27(6): 570-572 (1978) - 1977
- [j2]René David:
Modular Design of Asynchronous Circuits Defined by Graphs. IEEE Trans. Computers 26(8): 727-737 (1977) - [c1]Pascale Thévenod-Fosse, René David:
Random Testing of Memories. GI Jahrestagung 1977: 139-153 - 1976
- [j1]René David, Gérard Blanchet:
About Random Fault Detection of Combinational Networks. IEEE Trans. Computers 25(6): 659-664 (1976)
1960 – 1969
- 1969
- [b2]René David:
Réalisation de systèmes séquentiels asynchrones par interconnexion simple de cellules séquentielles identiques. Joseph Fourier University, Grenoble, France, 1969 - [b1]René David:
Langages de programmation en commande numérique de machines-outils. Joseph Fourier University, Grenoble, France, 1969
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-08 20:16 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
