Bergstra, J.A. (Johannes Aldert), 1951-
Bergstra, J. A.
Bergstra, Jan A. 1951-
Bergstra, J. A., 1951-
Bergstra, Jan
Bergstra, Johannes (Jan) Aldert
Bergstra, Jan A.
Bergstra, Jan, 1951-
Jan Bergstra Nederlands informaticus
Bergstra, Johannes Aldert 1951-
Bergstra, Johannes Aldert
VIAF ID: 18127576 ( Personal )
Permalink: http://viaf.org/viaf/18127576
Preferred Forms
- 200 _ | ‡a Bergstra ‡b Jan
-
-
-
-
- 100 1 _ ‡a Bergstra, J. A.
- 100 1 _ ‡a Bergstra, J. A.
- 100 1 _ ‡a Bergstra, J. A. ‡d 1951-
-
-
-
-
-
-
- 100 1 _ ‡a Bergstra, Jan A. ‡d 1951-
-
- 100 1 _ ‡a Bergstra, Johannes (Jan) Aldert
-
- 100 0 _ ‡a Jan Bergstra ‡c Nederlands informaticus
4xx's: Alternate Name Forms (23)
5xx's: Related Names (1)
Works
Title | Sources |
---|---|
Algebraic methods II / J. A. Bergstra, L. M. G. Feijs (eds.). - Berlin, 1991. | |
Algebraic methods II : theory, tools and applications | |
Algebraic specification | |
Atlantis studies in computing | |
Axiomatizing probabilistic processes : ACP with generative probabilities | |
Branching time and orthogonal bisimulation equivalence | |
Computability and continuity in finite types | |
Conditional axioms and α/β calculus in process algebra | |
Conditional rewrite rules: confluency and termination | |
Contribution to the parallelism specification : CSP applications. | |
Decidability of bisimulation equivalence for processes generating context-free languages | |
Equational specifications for computable data types : six hidden functions suffice and other sufficiency bounds | |
Fair FIFO queues satisfy an algebraic criterion for protocol correctness | |
Festschrift in honour of Jan Bergstra | |
The field of algebraic numbers fails to possess even a nice sound, if relatively incomplete, hoare-like logic for its while-programs | |
Floyd's principle, correctness theories and program equivalence [microvorm] | |
Formal proof systems for program equivalence | |
Formele ontwikkeling van schermverloopschema's en interaktieve programma's | |
Global renaming operators in concrete process algebra | |
Handbook of network and system administration | |
Handbook of process algebra | |
The history of information security : a comprehensive handbook | |
inescapable stack | |
Instruction sequences for computer science | |
The Journal of logic and algebraic programming | |
Logic of transition systems | |
Module algebra | |
A natural data type with a finite equational final semantics specification but no effective equational initial semantics specification | |
On sequential composition, action prefixes and process prefix | |
On specifying sets of integers | |
On the adequacy of finite equational methods for data type specification [microvorm] | |
On the consistency of Koomen's fair abstraction rule | |
PC-compactnes, a necessary condition for the existence of sound and complete logics of partial correctness | |
Platform projections, compilers, interpreters and portability | |
Platforms, specifications and decisions | |
Process algebra for communication and mutual exclusion | |
Process theory based on bisimulation semantics | |
Processen en procesexpressies | |
Program algebra for flow charts | |
Programmatuuronderzoek in de schaduw | |
Programs, interfaces and components | |
Proving program inclusion using Hoare's logic | |
Put and get, primitives for synchronous unreliable message passing | |
Raaskal, een taal om eindige automaten te simuleren | |
Ready trace semantiek voor procesalgebra met prioriteitsoperator | |
A real time process logic | |
Recursive assertions are not enough, or are they? | |
Recursive process definitions with the state operator | |
Software mechanics for Java multi-threading | |
Spoorweglogica via EURIS | |
Syntax and defining equations for an interrupt mechanism in process algebra | |
Syntax and semantics of a high-level intermediate representation for ASF+SDF | |
Term rewriting systems with priorities | |
Termherschrijfsystemen | |
Theoretische software-engineering : kenmerken, faseringen en classificaties | |
Towards a complete transformational toolkit for compilers |