René David - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 55 from 55

2011

A short proof that adding some permutation rules to β preserves SNRené David. TCS, 412(11):1022-1026, 2011. [doi]

2010

Strong normalization results by translationRené David, Karim Nour. APAL, 161(9):1171-1179, 2010. [doi]

2007

Arithmetical Proofs of Strong Normalization Results for Symmetric ?-calculiRené David, Karim Nour. FUIN, 77(4):489-510, 2007. [doi]

An Arithmetical Proof of the Strong Normalization for the ::::lambda:::: -Calculus with Recursive Equations on TypesRené David, Karim Nour. tlca 2007: 84-101 [doi]

2005

2004

An experiment concerning mathematical proofs on computers with French undergraduate studentsRené David, Christophe Raffalli. japll, 2(2):219-239, 2004. [doi]

2003

Reachability Graph for Autonomous Continuous Petri NetsRené David, Hassane Alla. posta 2003: 63-70 [doi]

Decidability results for primitive recursive algorithmsRené David. TCS, 300(1-3):477-504, 2003. [doi]

A short proof of the strong normalization of classical natural deduction with disjunctionRené David, Karim Nour. JSYML, 68(4):1277-1288, 2003. [doi]

Strong Normalization of the Typed gamma::ws::-CalculusRené David, Bruno Guillaume. csl 2003: 155-168 [doi]

2002

On Using Efficient Test Sequences for BISTRené David, Patrick Girard, Christian Landrault, Serge Pravossoudovitch, Arnaud Virazel. vts 2002: 145-152 [doi]

Hardware Generation of Random Single Input Change Test SequencesRené David, Patrick Girard, Christian Landrault, Serge Pravossoudovitch, Arnaud Virazel. et, 18(2):145-157, 2002. [doi]

2001

On Hybrid Petri NetsRené David, Hassane Alla. deds, 11(1-2):9-40, 2001. [doi]

Normalization without reducibilityRené David. APAL, 107(1-3):121-130, 2001.

lambda mu - Calculus and Böhm s TheoremRené David, Walter Py. JSYML, 66(1):407-413, 2001.

On hardware generation of random single input change test sequencesRené David, P. Girard, Christian Landrault, Serge Pravossoudovitch, Arnaud Virazel. ets 2001: 117-123 [doi]

Random Adjacent Sequences: An Efficient Solution for Logic BISTRené David, Patrick Girard, Christian Landrault, Serge Pravossoudovitch, Arnaud Virazel. ifip10-5 2002: 413-424

A lambda-calculus with explicit weakening and explicit substitutionRené David, Bruno Guillaume. mscs, 11(1):169-206, 2001.

Delay Fault Testing: Choosing Between Random SIC and Random MIC Test SequencesArnaud Virazel, René David, Patrick Girard, Christian Landrault, Serge Pravossoudovitch. et, 17(3-4):233-241, 2001. [doi]

2000

Delay fault testing: choosing between random SIC and random MIC test sequencesArnaud Virazel, René David, P. Girard, Christian Landrault, Serge Pravossoudovitch. ets 2000: 9-14 [doi]

The Partition Method for the Order - Insensitivity in a Synchronous Distributed SystemsMoez Yeddes, Hassane Alla, René David. ISCC 2000: 635-640 [doi]

1999

Discrete-event dynamic systemsFrançois Charbonnier, Hassane Alla, René David. tcst, 7(2):175-187, 1999. [doi]

Every Unsolvable ::::lambda:::: Term has a DecorationRené David. tlca 1999: 98-113 [doi]

1998

Continuous and Hybrid Petri NetsHassane Alla, René David. jcsc, 8(1):159-188, 1998. [doi]

A Modelling and Analysis Tool for Discrete Events Systems: Continuous Petri NetHassane Alla, René David. pe, 33(3):175-199, 1998.

1997

Test Length for Random Testing of Sequential Machines Application to RAMsRené David. ats 1997: 392-397 [doi]

A Syntactical Proof of the Operational Equivalence of Two Lambda-TermsRené David, Karim Nour. TCS, 180(1-2):371-375, 1997. [doi]

Modeling of hybrid systems using continuous and hybrid Petri netsRené David. pnpm 1997: 47-58 [doi]

1995

Storage Operators and Directed Lambda-CalculusRené David, Karim Nour. JSYML, 60(4):1054-1086, 1995.

Grafcet: a powerful tool for specification of logic controllersRené David. tcst, 3(3):253-268, 1995. [doi]

1994

The Inf Function in the System FRené David. TCS, 135(2):423-431, 1994.

Petri nets for modeling of dynamic systems: A surveyRené David, Hassane Alla. automatica, 30(2):175-202, 1994. [doi]

1993

Asymptotic continuous Petri netsJean Le Bail, Hassane Alla, René David. deds, 2(3-4):235-263, 1993. [doi]

1992

Asymptotic continuous Petri nets: an efficient approximation of discrete event systemsJean Le Bail, Hassane Alla, René David. icra 1992: 1050-1056 [doi]

Petri nets and grafcet - tools for modelling discrete event systemsRené David, Hassane Alla. Prentice Hall, 1992.

1991

Autonomous And Timed Continous Petri NetsRené David, Hassane Alla. apn 1993: 71-90

1990

Fault Diagnosis of RAM s from Random Testing ExperimentsRené David, Antoine Fuentes. TC, 39(2):220-229, 1990.

Analysis of Detection Probability and Some ApplicationsRené David, Kenneth Wagner. TC, 39(10):1284-1291, 1990.

Comments on Signature Analysis for Multiple Output Circuits René David. TC, 39(2):287-288, 1990.

1989

Random Pattern Testing Versus Deterministic Testing of RAM sRené David, Antoine Fuentes, Bernard Courtois. TC, 38(5):637-650, 1989.

1987

An aggregation method for performance evaluation of transfer lines with unreliable machines and finite buffersClaude Terracol, René David. icra 1987: 1333-1338 [doi]

1986

Signature Analysis for Multiple-Output CircuitsRené David. TC, 35(9):830-837, 1986.

1982

1 real singletonRené David. APAL, 23(2-3):101-120, 1982. [doi]

1 realsRené David. APAL, 23(2-3):121-125, 1982. [doi]

1980

Testing by Feedback Shift RegisterRené David. TC, 29(7):668-673, 1980.

Minimal Detecting Transition Sequences: Application to Random TestingRené David, Pascale Thévenod-Fosse. TC, 29(6):514-518, 1980.

A Result of Relative Consistency About the Predicate WO(delta, kappa)René David. JSYML, 45(3):483-492, 1980.

1978

A Totally Self-Checking 1-Out-of-3 CheckerRené David. TC, 27(6):570-572, 1978.

1977

Modular Design of Asynchronous Circuits Defined by GraphsRené David. TC, 26(8):727-737, 1977.

Random Testing of MemoriesPascale Fosse, René David. gi 1977: 139-153

1969

Langages de programmation en commande numérique de machines-outilsRené David. 1969. [doi]

Réalisation de systèmes séquentiels asynchrones par interconnexion simple de cellules séquentielles identiquesRené David. 1969. [doi]

Sign in or sign up to see more results.

runs on WebDSL