Filters








736 Hits in 3.1 sec

Finite State Verification for the Asynchronous π-Calculus [chapter]

Ugo Montanari, Marco Pistore
1999 Lecture Notes in Computer Science  
Finite state verification is problematic in this context, since even very simple asynchronous π-processes give rise to infinite-state behaviors.  ...  The π-calculus is a development of CCS that has the ability of communicating channel names. The asynchronous π-calculus is a variant of the π-calculus where message emission is non-blocking.  ...  In this paper we face the problem of finite state verification for the asynchronous π-calculus.  ... 
doi:10.1007/3-540-49059-0_18 fatcat:zxldpvqaevdcnbhrnu6tnsbpb4

About Compositional Analysis of π-Calculus Processes [chapter]

Fabio Martinelli
2002 Foundations of Information Technology in the Era of Network and Mobile Computing  
We set up a logical framework for the compositional analysis of finite 71'calculus processes.  ...  As one of the possible applications, we show that our techniques may be used to study interesting security properties as confidentiality for (finite) 71'--calculus processes.  ...  We wish to thank Andy Gordon for encouraging comments about this work. Thanks are also due to the anonymous referees for their help for the presentation of the paper.  ... 
doi:10.1007/978-0-387-35608-2_43 dblp:conf/ifipTCS/Martinelli02 fatcat:ndc2n7a44zbs3e7iljmvymfy3u

Toward Design, Modelling and Analysis of Dynamic Workflow Reconfigurations [chapter]

Manuel Mazzara, Faisal Abouzaid, Nicola Dragoni, Anirban Bhattacharyya
2012 Lecture Notes in Computer Science  
We then use an asynchronous π-calculus and W ebπ∞ to model the design and to verify whether or not it will meet the requirements.  ...  We state the requirements on a system implementing the workflow and its reconfiguration, and describe the system's design in BPMN.  ...  Acknowledgments This work is partly funded by the EPSRC under the terms of a graduate studentship.  ... 
doi:10.1007/978-3-642-29834-9_6 fatcat:4azm3jd3lrfmta46xdkf6vir5y

On bisimulations for the asynchronous π-calculus

Roberto M. Amadio, Ilaria Castellani, Davide Sangiorgi
1998 Theoretical Computer Science  
The asynchronous n-calculus is a variant of the n-calculus where message emission is nonblocking. Honda and Tokoro have studied a semantics for this calculus based on bisimulation.  ...  In this paper we propose a new notion of bisimulation for the asynchronous n-calculus, defined on top of the standard labelled transition system.  ...  Turner for interesting initial discussions and Marco Pistore for helpful comments.  ... 
doi:10.1016/s0304-3975(97)00223-5 fatcat:xdpwtqtzjjeq5a33k7syofwdti

Interactive foundations of computing

Peter Wegner
1998 Theoretical Computer Science  
The extension of Turing to interaction machines parallels that of the lambda to the pi calculus.  ...  Part I of this paper examines extensions to interactive models for algorithms, machines, grammars, and semantics, while Part II considers the expressiveness of different forms of interaction.  ...  P23 (names): The pi calculus for names is an interactive analog of the CCS calculus for values.  ... 
doi:10.1016/s0304-3975(97)00154-0 fatcat:jfv7xn5nlveqjagut2rkidjdem

Static Analysis Techniques to Verify Mutual Exclusion Situations within SysML Models [chapter]

Ludovic Apvrille, Pierre de Saqui-Sannes
2013 Lecture Notes in Computer Science  
So far, formal verification of AVATAR models has relied on reachability techniques that face a state explosion problem.  ...  TTool implements a push-button approach and displays verification results at the AVATAR model level. The approach is not restricted to AVATAR and my be adapted to other UML profiles.  ...  The first possibility is to generate a pi-calculus specification, and then using ProVerif for verifying security properties.  ... 
doi:10.1007/978-3-642-38911-5_6 fatcat:iisamqiep5acplfikzmjjsdb5q

Foundations of Software Science and Computational Structures: Selected papers from FOSSACS 2005

Vladimiro Sassone
2008 Theoretical Computer Science  
, and is now a firmly-established point of reference for the Theoretical Computer Science research community.  ...  FOSSACS invites submissions on theories and methods to underpin the analysis, integration, synthesis, transformation, and verification of programs and software systems.  ...  FULL ABSTRACTION FOR POLYMORPHIC PI-CALCULUS Alan Jeffrey and Julian Rathke The authors establish a fully-abstract model for an asynchronous polymorphic π-calculus, the first such model ever for a concurrent  ... 
doi:10.1016/j.tcs.2007.09.019 fatcat:sknvkrnpozfl7d365rws52wwke

Mobile Processes: A Commented Bibliography [chapter]

Silvano Dal Zilio
2001 Lecture Notes in Computer Science  
π-calculus of Milner, Parrow and Walker for example, and motile processes, which can exhibit motion, as modelled in the ambient calculus of Cardelli and Gordon.  ...  A common characteristic of the algebraic frameworks presented in this paper is the use of names as first class values and the support for the dynamic generation of new, fresh names.  ...  Acknowledgments I would like to thank Uwe Nestmann and Peter Sewell for helpful comments. Luca Cardelli and Andy Gordon commented on a previous version of this text.  ... 
doi:10.1007/3-540-45510-8_11 fatcat:ksp2ci37rbc5jbwokvcs2ugspq

Towards automatic verification of Erlang programs by π-calculus translation

Chanchal Kumar Roy, Thomas Noll, Banani Roy, James R. Cordy
2006 Proceedings of the 2006 ACM SIGPLAN workshop on Erlang - ERLANG '06  
This paper provides a contribution to the formal modeling and verification of programs written in Erlang.  ...  It presents a mapping of Erlang programs to the π-calculus, a process algebra whose namepassing feature allows representation of the mobile aspects of software written in Erlang in a natural way.  ...  Acknowledgments The authors would like to thank Simon Thompson and the other three anonymous referees for their useful comments and suggestions.  ... 
doi:10.1145/1159789.1159798 dblp:conf/erlang/RoyNRC06 fatcat:zuexcl6tuvbqvip5zpx7qnyrfm

Issues about the Adoption of Formal Methods for Dependable Composition of Web Services [article]

Manuel Mazzara, Michele Ciavotta
2013 arXiv   pre-print
Nevertheless, we still try to propose some tentative answers based on our proposal for a composition calculus, which we hope can animate a proper discussion.  ...  The aim of this work is to individuate the proper questions on the adoption of formal methods for dependable composition of Web Services, not necessarily to find the optimal answers.  ...  For some of the ideas discussed here we have also to thank Cosimo Laneve, and Gianluigi Zavattaro among the others.  ... 
arXiv:1311.2535v1 fatcat:yko65m62nzgjdehpbqperntkxe

Models and emerging trends of concurrent constraint programming

Carlos Olarte, Camilo Rueda, Frank D. Valencia
2013 Constraints  
In this survey, we shall provide a unified presentation of the most important developments, applications and state of the art in CCP.  ...  We aim at giving a broad perspective to the reader about the calculus, its variants, applications and reasoning techniques, as well as recent trends in the area.  ...  We thank the anonymous reviewers for their detailed comments that helped us to improve this paper. Special thanks to Jorge A. Perez for his careful remarks and suggestions.  ... 
doi:10.1007/s10601-013-9145-3 fatcat:7mx6xnyfcjad7musa373vockne

An Executable Specification of Asynchronous Pi-Calculus Semantics and May Testing in Maude 2.0

Prasanna Thati, Koushik Sen, Narciso Martí-Oliet
2004 Electronical Notes in Theoretical Computer Science  
relation that characterizes may testing in asynchronous π-calculus.  ...  We also present an executable specification of the may testing equivalence on non-recursive asynchronous π-calculus processes, using the Maude metalevel.  ...  This work was done while the last author was visiting the Department of Computer Science in the University of Illinois at Urbana-Champaign, for whose hospitality he is very grateful.  ... 
doi:10.1016/s1571-0661(05)82539-3 fatcat:7hcogzp6f5akthcomvqn2q4bna

Model checking the probabilistic pi-calculus

Gethin Norman, Catuscia Palamidessi, David Parker, Peng Wu
2007 Fourth International Conference on the Quantitative Evaluation of Systems (QEST 2007)  
Formal verification techniques for this calculus have clear applications in several domains, including mobile ad-hoc network protocols and random security protocols.  ...  Building upon the (non-probabilistic) π-calculus model checker MMC, we first show an automated procedure for constructing the Markov decision process representing a probabilistic πcalculus process.  ...  This extension, MMC sp , can derive the semantic model for an arbitrary (input-closed) process in the (finite-control) probabilistic π-calculus.  ... 
doi:10.1109/qest.2007.31 dblp:conf/qest/NormanPPW07 fatcat:fnxykmrjtbbhlmfot5csjvchg4

Asynchronous router specification

F. Moller
1997 IEEE Aerospace and Electronic Systems Magazine  
The case study in question involves the specification of an asynchronous message router; the three design tools are process algebra (specifically Milner's Calculus of Communicating Systems CCS), the modal  ...  We demonstrate how an informally-presented specification can be formalised within the language of the modal y-calculus, allowing for a rigorous mathematical analysis of the correctness of our proposed  ...  This verification can be undertaken by the CWB. The example we use for the case study is an asynchronous message router.  ... 
doi:10.1109/62.579208 fatcat:aiupdlob4bae3dvvrf3nmap3t4

Security Abstractions and Intruder Models (Extended Abstract)

Michele Bugliesi, Riccardo Focardi
2009 Electronical Notes in Theoretical Computer Science  
for security analysis and verification.  ...  Drawing on our earlier work along these lines [5], we investigate the expressive power of a core set of security and network abstractions that provide high-level primitives for the specifications of the  ...  The starting point is the asynchronous pi-calculus with security abstractions we defined in [5] .  ... 
doi:10.1016/j.entcs.2009.06.015 fatcat:7he3rl2xbngvbjuvycntqi3aqi
« Previous Showing results 1 — 15 out of 736 results