Filters








13 Hits in 6.1 sec

The marriage of bisimulations and Kripke logical relations

Chung-Kil Hur, Derek Dreyer, Georg Neis, Viktor Vafeiadis
2012 SIGPLAN notices  
Two of the most prominent types of techniques to have emerged are bisimulations and Kripke logical relations (KLRs).  ...  In this paper, we propose relation transition systems (RTSs), which marry together some of the most appealing aspects of KLRs and bisimulations.  ...  Acknowledgments We thank Deepak Garg, Eijiro Sumii, and the anonymous reviewers for very helpful feedback on the paper, as well as Andrew Pitts for alerting us to the connection with Mendler-style recursion  ... 
doi:10.1145/2103621.2103666 fatcat:fx35otnsvbeylnndq3empy563a

The marriage of bisimulations and Kripke logical relations

Chung-Kil Hur, Derek Dreyer, Georg Neis, Viktor Vafeiadis
2012 Proceedings of the 39th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '12  
Two of the most prominent types of techniques to have emerged are bisimulations and Kripke logical relations (KLRs).  ...  In this paper, we propose relation transition systems (RTSs), which marry together some of the most appealing aspects of KLRs and bisimulations.  ...  Acknowledgments We thank Deepak Garg, Eijiro Sumii, and the anonymous reviewers for very helpful feedback on the paper, as well as Andrew Pitts for alerting us to the connection with Mendler-style recursion  ... 
doi:10.1145/2103656.2103666 dblp:conf/popl/HurDNV12 fatcat:xhuicvkxvzbynjoxvsgumjqqrm

From Bounded Checking to Verification of Equivalence via Symbolic Up-to Techniques [article]

Vasileios Koutavas and Yu-Yang Lin and Nikos Tzevelekos
2021 arXiv   pre-print
This technique combines fully abstract symbolic environmental bisimulations similar to symbolic game semantics, novel up-to techniques, and lightweight state invariant annotations.  ...  We realise the technique in a tool prototype called Hobbit and benchmark it with an extensive set of new and existing examples.  ...  Jaber, G., Tabareau, N.: Kripke open bisimulation -A marriage of game semantics and operational techniques. In: APLAS. Springer (2015) 16.  ... 
arXiv:2105.02541v2 fatcat:y52xwjzbozaprjg47prdkyn35e

The Geometry of Concurrent Interaction: Handling Multiple Ports by Way of Multiple Tokens (Long Version) [article]

Ugo Dal Lago and Ryo Tanaka and Akira Yoshimizu
2017 arXiv   pre-print
The latter is obtained by a fine analysis of convergence, both in nets and in token machines.  ...  We prove soundness and adequacy of the introduced model. The former is proved as a simulation result between the token machines one obtains along any reduction sequence.  ...  Acknowledgment The first author is partially supported by the ANR projects 12IS02001 PACE, and 14CE250005 ELICA. The third author is partially supported by the JST ERATO Grant Number JPMJER1603.  ... 
arXiv:1704.04620v1 fatcat:l745lytg35a2dby5aosfgcei2i

The geometry of concurrent interaction: Handling multiple ports by way of multiple tokens

Ugo Dal Lago, Ryo Tanaka, Akira Yoshimizu
2017 2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)  
We allow multiple tokens to move around at the same time and make use of them to realise the process of resolving nondeterminism and keeping track of choices, that we call marriages.  ...  This framework provides us with a natural way of defining parallel composition, and we will prove our semantics to be indeed compositional, i.e., that the parallel composition of two nets can be interpreted  ...  Acknowledgment The first author is partially supported by the ANR projects 12IS02001 PACE, and 14CE250005 ELICA. The third author is partially supported by the JST ERATO Grant Number JPMJER1603.  ... 
doi:10.1109/lics.2017.8005112 dblp:conf/lics/LagoTY17 fatcat:iow3wsike5c73diqxpymiwkdba

Report on BCTCS & AlgoUK 2020

Ulrich Berger, Faron Moller
2020 Bulletin of the European Association for Theoretical Computer Science  
diversity games; and Dr MS Ramanujan (Warwick) spoke on lossy kernelization.  ...  With the scene set by the opening invited lecture by Simon Chadwick from Siemens Rail Automation UK, three of Europe's leading railway verification groups presented the state-of-the-art in railway verification  ...  Adam /'O Conghaile (Cambridge University) Game comonads and generalised quantifiers Game comonads, introduced for the pebble game by Abramsky, Dawar and Wang (2017), and expanded to EF and bisimulation  ... 
dblp:journals/eatcs/BergerM20 fatcat:tnr3ji4yazgethl4qyhxkk6esm

Subject index volumes 1–200

1999 Theoretical Computer Science  
Kowalevskaya and -, 3594 game chip-firing -. 3 183 crossing set -, 3 101 drinking glasses, 2117 game of Daisies, 1787 Go, 329 1 kriegspiel, 1788 twenty questions, 3566 game technique, 2791  ...  states, 3107 languages, 489 stable marriage problem, 2426 man-optimal -, 2475 stable marriages, 2426 model semantics, 2040, 2797, 3392 model, ground -, 3 148 stable models, 2058. 2797, 3207 of  ... 
doi:10.1016/s0304-3975(98)00319-3 fatcat:s22ud3iiqjht7lfbtc3zctk7zm

An Old Discipline with a New Twist: The Course "Logic in Action"

Johan van Benthem
2017 IfColog journal of logics and their applications (FLAP)  
We hope that this volume will inspire teachers so that the way logic is taught to a wide range of students from undergraduate to postgraduate gets improved, and thereby make those audiences aware of the  ...  We are also very grateful to the Editorial Board of IfCoLog for agreeing in publishing this volume. Thanks are due to Jane Spurr, M. Antonia Huertas Sánchez, Dov Gabbay and Michael Gabbay.  ...  Then, a linear algebraic reformulation of Kripke semantics is defined by Boolean operations on matrices and vectors.  ... 
dblp:journals/flap/Benthem17 fatcat:e5d54ekdhrbmjcs3ywmfzhaslm

09502 Abstracts Collection – Coalgebraic Logics

Ernst-Erich Doberkat, Alexander Kurz
2010
Coalgebraic logic is a branch of logic which studies coalgebras as models of systems and their logics.  ...  Traditionally, modal logics find their use when reasoning about behavioural and temporal properties of computation and communication, whereas coalgebras give a uniform account for a large class of different  ...  Semantics and modal logics for process languages with names and substitutions Sam Staton, University of Cambridge Structural operational semantics for modern process languages (like p-calculi) involves  ... 
doi:10.4230/dagsemproc.09502.1 fatcat:2ino5isdizeqpktf4jxfqc5yqu

Abstract interpretation and partition refinement for model checking [article]

DR Dennis Dams, JCM Jos Baeten, W Werner Damm, RT Rob Gerth
1996
Abstract interpretation and partition refinement for model checking.  ...  -Eindhoven : Eindhoven University of Technology. -Ill. Thesis Technische Universiteit Eindhoven. -With index, ref. -With summary in Dutch.  ...  The states s and t are not bisimilar. An illuminating way to see this is by considering the definition of bisimulation in terms of a game ([Ehr61, Fra54]) ..  ... 
doi:10.6100/ir462072 fatcat:3cqx6okcubajldzfnd3v5l2nv4

Specification and analysis of systems with dynamic structure

Andrea Vandin
2013
In order to achieve this, logic-based specification languages and techniques equipped with a neat handling of components and their dynamicity are needed.  ...  Our solution belongs to the family of quantified μ-calculi, i.e. languages combining quantifiers with the fix-point and modal operators of temporal logics, for which we propose a novel approach to their  ...  Early works aimed at reasoning about networks of processes (e.g. the multiprocess network logic of (RS85)), and were based on extensions of classical linear-and branching-time logics with first-order quantifiers  ... 
doi:10.6092/imtlucca/e-theses/89 fatcat:jqd34gprk5cxlmj7alwdksqr5a

Subject Index to Volumes 1–75

2001 Information Processing Letters  
a tree, 1913 preordered Kripke structures, 2876 prepaging, 338 algorithm, 338 swapping strategies, 261 Preparata, 439, 1389 Preparata and Hong, 552 Preparata and Sarwate, 2357 Preparata, F.P. and D.V.  ...  system organization, 118 operational semantics, 3813  ...  constructibility, 3182 detection, 1387 range join, 2933 algorithm, 2933 range of a function, 3993 values, 744 range query, 153, 791, 859, 939, 1304, 1387, 1435, 1658, 1761, 1908, 2235, 2836 querying,  ... 
doi:10.1016/s0020-0190(01)00175-2 fatcat:5y67tfm6yfbblakrus5nnhs73e

The sharia: sources, legal theory and unofficial sources of law [chapter]

Jonathan Ercanbrack
The Transformation of Islamic Law in Global Financial Markets  
Legal theory, sources of law and the semantic web Boer, A. Link to publication Citation for published version (APA): Boer, A. (2009). Legal theory, sources of law and the semantic web.  ...  technique of bisimulation.  ...  operational semantics.  ... 
doi:10.1017/cbo9781107447929.003 fatcat:ivopkakf5fclpdaibyrcilu5jq