scientific article

zbMath0604.68001MaRDI QIDQ3741005

Robert B. K. Dewar, Edmond Schonberg, Ed Dubinsky

Publication date: 1986

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

program transformationscontrol structuresprogram verificationprogram testingdata typesprototypingcorrectness preserving transformationshigh level languagecompound data structuresData Representation Sublanguagesettheoretic language

Mathematics Subject Classification ID

Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Theory of software (68Nxx)

Related Items (36)

Unitary quantum relativity (work in progress) ⋮ Issues in commonsense set theory ⋮ Mechanical translation of set theoretic problem specifications into efficient RAM code - a case study ⋮ An informal introduction to a high level language with applications to interval mathematics ⋮ Unnamed Item ⋮ Comprehending Ringads ⋮ POETS: process-oriented event-driven transaction systems ⋮ The automation of syllogistic. I: Syllogistic normal forms ⋮ Automated reasoning with restricted intensional sets ⋮ Set graphs. IV. Further connections with claw-freeness ⋮ Adding partial functions to Constraint Logic Programming with sets ⋮ An automatically verified prototype of the Android permissions system ⋮ Unnamed Item ⋮ Program derivation with verified transformations — a case study ⋮ A decidable two-sorted quantified fragment of set theory with ordered pairs and some undecidable extensions ⋮ The foundation of self-developing blob machines for spatial computing ⋮ Une procédure de décision pour un problème de satisfiabilité dans un univers ensembliste héréditairement fini ⋮ Quantum interference computation ⋮ Using multiset discrimination to solve language processing problems without hashing ⋮ Interval propagation to reason about sets: Definition and implementation of a practical language ⋮ Set graphs. II. Complexity of set graph recognition and similar problems ⋮ Goals and benchmarks for automated map reasoning ⋮ Finding Reductions Automatically ⋮ A decision procedure for a sublanguage of set theory involving monotone, additive, and multiplicative functions. I: The two-level case ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Automated proof of Bell-LaPadula security properties ⋮ Why Sets? ⋮ SETL ⋮ An automatically verified prototype of the Tokeneer ID station specification ⋮ Orthogonal parallel processing in Vector Pascal ⋮ Formative processes with applications to the decision problem in set theory. I: Powerset and singleton operators ⋮ A derived algorithm for evaluating \(\varepsilon\)-expressions over abstract sets ⋮ Transformational derivation of an improved alias analysis algorithm ⋮ An NSF proposal

This page was built for publication: