On the public citation graph

Proof of correctness of data representations

https://doi.org/10.1007/bf00289507
0 signed · 921 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/bf01933419openalex-snapshot
A constructive approach to the problem of program correctness
inferredcites →https://doi.org/10.1145/357980.358001openalex-snapshot
An axiomatic basis for computer programming
inferredcites →https://doi.org/10.1145/357980.358010openalex-snapshot
Program development by stepwise refinement
inferredcites →https://doi.org/10.1145/362575.362577openalex-snapshot
Program development by stepwise refinement
inferredcites →https://doi.org/10.1145/363235.363259openalex-snapshot
An axiomatic basis for computer programming
inferredcites →https://doi.org/10.26153/tsw/52620openalex-snapshot
Structured programming
inferredcites →https://doi.org/10.26153/tsw/53177openalex-snapshot
Notes on Structured Programming

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/0471028959.sof179openalex-snapshot
Larch
inferred← citeshttps://doi.org/10.1002/0471028959.sof299openalex-snapshot
Computer Security
inferred← citeshttps://doi.org/10.1002/047134608x.w1601openalex-snapshot
Abstract Data Types
inferred← citeshttps://doi.org/10.1002/047134608x.w1681openalex-snapshot
Programming Theory
inferred← citeshttps://doi.org/10.1002/9780470050118.ecse001openalex-snapshot
Abstract Data Types
inferred← citeshttps://doi.org/10.1002/9780470593387.refsopenalex-snapshot
References
inferred← citeshttps://doi.org/10.1002/cpe.4330030403openalex-snapshot
The transputer and occam: A personal story
inferred← citeshttps://doi.org/10.1002/cpe.713openalex-snapshot
Modular specification of frame properties in JML
inferred← citeshttps://doi.org/10.1002/spe.4380080311openalex-snapshot
An exercise in program design using SIMULA class invariants
inferred← citeshttps://doi.org/10.1002/spe.4380080407openalex-snapshot
Another look at type compatibility in pascal
inferred← citeshttps://doi.org/10.1002/spe.4380120410openalex-snapshot
Two examples of block structuring
inferred← citeshttps://doi.org/10.1002/spe.4380141106openalex-snapshot
Dedicated, distributed and portable operating systems: A structuring concept
inferred← citeshttps://doi.org/10.1002/spe.4380251105openalex-snapshot
Experience with logical code analysis in software maintenance
inferred← citeshttps://doi.org/10.1002/stvr.327openalex-snapshot
Exploiting design patterns to automate validation of class invariants
inferred← citeshttps://doi.org/10.1002/stvr.368openalex-snapshot
Retracted and replaced: Software component composition: a subdomain‐based testing foundation
inferred← citeshttps://doi.org/10.1002/stvr.376openalex-snapshot
Software component composition: a subdomain‐based testing‐theory foundation
inferred← citeshttps://doi.org/10.1002/stvr.4370050404openalex-snapshot
Techniques for the verification and validation of knowledge‐based systems: A survey based on the symbol/knowledge level distinction
inferred← citeshttps://doi.org/10.1006/inco.2001.2927openalex-snapshot
Objects and Classes in Algol-Like Languages
inferred← citeshttps://doi.org/10.1006/inco.2002.3086openalex-snapshot
Secure Implementation of Channel Abstractions
inferred← citeshttps://doi.org/10.1006/jnca.1997.0050openalex-snapshot
Comparison of formal specification methods and object-oriented paradigms
inferred← citeshttps://doi.org/10.1007/0-387-24168-x_24openalex-snapshot
The Birth of Simula
inferred← citeshttps://doi.org/10.1007/1-4020-3532-2_1openalex-snapshot
Incremental Software Construction with Refinement Diagrams
inferred← citeshttps://doi.org/10.1007/1-4020-3532-2_4openalex-snapshot
The Dependent Delegate Dilemma
inferred← citeshttps://doi.org/10.1007/10722010_11openalex-snapshot
Liberating Data Refinement
inferred← citeshttps://doi.org/10.1007/10722581_18openalex-snapshot
Abstraction and Modularization in the BETA Programming Language
inferred← citeshttps://doi.org/10.1007/11526841_6openalex-snapshot
Controlling Object Allocation Using Creation Guards
inferred← citeshttps://doi.org/10.1007/11531142_17openalex-snapshot
State Based Ownership, Reentrance, and Encapsulation
inferred← citeshttps://doi.org/10.1007/11560647_31openalex-snapshot
On Refinement of Software Architectures
inferred← citeshttps://doi.org/10.1007/11561163_11openalex-snapshot
Assertion-Based Encapsulation, Object Invariants and Simulations
inferred← citeshttps://doi.org/10.1007/11561163_2openalex-snapshot
A Perspective on Component Refinement
inferred← citeshttps://doi.org/10.1007/11575467_3openalex-snapshot
Data Refinement with Low-Level Pointer Operations
inferred← citeshttps://doi.org/10.1007/11693024_9openalex-snapshot
A Verification Methodology for Model Fields
inferred← citeshttps://doi.org/10.1007/11766155_23openalex-snapshot
Allowing State Changes in Specifications
inferred← citeshttps://doi.org/10.1007/11768173_1openalex-snapshot
Retrospective and Prospective for Unifying Theories of Programming
inferred← citeshttps://doi.org/10.1007/11780274_16openalex-snapshot
Horizontal Composability Revisited
inferred← citeshttps://doi.org/10.1007/11785477_10openalex-snapshot
Peak Objects
inferred← citeshttps://doi.org/10.1007/11786160_3openalex-snapshot
Making Specifications Complete Through Models
inferred← citeshttps://doi.org/10.1007/11804192_16openalex-snapshot
Beyond Assertions: Advanced Specification and Verification with JML and ESC/Java2
inferred← citeshttps://doi.org/10.1007/11863908_15openalex-snapshot
A Formal Framework for Confidentiality-Preserving Refinement
inferred← citeshttps://doi.org/10.1007/11877028_6openalex-snapshot
Mappings Make Data Processing Go ’Round
inferred← citeshttps://doi.org/10.1007/11890591_2openalex-snapshot
Specifying the Semantics of Operation Contracts in Conceptual Modeling
inferred← citeshttps://doi.org/10.1007/11901433_2openalex-snapshot
JML’s Rich, Inherited Specifications for Behavioral Subtypes
inferred← citeshttps://doi.org/10.1007/11955757_4openalex-snapshot
Interpreting Invariant Composition in the B Method Using the Spec# Ownership Relation: A Way to Explain and Relax B Restrictions
inferred← citeshttps://doi.org/10.1007/3-540-06859-7_140openalex-snapshot
Application de la structuration de systeme a la conception interne du systeme GEMAU
inferred← citeshttps://doi.org/10.1007/3-540-07131-8_35openalex-snapshot
Formal definition in program development
inferred← citeshttps://doi.org/10.1007/3-540-07994-7_47openalex-snapshot
Parallel programming: An axiomatic approach
inferred← citeshttps://doi.org/10.1007/3-540-07994-7_56openalex-snapshot
The structure of an operating system
inferred← citeshttps://doi.org/10.1007/3-540-08442-8_74openalex-snapshot
Algebraic Semantics of Type Definitions and Structured Variables
inferred← citeshttps://doi.org/10.1007/3-540-08860-1_16openalex-snapshot
Stepwise specification and implementation of abstract data types
inferred← citeshttps://doi.org/10.1007/3-540-08921-7_56openalex-snapshot
Data types as functions
inferred← citeshttps://doi.org/10.1007/3-540-09541-1_25openalex-snapshot
A formal specification technique for abstract data types with parallelism
inferred← citeshttps://doi.org/10.1007/3-540-09541-1_33openalex-snapshot
The vienna development method (VDM)
inferred← citeshttps://doi.org/10.1007/3-540-09745-7_12openalex-snapshot
The design of a successor to pascal
inferred← citeshttps://doi.org/10.1007/3-540-09981-6_3openalex-snapshot
Types algebriques et semantique des langages de programmation
inferred← citeshttps://doi.org/10.1007/3-540-10007-5_39openalex-snapshot
An introduction to data algebras
inferred← citeshttps://doi.org/10.1007/3-540-10007-5_43openalex-snapshot
Modular program construction using abstractions
inferred← citeshttps://doi.org/10.1007/3-540-10250-7_18openalex-snapshot
Transforming denotational semantics into practical attribute grammars
inferred← citeshttps://doi.org/10.1007/3-540-10699-5_100openalex-snapshot
About data type genericity
inferred← citeshttps://doi.org/10.1007/3-540-10699-5_116openalex-snapshot
On the representation of data types
inferred← citeshttps://doi.org/10.1007/3-540-10699-5_94openalex-snapshot
Compiler generation from formal definition of programming languages : A survey
inferred← citeshttps://doi.org/10.1007/3-540-10843-2_12openalex-snapshot
Nondeterminism in abstract data types
inferred← citeshttps://doi.org/10.1007/3-540-11160-3_5openalex-snapshot
On the algorithmic theory of dictionaries
inferred← citeshttps://doi.org/10.1007/3-540-11490-4_16openalex-snapshot
Robust data types
inferred← citeshttps://doi.org/10.1007/3-540-11494-7_16openalex-snapshot
Proving the correctness of implementations of shared data abstractions
inferred← citeshttps://doi.org/10.1007/3-540-11604-4_45openalex-snapshot
Synchronization mechanisms for parallel processing
inferred← citeshttps://doi.org/10.1007/3-540-11981-7_2openalex-snapshot
On proving program correctness by means of stepwise refinement method
inferred← citeshttps://doi.org/10.1007/3-540-12689-9_116openalex-snapshot
Characterizing composability of abstract implementations
inferred← citeshttps://doi.org/10.1007/3-540-12896-4_366openalex-snapshot
Introducing institutions
inferred← citeshttps://doi.org/10.1007/3-540-13346-1_16openalex-snapshot
Partial implementations of abstract data types: A dissenting view on errors
inferred← citeshttps://doi.org/10.1007/3-540-15199-0_14openalex-snapshot
A theory of abstract data types for program development: Bridging the gap?
inferred← citeshttps://doi.org/10.1007/3-540-15199-0_4openalex-snapshot
Functional semantics of modules
inferred← citeshttps://doi.org/10.1007/3-540-15648-8_17openalex-snapshot
Continuation semantics in typed lambda-calculi
inferred← citeshttps://doi.org/10.1007/3-540-15648-8_29openalex-snapshot
A simple programming language with data types: semantics and verification
inferred← citeshttps://doi.org/10.1007/3-540-16442-1_14openalex-snapshot
Data refinement refined resume
inferred← citeshttps://doi.org/10.1007/3-540-16442-1_15openalex-snapshot
Proving entailment between conceptual state specifications
inferred← citeshttps://doi.org/10.1007/3-540-17654-3_15openalex-snapshot
VDM proof obligations and their justification
inferred← citeshttps://doi.org/10.1007/3-540-17945-3_7openalex-snapshot
Specifying functional and timing behavior for real-time applications
inferred← citeshttps://doi.org/10.1007/3-540-18088-5_45openalex-snapshot
Partial algebras flow from algebraic specifications
inferred← citeshttps://doi.org/10.1007/3-540-18508-9_27openalex-snapshot
Viewing implementations as an institution
inferred← citeshttps://doi.org/10.1007/3-540-18625-5_63openalex-snapshot
Hierarchical refinement of A Z specification
inferred← citeshttps://doi.org/10.1007/3-540-18740-5_61openalex-snapshot
Procedural implementation of algebraic specifications of abstract data types
inferred← citeshttps://doi.org/10.1007/3-540-40011-7_12openalex-snapshot
Swinging UML How to Make Class Diagrams and State Machines Amenable to Constraint Solving and Proving
inferred← citeshttps://doi.org/10.1007/3-540-40911-4_4openalex-snapshot
Formalizing Timing Diagrams as Causal Dependencies for Verification Purposes
inferred← citeshttps://doi.org/10.1007/3-540-44880-2_22openalex-snapshot
Towards Practical Proofs of Class Correctness
inferred← citeshttps://doi.org/10.1007/3-540-44904-3_10openalex-snapshot
Abstraction Barrier-Observing Relational Parametricity
inferred← citeshttps://doi.org/10.1007/3-540-44929-9_39openalex-snapshot
A Single Complete Refinement Rule for Demonic Specifications
inferred← citeshttps://doi.org/10.1007/3-540-45061-0_70openalex-snapshot
Axiomatic Criteria for Quotients and Subobjects for Higher-Order Data Types
inferred← citeshttps://doi.org/10.1007/3-540-45315-6_5openalex-snapshot
On the Duality between Observability and Reachability
inferred← citeshttps://doi.org/10.1007/3-540-45442-x_11openalex-snapshot
Verification of Java’s AbstractCollection Class: A Case Study
inferred← citeshttps://doi.org/10.1007/3-540-45500-0_25openalex-snapshot
Lightweight Analysis of Object Interactions
inferred← citeshttps://doi.org/10.1007/3-540-45575-2_13openalex-snapshot
Transformational Construction of Correct Pointer Algorithms
inferred← citeshttps://doi.org/10.1007/3-540-45614-7_26openalex-snapshot
Refinement in Circus
inferred← citeshttps://doi.org/10.1007/3-540-45614-7_27openalex-snapshot
Forward Simulation for Data Refinement of Classes
inferred← citeshttps://doi.org/10.1007/3-540-45687-2_1openalex-snapshot
Global Development via Local Observational Construction Steps
inferred← citeshttps://doi.org/10.1007/3-540-45719-4_23openalex-snapshot
Extending JML Specifications with Temporal Logic
inferred← citeshttps://doi.org/10.1007/3-540-46432-8_11openalex-snapshot
Constructive Data Refinement in Typed Lambda Calculus
inferred← citeshttps://doi.org/10.1007/3-540-46432-8_9openalex-snapshot
A Higher-Order Simulation Relation for System F
inferred← citeshttps://doi.org/10.1007/3-540-46589-8_8openalex-snapshot
Aliasing in Object Oriented Systems
inferred← citeshttps://doi.org/10.1007/3-540-46674-6_14openalex-snapshot
Logical Relations in Circuit Verification
inferred← citeshttps://doi.org/10.1007/3-540-47910-4_8openalex-snapshot
A New Definition of the Subtype Relation
inferred← citeshttps://doi.org/10.1007/3-540-48118-4_1openalex-snapshot
From informal requirements to COOP: a concurrent automata approach
inferred← citeshttps://doi.org/10.1007/3-540-48119-2_2openalex-snapshot
Scientific Decisions which Characterize VDM
inferred← citeshttps://doi.org/10.1007/3-540-48153-2_3openalex-snapshot
A Proof of Correctness of a Processor Implementing Tomasulo’s Algorithm without a Reorder Buffer
inferred← citeshttps://doi.org/10.1007/3-540-48153-2_5openalex-snapshot
Superscalar Processor Verification Using Efficient Reductions of the Logic of Equality with Uninterpreted Functions to Propositional Logic
inferred← citeshttps://doi.org/10.1007/3-540-48168-0_39openalex-snapshot
Data-Refinement for Call-By-Value Programming Languages
inferred← citeshttps://doi.org/10.1007/3-540-48256-3_4openalex-snapshot
Isomorphisms — A Link Between the Shallow and the Deep
inferred← citeshttps://doi.org/10.1007/3-540-48749-2_2openalex-snapshot
Protection in Programming-Language Translations
inferred← citeshttps://doi.org/10.1007/3-540-48754-9_1openalex-snapshot
Microprocessor Verification Using Efficient Decision Procedures for a Logic of Equality with Uninterpreted Functions
inferred← citeshttps://doi.org/10.1007/3-540-48958-4_4openalex-snapshot
Using Decision Procedures to Accelerate Domain-Specific Deductive Synthesis Systems
inferred← citeshttps://doi.org/10.1007/3-540-49213-5_6openalex-snapshot
Compositional Refinement of Interactive Systems Modelled by Relations
inferred← citeshttps://doi.org/10.1007/3-540-49254-2_12openalex-snapshot
An Exercise in Conditional Refinement
inferred← citeshttps://doi.org/10.1007/3-540-49255-0_25openalex-snapshot
Consistent Extension of Components in Presence of Explicit Invariants
inferred← citeshttps://doi.org/10.1007/3-540-49477-4_2openalex-snapshot
A Logical Basis for Modular Software and Systems Engineering
inferred← citeshttps://doi.org/10.1007/3-540-49519-3_3openalex-snapshot
Bit-Level Abstraction in the Verification of Pipelined Microprocessors by Correspondence Checking
inferred← citeshttps://doi.org/10.1007/3-540-50302-1_14openalex-snapshot
Reasoning about atomic objects
inferred← citeshttps://doi.org/10.1007/3-540-50325-0_7openalex-snapshot
The specification language of OBSCURE
inferred← citeshttps://doi.org/10.1007/3-540-50325-0_9openalex-snapshot
Observing nondeterministic data types
inferred← citeshttps://doi.org/10.1007/3-540-51305-1_11openalex-snapshot
Towards a calculus of data refinement
inferred← citeshttps://doi.org/10.1007/3-540-52513-0_1openalex-snapshot
Object orientation and formal techniques
inferred← citeshttps://doi.org/10.1007/3-540-52513-0_19openalex-snapshot
Refining data to processes
inferred← citeshttps://doi.org/10.1007/3-540-52513-0_2openalex-snapshot
An algebraic approach to refinement
inferred← citeshttps://doi.org/10.1007/3-540-52559-9_59openalex-snapshot
Composing specifications
inferred← citeshttps://doi.org/10.1007/3-540-52559-9_60openalex-snapshot
Refinement calculus, part I: Sequential nondeterministic programs
inferred← citeshttps://doi.org/10.1007/3-540-52559-9_79openalex-snapshot
Formal verification of data type refinement — Theory and practice
inferred← citeshttps://doi.org/10.1007/3-540-52559-9_85openalex-snapshot
Verifying atomic data types
inferred← citeshttps://doi.org/10.1007/3-540-52559-9_86openalex-snapshot
Predicates, predicate transformers and refinement
inferred← citeshttps://doi.org/10.1007/3-540-53982-4_9openalex-snapshot
Program specification and data refinement in type theory
inferred← citeshttps://doi.org/10.1007/3-540-54152-7_62openalex-snapshot
Program refinement in fair transition systems
inferred← citeshttps://doi.org/10.1007/3-540-54430-5_90openalex-snapshot
Synchrony loosening transformations for interacting processes
inferred← citeshttps://doi.org/10.1007/3-540-54430-5_99openalex-snapshot
Simulations between specifications of distributed systems
inferred← citeshttps://doi.org/10.1007/3-540-54496-8_8openalex-snapshot
A notion of implementation for the specification language OBSCURE
inferred← citeshttps://doi.org/10.1007/3-540-54834-3_9openalex-snapshot
A model-oriented method for algebraic specifications using COLD-1 as notation
inferred← citeshttps://doi.org/10.1007/3-540-55719-9_111openalex-snapshot
Interfaces between languages for communicating systems
inferred← citeshttps://doi.org/10.1007/3-540-55963-9_45openalex-snapshot
Formal methods for software engineers: Tradeoffs in curriculum design
inferred← citeshttps://doi.org/10.1007/3-540-56287-7_109openalex-snapshot
Verification of large software systems
inferred← citeshttps://doi.org/10.1007/3-540-56379-2_36openalex-snapshot
Implementation and behavioural equivalence: A survey
inferred← citeshttps://doi.org/10.1007/3-540-56379-2_40openalex-snapshot
Bounded implementation of algebraic specifications
inferred← citeshttps://doi.org/10.1007/3-540-56610-4_74openalex-snapshot
A technique for specifying and refining TCSP processes by using guards and liveness conditions
inferred← citeshttps://doi.org/10.1007/3-540-56610-4_82openalex-snapshot
Constructing systems as object communities
inferred← citeshttps://doi.org/10.1007/3-540-58043-3_30openalex-snapshot
Partial order based design of concurrent systems
inferred← citeshttps://doi.org/10.1007/3-540-58495-1_33openalex-snapshot
Amphion: Automatic programming for scientific subroutine libraries
inferred← citeshttps://doi.org/10.1007/3-540-59293-8_184openalex-snapshot
A decade of TAPSOFT
inferred← citeshttps://doi.org/10.1007/3-540-60043-4_51openalex-snapshot
Proving the correctness of behavioural implementations
inferred← citeshttps://doi.org/10.1007/3-540-60117-1_22openalex-snapshot
Specware: Formal support for composing software
inferred← citeshttps://doi.org/10.1007/3-540-60117-1_23openalex-snapshot
A refinement relation supporting the transition from unbounded to bounded communication buffers
inferred← citeshttps://doi.org/10.1007/3-540-61064-2_41openalex-snapshot
Behavioural satisfaction and equivalence in concrete model categories
inferred← citeshttps://doi.org/10.1007/3-540-61550-4_143openalex-snapshot
Mind the gap! Abstract versus concrete models of specifications
inferred← citeshttps://doi.org/10.1007/3-540-61550-4_159openalex-snapshot
Simulation of specification statements in Hoare logic
inferred← citeshttps://doi.org/10.1007/3-540-63533-5_5openalex-snapshot
Class refinement and interface refinement in object-oriented programs
inferred← citeshttps://doi.org/10.1007/3-540-63875-x_40openalex-snapshot
Verification of pipelined microprocessors by comparing memory execution sequences in symbolic simulation
inferred← citeshttps://doi.org/10.1007/3-540-64299-4_31openalex-snapshot
Implementation of derived programs (almost) for free
inferred← citeshttps://doi.org/10.1007/978-0-387-09766-4_301openalex-snapshot
Monitors, Axiomatic Verification of
inferred← citeshttps://doi.org/10.1007/978-0-387-21798-7_12openalex-snapshot
Object models as heap invariants
inferred← citeshttps://doi.org/10.1007/978-0-387-21798-7_13openalex-snapshot
Abstraction dependencies
inferred← citeshttps://doi.org/10.1007/978-0-387-35264-0_2openalex-snapshot
Calculating With Pointer Structures
inferred← citeshttps://doi.org/10.1007/978-0-585-27524-6_8openalex-snapshot
An Overview of Larch/C++: Behavioral Specifications for C++ Modules
inferred← citeshttps://doi.org/10.1007/978-0-85729-277-3_10openalex-snapshot
Predicate Logic
inferred← citeshttps://doi.org/10.1007/978-1-4419-0176-7_13openalex-snapshot
Designing a Flexible Framework for a Table Abstraction
inferred← citeshttps://doi.org/10.1007/978-1-4419-5998-0_6openalex-snapshot
Connecting Different Proof Styles
inferred← citeshttps://doi.org/10.1007/978-1-4419-8596-5openalex-snapshot
A Practical Theory of Programming
inferred← citeshttps://doi.org/10.1007/978-1-4419-8596-5_11openalex-snapshot
Reference
inferred← citeshttps://doi.org/10.1007/978-1-4471-3229-5_10openalex-snapshot
Multiparadigm Specification Languages: a First Attempt at Foundations
inferred← citeshttps://doi.org/10.1007/978-1-4471-3240-0_7openalex-snapshot
Program Refinement by Theorem Prover
inferred← citeshttps://doi.org/10.1007/978-1-4471-3273-8_7openalex-snapshot
Data Refinement by Calculation
inferred← citeshttps://doi.org/10.1007/978-1-4471-3431-2_5openalex-snapshot
Concurrent and Distributed Systems
inferred← citeshttps://doi.org/10.1007/978-1-4471-3452-7_5openalex-snapshot
Integrating Formal Methods into a Professional Master of Software Engineering Program
inferred← citeshttps://doi.org/10.1007/978-1-4471-3544-9_12openalex-snapshot
Efficient Circuits as Implementations of Non-Strict Functions
inferred← citeshttps://doi.org/10.1007/978-1-4471-3550-0_15openalex-snapshot
Revisiting Abstraction Functions For Reasoning About Concurrency
inferred← citeshttps://doi.org/10.1007/978-1-4471-3550-0_9openalex-snapshot
Classification of Refinements in VDM
inferred← citeshttps://doi.org/10.1007/978-1-4471-3558-6_10openalex-snapshot
Preliminary Design of Larch/C++
inferred← citeshttps://doi.org/10.1007/978-1-4471-3558-6_8openalex-snapshot
Formal Verification of Ada Programs
inferred← citeshttps://doi.org/10.1007/978-1-4471-3756-6_11openalex-snapshot
Transforming axioms for data types into sequential programs
inferred← citeshttps://doi.org/10.1007/978-1-4471-3756-6_12openalex-snapshot
Refinement of two graph problems
inferred← citeshttps://doi.org/10.1007/978-1-4471-3756-6_5openalex-snapshot
Assertional Data Reification Proofs: Survey and Perspective
inferred← citeshttps://doi.org/10.1007/978-1-4471-5355-9_3openalex-snapshot
Data Refinement and Simulations
inferred← citeshttps://doi.org/10.1007/978-1-4612-4118-8_11openalex-snapshot
Syntactic Control of Interference
inferred← citeshttps://doi.org/10.1007/978-1-4612-4118-8_4openalex-snapshot
The Essence of Algol
inferred← citeshttps://doi.org/10.1007/978-1-4612-5196-5_3openalex-snapshot
The Impact of Modelling and Abstraction Concerns on Modern Programming Languages
inferred← citeshttps://doi.org/10.1007/978-1-4612-5517-8openalex-snapshot
Studies in Ada Style
inferred← citeshttps://doi.org/10.1007/978-1-4612-5979-4_10openalex-snapshot
Abstraction and Verification in Alphard: Design and Verification of a Tree Handler
inferred← citeshttps://doi.org/10.1007/978-1-4612-5979-4_11openalex-snapshot
Abstraction and Verification in Alphard: A Symbol Table Example
inferred← citeshttps://doi.org/10.1007/978-1-4612-5979-4_17openalex-snapshot
Validating the Utility of Abstraction Techniques
inferred← citeshttps://doi.org/10.1007/978-1-4612-5979-4_2openalex-snapshot
Introduction History and Overview
inferred← citeshttps://doi.org/10.1007/978-1-4612-5979-4_4openalex-snapshot
Abstraction and Verification in Alphard: Introduction to Language and Methodology
inferred← citeshttps://doi.org/10.1007/978-1-4612-5979-4_5openalex-snapshot
Remarks on the Impact of Program Verification on Language Design
inferred← citeshttps://doi.org/10.1007/978-1-4612-5979-4_7openalex-snapshot
Abstraction and Verification in Alphard: Iteration and Generators
inferred← citeshttps://doi.org/10.1007/978-1-4612-5979-4_8openalex-snapshot
Achieving Quality Software: Reflections on the Aims and Objectives of Alphard
inferred← citeshttps://doi.org/10.1007/978-1-4613-1437-0_6openalex-snapshot
Semantic Refinement of Concurrent Object Systems Based on Serializability
inferred← citeshttps://doi.org/10.1007/978-1-4613-9614-7_9openalex-snapshot
A First Course in Computer Science: Mathematical Principles for Software Engineering
inferred← citeshttps://doi.org/10.1007/978-1-4613-9685-7_5openalex-snapshot
Package Specifications
inferred← citeshttps://doi.org/10.1007/978-1-4613-9685-7_9openalex-snapshot
Annotation of the Hidden Parts of Packages
inferred← citeshttps://doi.org/10.1007/978-1-4615-0413-9_16openalex-snapshot
Tool Support for Contract Enhanced Scenarios
inferred← citeshttps://doi.org/10.1007/978-1-4615-3556-0_2openalex-snapshot
Formal Hardware Verification Methods: A Survey
inferred← citeshttps://doi.org/10.1007/978-1-4615-5229-1_12openalex-snapshot
JML: A Notation for Detailed Design
inferred← citeshttps://doi.org/10.1007/978-1-4615-8249-6_3openalex-snapshot
Data Structure Models in Information System Design
inferred← citeshttps://doi.org/10.1007/978-1-4615-8297-7_7openalex-snapshot
Equations Compared with Clauses for Specification of Abstract Data Types
inferred← citeshttps://doi.org/10.1007/978-1-4684-3384-5_9openalex-snapshot
Nondeterministic Languages Used for the Definition of Data Models
inferred← citeshttps://doi.org/10.1007/978-1-4757-3472-0_1openalex-snapshot
The Invention of Concurrent Programming
inferred← citeshttps://doi.org/10.1007/978-1-4757-3472-0_10openalex-snapshot
Monitors: An Operating System Structuring Concept
inferred← citeshttps://doi.org/10.1007/978-1-4757-3472-0_16openalex-snapshot
Communicating Sequential Processes
showing the first 200 of 914 · page through all 914
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.