Sökning: "Joachim Parrow"

Visar resultat 1 - 5 av 10 avhandlingar innehållade orden Joachim Parrow.

  1. 1. The Fusion Calculus : Expressiveness and Symmetry in Mobile Processes

    Författare :Björn Victor; Joachim Parrow; Uppsala universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Computer Systems; Datorteknik;

    Sammanfattning : The fusion calculus is presented as a significant step towards a canonical calculus of concurrency. It simplifies and extends the π-calculus of Milner, Parrow and Walker.The fusion calculus contains the polyadic π-calculus as a proper subcalculus and thus inherits all its expressive power. LÄS MER

  3. 2. Formalising process calculi

    Författare :Jesper Bengtson; Joachim Parrow; Daniel Hirschkoff; Uppsala universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; process calculi; interactive theorem proving; nominal logic; pi-calculus; CCS; psi-calculi; Computer science; Datalogi; Datavetenskap; Computer Science;

    Sammanfattning : As the complexity of programs increase, so does the complexity of the models required to reason about them. Process calculi were introduced in the early 1980s and have since then been used to model communication protocols of varying size and scope. LÄS MER

  4. 3. Regular inference for reactive systems

    Författare :Therese Berg; Bengt Jonsson; Joachim Parrow; Uppsala universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Datavetenskap; Computer Science;

    Sammanfattning : Models of reactive systems play a central role in many techniques for verification and analysis of reactive systems. Both a specification of the system and the abstract behavior of the system can be expressed in a formal model. Compliance with the functional parts in the specification can be controlled in different ways. LÄS MER

  5. 4. Conservative Definitions for Higher-order Logic with Ad-hoc Overloading

    Författare :Arve Gengelbach; Tjark Weber; Joachim Parrow; Andrei Popescu; Uppsala universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; higher-order logic HOL ; conservative extension; ad-hoc overloading; definitions; Computer Science; Datavetenskap;

    Sammanfattning : With an ever growing dependency on computer systems, the need to guarantee their correct behaviour increases. Mathematically rigorous techniques like formal verification offer a way to derive a system's mathematical properties for example with the help of a theorem prover. LÄS MER

  7. 5. Psi-calculi: a framework for mobile process calculi : Cook your own correct process calculus - just add data and logic

    Författare :Magnus Johansson; Björn Victor; Joachim Parrow; Catuscia Palamidessi; Uppsala universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; process calculi; pi-calculus; bisimulation; operational semantics; nominal logic; Computer science; Datavetenskap; Datavetenskap; Computer Science;

    Sammanfattning : A psi-calculus is an extension of the pi-calculus with nominal data types for data structures, logical assertions, and conditions. These can be transmitted between processes and their names can be statically scoped as in the standard pi-calculus. LÄS MER