scientific article
From MaRDI portal
Publication:3141916
zbMath0919.68082MaRDI QIDQ3141916
Publication date: 1 November 1993
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Theory of programming languages (68N15) Semantics in the theory of computing (68Q55)
Related Items (only showing first 100 items - show all)
The Hoare Logic of Deterministic and Nondeterministic Monadic Recursion Schemes ⋮ A Hoare Logic for GPU Kernels ⋮ Computational adequacy via ‘mixed’ inductive definitions ⋮ Teaching Semantics with a Proof Assistant: No More LSD Trip Proofs ⋮ Categorical fixed point calculus ⋮ Assignment Calculus: A Pure Imperative Language ⋮ Observation-Based Concurrent Program Logic for Relaxed Memory Consistency Models ⋮ Building Specifications in the Event-B Institution ⋮ Perspectives on Transactional Memory ⋮ Cutting Out Continuations ⋮ Reasoning about knowledge and messages in asynchronous multi-agent systems ⋮ Game theoretic analysis of call-by-value computation ⋮ Computation semantics of the functional scientific workflow language Cuneiform ⋮ A foundation for higher-order concurrent constraint programming ⋮ Solving polynomial fixed point equations ⋮ Programming language semantics: It’s easy as 1,2,3 ⋮ αCheck: A mechanized metatheory model checker ⋮ Control-data separation and logical condition propagation for efficient inference on probabilistic programs ⋮ Sound and relatively complete belief Hoare logic for statistical hypothesis testing programs ⋮ A Comparison of Sets of Recognizable Weighted Tree Languages Over Specific Sets of Bounded Lattices ⋮ Branching vs. Linear Time: Semantical Perspective ⋮ Property-driven code obfuscations reinterpreting Jones-optimality in abstract interpretation ⋮ An algebraic glimpse at bunched implications and separation logic ⋮ Parallelism Increases Iterative Learning Power ⋮ Unnamed Item ⋮ Calculating correct compilers ⋮ Flexible dynamic information flow control in the presence of exceptions ⋮ Unnamed Item ⋮ A Higher-Order Calculus of Computational Fields ⋮ Denotational semantics of recursive types in synthetic guarded domain theory ⋮ Some reasons for generalising domain theory ⋮ Programming with Infinitesimals: A While-Language for Hybrid System Modeling ⋮ Mechanical verification of mutually recursive procedures ⋮ Information Theory and Security: Quantitative Information Flow ⋮ Linear Structures for Concurrency in Probabilistic Programming Languages ⋮ Capsules and Closures ⋮ Hybrid tree automata and the yield theorem for constituent tree automata ⋮ A categorical foundation for structured reversible flowchart languages: Soundness and adequacy ⋮ Generalized homogeneous polynomials for efficient template-based nonlinear invariant synthesis ⋮ A metalanguage for guarded iteration ⋮ Unnamed Item ⋮ A Hybrid Denotational Semantics for Hybrid Systems ⋮ The geometry of conservative programs ⋮ Primitive recursion in the abstract ⋮ Static Livelock Analysis in CSP ⋮ Domain mu-calculus ⋮ Modelling declassification policies using abstract domain completeness ⋮ Dynamic game semantics ⋮ Unnamed Item ⋮ A Certified Study of a Reversible Programming Language ⋮ Some Fixed-Point Issues in PPTL ⋮ Encoding FIX in Object Calculi ⋮ The algebra of recursive graph transformation language UnCAL: complete axiomatisation and iteration categorical semantics ⋮ Localized Operational Termination in General Logics ⋮ Rule-Based Operational Semantics for an Imperative Language ⋮ Not by equations alone: Reasoning with extensible effects ⋮ An Operational Semantics for Shared Messaging Communication ⋮ Token-passing Nets for Functional Languages ⋮ Work it, wrap it, fix it, fold it ⋮ Formal semantics of a classical-quantum language ⋮ Modular structural operational semantics ⋮ Reasoning with power defaults ⋮ From IF to BI. A tale of dependence and separation ⋮ Atomicity, coherence of information, and point-free structures ⋮ A first-order one-pass CPS transformation ⋮ Secure mechanical verification of mutually recursive procedures ⋮ Ontology population as algebraic information system processing based on multi-agent natural language text analysis algorithms ⋮ From reversible programming languages to reversible metalanguages ⋮ Prime algebraicity ⋮ Transfinite semantics in the form of greatest fixpoint ⋮ Operational semantics of Framed Tempura ⋮ Computational adequacy of the FIX-logic ⋮ Adequacy for a lazy functional language with recursive and polymorphic types ⋮ Algorithmically broad languages for polynomial time and space ⋮ Equivalence of formal semantics definition methods ⋮ Call-by-push-value: Decomposing call-by-value and call-by-name ⋮ Deriving escape analysis by abstract interpretation ⋮ Semantics, calculi, and analysis for object-oriented specifications ⋮ Computable model discovery and high-level-programming approximations to algorithmic complexity ⋮ Full abstraction for the second order subset of an Algol-like language ⋮ Certified verification of relational properties ⋮ On the relations between monadic semantics ⋮ A theory of formal synthesis via inductive learning ⋮ Computation on abstract data types. The extensional approach, with an application to streams ⋮ Generalized metric spaces: Completion, topology, and powerdomains via the Yoneda embedding ⋮ Structured proof procedures ⋮ On rational choice and the representation of decision problems ⋮ An observationally complete program logic for imperative higher-order functions ⋮ Constructing a binary tree from its traversals by reversible recursion and iteration ⋮ Finding suitable variability abstractions for lifted analysis ⋮ From regular expressions to DFA's using compressed NFA's ⋮ The equational logic of fixed points ⋮ A general adequacy result for a linear functional language ⋮ Completeness of Park induction ⋮ Parameterized strategies specification in Maude ⋮ Generic weakest precondition semantics from monads enriched with order ⋮ An equational notion of lifting monad ⋮ A proof system for unified temporal logic ⋮ A sound and complete proof system for a unified temporal logic ⋮ Pointfree expression and calculation: From quantification to temporal logic
This page was built for publication:
