Filters








171 Hits in 2.6 sec

A Type System for proving Depth Boundedness in the pi-calculus [article]

Emanuele D'Osualdo, Luke Ong
2015 arXiv   pre-print
We propose a novel type system, parameterised over a finite forest, that formalises name usage by pi-terms in a manner that respects the forest.  ...  The depth-bounded fragment of the pi-calculus is an expressive class of systems enjoying decidability of some important verification problems. Unfortunately membership of the fragment is undecidable.  ...  ACKNOWLEDGEMENT We would like to thank Damien Zufferey for helpful discussions on the nature of depth boundedness.  ... 
arXiv:1502.00944v2 fatcat:5n46ef3ol5cqtilyd2ucpq6jea

Using Session Types for Reasoning About Boundedness in the Pi-Calculus

Hans Hüttel
2017 Electronic Proceedings in Theoretical Computer Science  
In this paper we use binary session types to decise two type systems that give a sound characterization of the properties: If a process is well-typed in our first system, it is depth-bounded.  ...  The classes of depth-bounded and name-bounded processes are fragments of the pi-calculus for which some of the decision problems that are undecidable for the full calculus become decidable.  ...  Soundness of the type system for depth-boundedness In the following we will consider the correctness properties of the type system for depth boundedness.  ... 
doi:10.4204/eptcs.255.5 fatcat:xqtta5pym5bsxeeecvov65rejy

On Hierarchical Communication Topologies in the $$\pi $$ -calculus [chapter]

Emanuele D'Osualdo, C.-H. Luke Ong
2016 Lecture Notes in Computer Science  
The soundness proof of the type system employs a non-standard view of π-calculus reactions. The coverability problem for hierarchical terms is decidable.  ...  This is proved by showing that every hierarchical term is depth-bounded, an undecidable property known in the literature.  ...  We would like to thank Damien Zufferey for helpful discussions on the nature of depth boundedness, and Roland Meyer for insightful feedback on a previous version of this paper. Bibliography  ... 
doi:10.1007/978-3-662-49498-1_7 fatcat:xtijxdrdf5gifmm5sezfh7tx7m

Forward Analysis of Depth-Bounded Processes [chapter]

Thomas Wies, Damien Zufferey, Thomas A. Henzinger
2010 Lecture Notes in Computer Science  
In this paper we develop an adequate domain of limits for the well-structured transition systems that are induced by depth-bounded processes.  ...  Depth-bounded processes form the most expressive known fragment of the π-calculus for which interesting verification problems are still decidable.  ...  While checking depth-boundedness is in general undecidable, many fragments of the π-calculus that are defined syntactically [2, 7] or in terms of type systems [4, 25, 26] are subsumed by depth-bounded  ... 
doi:10.1007/978-3-642-12032-9_8 fatcat:if7c3sdgara2zdzzk5ux3hconu

Decidable Inductive Invariants for Verification of Cryptographic Protocols with Unbounded Sessions [article]

Emanuele D'Osualdo, Felix Stutz
2020 arXiv   pre-print
Since the problem is undecidable in general, we introduce depth-bounded protocols, a strict generalisation of a class from the literature, for which our decidable analysis is sound and complete.  ...  We develop a theory of decidable inductive invariants for an infinite-state variant of the Applied pi-calculus, with applications to automatic verification of stateful cryptographic protocols with unbounded  ...  Acknowledgements We would like to thank Alwen Tiu, Roland Meyer and Véronique Cortier for the useful feedback.  ... 
arXiv:1911.05430v2 fatcat:qjafaoupizeu5ioorgvdxfwsne

Adventures in time and space

Norman Danner, James S. Royer
2006 Conference record of the 33rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL'06  
The type system comes in two parts, one that primarily restricts the sizes of values of expressions and a second that primarily restricts the time required to evaluate expressions.  ...  This paper investigates what is essentially a call-by-value version of PCF under a complexity-theoretically motivated type system.  ...  Finally many thanks to Peter O'Hearn, Josh Berdine, and the Queen Mary theory group for hosting my visit in the Autumn of 2005 and for repeatedly raking my poor type-systems over the coals until something  ... 
doi:10.1145/1111037.1111053 dblp:conf/popl/DannerR06 fatcat:kgamy5t645burgvazikhrejjqy

Adventures in time and space

2015 Science  
The type system comes in two parts, one that primarily restricts the sizes of values of expressions and a second that primarily restricts the time required to evaluate expressions.  ...  This paper investigates what is essentially a call-by-value version of PCF under a complexity-theoretically motivated type system.  ...  Finally many thanks to Peter O'Hearn, Josh Berdine, and the Queen Mary theory group for hosting my visit in the Autumn of 2005 and for repeatedly raking my poor type-systems over the coals until something  ... 
doi:10.1126/science.aad5282 fatcat:z3rkygh7ajcxjilrru42gywt4y

Adventures in time and space

Norman Danner, James S. Royer
2006 SIGPLAN notices  
The type system comes in two parts, one that primarily restricts the sizes of values of expressions and a second that primarily restricts the time required to evaluate expressions.  ...  This paper investigates what is essentially a call-by-value version of PCF under a complexity-theoretically motivated type system.  ...  Finally many thanks to Peter O'Hearn, Josh Berdine, and the Queen Mary theory group for hosting my visit in the Autumn of 2005 and for repeatedly raking my poor type-systems over the coals until something  ... 
doi:10.1145/1111320.1111053 fatcat:uvevcht34ram7lbfocmztdqtsa

Efficient Engineering of Complex Self-Organising Systems by Self-Stabilising Fields

Mirko Viroli, Jacob Beal, Ferruccio Damiani, Danilo Pianini
2015 2015 IEEE 9th International Conference on Self-Adaptive and Self-Organizing Systems  
Self-organising systems are notoriously difficult to engineer, particularly due to the interactions between complex specifications and the simultaneous need for efficiency and for resilience to faults  ...  Beginning with field calculus, we identify the largest known sub-language of self-stabilising programs, guaranteed to eventually attain correct behavior despite any perturbation in state or topology.  ...  We shall assume a type system (a variant of the Hindley-Milner type system [22] ) can be built for this calculus along the lines of [3] , [4] , which has two kinds of types: local types (for local values  ... 
doi:10.1109/saso.2015.16 dblp:conf/saso/ViroliBDP15 fatcat:i435z4ugfjg4ldaioep3ywwz4i

Modality, bisimulation and interpolation in infinitary logic

Johan van Benthem
1999 Annals of Pure and Applied Logic  
The main results show how its model-theoretic invariance properties, first established within first-order model theory, may be lifted to infinitary logic, a natural generalized habitat for theories of  ...  In this contribution, I consider the bridge concept of blsimulation, which links modal logic with computational process theories.  ...  Barwise and van Benthem [3] prove this result using the Boundedness Theorem for L,,,.  ... 
doi:10.1016/s0168-0072(98)00029-3 fatcat:kmxgk5pudndcvliy2kcfmdz66m

The Ideal Theory for WSTS [chapter]

Alain Finkel
2016 Lecture Notes in Computer Science  
We argue that the theory of ideals prompts a renewal of the theory of WSTS by providing a way to define a new class of monotonic systems, the so-called Well Behaved Transition Systems, which properly contains  ...  WSTS, and for which coverability is still decidable by a forward algorithm.  ...  Acknowledgement I would like to thank Michael Blondin, Jean Goubault-Larrecq and Pierre McKenzie for fruitful discussions and for having allowed me to use some parts of common papers.  ... 
doi:10.1007/978-3-319-45994-3_1 fatcat:ym2cdxqginagtk2kvoiuip6l5m

A Calculus of Mobile Resources* [chapter]

Jens Chr. Godskesen, Thomas Hildebrandt, Vladimiro Sassone
2002 Lecture Notes in Computer Science  
We introduce a calculus of Mobile Resources (MR) tailored for the design and analysis of systems containing mobile, possibly nested, computing devices that may have resource and access constraints, and  ...  We provide examples of the expressiveness of the calculus, and apply the theory to prove one of its characteristic properties.  ...  The phenomenon is totally analogous to that in the (higher-order) pi-calculus, and we handle it as usual (cf.  ... 
doi:10.1007/3-540-45694-5_19 fatcat:g4xldnn4fnhvzglxjxa3mbp4au

Church's thesis and related axioms in Coq's type theory [article]

Yannick Forster
2020 arXiv   pre-print
Recently, 𝖢𝖳 was proved consistent for (univalent) constructive type theory.  ...  The paper can also be read as a broad survey of axioms in type theory, with all results mechanised in the Coq proof assistant.  ...  The calculus is a constructive type theory with a cumulative hierarchy of types T i (but we leave out the index from now on), an impredicative universe of propositions P, and inductive types in every universe  ... 
arXiv:2009.00416v2 fatcat:nlxcksyn2bb23b3uf5ntjpnz3i

Type-based information flow analysis for the π-calculus

Naoki Kobayashi
2005 Acta Informatica  
We propose a new type system for information flow analysis for the π-calculus.  ...  Our type system treats a wide range of communication/synchronization primitives in a uniform manner, which enabled development of a clear proof of type soundness and a sound and complete type inference  ...  We would also like to thank anonymous referees for a number of useful comments.  ... 
doi:10.1007/s00236-005-0179-x fatcat:3s2mbig42zgjxps3pnh6jq2k6q

Formal Verification of Petri Nets with Names [chapter]

Marco Montali, Andrey Rivkin
2016 Lecture Notes in Computer Science  
We introduce sophisticated variants of first-order µcalculus to specify rich properties that simultaneously account for the system dynamics and the names present in its states.  ...  Notably, our decidability results are obtained via a translation to datacentric dynamic systems, a recently devised framework for the formal specification and verification of business processes working  ...  Thanks to the decidability of stateboundedness for ν-PNs, the DCDSs obtained from our translation mechanism represent an interesting DCDS fragment for which state-boundedness is indeed decidable to check  ... 
doi:10.1007/978-3-319-33612-1_3 fatcat:jiccyhbxuffldkjkyhrcyiqj7i
« Previous Showing results 1 — 15 out of 171 results