An Abstract Machine for the Kell Calculus

Bidinger, Philippe; Schmitt, Alan; Stefani, Jean-Bernard

doi:10.1007/11494881_3

Cited by 9 publications

(16 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…One can imagine annotated processes like in P h | Q l where the annotations are taken into account by the scheduler. Such a scheme would fit naturally in a calculus with hierarchical localities such as [1]. For Most correctness results of the implementations of process calculi with localities concern their distributed implementation, but do not deal with the correctness of their local implementation, i.e.…”

Section: Resultsmentioning

confidence: 99%

“…It would be interesting to consider correctness results combining these two approaches. We are currently investigating the proof of a refined abstract machine based on [1].…”

Section: Resultsmentioning

confidence: 99%

“…However, it should be straightforward to define an observation predicate on π-calculus processes and PAM terms (such as those in [1,7,11]) and show that preserves the observables.…”

Section: P As [[P]]mentioning

confidence: 99%

“…There have been several recent papers devoted to the formal description of implementations of process calculi based on the π-calculus or the Ambient calculus. In addition to Pict, one can notably cite the Jocaml distributed implementation of the Join calculus [6,5], the Join calculus implementation of Mobile Ambients [7], Nomadic Pict [22,20], the abstract machine for the M-calculus [10], the Fusion Machine [8], the PAN and GCPAN abstract machines for Safe Ambients [11,12], the CAM abstract machine for Channel Ambients [15] and the abstract machine for the Kell calculus [1]. Most of these works [7,22,20,10,8,11,12,15,1] deal with distributed implementations of calculi, rather than local implementation of concurrent processes like in Pict.…”

Section: Related Workmentioning

confidence: 99%

See 3 more Smart Citations

Pict correctness revisited

Bidinger

Compagnoni

2009

Theoretical Computer Science

Self Cite

View full text Add to dashboard Cite

machine Fairness Pict a b s t r a c tThe Pict programming language is an implementation of the π -calculus in which executions of π-calculus terms are specified via an abstract machine. An important property of any concurrent programming language implementation is the fair execution of threads. After defining fairness for the π-calculus, we show that Pict abstract machine executions implement fair π-calculus executions. We also give new proofs of soundness and liveness for the Pict abstract machine.

show abstract

Section: Resultsmentioning

confidence: 99%

“…It would be interesting to consider correctness results combining these two approaches. We are currently investigating the proof of a refined abstract machine based on [1].…”

Section: Resultsmentioning

confidence: 99%

“…However, it should be straightforward to define an observation predicate on π-calculus processes and PAM terms (such as those in [1,7,11]) and show that preserves the observables.…”

Section: P As [[P]]mentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

See 2 more Smart Citations

Pict correctness revisited

Bidinger

Compagnoni

2009

Theoretical Computer Science

Self Cite

View full text Add to dashboard Cite

show abstract

“…Moreover, we benefited from the Kell calculus papers [BS03,BSS05,SS04], where the problems raised by using atomic actions (i.e., a sort of distributed synchronization) in wide-area networks are discussed. In particular, the authors highlight the need of modeling different forms of failure; we kept this in mind when giving the semantics of the moving capabilities.…”

Section: Related Workmentioning

confidence: 99%

A model checking-based approach for security policy verification of mobile systems

2011

View full text Add to dashboard Cite

This article describes an approach for the automated verification of mobile systems. Mobile systems are characterized by the explicit notion of location (e.g., sites where they run) and the ability to execute at different locations, yielding a number of security issues. To this aim, we formalize mobile systems as Labeled Kripke Structures, encapsulating the notion of location net that describes the hierarchical nesting of the threads constituting the system. Then, we formalize a generic security-policy specification language that includes rules for expressing and manipulating the code location. In contrast to many other approaches, our technique supports both access control and information flow specification. We developed a prototype framework for model checking of mobile systems. It works directly on the program code (in contrast to most traditional process-algebraic approaches that can model only limited details of mobile systems) and uses abstraction-refinement techniques, based also on location abstractions, to manage the program state space. We experimented with a number of mobile code benchmarks by verifying various security policies. The experimental results demonstrate the validity of the proposed mobile system modeling and policy specification formalisms and highlight the advantages of the model checking-based approach, which combines the validation of security properties with other checks, such as the validation of buffer overflows.

show abstract