Conferences in DBLP

Mathematics of Program Construction (MPC) (mpc)
1995 (conf/mpc/1995)

1. Krzysztof R. Apt
   Towards Automatic Parallelization of Logic Programs (Abstract). [Citation Graph (0, 0)][DBLP]
   MPC, 1995, pp:1- [Conf]
   
2. Richard S. Bird
   Functional Algorithm Design. [Citation Graph (0, 0)][DBLP]
   MPC, 1995, pp:2-17 [Conf]
   
3. Manfred Broy
   Mathematics of Software Engineering. [Citation Graph (0, 0)][DBLP]
   MPC, 1995, pp:18-48 [Conf]
   
4. Thierry Coquand
   Program Construction in Intuitionistic Type Theory (Abstract). [Citation Graph (0, 0)][DBLP]
   MPC, 1995, pp:49- [Conf]
   
5. Natarajan Shankar
   Computer-Aided Computing. [Citation Graph (0, 0)][DBLP]
   MPC, 1995, pp:50-66 [Conf]
   
6. Ali E. Abdallah
   Derivation of Parallel Algorithms from Functional Specifications to CSP Processes. [Citation Graph (0, 0)][DBLP]
   MPC, 1995, pp:67-96 [Conf]
   
7. Klaus Achatz, Wolfram Schulte
   Architecture Independent Massive Parallelization of Divide-and-Conquer Algorithms. [Citation Graph (0, 0)][DBLP]
   MPC, 1995, pp:97-127 [Conf]
   
8. Ralph-Johan Back, Michael J. Butler
   Exploring Summation and Product Operators in the Refinement Calculus. [Citation Graph (0, 0)][DBLP]
   MPC, 1995, pp:128-158 [Conf]
   
9. Ralph-Johan Back, Alain J. Martin, Kaisa Sere
   An Action System Specification of the Caltech Asynchronous Microprocessor. [Citation Graph (0, 0)][DBLP]
   MPC, 1995, pp:159-179 [Conf]
   
10. Rudolf Berghammer, Burghard von Karger
    Formal Derivation of CSP Programs From Temporal Specifications. [Citation Graph (0, 0)][DBLP]
    MPC, 1995, pp:181-196 [Conf]
    
11. Frank S. de Boer, M. van Hulst
    A Compositional Proof System for Asynchronously Communicating Processes. [Citation Graph (0, 0)][DBLP]
    MPC, 1995, pp:197-213 [Conf]
    
12. Sharon Curtis, Gavin Lowe
    A Graphical Calculus. [Citation Graph (0, 0)][DBLP]
    MPC, 1995, pp:214-231 [Conf]
    
13. Victor J. Dielissen, Anne Kaldewaij
    A Simple, Efficient, and Flexible Implementation of Flexible Arrays. [Citation Graph (0, 0)][DBLP]
    MPC, 1995, pp:232-241 [Conf]
    
14. Henk Doornbos, Roland Carl Backhouse
    Induction and Recursion on Datatypes. [Citation Graph (0, 0)][DBLP]
    MPC, 1995, pp:242-256 [Conf]
    
15. Marc Frappier, Ali Mili, Jules Desharnais
    Program Construction by Parts. [Citation Graph (0, 0)][DBLP]
    MPC, 1995, pp:257-281 [Conf]
    
16. Jeremy Gibbons
    An Initial-Algebra Approach to Directed Acyclic Graphs. [Citation Graph (0, 0)][DBLP]
    MPC, 1995, pp:282-303 [Conf]
    
17. Rix Groenboom, Chris Hendriks, Indra Polak, Jan Terlouw, Jan Tijmen Udding
    Algebraic Proof Assistants in HOL. [Citation Graph (0, 0)][DBLP]
    MPC, 1995, pp:304-321 [Conf]
    
18. Wim H. Hesselink
    Angelic Termination in Dijkstra`s Calculus. [Citation Graph (0, 0)][DBLP]
    MPC, 1995, pp:322-334 [Conf]
    
19. Jean-François Monin
    Extracting Programs with Exceptions in an Impredicative Type System. [Citation Graph (0, 0)][DBLP]
    MPC, 1995, pp:335-350 [Conf]
    
20. Catherine Parent
    Synthesizing Proofs from Programs in the Calculus of Inductive Constructions. [Citation Graph (0, 0)][DBLP]
    MPC, 1995, pp:351-379 [Conf]
    
21. Martin Russling
    A General Scheme for Breadth-First Graph Traversal. [Citation Graph (0, 0)][DBLP]
    MPC, 1995, pp:380-398 [Conf]
    
22. Yellamraju V. Srinivas, Richard Jüllig
    Specware: Formal Support for Composing Software. [Citation Graph (0, 0)][DBLP]
    MPC, 1995, pp:399-422 [Conf]
    
23. Ketil Stølen
    A Refinement Relation Supporting the Transition from Unbounded to Bounded Communication Buffers. [Citation Graph (0, 0)][DBLP]
    MPC, 1995, pp:423-451 [Conf]
    
24. Rob T. Udink, Joost N. Kok
    ImpUNITY: UNITY with Procedures and Local Variables. [Citation Graph (0, 0)][DBLP]
    MPC, 1995, pp:452-472 [Conf]