Filters








481 Hits in 3.1 sec

Proving correctness of coroutines without history variables

EdmundMelson Clarke
1980 Acta Informatica  
We propose a modification of Clint's axiom system and a strategy for constructing proofs which eliminates the need for history variables in verifying simple coroutines.  ...  We examine the question of whether history variables are necessary in formal proofs of correctness for coroutines.  ...  Introduction This paper examines some of the problems involved in developing an axiomatic proof system for a programming language with coroutines.  ... 
doi:10.1007/bf00263992 fatcat:dypcwdkne5c7jdddmcz55ojjdy

Proving the correctness of coroutines without history variables

Edmund M. Clarke
1978 Proceedings of the 16th annual Southeast regional conference on - ACM-SE 16  
We propose a modification of Clint's axiom system and a strategy for constructing proofs which eliminates the need for history variables in verifying simple coroutines.  ...  We examine the question of whether history variables are necessary in formal proofs of correctness for coroutines.  ...  Introduction This paper examines some of the problems involved in developing an axiomatic proof system for a programming language with coroutines.  ... 
doi:10.1145/503643.503680 fatcat:dstkrnqlqngtvaotrlky3z6ut4

A Formulae-as-Types Interpretation of Subtractive Logic

T. Crolard
2004 Journal of Logic and Computation  
From a computational standpoint, the resulting calculus provides a type system for first-class coroutines (a restricted form of first-class continuations). Lemma 6.11.  ...  Proof. By induction on the context C[ ]. Lemma 6.12. Given an instance r s of a rule of the λµ →+×− -calculus, if r is safe w.r.t. first-class coroutines then s is safe w.r.t. first-class coroutines.  ...  Typing rules for coroutines The typing rules for make-coroutine and resume are respectively introduction and elimination rules for subtraction: Proof.  ... 
doi:10.1093/logcom/14.4.529 fatcat:tjyiakbzlvblxnggrksoeciszi

A verified abstract machine for functional coroutines

Tristan Crolard
2016 Electronic Proceedings in Theoretical Computer Science  
In this article, we present a refinement of de Groote's abstract machine for functional coroutines and we prove its correctness.  ...  Functional coroutines are a restricted form of control mechanism, where each coroutine is represented with both a continuation and an environment.  ...  I am also very grateful to Olivier Danvy for proof-reading this article, and for giving me the opportunity to present these results at WoC 2015.  ... 
doi:10.4204/eptcs.212.1 fatcat:qkhwky3kg5ft7di2bjwzdbsftm

Formal Verification of a Hybrid IoT Operating System Model

Yuqian Guan, Jian Guo, Qin Li
2021 IEEE Access  
This paper proposes a hybrid model for an IoT operating system and employs the Event-B method for modeling and verification.  ...  A large proportion of the proof obligations (91%) are automatically proven on the Rodin platform to simplify the development process.  ...  Zhou for guidance on system design, and the editor and anonymous reviewers for reviewing the paper.  ... 
doi:10.1109/access.2021.3073398 fatcat:ex6rxymf4bhb7imztec4t37twm

A calculus of coroutines

J. Laird
2006 Theoretical Computer Science  
We describe a notion of categorical model for our calculus, and give a simple example of such a model based on a category of games and strategies.  ...  We describe a simple but expressive calculus of sequential processes, represented as coroutines.  ...  It is now straightforward to verify the soundness of the operational rules on a case-by-case basis: Proof.  ... 
doi:10.1016/j.tcs.2005.10.027 fatcat:bt4biq6rpjbdxhjgrlqvrt7pou

Sound Probabilistic Inference via Guide Types [article]

Di Wang, Jan Hoffmann, Thomas Reps
2021 arXiv   pre-print
Experiments show that our language is capable of expressing a variety of probabilistic models with nontrivial control flow and recursion, and that the coroutine-based computation does not introduce significant  ...  For Bayesian inference to be sound, guide programs must be compatible with model programs.  ...  There have been several type systems for coroutines [2, 3, 29] , but all of them require that all messages from a coroutine to another have the same type; thus, they are not sufficient to handle sample  ... 
arXiv:2104.03598v1 fatcat:vpobeqiwhnb5bbvaxpicwzvyle

On the Soundness of Coroutines with Snapshots [article]

Aleksandar Prokopec, Fengyun Liu
2018 arXiv   pre-print
Coroutines with snapshots are a first-class, type-safe, stackful coroutine model, which unifies many variants of suspendable computing, and is sufficiently general to express iterators, single-assignment  ...  In this paper, we develop a formal model called λ_ (lambda-squiggly) that captures the essence of type-safe, stackful, delimited coroutines with snapshots.  ...  , and then applying existing type systems for programs with continuations [2] .  ... 
arXiv:1806.01405v1 fatcat:x6eih4s77vbnzbbhwky46gtjae

A New Method for Dependent Parsing [chapter]

Trevor Jim, Yitzhak Mandelbaum
2011 Lecture Notes in Computer Science  
To address this shortcoming, we have developed a new method for implementing dependent parsers by extending existing parsing algorithms.  ...  Our method proposes a point-free language of dependent grammars, which we believe closely corresponds to existing context-free parsing algorithms, and gives a novel transformation from conventional dependent  ...  Correctness The goal of our coroutine transformation is to simplify both the task of implementing a dependent parsing system and the task of proving said system correct.  ... 
doi:10.1007/978-3-642-19718-5_20 fatcat:2ijfyeywjfhcxd2okuvmsg2dye

Theory and Practice of Coroutines with Snapshots

Aleksandar Prokopec, Fengyun Liu, Michael Wagner
2018 European Conference on Object-Oriented Programming  
We also develop a formal model for type-safe, stackful and delimited coroutines, and we prove the respective safety properties.  ...  Coroutines are a general control flow construct that can eliminate control flow fragmentation. However, coroutines are still missing in many popular languages.  ...  , and then applying existing type systems for programs with continuations [2] .  ... 
doi:10.4230/lipics.ecoop.2018.3 dblp:conf/ecoop/ProkopecL18 fatcat:6e7eipgjrrbd5bu5x4r6oodrvq

A decentralized approach for programming interactive applications with JavaScript and blockly

Assaf Marron, Gera Weiss, Guy Wiener
2012 Proceedings of the 2nd edition on Programming systems, languages and applications based on actors, agents, and decentralized control abstractions - AGERE! '12  
., with a single-threaded environment using coroutines.  ...  We present a decentralized-control methodology and a tool-set for developing interactive user interfaces. We focus on the common case of developing the client side of Web applications.  ...  We thank the anonymous reviewers for their valuable comments and suggestions for improvements, which we tried to incorporate.  ... 
doi:10.1145/2414639.2414648 dblp:conf/agere/MarronWW12 fatcat:yd4aymhzdbdphovzi4qqjkgckq

Modular verification of assembly code with stack-based control abstractions

Xinyu Feng, Zhong Shao, Alexander Vaynberg, Sen Xiang, Zhaozhong Ni
2006 SIGPLAN notices  
Instead of presenting a specific logic for each control structure, we develop all reasoning systems as instances of a generic framework.  ...  We give the complete soundness proof and a full verification of several examples in the Coq proof assistant.  ...  Acknowledgments We thank anonymous referees for suggestions and comments on an earlier version of this paper.  ... 
doi:10.1145/1133255.1134028 fatcat:e4bqqhh2bfbtxbrt4z5misopsy

Modular verification of assembly code with stack-based control abstractions

Xinyu Feng, Zhong Shao, Alexander Vaynberg, Sen Xiang, Zhaozhong Ni
2006 Proceedings of the 2006 ACM SIGPLAN conference on Programming language design and implementation - PLDI '06  
Instead of presenting a specific logic for each control structure, we develop all reasoning systems as instances of a generic framework.  ...  We give the complete soundness proof and a full verification of several examples in the Coq proof assistant.  ...  Acknowledgments We thank anonymous referees for suggestions and comments on an earlier version of this paper.  ... 
doi:10.1145/1133981.1134028 dblp:conf/pldi/FengSVXN06 fatcat:n6wapn5dm5bxrkbbo4ripducm4

Categorical Proof Theory of Co-Intuitionistic Linear Logic

Gianluigi Bellin, Valeria de Paiva
2014 Logical Methods in Computer Science  
To provide a categorical semantics for co-intuitionistic logic one has to face the fact, noted by Tristan Crolard, that the definition of co-exponents as adjuncts of coproducts does not work in the category  ...  of a free category.  ...  We sketch our result only for the multiplicative linear fragment, i.e., for typing derivations in the linear system with subtraction and par only.  ... 
doi:10.2168/lmcs-10(3:16)2014 fatcat:rnejuve3qnftdfqvzljn77yenm

On an intuitionistic logic for pragmatics

Gianluigi Bellin, Massimiliano Carrara, Daniele Chiffi
2015 Journal of Logic and Computation  
translation, we give a definition of a system AHL of bi-intuitionistic logic that correctly represents the duality between intuitionistic and co-intuitionistic logic, correcting a mistake in previous  ...  A computational interpretation of cointuitionism as a distributed calculus of coroutines is then used to give an operational interpretation of subtraction.  ...  A motivation here is to create a "distributed calculus" for our "multiple conclusion" logical deductive system.  ... 
doi:10.1093/logcom/exv036 fatcat:kiqprtcp6vfrhnutwqpyadmpyy
« Previous Showing results 1 — 15 out of 481 results