Lecture Notes in Computer Science - Mathematics of Program Construction
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783540601173, 9783540494454

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

A graphical calculus

Lecture Notes in Computer Science - Mathematics of Program Construction ◽

10.1007/3-540-60117-1_12 ◽

1995 ◽

pp. 214-231 ◽

Cited By ~ 3

Author(s):

Sharon Curtis ◽

Gavin Lowe

Keyword(s):

Graphical Calculus

Download Full-text

Exploring summation and product operators in the refinement calculus

Lecture Notes in Computer Science - Mathematics of Program Construction ◽

10.1007/3-540-60117-1_8 ◽

1995 ◽

pp. 128-158 ◽

Cited By ~ 9

Author(s):

Ralph-Johan Back ◽

Michael Butler

Keyword(s):

Refinement Calculus

Download Full-text

Computer-aided computing

Lecture Notes in Computer Science - Mathematics of Program Construction ◽

10.1007/3-540-60117-1_5 ◽

1995 ◽

pp. 50-66 ◽

Cited By ~ 4

Author(s):

Natarajan Shankar

Keyword(s):

Computer Aided

Download Full-text

Towards automatic parallelization of logic programs

Lecture Notes in Computer Science - Mathematics of Program Construction ◽

10.1007/3-540-60117-1_1 ◽

1995 ◽

pp. 1-1

Author(s):

Krzysztof R. Apt

Keyword(s):

Automatic Parallelization ◽

Logic Programs

Download Full-text

A general scheme for breadth-first graph traversal

Lecture Notes in Computer Science - Mathematics of Program Construction ◽

10.1007/3-540-60117-1_21 ◽

1995 ◽

pp. 380-398 ◽

Cited By ~ 4

Author(s):

Martin Russling

Keyword(s):

General Scheme ◽

Graph Traversal

Download Full-text

Program construction in intuitionistic Type Theory

Lecture Notes in Computer Science - Mathematics of Program Construction ◽

10.1007/3-540-60117-1_4 ◽

1995 ◽

pp. 49-49 ◽

Cited By ~ 2

Author(s):

Thierry Coquand

Keyword(s):

Type Theory ◽

Program Construction

Download Full-text

Derivation of parallel algorithms from functional specifications to CSP processes

Lecture Notes in Computer Science - Mathematics of Program Construction ◽

10.1007/3-540-60117-1_6 ◽

1995 ◽

pp. 67-96 ◽

Cited By ~ 9

Author(s):

Ali E. Abdallah

Keyword(s):

Parallel Algorithms

Download Full-text

A refinement relation supporting the transition from unbounded to bounded communication buffers

Lecture Notes in Computer Science - Mathematics of Program Construction ◽

10.1007/3-540-60117-1_23 ◽

1995 ◽

pp. 423-451

Author(s):

Ketil Stølen

Keyword(s):

Refinement Relation

Download Full-text

Angelic termination in Dijkstra's calculus

Lecture Notes in Computer Science - Mathematics of Program Construction ◽

10.1007/3-540-60117-1_18 ◽

1995 ◽

pp. 322-334 ◽

Cited By ~ 1

Author(s):

Wim H. Hesselink

Download Full-text

Mathematics of software engineering

Lecture Notes in Computer Science - Mathematics of Program Construction ◽

10.1007/3-540-60117-1_3 ◽

1995 ◽

pp. 18-48 ◽

Cited By ~ 6

Author(s):

Manfred Broy

Keyword(s):

Software Engineering

Download Full-text

Lecture Notes in Computer Science - Mathematics of Program ConstructionLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

A graphical calculus

Exploring summation and product operators in the refinement calculus

Computer-aided computing

Towards automatic parallelization of logic programs

A general scheme for breadth-first graph traversal

Program construction in intuitionistic Type Theory

Derivation of parallel algorithms from functional specifications to CSP processes

A refinement relation supporting the transition from unbounded to bounded communication buffers

Angelic termination in Dijkstra's calculus

Mathematics of software engineering

Lecture Notes in Computer Science - Mathematics of Program Construction
Latest Publications