Pascal and Francis Bibliographic Databases


Search results

Your search

kw.\*:("Spécification programme")

Document Type [dt]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Publication Year[py]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Discipline (document) [di]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV


A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Author Country

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV


A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Results 1 to 25 of 1334

  • Page / 54

Selection :

  • and

XPLAIN: a system for creating and explaining expert consulting programsSWARTOUT, W. R.Artificial intelligence. 1983, Vol 21, Num 3, pp 285-325, issn 0004-3702Article

Specification of concurrent objects using auxiliary variablesSINGH, A. K.Science of computer programming. 1991, Vol 16, Num 1, pp 49-88, issn 0167-6423, 40 p.Article

Logic programming and rapid prototypingKOMOROWSKI, H. J; MALUSZYNSKI, J; GAUDEL, M. C et al.Science of computer programming. 1987, Vol 9, Num 2, pp 179-205, issn 0167-6423Article

Some fundamental algebraic tools for the semantics of computation. I: Comma categories, colimits, signatures and theoriesGOGUEN, J. A; BURSTALL, R. M.Theoretical computer science. 1984, Vol 31, Num 1-2, pp 175-209, issn 0304-3975Article

Requirements engineering: Problem analysis and solution specificationWIERINGA, R. J.Lecture notes in computer science. 2004, pp 13-16, issn 0302-9743, isbn 3-540-22511-0, 4 p.Conference Paper

Software documentation and the verification processPARNAS, David Lorge.Lecture notes in computer science. 2001, issn 0302-9743, isbn 3-540-42345-1, p. 1Conference Paper

Prescribing behavioursTURSKI, W. M.Theoretical computer science. 1991, Vol 90, Num 1, pp 119-125, issn 0304-3975Article

Validation des spécifications algébriques par complétion inductives = Algebraic specifications validation by inductive completionKOUNALIS, Emmanuel.1985, 204 pThesis

Spécifications algébriques observationnelles modulaires: Une sémantique fondée sur une relation de satisfaction observationnelle = Modular Observational Algebraic Specifications: A Semantics Based on an Observational Satisfaction RelationKnapik, Teodor; Bidoit, Michel; Bernot, Gilles et al.1993, 150 p.Thesis

The existence of refinement mappingsABADI, M; LAMPORT, L.Theoretical computer science. 1991, Vol 82, Num 2, pp 253-284, issn 0304-3975, 32 p.Article

Inverted decision tables and their application: automating the translation of specifications to programsLEVY, L. S; STUMP, H. T.AT&T Bell Laboratories technical journal. 1985, Vol 64, Num 2, pp 533-558, 2Article

Algebraic relations and presentationsKAMIMURA, T; TANG, A.Theoretical computer science. 1983, Vol 27, Num 1-2, pp 39-60, issn 0304-3975Article

Termination is not modular for confluent variable-preserving term rewriting systemsOHLEBUSCH, E.Information processing letters. 1995, Vol 53, Num 4, pp 223-228, issn 0020-0190Article

Control predicates are better than dummy variables for reasoning about program controlLAMPORT, L.ACM transactions on programming languages and systems. 1988, Vol 10, Num 2, pp 267-281, issn 0164-0925Article

Program synthesis through problem splitting : a method for subproblem caracterizationBRENA, P; CAFERRA, R; BRONHOEFFER, B et al.Rapport de recherche - Informatique et mathématiques appliquées de Grenoble, ISSN: 0750-7380 ; 471. 1984, 12 p.Report

Deriving specifications from requirements through problem reductionRAPANOTTI, L; HALL, J. G; LI, Z et al.IEE Proceedings - Software (Print). 2006, Vol 153, Num 5, pp 183-198, issn 1462-5970, 16 p.Article

Non-deterministic expressions and predicate transformersMORRIS, J. M.Information processing letters. 1997, Vol 61, Num 5, pp 241-246, issn 0020-0190Article

Propositions and specifications of programs in Martin-Löf's type theoryNORDSTROM, B; SMITH, J.BIT (Nordisk Tidskrift for Informationsbehandling). 1984, Vol 24, Num 3, pp 288-301, issn 0006-3835Article

Logiques du temps arborescent pour la spécification et la preuve de programmes = Branching time logics for program specification and proofGRAF, Susanne.1984, Pagination mult. [133 p.]Thesis

The lattice of data refinementVON WRIGHT, J.Acta informatica. 1994, Vol 31, Num 2, pp 105-135, issn 0001-5903Article

A generalized iterative construct and its semanticsANSON, E.ACM transactions on programming languages and systems. 1987, Vol 9, Num 4, pp 567-581, issn 0164-0925Article

Horizontal Composability RevisitedSANNELLA, Donald; TARLECKI, Andrzej.Algebra, meaning, and computation (essays dedicated to Joseph A. Goguen on the occasion of his 65th birthday). Lecture notes in computer science. 2006, pp 296-316, issn 0302-9743, isbn 3-540-35462-X, 1Vol, 21 p.Book Chapter

Relating software requirements and architecturesHALL, Jon G; MISTRIK, Ivan; NUSEIBEH, Bashar et al.IEE Proceedings - Software (Print). 2005, Vol 152, Num 4, pp 141-208, issn 1462-5970, 68 p.Serial Issue

Predicative methodologyHEHNER, E.C.R; GUPTA, L. E; MALTIN, A. J et al.Acta informatica. 1986, Vol 23, Num 5, pp 487-505, issn 0001-5903Article

The relation between logic programming and logic specificationKOWALSKI, R.Philosophical transactions of the royal society of London, series A : mathematical and physical sciences. 1984, Vol 312, Num 1522, pp 345-361, issn 0080-4614Article

  • Page / 54