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

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

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

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

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

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

Mathematical notation in formal specification : too difficult for the masses ?FINNEY, K.IEEE transactions on software engineering. 1996, Vol 22, Num 2, pp 158-159, issn 0098-5589Article

A bridge between constructive logic and computer programmingNEPEJVODA, N. N.Theoretical computer science. 1991, Vol 90, Num 1, pp 253-270, issn 0304-3975Article

On guarded recursionBADOUEL, E; DARONDEAU, P.Theoretical computer science. 1991, Vol 82, Num 2, pp 403-408, issn 0304-3975, 6 p.Article

The programming system PRIZMINTS, G; TYUGU, E.Journal of symbolic computation. 1988, Vol 5, Num 3, pp 359-375, issn 0747-7171Article

Program design languages: how much detail should they include?BOEHM-DAVIS, D. A; SHEPPARD, S. B; BAILEY, J. W et al.International journal of man-machine studies. 1987, Vol 27, Num 4, pp 337-347, issn 0020-7373Article

Dérivation de programmes impératifs à partir de spécifications algébriques = Derivation of imperatives programs from algebreac specificationsGuerte, Yves; Bert, D.1996, 144 p.Thesis

A relational division operator: the conjugate kernelDESHARNAIS, J; ALI JAOUA; MILI, F et al.Theoretical computer science. 1993, Vol 114, Num 2, pp 247-272, issn 0304-3975Article

Tail recursion through universal invariantsBARRY JAY, C.Theoretical computer science. 1993, Vol 115, Num 1, pp 151-189, issn 0304-3975Conference Paper