Pascal and Francis Bibliographic Databases

Help

Export

Selection :

Permanent link
http://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=1607224

Modular correctness proofs of behavioural implementations

Author
BIDOIT, M1 ; HENNICKER, R2
[1] Laboratoire Specification et Verification, CNRS & Ecole Normale Supérieure de Cachan 61, Avenue du President Wilson, 94235 Cachan, France
[2] Institut für Informatik, Ludwig-Maximilians-Universität München, Oettingenstrasse 67, 80538 München, Germany
Source

Acta informatica. 1998, Vol 35, Num 11, pp 951-1005 ; ref : 1 p.3/4

CODEN
AINFA2
ISSN
0001-5903
Scientific domain
Computer science
Publisher
Springer, Berlin
Publication country
Germany
Document type
Article
Language
English
Keyword (fr)
Algèbre processus Complexité calcul Logique algorithmique Spécification algébrique
Keyword (en)
Process algebra Computational complexity Algorithmic logic Algebraic specification
Keyword (es)
Algebra proceso Complejidad computación Lógica algorítmica
Classification
Pascal
001 Exact sciences and technology / 001D Applied sciences / 001D02 Computer science; control theory; systems / 001D02A Theoretical computing / 001D02A05 Algorithmics. Computability. Computer arithmetics

Discipline
Computer science : theoretical automation and systems
Origin
Inist-CNRS
Database
PASCAL
INIST identifier
1607224

Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS

Access to the document

Searching the Web