default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFormal Aspects of Computing, Volume 4
Volume 4, Number 1, 1992
- Cornelis A. Middelburg
:
Modular Structuring of VDM Specifications in VVSL. 13-47 - Chris George:
The NDB Database Specified in the RAISE Specification Language. 48-75 - Ian J. Hayes:
VDM and Z: A Comparative Case Study. 76-99 - Edmund Kazmierczak:
Modularising the Specification of a Small Database System in Extended ML. 100-142
Volume 4, Number 2, 1992
- Parosh Aziz Abdulla:
Automatic Verification of a Class Systolic Circuits. 149-194 - Johan J. Lukkien, Jan L. A. van de Snepscheut:
Weakest Preconditions for Progress. 195-236
Volume 4, Number 3, 1992
- José Luiz Fiadeiro, T. S. E. Maibaum:
Temporal Theories as Modularisation Units for Concurrent System Specification. 239-272 - James H. Anderson, Mohamed G. Gouda:
A Criterion for Atomicity. 273-298 - Michael Fisher:
A Model Checker for Linear Time Temporal Logic. 299-319
Volume 4, Number 4, 1992
- Olaf Owe:
Axiomatic Treatment of Processes with shared Variables Revisited. 323-340 - Heinz Faßbender, Heiko Vogler:
An Implementation of Syntax Directed Functional Programming on Nested-Stack Machines. 341-375 - Pierre America, Jan J. M. M. Rutten:
A Layered Semantics for a Parallel Object-Oriented Language. 376-408
Volume 4, Number 5, 1992
- Lambert G. L. T. Meertens:
Paramorphisms. 413-424 - Jonathan P. Seldin:
Coquand's Calculus of Constructions: A Mathematical Foundation for a Proof Development System. 425-441 - Zhiming Liu, Mathai Joseph:
Transformation of Programs for Fault-Tolerance. 442-469 - J. Roger Hindley:
Types with Intersection: An Introduction. 470-486 - Andrew Kay, Peter Lupton:
Sequential to Parallel Buffer Refinement (Short Communication). 487-492
Volume 4, Number 6, 1992
- Fredrik Orava, Joachim Parrow:
An Algebraic Verification of a Mobile Network. 497-543 - Noureddine Boudriga, Fathi Elloumi, Ali Mili:
On the Lattice of Specifications: Applications to a Specification Methodology. 544-571 - Eike Best, Ludmila Cherkasova, Jörg Desel:
Compositional Generation of Home States in Free Choice Nets. 572-581 - Nissim Francez, Ralph-Johan Back, Reino Kurki-Suonio:
On Equivalence-Completions of Fairness Assumtions. 582-591
Volume 4, Number 6A, 1992
- David M. Russinoff:
A Verification System for Current Programs Based on the Boyer-Moore Prover. Formal Aspects Comput. 4(6A): 597-611 (1992) - Lucia Pomello, Carla Simone:
An Algebraic Characterisation of Elementary Net System (Observable) State Space. Formal Aspects Comput. 4(6A): 612-637 (1992) - José L. Balcázar, Joaquim Gabarró, Miklos Santha:
Deciding Bisimilarity is P-Complete. Formal Aspects Comput. 4(6A): 638-648 (1992) - M. W. Shields:
Multitraces, Hypertraces and Partial Order Semantics. Formal Aspects Comput. 4(6A): 649-672 (1992) - Maarten M. Fokkinga:
Calculate Categorically! Formal Aspects Comput. 4(6A): 673-692 (1992) - C. T. P. Burton:
Program Morphisms. Formal Aspects Comput. 4(6A): 693-726 (1992) - Masaaki Mizuno, David A. Schmidt:
A Security Flow Control Algorithm and Its Denotational Semantics Correctness Proof. Formal Aspects Comput. 4(6A): 727-754 (1992) - William R. Bevier, William D. Young:
Machine Checked Proofs of the Design of a Fault-Tolerance Circuit. Formal Aspects Comput. 4(6A): 755-775 (1992) - Jeroen Fokker:
The Systematic Construction of a One-Combinator Basis for Lambda-Terms. Formal Aspects Comput. 4(6A): 776-780 (1992)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2026-09-02 23:21 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
