Filters








81 Hits in 6.2 sec

A Flexible Framework for Visualisation of Computational Properties of General Explicit Substitutions Calculi

F.L.C. de Moura, A.V. Barbosa, M. Ayala-Rincón, F. Kamareddine
2011 Electronical Notes in Theoretical Computer Science  
SUBSEXPL is a system originally developed to visualise reductions, simplifications and normalisations in three important calculi of explicit substitutions and has been applied to understand and explain  ...  SUBSEXPL has been used with success for teaching basic properties of the λ-calculus and for illustrating the computational impact of selecting one kind of representation of variables (either names or indices  ...  In fact, just recently a calculus of explicit substitutions that satisfies the desired computational properties was developed [26] .  ... 
doi:10.1016/j.entcs.2011.03.004 fatcat:iwspr275tvcc7c5bwuyihz5mva

On Distributability in Process Calculi [chapter]

Kirstin Peters, Uwe Nestmann, Ursula Goltz
2013 Lecture Notes in Computer Science  
For this, we propose a new quality criterion that (1) measures the preservation of distributability and (2) allows us to derive two synchronisation patterns that separate several variants of pi-like calculi  ...  We present a novel approach to compare process calculi and their synchronisation mechanisms by using synchronisation patterns and explicitly considering the degree of distributability.  ...  In order to provide a general framework, Gorla in [8] suggests five criteria well suited for language comparison.  ... 
doi:10.1007/978-3-642-37036-6_18 fatcat:hdzudrm3vbfbhm4zh3pdzpknpu

Unifying Heterogeneous State-Spaces with Lenses [chapter]

Simon Foster, Frank Zeyda, Jim Woodcock
2016 Lecture Notes in Computer Science  
Though a variety of heterogeneous statespace models exists, they all possess common theoretical properties one would like to capture abstractly, such as the common algebraic laws of programming.  ...  The combination of lenses and relational algebra gives rise to a model for UTP in which its fundamental laws can be verified.  ...  Burkhart Wolff for his generous and helpful comments on our work.  ... 
doi:10.1007/978-3-319-46750-4_17 fatcat:iqgqf6snefe5beipuqnkia42ka

Efficient Implementation of Evaluation Strategies via Token-Guided Graph Rewriting

Koko Muroya, Dan R. Ghica
2018 Electronic Proceedings in Theoretical Computer Science  
We contributed to the study of this trade-off by the introduction of an abstract machine for call-by-need, inspired by Girard's Geometry of Interaction, a machine combining token passing and graph rewriting  ...  While the notion of correctness is determined by the evaluation strategy, regarding efficiency there is a larger design space that can be explored, in particular the trade-off between space versus time  ...  Acknowledgement We thank Steven Cheung for helping us implement the on-line visualiser.  ... 
doi:10.4204/eptcs.265.5 fatcat:22psmjrwcjhqlpwkjlbdu375de

Engineering Simulations for Cancer Systems Biology

James Bown, Paul S. Andrews, Yusuf Deeni, Alexey Goltsov, Michael Idowu, Fiona A.C. Polack, Adam T. Sampson, Mark Shovman, Susan Stepney
2012 Current Drug Targets  
Our framework comprises a process to clearly separate scientific and engineering concerns in model and simulation development, and an argumentation approach to documenting models for rigorous way of recording  ...  Computer simulation can be used to inform in vivo and in vitro experimentation, enabling rapid, low-cost hypothesis generation and directing experimental design in order to test those hypotheses.  ...  Goltsov and Shovman acknowledge support from SICSA, the Scottish Informatics and Computer Science Alliance.  ... 
doi:10.2174/138945012803530071 pmid:22974398 fatcat:msgotbcthzatxlnhopct4c5il4

An Algebra of Hierarchical Graphs [chapter]

Roberto Bruni, Fabio Gadducci, Alberto Lluch Lafuente
2010 Lecture Notes in Computer Science  
A design is a term of sort D generated by the grammar  ...  Our algebra can be understood as a high-level language for describing graphs with a node-sharing, embedding structure, and it is then well suited for defining graphical representations of software models  ...  We are greatful to the EU project Sensoria for the support and to Artur Boronat for fruitful discussions regarding his algebraic approach to MOF [2] and for allowing us to use the figures of [1] .  ... 
doi:10.1007/978-3-642-15640-3_14 fatcat:q6ikd7mqdjdmnkp2s3pc3hlyiu

Modelling the dynamics of biosystems

C. Priami
2004 Briefings in Bioinformatics  
Biology can benefit this approach, yielding a better understanding of behavioural properties of cells, and computer science can benefit this approach, obtaining new computational models inspired by nature  ...  The need for a more formal handling of biological information processing with stochastic and mobile process algebras is addressed.  ...  There is a general understanding in the scientific community that computer science will be as indispensable for biology as mathematics has been for physics.  ... 
doi:10.1093/bib/5.3.259 pmid:15383212 fatcat:kooxjwbrnbgghjketwvsywz2pi

The Dynamic Geometry of Interaction Machine: A Token-Guided Graph Rewriter

Koko Muroya, Dan R. Ghica
2018 Logical Methods in Computer Science  
Aiming at a unified framework that would enable the study of this trade-off, we introduce an abstract machine, inspired by Girard's Geometry of Interaction (GoI), a machine combining token passing and  ...  While the notion of correctness is determined by the evaluation strategy, regarding efficiency there is a larger design space that can be explored, in particular the trade-off between space versus time  ...  Cheung for helping us implement the on-line visualiser. The second author is grateful to Michele Pagani for stimulating discussions in the very early stages of this work.  ... 
doi:10.23638/lmcs-15(4:7)2019 fatcat:pktnycbigzfqbhcxywrnrp7nfa

The Dynamic Geometry of Interaction Machine: A Token-Guided Graph Rewriter [article]

Koko Muroya, Dan R. Ghica
2019 arXiv   pre-print
Aiming at a unified framework that would enable the study of this trade-off, we introduce an abstract machine, inspired by Girard's Geometry of Interaction (GoI), a machine combining token passing and  ...  While the notion of correctness is determined by the evaluation strategy, regarding efficiency there is a larger design space that can be explored, in particular the trade-off between space versus time  ...  Cheung for helping us implement the on-line visualiser. The second author is grateful to Michele Pagani for stimulating discussions in the very early stages of this work.  ... 
arXiv:1803.00427v3 fatcat:lkit7r3jw5ardggq5gjl42ztem

Memoryful geometry of interaction II: recursion and adequacy

Koko Muroya, Naohiko Hoshino, Ichiro Hasuo
2016 Proceedings of the 43rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages - POPL 2016  
Cheung for helping us implement the on-line visualiser. The second author is grateful to Michele Pagani for stimulating discussions in the very early stages of this work.  ...  Acknowledgement We are grateful to Ugo Dal Lago and anonymous reviewers for encouraging and insightful comments on earlier versions of this work. We thank Steven W. T.  ...  As shown in the top of Fig. 1 , the calculus accommodates explicit substitutions [x ← u]. A term with no explicit substitutions is said to be "pure".  ... 
doi:10.1145/2837614.2837672 dblp:conf/popl/MuroyaHH16 fatcat:4anfzezscjgdpmn34xqoxbjfg4

Ownership Types: A Survey [chapter]

Dave Clarke, Johan Östlund, Ilya Sergey, Tobias Wrigstad
2013 Lecture Notes in Computer Science  
Ownership types were devised nearly 15 years ago to provide a stronger notion of protection to object-oriented programming languages.  ...  Originating as the formalisation of the core of Flexible Alias Protection, ownership types have since been extended and adapted in many ways, and the notion of protection provided has been refined into  ...  Thanks to Marwan Abi-Antoun, Jonathan Aldrich, Peter Müller, and the anonymous reviewers for their detailed comments.  ... 
doi:10.1007/978-3-642-36946-9_3 fatcat:inhsxhjizzfrvizsdz5blacu4i

On the Distributability of Mobile Ambients

Kirstin Peters, Uwe Nestmann
2018 Electronic Proceedings in Theoretical Computer Science  
To analyse the quality of mobile ambients as a good foundational model for distributed computation, we analyse the level of synchronisation between distributed components that they can express.  ...  Finally, we discuss how these results can be used to obtain a fully distributed variant of mobile ambients.  ...  For the calculi without an explicit notion of location [22] defines a general notion of distributability that focuses on the possible division of a process term into components.  ... 
doi:10.4204/eptcs.276.9 fatcat:u4x7uvwxwjbw5n6msivr6t6dge

Journeys in non-classical computation II: initial journeys and waypoints

Susan Stepney, Samuel L. Braunstein, John A. Clark, Andy Tyrrell, Andrew Adamatzky, Robert E. Smith, Tom Addis, Colin Johnson, Jonathan Timmis, Peter Welch, Robin Milner, Derek Partridge
2006 International Journal of Parallel, Emergent and Distributed Systems  
For example, a fixed-point algorithm on a quantum computer could include a superposition of all fixed points, not just the stable one obtained by repeated substitution.  ...  Current state of the framework Over the past ten years, the Concurrency Research Group at Kent [91] has been laying the foundations for such a framework.  ... 
doi:10.1080/17445760500355454 fatcat:amvihccwmvbvviswdc5344cu5m

Infobiotics Workbench: A P Systems Based Tool for Systems and Synthetic Biology [chapter]

Jonathan Blakes, Jamie Twycross, Savas Konur, Francisco Jose Romero-Campero, Natalio Krasnogor, Marian Gheorghe
2013 Emergence, Complexity and Computation  
This chapter gives an overview of an integrated software suite, the Infobiotics Workbench, which is based on a novel spatial discrete-stochastic P systems modelling framework.  ...  Its capability for building, analysing and optimising large spatially discrete and stochastic models of multicellular systems makes it a useful, coherent and comprehensive in silico tool in systems and  ...  Some parts of this paper are based on the first authors PhD thesis [13] .  ... 
doi:10.1007/978-3-319-03191-0_1 fatcat:vz4edynpzbglxiyg23evljxeqi

On the Distributability of Mobile Ambients (Technical Report) [article]

Kirstin Peters, Uwe Nestmann
2018 arXiv   pre-print
To analyse the quality of mobile ambients as a good foundational model for distributed computation, we analyse the level of synchronisation between distributed components that they can express.  ...  Finally, we discuss how these results can be used to obtain a fully distributed variant of mobile ambients.  ...  For the calculi without an explicit notion of location [22] defines a general notion of distributability that focuses on the possible division of a process term into components.  ... 
arXiv:1808.01599v1 fatcat:ulomlfpp3jgvhf5f7lwpmum76i
« Previous Showing results 1 — 15 out of 81 results