Person:190306: Difference between revisions

From MaRDI portal
Person:190306
Created automatically from import230924090903
 
m AuthorDisambiguator moved page Jan A. Bergstra to Jan A. Bergstra: Duplicate
 
(No difference)

Latest revision as of 20:19, 8 December 2023

Available identifiers

zbMath Open bergstra.jan-aDBLPb/JanABergstraWikidataQ15462007 ScholiaQ15462007MaRDI QIDQ190306

List of research outcomes





PublicationDate of PublicationType
Logical models of mathematical texts: the case of conventions for division by zero.2025-01-13Paper
A survey of testing for instruction sequence theory2024-08-15Paper
Which arithmetical data types admit fracterm flattening?2024-08-15Paper
Four notions of fault for program specifications2024-08-15Paper
Symmetric transrationals: the data type and the algorithmic degree of its equational theory2023-07-26Paper
Eager Equality for Rational Number Arithmetic2023-07-18Paper
Bounded stacks, bags and queues2023-05-17Paper
Discrete time process algebra with abstraction2022-12-09Paper
Processes with multiple entries and exits2022-12-09Paper
Partial arithmetical data types of rational numbers and their equational specification2022-08-26Paper
Adams Conditioning and Likelihood Ratio Transfer Mediated Inference2022-07-19Paper
Program Algebra for Turing-Machine Programs2022-07-19Paper
Most General Algebraic Specifications for an Abstract Datatype of Rational Numbers2022-07-19Paper
Instruction Sequence Faults with Formal Change Justification2022-07-19Paper
Sumterms, Summands, Sumtuples, and Sums and the Meta-Arithmetic of Summation2022-07-19Paper
Qualifications of Instruction Sequence Failures, Faults and Defects: Dormant, Effective, Detected, Temporary, and Permanent2022-07-19Paper
Non-commutative propositional logic with short-circuit evaluation2022-03-03Paper
Using Hoare Logic in a Process Algebra Setting2021-11-15Paper
The wheel of rational numbers as an abstract data type2021-10-27Paper
https://portal.mardi4nfdi.de/entity/Q58564212021-03-26Paper
A short introduction to program algebra with instructions for Boolean registers2020-11-02Paper
Quantitative expressiveness of instruction sequence classes for computation on single bit registers2020-11-02Paper
Sumterms, Summands, Sumtuples, and Sums and the Meta-arithmetic of Summation2020-09-18Paper
Arithmetical datatypes with true fractions2020-05-26Paper
Probability Functions in the Context of Signed Involutive Meadows (Extended Abstract)2020-01-16Paper
On the complexity of the correctness problem for non-zeroness test instruction sequences2019-11-22Paper
A negative result on algebraic specifications of the meadow of rational numbers2019-07-24Paper
Process algebra with strategic interleaving2019-06-27Paper
https://portal.mardi4nfdi.de/entity/Q46211312019-02-08Paper
https://portal.mardi4nfdi.de/entity/Q46211362019-02-08Paper
https://portal.mardi4nfdi.de/entity/Q46211542019-02-08Paper
Indirect Jumps Improve Instruction Sequence Performance2019-02-08Paper
Timed Tuplix Calculus and the Wesseling and van den Bergh Equation2019-02-08Paper
Instruction Sequence Based Non-uniform Complexity Classes2019-02-08Paper
Probabilistic Thread Algebra2019-02-08Paper
On Instruction Sets for Boolean Registers in Program Algebra2019-02-08Paper
A Hoare-Like Logic of Asserted Single-Pass Instruction Sequences2019-02-08Paper
Subvarieties of the Variety of Meadows2019-02-08Paper
Axioms for Behavioural Congruence of Single-Pass Instruction Sequences2019-02-08Paper
Instruction Sequences Expressing Multiplication Algorithms2019-02-08Paper
Note on paraconsistency and reasoning about fractions2018-09-12Paper
https://portal.mardi4nfdi.de/entity/Q45848972018-09-04Paper
Contradiction-Tolerant Process Algebra with Propositional Signals2018-01-05Paper
Instruction Sequence Size Complexity of Parity2017-11-09Paper
Universality of Univariate Mixed Fractions in Divisive Meadows2017-07-03Paper
Equational Axioms for Expected Value Operators2016-09-09Paper
https://portal.mardi4nfdi.de/entity/Q31858422016-08-05Paper
https://portal.mardi4nfdi.de/entity/Q31858432016-08-05Paper
Transformation of fractions into simple fractions in divisive meadows2016-06-30Paper
Fracpairs and fractions over a reduced commutative ring2016-06-20Paper
Kleene's three-valued logic and process algebra2016-06-09Paper
On Algorithmic Equivalence of Instruction Sequences for Computing Bit String Functions2016-04-28Paper
Evaluation Trees for Proposition Algebra2015-11-04Paper
Register-machine based processes2015-10-30Paper
Proposition algebra2015-09-17Paper
Division by Zero in Common Meadows2015-06-22Paper
Equations for formally real meadows2015-05-15Paper
Division by zero in non-involutive meadows2015-03-24Paper
Data Linkage Algebra, Data Linkage Dynamics, and Priority Rewriting2014-04-25Paper
Parallel Processes with Implicit Computational Capital2014-01-17Paper
A process calculus with finitary comprehended terms2013-12-02Paper
On the Behaviours Produced by Instruction Sequences under Execution2013-01-14Paper
On the contribution of backward jumps to instruction sequence expressiveness2012-12-06Paper
On the expressiveness of single-pass instruction sequences2012-12-06Paper
Instruction sequence processing operators2012-10-15Paper
Instruction sequences for computer science.2012-08-20Paper
Proposition Algebra and Short-Circuit Logic2012-06-29Paper
Inversive meadows and divisive meadows2012-05-23Paper
Thread algebra for poly-threading2011-10-18Paper
A calculus for four-valued sequential logic2011-07-07Paper
Straight-line instruction sequence completeness for total calculation on cancellation meadows2011-05-25Paper
Data Linkage Dynamics with Shedding2011-05-18Paper
On Hoare-McCarthy algebras2010-12-22Paper
Short-circuit logic2010-10-18Paper
An Interface Group for Process Components2010-10-01Paper
A thread calculus with molecular dynamics2010-08-18Paper
On the operating unit size of load/store architectures2010-06-02Paper
Instruction Sequences with Dynamically Instantiated Instructions2010-02-05Paper
An upper bound for the equational specification of finite state services2009-12-04Paper
Machine structure oriented control code logic2009-10-02Paper
Partial Komori fields and imperative Komori fields2009-09-29Paper
Transmission Protocols for Instruction Streams2009-08-20Paper
Division safe calculation in totalised fields2009-05-08Paper
Meadows and the equational specification of division2009-03-25Paper
Skew Meadows2009-01-07Paper
The rational numbers as an abstract data type2008-12-21Paper
Program algebra with a jump-shift instruction2008-12-11Paper
Differential Meadows2008-04-21Paper
https://portal.mardi4nfdi.de/entity/Q54573782008-04-14Paper
Maurer computers for pipelined instruction processing2008-04-10Paper
Simulating Turing machines on Maurer machines2008-04-07Paper
Cancellation Meadows: a Generic Basis Theorem and Some Applications2008-03-27Paper
Fields, Meadows and Abstract Data Types2008-03-25Paper
https://portal.mardi4nfdi.de/entity/Q54319262008-01-02Paper
Synchronous cooperation for explicit multi-threading2007-12-10Paper
Thread algebra for strategic interleaving2007-11-28Paper
Elementary Algebraic Specifications of the Rational Complex Numbers2007-09-07Paper
A thread algebra with multi-level strategic interleaving2007-09-06Paper
Decision problems for pushdown threads2007-06-07Paper
Execution architectures for program algebra2007-05-18Paper
Logical Approaches to Computational Barriers2007-04-30Paper
Preferential choice and coordination conditions2007-02-09Paper
Processes, Terms and Cycles: Steps on the Road to Infinity2006-11-13Paper
Algebra and Coalgebra in Computer Science2006-10-20Paper
Splitting bisimulations and retrospective conditions2006-08-16Paper
https://portal.mardi4nfdi.de/entity/Q54806522006-08-03Paper
Continuity controlled hybrid automata2006-04-28Paper
New Computational Paradigms2006-01-11Paper
Polarized process algebra with reactive composition2005-11-01Paper
Formal Methods for Components and Objects2005-08-22Paper
Process algebra for hybrid systems2005-06-10Paper
Network algebra in Java2005-02-22Paper
https://portal.mardi4nfdi.de/entity/Q48257072004-11-05Paper
Branching time and orthogonal bisimulation equivalence2004-10-27Paper
https://portal.mardi4nfdi.de/entity/Q44491592004-02-08Paper
Process algebra with four-valued logic2004-01-13Paper
https://portal.mardi4nfdi.de/entity/Q27602552003-09-30Paper
Program algebra for sequential code2003-02-13Paper
Combining programs and state machines2003-02-13Paper
Molecular dynamics2003-02-13Paper
Algebra of timed frames2002-12-19Paper
https://portal.mardi4nfdi.de/entity/Q45505522002-08-25Paper
Process algebra and conditional composition2002-07-25Paper
Linear time and branching time semantics for recursion with merge2002-05-13Paper
Non-regular iterators in process algebra2002-03-03Paper
https://portal.mardi4nfdi.de/entity/Q27602422001-12-18Paper
https://portal.mardi4nfdi.de/entity/Q27520472001-10-21Paper
Bochvar-McCarthy logic and process algebra2001-07-17Paper
https://portal.mardi4nfdi.de/entity/Q45252742001-01-22Paper
https://portal.mardi4nfdi.de/entity/Q45184132000-11-28Paper
Program algebra for component code2000-11-14Paper
https://portal.mardi4nfdi.de/entity/Q45039512000-09-14Paper
On sequential composition, action prefixes and process prefix2000-08-14Paper
Real space process algebra2000-08-02Paper
The discrete time TOOLBUS. -- A software coordination architecture2000-01-04Paper
https://portal.mardi4nfdi.de/entity/Q42230071999-01-07Paper
Process algebra with propositional signals1998-07-23Paper
Network algebra for asynchronous dataflow1998-03-04Paper
Equational specifications, complete term rewriting systems, and computable and semicomputable algebras1998-01-28Paper
https://portal.mardi4nfdi.de/entity/Q48907051996-08-25Paper
A propositional logic with 4 values: true, false, divergent and meaningless1996-08-15Paper
https://portal.mardi4nfdi.de/entity/Q48656111996-07-17Paper
Discrete time process algebra1996-06-02Paper
https://portal.mardi4nfdi.de/entity/Q48656121996-04-22Paper
Axiomatizing probabilistic processes: ACP with generative probabilities1996-01-22Paper
Logic of transition systems1995-09-26Paper
Homomorphism preserving algebraic specifications require hidden sorts1995-08-01Paper
The data type variety of stack algebras1995-05-30Paper
Bisimulation is two-way simulation1995-02-09Paper
Which data types have \(\omega\)-complete initial algebra specifications?1994-04-05Paper
https://portal.mardi4nfdi.de/entity/Q42842361994-03-24Paper
Decidability of bisimulation equivalence for process generating context-free languages1993-12-09Paper
https://portal.mardi4nfdi.de/entity/Q40295841993-03-28Paper
UNIFORM ALGEBRAIC SPECIFICATIONS OF FINITE SETS WITH EQUALITY1992-06-28Paper
Recursive process definitions with the state operator1991-01-01Paper
Real time process algebra1991-01-01Paper
Module algebra1990-01-01Paper
Term-rewriting systems with rule priorities1989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q34909641989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q47334261989-01-01Paper
Global renaming operators in concrete process algebra1988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37922311988-01-01Paper
Readies and Failures in the Algebra of Communicating Processes1988-01-01Paper
On the consistency of Koomen's fair abstraction rule1987-01-01Paper
Algebraic specifications of computable and semicomputable data types1987-01-01Paper
Ready-Trace Semantics for Concrete Process Algebra with the Priority Operator1987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37749291987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37766071987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38058911987-01-01Paper
Conditional rewrite rules: Confluence and termination1986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q30283341986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37273671986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37426981986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q47274121986-01-01Paper
Algebra of communicating processes with abstraction1985-01-01Paper
Top-down design and the algebra of communicating processes1985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37025001985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q51867201984-01-01Paper
Proving program inclusion using Hoare's logic1984-01-01Paper
The axiomatic semantics of programs based on Hoare's logic1984-01-01Paper
Hoare's logic for programming languages with two data types1984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q32175831984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33304911984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36786641984-01-01Paper
Process algebra for synchronous communication1984-01-01Paper
Hoare's logic and Peano's arithmetic1983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q30423761983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36574101983-01-01Paper
Initial and Final Algebra Semantics for Data Type Specifications: Two Characterization Theorems1983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36644131983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36662471983-01-01Paper
A simple transfer lemma for algebraic specifications1982-01-01Paper
A simple transfer lemma for algebraic specifications1982-01-01Paper
Two theorems about the completeness of Hoare's logic1982-01-01Paper
Expressiveness and the completeness of Hoare's logic1982-01-01Paper
Floyd's principle, correctness theories and program equivalence1982-01-01Paper
Some natural structures which fail to possess a sound and decidable Hoare-like logic for their while-programs1982-01-01Paper
On the elimination of iteration quantifiers in a fragment of algorithmic logic1982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33277061982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33401221982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33418731982-01-01Paper
The completeness of the algebraic specification methods for computable data types1982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36746161982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39354531982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39392181982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39515251982-01-01Paper
Another incompleteness result for Hoare's logic1982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q47416951982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q51867161981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39040411981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39040421981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39120011981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39174771981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39190611981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39190621981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39190671981-01-01Paper
Small specifications for large finite data structures1981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39290111981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39485751981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39485781981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39515241981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39601421981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q47399041981-01-01Paper
Invertible terms in the lambda calculus1980-01-01Paper
Discourse between processes1980-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38546001980-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38546011980-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38608221980-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38687371980-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38787401980-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38787411980-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38819031980-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38834731980-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38932861980-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38932871980-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38964781980-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39384901980-01-01Paper
Recursive assertions are not enough - or are they?1979-01-01Paper
Church-Rosser strategies in the lambda calculus1979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q32080661979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38515881979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38515921979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38531071979-01-01Paper
Effective Transformations on Probabilistic Data1979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39063951979-01-01Paper
Recursion theory on processes1979-01-01Paper
Degrees of partial functions1978-01-01Paper
What is an abstract datatype?1978-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41647931978-01-01Paper
Degrees of sensible lambda theories1978-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41381161977-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41824761976-01-01Paper

Research outcomes over time

This page was built for person: Jan A. Bergstra