On the public citation graph
An axiomatic definition of the programming language PASCAL
0 signed · 417 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/spe.4380010403openalex-snapshot
The design of a pascal compiler
inferredcites →https://doi.org/10.1002/spe.4380020108openalex-snapshot
A pascal compiler for ICL 1900 series computers
inferredcites →https://doi.org/10.1007/3-540-06720-5_1openalex-snapshot
An axiomatic definition of the programming language PASCAL
inferredcites →https://doi.org/10.1080/00222936208651257openalex-snapshot
Notes on Phymatidae in the British Museum (Nat. Hist.), (Hemiptera-Heteroptera)
inferredcites →https://doi.org/10.1145/357980.358001openalex-snapshot
An axiomatic basis for computer programming
inferredcites →https://doi.org/10.1145/363235.363259openalex-snapshot
An axiomatic basis for computer programming
inferredcites →https://doi.org/10.1145/366193.366201openalex-snapshot
Revised report on the algorithmic language ALGOL 60
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/(sici)1099-1689(199906)9:2<85::aid-stvr178>3.0.co;2-2openalex-snapshot
Towards a transformational approach to program verification
inferred← citeshttps://doi.org/10.1002/spe.4380070311openalex-snapshot
On code generation in a PASCAL compiler
inferred← citeshttps://doi.org/10.1002/spe.4380070604openalex-snapshot
Ambiguities and insecurities in pascal
inferred← citeshttps://doi.org/10.1002/spe.4380080110openalex-snapshot
Economic range checks in pascal
inferred← citeshttps://doi.org/10.1002/spe.4380080111openalex-snapshot
Error‐checking compilers and portability
inferred← citeshttps://doi.org/10.1002/spe.4380080407openalex-snapshot
Another look at type compatibility in pascal
inferred← citeshttps://doi.org/10.1002/spe.4380090807openalex-snapshot
Strings and the sequence abstraction in Pascal
inferred← citeshttps://doi.org/10.1002/spe.4380110208openalex-snapshot
The architecture of the PLAIN data base handler
inferred← citeshttps://doi.org/10.1002/spe.4380120508openalex-snapshot
An alternative approach to arrays
inferred← citeshttps://doi.org/10.1002/spe.4380140803openalex-snapshot
The use of ghost variables and virtual programming in the documentation and verification of programs
inferred← citeshttps://doi.org/10.1002/spe.4380160104openalex-snapshot
Executable semantic descriptions
inferred← citeshttps://doi.org/10.1007/10722010_8openalex-snapshot
Proving Pointer Programs in Hoare Logic
inferred← citeshttps://doi.org/10.1007/11804192_17openalex-snapshot
Boogie: A Modular Reusable Verifier for Object-Oriented Programs
inferred← citeshttps://doi.org/10.1007/11828563_4openalex-snapshot
An Axiomatization of Arrays for Kleene Algebra with Tests
inferred← citeshttps://doi.org/10.1007/3-540-06859-7_124openalex-snapshot
Proving program correctness in LCF
inferred← citeshttps://doi.org/10.1007/3-540-06859-7_147openalex-snapshot
Behavioral semantics of nonrecursive control structures
inferred← citeshttps://doi.org/10.1007/3-540-07131-8_37openalex-snapshot
Axiomatisierung von Programmiersprachen und ihre Grenzen
inferred← citeshttps://doi.org/10.1007/3-540-07141-5_209openalex-snapshot
Toward a Methodology for Designing Large Systems and Verifying Their Properties
inferred← citeshttps://doi.org/10.1007/3-540-07389-2_198openalex-snapshot
Control structures in single block programs
inferred← citeshttps://doi.org/10.1007/3-540-07854-1_157openalex-snapshot
Exercises in denotational semantics
inferred← citeshttps://doi.org/10.1007/3-540-07994-7_53openalex-snapshot
Programming as an evolutionary process
inferred← citeshttps://doi.org/10.1007/3-540-08138-0_17openalex-snapshot
Formale Korrektheitsbeweise für While-Programme
inferred← citeshttps://doi.org/10.1007/3-540-08342-1_3openalex-snapshot
Semantics and proof theory of pascal procedures
inferred← citeshttps://doi.org/10.1007/3-540-08921-7_52openalex-snapshot
The connection between modal logic and algorithmic logics
inferred← citeshttps://doi.org/10.1007/3-540-09118-1_3openalex-snapshot
Can partial correctness assertions specify programming language semantics?
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-10256-6_7openalex-snapshot
Conclusions and further research
inferred← citeshttps://doi.org/10.1007/3-540-10574-3openalex-snapshot
Directions in Human Factors for Interactive Systems
inferred← citeshttps://doi.org/10.1007/3-540-10574-3_2openalex-snapshot
Directions in human factors for interactive systems
inferred← citeshttps://doi.org/10.1007/3-540-10843-2_30openalex-snapshot
Automatic construction of verification condition generators from hoare logics
inferred← citeshttps://doi.org/10.1007/3-540-10856-4_120openalex-snapshot
Axiomatic semantics of indirect addressing
inferred← citeshttps://doi.org/10.1007/3-540-11490-4_17openalex-snapshot
A reduction specification for DTL
inferred← citeshttps://doi.org/10.1007/3-540-15648-8_15openalex-snapshot
Partial-correctness theories as first-order theories
inferred← citeshttps://doi.org/10.1007/3-540-15984-3_308openalex-snapshot
Correctness proofs of the implementation of abstract data types
inferred← citeshttps://doi.org/10.1007/3-540-27662-9_7openalex-snapshot
A Methodology for Collecting Valid Software Engineering Data
inferred← citeshttps://doi.org/10.1007/3-540-36103-0_2openalex-snapshot
Developing Quality Software Systems Using the SOFL Formal Engineering Method
inferred← citeshttps://doi.org/10.1007/3-540-57887-0_96openalex-snapshot
A purely functional language with encapsulated assignment
inferred← citeshttps://doi.org/10.1007/3540069585_59openalex-snapshot
Introduction to Compiler Compilers
inferred← citeshttps://doi.org/10.1007/978-1-4612-4118-8_7openalex-snapshot
Idealized Algol and its Specification Logic
inferred← citeshttps://doi.org/10.1007/978-1-4612-5196-5_10openalex-snapshot
On the Design and Specification of Database Transactions
inferred← citeshttps://doi.org/10.1007/978-1-4612-5196-5_13openalex-snapshot
The Functional Data Model and its Uses for Interaction with Databases
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-9685-7_8openalex-snapshot
Annotation of Operations on Composite Types
inferred← citeshttps://doi.org/10.1007/978-1-4615-9984-5_15openalex-snapshot
How to use the PASCAL 6000-3.4 System
inferred← citeshttps://doi.org/10.1007/978-1-4684-5775-9_5openalex-snapshot
Reliable programming in standard languages
inferred← citeshttps://doi.org/10.1007/978-1-84882-912-1_1openalex-snapshot
Insight, Inspiration and Collaboration
inferred← citeshttps://doi.org/10.1007/978-3-030-38800-3_9openalex-snapshot
Origins and Development of Formal Methods
inferred← citeshttps://doi.org/10.1007/978-3-030-71374-4_1openalex-snapshot
Rooting Formal Methods Within Higher Education Curricula for Computer Science and Software Engineering — A White Paper —
inferred← citeshttps://doi.org/10.1007/978-3-030-71374-4_2openalex-snapshot
Axiom Based Testing for Fun and Pedagogy
inferred← citeshttps://doi.org/10.1007/978-3-031-98208-8_2openalex-snapshot
Testing-Based Formal Verification with Program Slicing on Functional Soundness and Completeness
inferred← citeshttps://doi.org/10.1007/978-3-319-04915-1_1openalex-snapshot
Combining Specification-Based Testing, Correctness Proof, and Inspection for Program Verification in Practice
inferred← citeshttps://doi.org/10.1007/978-3-319-97226-8_4openalex-snapshot
Formal Semantics of ALGOL 60: Four Descriptions in their Historical Context
inferred← citeshttps://doi.org/10.1007/978-3-322-99367-0_1openalex-snapshot
Allgemeine Eigenschaften von Algorithmen und Programmen
inferred← citeshttps://doi.org/10.1007/978-3-540-30579-8_11openalex-snapshot
Abstract Interpretation with Alien Expressions and Heap Structures
inferred← citeshttps://doi.org/10.1007/978-3-540-37500-5_15openalex-snapshot
How to Use the PASCAL 6000–3.4 System
inferred← citeshttps://doi.org/10.1007/978-3-540-45213-3_1openalex-snapshot
The Essence of Programming Languages
inferred← citeshttps://doi.org/10.1007/978-3-540-69149-5_2openalex-snapshot
Towards a Worldwide Verification Technology
inferred← citeshttps://doi.org/10.1007/978-3-540-76550-9_8openalex-snapshot
Die 2000er Jahre bis 2006
inferred← citeshttps://doi.org/10.1007/978-3-642-29709-0_29openalex-snapshot
Development of the Computer Language Classification Knowledge Portal
inferred← citeshttps://doi.org/10.1007/978-3-642-46620-5_16openalex-snapshot
Reasoning about Theories with a Finite Model
inferred← citeshttps://doi.org/10.1007/978-3-642-48354-7_16openalex-snapshot
Abstract Data Types and the Development of Data Structures
inferred← citeshttps://doi.org/10.1007/978-3-642-58154-0_5openalex-snapshot
Syntaktische und semantische Definition algorithmischer Sprachen
inferred← citeshttps://doi.org/10.1007/978-3-642-58722-1_13openalex-snapshot
Maschinennahe Programmstrukturen
inferred← citeshttps://doi.org/10.1007/978-3-642-58722-1_9openalex-snapshot
Objektorientierte Programmierung
inferred← citeshttps://doi.org/10.1007/978-3-642-59412-0_22openalex-snapshot
Assertions: A Personal Perspective
inferred← citeshttps://doi.org/10.1007/978-3-642-59412-0_29openalex-snapshot
Abstract Data Types and the Development of Data Structures
inferred← citeshttps://doi.org/10.1007/978-3-642-66319-2_2openalex-snapshot
Anwendung der Axiomatischen Definitionsmethode Auf Höhere Programmiersprachen
inferred← citeshttps://doi.org/10.1007/978-3-642-66635-3_4openalex-snapshot
Eigenschaften der Prädikatenlogik
inferred← citeshttps://doi.org/10.1007/978-3-642-67091-6_6openalex-snapshot
Entwicklungslinien in der Informatik
inferred← citeshttps://doi.org/10.1007/978-3-642-67444-0_12openalex-snapshot
Erfahrungen Mit Neueren Methoden Zur Konstruktion Zuverlässiger Software Bei Der Realisierung Eines Vermittlungssystems Für Rechnernetze In Der Fertigungssteuerung
inferred← citeshttps://doi.org/10.1007/978-3-642-67600-0_5openalex-snapshot
A Critical Review of PASCAL Based on a Formal Storage Model
inferred← citeshttps://doi.org/10.1007/978-3-642-69393-9_2openalex-snapshot
Programmverifikation in lauffähigen PASCAL-Programmen
inferred← citeshttps://doi.org/10.1007/978-3-642-76562-9_14openalex-snapshot
Werkzeuggestützter Nachweis von Verläßlichkeitseigenschaften
inferred← citeshttps://doi.org/10.1007/978-3-642-76562-9_3openalex-snapshot
Formale Spezifikation und Verifikation - Ein Überblick -
inferred← citeshttps://doi.org/10.1007/978-3-642-83091-4_25openalex-snapshot
Use of Software Reliability Tools in Information System Failure Analysis
inferred← citeshttps://doi.org/10.1007/978-3-642-87956-2_13openalex-snapshot
The connection between Axiomatic and Denotational Semantics of Programming Languages
inferred← citeshttps://doi.org/10.1007/978-3-642-96811-2_5openalex-snapshot
Syntaktische und semantische Definition algorithmischer Sprachen
inferred← citeshttps://doi.org/10.1007/978-3-658-18121-5_1openalex-snapshot
Allgemeine Eigenschaften von Algorithmen und Programmen
inferred← citeshttps://doi.org/10.1007/978-3-662-02328-0_24openalex-snapshot
Program Veriflcation at Stanford: Past, Present, Future
inferred← citeshttps://doi.org/10.1007/978-3-662-09507-2_1openalex-snapshot
Programming Languages—The First 25 Years
inferred← citeshttps://doi.org/10.1007/978-3-662-09507-2_16openalex-snapshot
Notes on the Design of Euclid
inferred← citeshttps://doi.org/10.1007/978-3-662-09507-2_2openalex-snapshot
On the Design of Programming Languages
inferred← citeshttps://doi.org/10.1007/978-3-662-09507-2_8openalex-snapshot
Ambiguities and Insecurities in Pascal
inferred← citeshttps://doi.org/10.1007/978-3-662-09507-2_9openalex-snapshot
An Assessment of the Programming Language Pascal
inferred← citeshttps://doi.org/10.1007/978-3-662-10817-8_2openalex-snapshot
Strukturiertes Programmieren
inferred← citeshttps://doi.org/10.1007/978-3-7091-4009-3_8openalex-snapshot
Compiler Correctness and Input/Output
inferred← citeshttps://doi.org/10.1007/978-94-009-7893-5_3openalex-snapshot
A General Axiom of Assignment
inferred← citeshttps://doi.org/10.1007/978-94-010-1226-3_11openalex-snapshot
Problem-/Language-Orientated Architecture
inferred← citeshttps://doi.org/10.1007/978-981-97-2285-3_7openalex-snapshot
Specification-Based Inspection
inferred← citeshttps://doi.org/10.1007/bf00260921openalex-snapshot
Proof rules for the programming language Euclid
inferred← citeshttps://doi.org/10.1007/bf00260922openalex-snapshot
The algebraic specification of abstract data types
inferred← citeshttps://doi.org/10.1007/bf00261259openalex-snapshot
The clean termination of iterative programs
inferred← citeshttps://doi.org/10.1007/bf00263741openalex-snapshot
Specification and proving of command programs
inferred← citeshttps://doi.org/10.1007/bf00264252openalex-snapshot
The axiomatic semantics of programs based on Hoare's logic
inferred← citeshttps://doi.org/10.1007/bf00268496openalex-snapshot
SEMANOL (73) a metalanguage for programming the semantics of programming languages
inferred← citeshttps://doi.org/10.1007/bf00269810openalex-snapshot
Language design methods based on semantic principles: Algol 68, a Language Designed using Semantic Principles
inferred← citeshttps://doi.org/10.1007/bf00276182openalex-snapshot
Proof of termination within a weak logic of programs
inferred← citeshttps://doi.org/10.1007/bf00288728openalex-snapshot
More comments on the programming language Pascal
inferred← citeshttps://doi.org/10.1007/bf00288745openalex-snapshot
The verification and synthesis of data structures
inferred← citeshttps://doi.org/10.1007/bf00288746openalex-snapshot
Automatic program verification I: A logical basis and its implementation
inferred← citeshttps://doi.org/10.1007/bf00288883openalex-snapshot
Design and correctness of a compiler for a non-procedural language
inferred← citeshttps://doi.org/10.1007/bf00289061openalex-snapshot
Correctness of the compiling process based on axiomatic semantics
inferred← citeshttps://doi.org/10.1007/bf00289066openalex-snapshot
The clean termination of Pascal programs
inferred← citeshttps://doi.org/10.1007/bf00289243openalex-snapshot
Language design methods based on semantic principles
inferred← citeshttps://doi.org/10.1007/bf00289309openalex-snapshot
The formal definition of a real-time language
inferred← citeshttps://doi.org/10.1007/bf00985823openalex-snapshot
The use of hoare logic in the verification of horizontal microprograms
inferred← citeshttps://doi.org/10.1007/bf01069058openalex-snapshot
Current methods for proving program correctness
inferred← citeshttps://doi.org/10.1007/bf01069174openalex-snapshot
Practical methods of program verification
inferred← citeshttps://doi.org/10.1007/bf01383985openalex-snapshot
Deriving correctness properties of compiled code
inferred← citeshttps://doi.org/10.1007/bf01932133openalex-snapshot
An axiomatic treatment ofSIMD assignment
inferred← citeshttps://doi.org/10.1007/bf01933186openalex-snapshot
Monitors with arrays of condition variables and proof rules handling local quantities
inferred← citeshttps://doi.org/10.1007/bf01941139openalex-snapshot
Simd language design using prescriptive semantics
inferred← citeshttps://doi.org/10.1007/bf02281721openalex-snapshot
Embedding universal computer arithmetic in higher programming languages
inferred← citeshttps://doi.org/10.1007/bf02850791openalex-snapshot
The formal specifications for protocols of decoders
inferred← citeshttps://doi.org/10.1007/bfb0014665openalex-snapshot
A case study in language design: Euclid
inferred← citeshttps://doi.org/10.1007/bfb0014666openalex-snapshot
Proof rules for the programming language Euclid
inferred← citeshttps://doi.org/10.1007/bfb0014674openalex-snapshot
A study on transformational semantics
inferred← citeshttps://doi.org/10.1007/bfb0014680openalex-snapshot
Programing languages for reliable computing systems
inferred← citeshttps://doi.org/10.1007/bfb0021421openalex-snapshot
Some issues in data types and type checking
inferred← citeshttps://doi.org/10.1007/bfb0022497openalex-snapshot
Abstract data types: A retrospective and prospective view
inferred← citeshttps://doi.org/10.1007/bfb0022532openalex-snapshot
Axioms of algorithmic logic univocally determine semantics of programs
inferred← citeshttps://doi.org/10.1007/bfb0025735openalex-snapshot
Definition of programming language semantics using grammars for hierarchical graphs
inferred← citeshttps://doi.org/10.1007/bfb0025790openalex-snapshot
A critique of the foundations of Hoare-style programming logics
inferred← citeshttps://doi.org/10.1007/bfb0029351openalex-snapshot
Correctness of realizations of levels of abstraction in Operating Systems
inferred← citeshttps://doi.org/10.1007/bfb0029529openalex-snapshot
Programming language semantics in a typed lambda-calculus
inferred← citeshttps://doi.org/10.1007/bfb0039133openalex-snapshot
On the structure of algorithmic problems
inferred← citeshttps://doi.org/10.1007/s00165-019-00501-3openalex-snapshot
Fifty years of Hoare’s logic
inferred← citeshttps://doi.org/10.1007/s00236-006-0029-5openalex-snapshot
Verification conditions are code
inferred← citeshttps://doi.org/10.1007/s10515-008-0036-6openalex-snapshot
Reasoning about programs via operational semantics: requirements for a support system
inferred← citeshttps://doi.org/10.1007/s11704-011-0130-yopenalex-snapshot
Pre-post notation is questionable in effectively specifying operations of object-oriented systems
inferred← citeshttps://doi.org/10.1016/0020-0190(76)90024-7openalex-snapshot
A note on the semantic definition of side effects
inferred← citeshttps://doi.org/10.1016/0020-0190(76)90082-xopenalex-snapshot
A proof rule for multiple coroutine systems
inferred← citeshttps://doi.org/10.1016/0020-0190(79)90132-7openalex-snapshot
Aliasing among pointers in EUCLID
inferred← citeshttps://doi.org/10.1016/0020-0190(83)90090-xopenalex-snapshot
Is an exit statement sufficient?
inferred← citeshttps://doi.org/10.1016/0020-0190(91)90058-popenalex-snapshot
Axiomatic semantics for “escape” statements
inferred← citeshttps://doi.org/10.1016/0022-0000(82)90013-7openalex-snapshot
Expressiveness and the completeness of Hoare's logic
inferred← citeshttps://doi.org/10.1016/0041-5553(78)90180-5openalex-snapshot
A new language for structured programming
inferred← citeshttps://doi.org/10.1016/0096-0551(77)90002-9openalex-snapshot
Pointers and data abstractions in high level languages—I: Language proposals
inferred← citeshttps://doi.org/10.1016/0096-0551(77)90003-0openalex-snapshot
Pointers and data abstractions in high level languages—II: Correctness proofs
inferred← citeshttps://doi.org/10.1016/0096-0551(77)90010-8openalex-snapshot
Units of measure as a data attribute
inferred← citeshttps://doi.org/10.1016/0096-0551(79)90017-1openalex-snapshot
Testing and verification aspects of Pascal-like languages
inferred← citeshttps://doi.org/10.1016/0096-0551(80)90049-1openalex-snapshot
Toward modular verifiable exception handling
inferred← citeshttps://doi.org/10.1016/0096-0551(81)90045-xopenalex-snapshot
Methods for specifying static semantics
inferred← citeshttps://doi.org/10.1016/0096-0551(82)90024-8openalex-snapshot
A mechanism for exception handling and its verification rules
inferred← citeshttps://doi.org/10.1016/0096-0551(84)90015-8openalex-snapshot
A proposal for comparison of types in Pascal and associated semantic models
inferred← citeshttps://doi.org/10.1016/0096-0551(93)90020-2openalex-snapshot
An abstract programming language and correctness proofs
inferred← citeshttps://doi.org/10.1016/0164-1212(87)90014-8openalex-snapshot
On the development of reliable large software
inferred← citeshttps://doi.org/10.1016/0164-1212(87)90019-7openalex-snapshot
Language definition-based compiler development
inferred← citeshttps://doi.org/10.1016/0167-6423(82)90003-xopenalex-snapshot
A methodology for programming with concurrency: the formalism
inferred← citeshttps://doi.org/10.1016/0167-6423(89)90002-6openalex-snapshot
Calculating with pointers
inferred← citeshttps://doi.org/10.1016/0304-3975(77)90004-4openalex-snapshot
Pascal in LCF: Semantics and examples of proof
inferred← citeshttps://doi.org/10.1016/0304-3975(79)90059-8openalex-snapshot
Data types, abstract data types and their specification problem
inferred← citeshttps://doi.org/10.1016/0304-3975(82)90001-9openalex-snapshot
Floyd's principle, correctness theories and program equivalence
inferred← citeshttps://doi.org/10.1016/0306-4379(80)90075-7openalex-snapshot
The application of data types to database semantic integrity
inferred← citeshttps://doi.org/10.1016/0306-4379(82)90028-xopenalex-snapshot
Axiomatic definitions for data model semantics
inferred← citeshttps://doi.org/10.1016/0376-5075(76)90015-5openalex-snapshot
A data transfer protocol
inferred← citeshttps://doi.org/10.1016/0745-7138(87)90041-8openalex-snapshot
Embedded microcomputer systems—a comparative study of two implementation methods
inferred← citeshttps://doi.org/10.1016/0890-5401(91)90046-5openalex-snapshot
Correctness and efficiency of pattern matching algorithms
inferred← citeshttps://doi.org/10.1016/b978-0-12-415050-8.50007-0openalex-snapshot
Data Structures for Pattern Recognition Algorithms
inferred← citeshttps://doi.org/10.1016/b978-0-12-528540-7.50005-8openalex-snapshot
LANGUAGE AS A TOOL FOR SCIENTIFIC PROGRAMMING
inferred← citeshttps://doi.org/10.1016/b978-0-444-88074-1.50020-2openalex-snapshot
Methods and Logics for Proving Programs
inferred← citeshttps://doi.org/10.1016/b978-0-444-89880-7.50027-9openalex-snapshot
Deriving Correctness Properties of Compiled Code
inferred← citeshttps://doi.org/10.1016/b978-0-934613-53-8.50034-0openalex-snapshot
FAST MAINTENANCE OF SEMANTIC INTEGRITY ASSERTIONS USING REDUNDANT AGGREGATE DATA**This work was supported by the National Science Foundation under grants MCS-77-05314, MCS-79-07762, and MCS-79-08365
inferred← citeshttps://doi.org/10.1016/j.cola.2026.101395openalex-snapshot
Imperative-program synthesis from assumptions and assertions by abstract analysis and SMT mutations
inferred← citeshttps://doi.org/10.1016/j.entcs.2005.01.023openalex-snapshot
Inferring Object Invariants
inferred← citeshttps://doi.org/10.1016/j.entcs.2005.12.012openalex-snapshot
Formal Semantics of Programming Languages
inferred← citeshttps://doi.org/10.1016/j.infsof.2020.106503openalex-snapshot
Rigorous code review by reverse engineering
inferred← citeshttps://doi.org/10.1016/j.ins.2011.07.004openalex-snapshot
A quantitative model for software engineering trends
inferred← citeshttps://doi.org/10.1016/j.scico.2005.05.003openalex-snapshot
To use or not to use the goto statement: Programming styles viewed from Hoare Logic
inferred← citeshttps://doi.org/10.1016/j.scico.2015.06.002openalex-snapshot
Building traceable Event-B models from requirements
inferred← citeshttps://doi.org/10.1016/j.scico.2015.09.006openalex-snapshot
Designing a verifying compiler: Lessons learned from developing Whiley
inferred← citeshttps://doi.org/10.1016/j.scico.2021.102679openalex-snapshot
Loop invariance with break and continue
inferred← citeshttps://doi.org/10.1016/s0019-9958(78)90611-3openalex-snapshot
Formal methodology of translation. I. Semantic preserving translations
inferred← citeshttps://doi.org/10.1016/s0019-9958(78)90623-xopenalex-snapshot
Formal methodology of translation. II. Capabilities and limitations
inferred← citeshttps://doi.org/10.1016/s0020-7373(78)80012-1openalex-snapshot
Empirical and formal language design applied to a unified control construct for interactive computing
inferred← citeshttps://doi.org/10.1016/s0049-237x(08)71950-5openalex-snapshot
On the Solvability of Algorithmic Problems
inferred← citeshttps://doi.org/10.1016/s0065-2458(08)60045-5openalex-snapshot
The Structure of Design Processes
showing the first 200 of 408 · page through all 408
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.