| H.P. Korver and M.P.A. Sellink. A Formal Axiomatization for Alphabet Reasoning with Parametrized Processes. |
....of Iteration in Process Algebra Jan A. Bergstra Alban Ponse J.A. Bergstra Programming Research Group Department of Computer Science University of Amsterdam Kruislaan 403 NL 1098 SJ Amsterdam The Netherlands tel. 31 20 525 7591 e mail: janb wins.uva.nl Department of Philosophy Utrecht University P.O.Box 80126 NL 3508 TC Utrecht The Netherlands tel. 31 30 253 5579 e mail: Jan.Bergstra phil.uu.nl A. Ponse Programming Research Group Department of Computer Science University of Amsterdam Kruislaan 403 NL 1098 SJ Amsterdam The Netherlands tel. 31 20 525 7592 e mail: alban wins.uva.nl Universiteit van ....
....3.3. 1: A counter (a(a c can be defined in ACP ; fl) if jA n Aj = 5. 2: With seven additional actions, a half counter ( s c can be specified in ACP ; fl) Proof. As for 1: let A n A = ftg [ fr i ; s i j i = 0; 1g and consider (a(a b) z)s1 c abbreviated by P (r1 Delta P ) r0 abbreviated by Q (r1 Delta s1 ) s0 abbreviated by R: Then it follows with RSP that (a(a c = ftg ffi fr i ;s i ji=0;1g (P Delta Q k R) As for 2: let A n A = ftg [ fr i ; s i j i = 0; 1; 2g and consider m)z Delta s1 c Delta s0 abbreviated by S (r1 Delta S s2 Delta r2) ....
[Article contains additional citation context not shown here]
H.P. Korver and M.P.A. Sellink. A Formal Axiomatization for Alphabet Reasoning with Parametrized Processes.
.... of Amsterdam Programming Research Group index.html Layout.html Bool.html Strings.html Int.html A specification of Box to HTML in ASF SDF Maarten van der Graaf Report P9720 november 1997 University of Amsterdam Department of Computer Science Programming Research Group A specification of box to html in asf sdf Maarten van der Graaf Report P9720 november 1997 M. van der Graaf Programming Research Group Department of Computer Science University of Amsterdam ....
.... Layout.html Bool.html Strings.html Int.html A specification of Box to HTML in ASF SDF Maarten van der Graaf Report P9720 november 1997 University of Amsterdam Department of Computer Science Programming Research Group A specification of box to html in asf sdf Maarten van der Graaf Report P9720 november 1997 M. van der Graaf Programming Research Group Department of Computer Science University of Amsterdam Kruislaan 403 NL 1098 SJ Amsterdam The Netherlands tel. 31 20 525 7586 e mail: graaf wins.uva.nl Universiteit van Amsterdam, 1997 A specification of Box to HTML in ASF SDF ....
[Article contains additional citation context not shown here]
H.P. Korver and M.P.A. Sellink. A Formal Axiomatization for Alphabet Reasoning with Parametrized Processes.
.... of Amsterdam Programming Research Group Annotated Algebraic Specification of the Syntax and Semantics of the Programming Language Alma 0 Jacob Brunekreef Report P9803 april 1998 University of Amsterdam Department of Computer Science Programming Research Group Annotated Algebraic Specification of the Syntax and Semantics of the Programming Language Alma 0 Jacob Brunekreef Report P9803 april 1998 J.J. Brunekreef Programming Research Group Department of ....
.... Syntax and Semantics of the Programming Language Alma 0 Jacob Brunekreef Report P9803 april 1998 University of Amsterdam Department of Computer Science Programming Research Group Annotated Algebraic Specification of the Syntax and Semantics of the Programming Language Alma 0 Jacob Brunekreef Report P9803 april 1998 J.J. Brunekreef Programming Research Group Department of Computer Science University of Amsterdam Kruislaan 403 NL 1098 SJ Amsterdam The Netherlands tel. 31 20 525 7588 e mail: jacob wins.uva.nl Universiteit van Amsterdam, 1998 Annotated algebraic specification of the syntax and ....
[Article contains additional citation context not shown here]
H.P. Korver and M.P.A. Sellink. A Formal Axiomatization for Alphabet Reasoning with Parametrized Processes.
....chaining for all variables (dotted arrows) The characters t and f denote the path that is taken when the condition of the while is respectively true or false. program fac begin declare input: natural, output: natural, repnr: natural, rep: natural; input : 3; output : 1; while (input 1 0) do rep : output; repnr : input; while (repnr 1 0) do output : output rep; repnr : repnr 1 od; input : input 1 od end program fac input : 3 output : 1 while (input 1 0) do t rep : output repnr : input while (repnr 1 0) do t output : output rep repnr : ....
.... t and f denote the path that is taken when the condition of the while is respectively true or false. program fac begin declare input: natural, output: natural, repnr: natural, rep: natural; input : 3; output : 1; while (input 1 0) do rep : output; repnr : input; while (repnr 1 0) do output : output rep; repnr : repnr 1 od; input : input 1 od end program fac input : 3 output : 1 while (input 1 0) do t rep : output repnr : input while (repnr 1 0) do t output : output rep repnr : repnr 1 input : input 1 end f f 4 A Generic ....
[Article contains additional citation context not shown here]
H.P. Korver and M.P.A. Sellink. A Formal Axiomatization for Alphabet Reasoning with Parametrized Processes.
....of Philosophy, P.O. Box 80126, 3508 TC Utrecht, The Netherlands; 3 University of Amsterdam, Programming Research Group, P.O. Box 41882, 1009 DB Amsterdam, The Netherlands Keywords: Formal verification; Alphabet axioms; Process algebra; CRL; Bags Abstract. This paper is a paper supplementary to [KS98] It illustrates by means of examples the use of alphabet axioms as presented in [KS98] Furthermore a brief overview of CRL [GP94] and its proof theory [GP93] are added. 1. Introduction This paper must not be seen as a stand alone paper but as a paper supplementary to [KS98] In [KS98] the ....
....Programming Research Group, P.O. Box 41882, 1009 DB Amsterdam, The Netherlands Keywords: Formal verification; Alphabet axioms; Process algebra; CRL; Bags Abstract. This paper is a paper supplementary to [KS98] It illustrates by means of examples the use of alphabet axioms as presented in [KS98] Furthermore a brief overview of CRL [GP94] and its proof theory [GP93] are added. 1. Introduction This paper must not be seen as a stand alone paper but as a paper supplementary to [KS98] In [KS98] the proof theory of CRL [GP93] is extended with so called alphabet axiom. Here we give two ....
[Article contains additional citation context not shown here]
H.P. Korver and M.P.A. Sellink. A formal axiomatization for alphabet reasoning with parametrized processes. Formal Aspects of Computing, 1998.
No context found.
H.P. Korver and M.P.A. Sellink. A Formal Axiomatization for Alphabet Reasoning with Parametrized Processes.
.... of Amsterdam Programming Research Group a b A Formal Axiomatization for Alphabet Reasoning with Parametrized Processes Henri Korver Alex Sellink Report P9703 Februari 1997 University of Amsterdam Department of Computer Science Programming Research Group A formal axiomatization for alphabet reasoning with parametrized processes Henri Korver Alex Sellink Report P9703 Februari 1997 H.P. Korver ID Research Groningenweg 6 2803 PV Gouda The ....
.... Alphabet Reasoning with Parametrized Processes Henri Korver Alex Sellink Report P9703 Februari 1997 University of Amsterdam Department of Computer Science Programming Research Group A formal axiomatization for alphabet reasoning with parametrized processes Henri Korver Alex Sellink Report P9703 Februari 1997 H.P. Korver ID Research Groningenweg 6 2803 PV Gouda The Netherlands tel. 31 182 546546 e mail: H.Korver idr.nl M.P.A. Sellink Programming Research Group Department of Computer Science University of Amsterdam Kruislaan 403 NL 1098 SJ Amsterdam The Netherlands tel. ....
[Article contains additional citation context not shown here]
H.P. Korver and M.P.A. Sellink. A Formal Axiomatization for Alphabet Reasoning with Parametrized Processes.
No context found.
H.P. Korver and M.P.A. Sellink. A Formal Axiomatization for Alphabet Reasoning with Parametrized Processes.
.... of Amsterdam Programming Research Group Original Code Renovated Abstract Syntax Tree Transform Parse Unparse Code Generation of Components for Software Renovation Factories from Context free Grammars Mark van den Brand Alex Sellink Chris Verhoef Report P9705 June University of Amsterdam Department of Computer Science Programming Research Group Generation of components for software renovation factories from context free grammars Mark van den Brand Alex Sellink Chris Verhoef Report P9705 June M.G.J. van den Brand Programming Research Group ....
.... Grammars Mark van den Brand Alex Sellink Chris Verhoef Report P9705 June University of Amsterdam Department of Computer Science Programming Research Group Generation of components for software renovation factories from context free grammars Mark van den Brand Alex Sellink Chris Verhoef Report P9705 June M.G.J. van den Brand Programming Research Group Department of Computer Science University of Amsterdam Kruislaan 403 NL 1098 SJ Amsterdam The Netherlands tel. 31 20 525 7593 e mail: markvdb fwi.uva.nl M.P.A. Sellink Programming Research Group Department of Computer Science University of ....
[Article contains additional citation context not shown here]
H.P. Korver and M.P.A. Sellink. A Formal Axiomatization for Alphabet Reasoning with Parametrized Processes.
No context found.
H.P. Korver and M.P.A. Sellink. A Formal Axiomatization for Alphabet Reasoning with Parametrized Processes.
No context found.
H.P. Korver and M.P.A. Sellink. A Formal Axiomatization for Alphabet Reasoning with Parametrized Processes.
No context found.
H.P. Korver and M.P.A. Sellink. A Formal Axiomatization for Alphabet Reasoning with Parametrized Processes.
No context found.
H.P. Korver and M.P.A. Sellink. A Formal Axiomatization for Alphabet Reasoning with Parametrized Processes.
No context found.
H.P. Korver and M.P.A. Sellink. A Formal Axiomatization for Alphabet Reasoning with Parametrized Processes.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC