scientific article; zbMATH DE number 3550181
From MaRDI portal
Publication:4124327
Classical first-order logic (03B10) Automata and formal grammars in connection with logical questions (03D05) Turing machines and related notions (03D10) Numerical mathematical programming methods (65K05) Research exposition (monographs, survey articles) pertaining to computer science (68-02) General topics in the theory of software (68N01) Formal languages and automata (68Q45)
Cited in
(only showing first 100 items - show all)- The 4-way deterministic tiling problem is undecidable
- A note on an expressiveness hierarchy for multi-exit iteration
- Using computer algebra techniques for the specification, verification and synthesis of recursive programs
- Mathematics for reasoning about loop functions
- Extracting Lisp programs from constructive proofs: A formal theory of constructive mathematics based on Lisp
- Programs as proofs: A synopsis
- The lifeness property of on-the-fly garbage collector - a proof
- On the fixpoints of nondeterministic recursive definitions
- Acceptable functional programming systems
- Process logic with regular formulas
- Rewrite systems on a lattice of types
- Optimal fixedpoints of logic programs
- Complete problems in the first-order predicate calculus
- Non-standard algorithmic and dynamic logic
- Relational algebraic semantics of deterministic and nondeterministic programs
- Structured algebraic specifications: A kernel language
- Constructing recursion operators in intuitionistic type theory
- Crypt-equivalent algebraic specifications
- A note on: `Deque automata and a subfamily of context-sensitive languages which contains all semilinear bounded languages' (by K. Ayers)
- Controlling recursive inference
- Characteristics of graph languages generated by edge replacement
- Termination of rewriting
- Word operation definable in the typed -calculus
- On the topology of algorithms. I
- Equational specification of partial higher-order algebras
- Implication of clauses is undecidable
- Proving properties of a ring of finite-state machines
- An algorithm for reconstructing convex bodies from their projections
- An operator net model for distributed systems
- Parameter passing in nondeterministic recursive programs
- General purpose schedulers for database systems
- An approach for data type specification and its use in program verification
- Partially additive categories and flow-diagram semantics
- Proving the correctness of regular deterministic programs: A unifying survey using dynamic logic
- Nondeterministic flowchart programs with recursive procedures: Semantics and correctness. I
- Synthesising recursive functions with side effects
- Formalization of equivalence of recursively defined functions
- On the use of history variables
- Formalization of properties of nondeterministic recursive definitions
- Multiple equality sets and Post machines
- An algebraic definition for control structures
- Nondeterministic flowchart programs with recursive procedures: Semantics and correctness. II
- Proving total correctness of nondeterministic programs in infinitary logic
- The independence of control structures in abstract programming systems
- On the time and tape complexity of weak unification
- Chain properties in Pomega
- Floyd's principle, correctness theories and program equivalence
- A complete logic for reasoning about programs via nonstandard model theory. I
- Semantics of probabilistic programs
- A dual problem to least fixed points
- A note on the existence of continuous functionals
- Programs and program verifications in a general setting
- Fixed point theorems and semantics: A folk tale
- Canonical recursive functions and operations
- A class of fuzzy theories
- A simplified problem reduction format
- An extensional fixed-point semantics for nondeterministic data flow
- A theory for program and data type specification
- On the lattice of specifications: Applications to a specification methodology
- Knowledge and reasoning in program synthesis
- Backtracking in recursive computations
- Dispositions, realism, and explanation
- IO and OI. I
- A proof method for cyclic programs
- IO and OI. II
- On an equivalence between continuation and stack semantics
- A linear-time algorithm for finding all feedback vertices
- A probabilistic remark on algebraic program testing
- Sequential method in propositional dynamic logic
- The convergence of functions to fixedpoints of recursive definitions
- Modifications of the program scheme model
- Partial logics reconsidered: A conservative approach
- Examples of undecidable problems for 2-generator matrix semigroups
- Deductive and inductive synthesis of equational programs
- On the mechanical derivation of loop invariants
- Logic program synthesis from incomplete specifications
- Process algebra with guards: Combining hoare logic with process algebra
- On proving the termination of algorithms by machine
- An algebraic approach to semantics of programming languages
- Formalizing non-termination of recursive programs
- An equational axiomatization for multi-exit iteration
- Using automata theory for characterizing the semantics of terminological cycles
- Program tactics and logic tactics
- The equational logic of fixed points
- Structure coarsening, entropy and compressed space dimension
- An abstract formalization of correct schemas for program synthesis
- Convergence: integrating termination and abort-freedom
- Atomatics as mathematical modelling and knowledge representation. Applications to systems analysis in computer and information sciences
- On the transformation semigroups of finite automata
- A metatheorem for undecidable properties of formal languages and its application to LRR and LLR grammars and languages
- Approximation properties of abstract data types
- Recursion induction principle revisited
- A formal model of atomicity in asynchronous systems
- Equivalence of conservative, free, linear program schemas is decidable
- Peg-solitaire, string rewriting systems and finite automata
- Specification and refinement of networks of asynchronously communicating agents using the assumption/commitment paradigm
- Computation on abstract data types. The extensional approach, with an application to streams
- Forward chaining is simple\((x)\)
- A unified approach of program verification
- Differentiators and detectors
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 Q4124327)