J.J. van Wamel. Process algebra with language matching. 26  Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
A formal axiomatization for alphabet reasoning with.. - Korver, Sellink (1997) (9 citations) (Correct)
.... 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]
J.J. van Wamel. Process algebra with language matching. 26
A Generic Architecture for Data Flow Analysis to Support Reverse.. - Moonen (1997) (14 citations) (Correct)
....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]
J.J. van Wamel. Process algebra with language matching.
Reengineering COBOL software implies specification of the.. - van den Brand, al. (1997) (1 citation) (Correct)
....of Amsterdam Programming Research Group DATA DIVISION. WORKING STORAGE SECTION. 01. DSJDFRR IJ192390 SDJGEHJ2. 02. UI8T G5KM N034D PIC 99 99 99. 02. HJML97G KNBVFD45 7 HG PIC XXXXXX. 02. LK21 34 JSJKDJR 93894J PIC : 01. DVK54 FJKFJK4390 23 OKR2349IO PIC 9999. 01. HDRISO0934834R3NMJRQRRUJJJ49 PIC 9(2) Reengineering COBOL software implies specification of the underlying dialects Mark van den Brand Alex Sellink Chris Verhoef Report P9702 Februari University of Amsterdam Department of Computer Science ....
....of Amsterdam Programming Research Group DATA DIVISION. WORKING STORAGE SECTION. 01. DSJDFRR IJ192390 SDJGEHJ2. 02. UI8T G5KM N034D PIC 99 99 99. 02. HJML97G KNBVFD45 7 HG PIC XXXXXX. 02. LK21 34 JSJKDJR 93894J PIC : 01. DVK54 FJKFJK4390 23 OKR2349IO PIC 9999. 01. HDRISO0934834R3NMJRQRRUJJJ49 PIC 9(2) Reengineering COBOL software implies specification of the underlying dialects Mark van den Brand Alex Sellink Chris Verhoef Report P9702 Februari University of Amsterdam Department of Computer Science Programming Research Group Reengineering COBOL ....
[Article contains additional citation context not shown here]
J.J. van Wamel. Process algebra with language matching.
Re-engineering needs Generic Programming Language Technology - van den Brand, Klint.. (1996) (5 citations) (Correct)
....Kruislaan 403 NL 1098 SJ Amsterdam The Netherlands tel. 31 20 525 7593 e mail: markvdb fwi.uva.nl P. Klint Programming Research Group Department of Computer Science University of Amsterdam Kruislaan 403 NL 1098 SJ Amsterdam The Netherlands tel. 31 20 525 7585 e mail: paulk fwi.uva.nl CWI P.O.Box 94079 1090 GB Amsterdam The Netherlands tel. 31 20 592 4126 e mail: paulk cwi.nl C. Verhoef Programming Research Group Department of Computer Science University of Amsterdam Kruislaan 403 NL 1098 SJ Amsterdam The Netherlands tel. 31 20 525 7581 e mail: x fwi.uva.nl Universiteit van Amsterdam, ....
.... van Amsterdam, Re engineering needs Generic Programming Language Technology Mark van den Brand 1 , Paul Klint 2;1 , Chris Verhoef 1 1 University of Amsterdam, Programming Research Group Kruislaan 403, NL 1098 SJ Amsterdam, The Netherlands 2 CWI, Department of Software Technology P.O. Box 94079, NL 1090 GB Amsterdam, The Netherlands markvdb wins.uva.nl, paulk cwi.nl, x wins.uva.nl Abstract Generic language technology and compiler construction techniques are a prerequisite to build analysis and conversion tools that are needed for the re engineering of large software systems. We ....
J.J. van Wamel. Process algebra with language matching.
Generation of Components for Software Renovation.. - van den Brand.. (1997) (20 citations) (Correct)
.... 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]
J.J. van Wamel. Process algebra with language matching.
Verification Techniques for Elementary Data Types and.. - van Wamel (1995) (1 citation) Self-citation (Van wamel) (Correct)
....invariants are available. Moreover basic notions such as transition systems, bisimulation semantics and recursion are treated. In short, I try to cover all material that could be relevant for subsequent chapters based on process algebra. Chapter 3. Process algebra with language matching. Origin: [Wam94]. An axiom system ACP lm is presented as a variant of the process algebra ACP. The acronym ACP lm stands for ACP with abstraction, extended with operators and axioms for language matching . Language matching is a technique based on trace information for labelling and cutting off process ....
....p l is a labelled version of some process p, then it holds that H (p l k q) H (p k q) It is shown that under certain natural conditions a similar result holds when abstraction is applied to p l and p. Chapter 4. An algebraic verification of the Concurrent Alternating Bit Protocol. Origin: [Wam92a, Wam94]. In order to illustrate the use of language matching the Concurrent Alternating Bit Protocol (CABP) is verified. The CABP is a simple communication protocol, which can be recursively specified over the signature of ACP , and it may be regarded as a slightly more sophisticated variant ....
J.J. van Wamel. Process algebra with language matching. Report P9423, University of Amsterdam, 1994.
Polymorphic Syntax Definition - Visser (1997) (10 citations) (Correct)
No context found.
J.J. van Wamel. Process algebra with language matching.
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