Two common misbeliefs about encodings of the λ-calculus in interaction nets (INs) are that they are good only for strategies that are not very well understood (e.g. optimal reduct...
mspass is an extension of the first-order theorem prover spass, which can be used as a modal logic theorem prover, a theorem prover for description logics and a theorem prover for ...
Thanks to recent advances, modern proof assistants now enable verification of realistic sequential programs. However, regarding the concurrency paradigm, previous work essentially...
Abstract Metric-Space Denotational Semantics for Reactive Probabilistic Processes M.Z. Kwiatkowska and G.J. Norman School of Computer Science, University of Birmingham, Edgbaston, ...
Abstract. In this paper we consider ν-MSR, a formalism that combines the two main existing approaches for multiset rewriting, namely MSR and CMRS. In ν-MSR we rewrite multisets o...