scientific article; zbMATH DE number 3976287

MaRDI QIDQ3741005zbMATH OpenFDO

Authors Robert B. K. Dewar, Ed Dubinsky, Edmond Schonberg, Jacob T. Schwartz

Publication date 1986

zbMATH Keywords

compound data structurescontrol structurescorrectness preserving transformationsData Representation Sublanguagedata typeshigh level languageprogram testingprogram transformationsprogram verificationprototypingsettheoretic language

Mathematics Subject Classification ID

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

Cited in

(40)

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

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3741005)