Sciweavers

1564 search results - page 59 / 313
» Extensions to the Estimation Calculus
Sort
View
TLCA
2005
Springer
15 years 10 months ago
Call-by-Name and Call-by-Value as Token-Passing Interaction Nets
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...
François-Régis Sinot
TABLEAUX
2000
Springer
15 years 8 months ago
MSPASS: Modal Reasoning by Translation and First-Order Resolution
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 ...
Ullrich Hustadt, Renate A. Schmidt
ENTCS
2008
170views more  ENTCS 2008»
15 years 5 months ago
A Coq Library for Verification of Concurrent Programs
Thanks to recent advances, modern proof assistants now enable verification of realistic sequential programs. However, regarding the concurrency paradigm, previous work essentially...
Reynald Affeldt, Naoki Kobayashi
155
Voted
ENTCS
1998
101views more  ENTCS 1998»
15 years 5 months ago
A Fully Abstract Metric-Space Denotational Semantics for Reactive Probabilistic Processes
Abstract Metric-Space Denotational Semantics for Reactive Probabilistic Processes M.Z. Kwiatkowska and G.J. Norman School of Computer Science, University of Birmingham, Edgbaston, ...
Marta Z. Kwiatkowska, Gethin Norman
132
Voted
RP
2010
Springer
146views Control Systems» more  RP 2010»
15 years 3 months ago
Depth Boundedness in Multiset Rewriting Systems with Name Binding
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...
Fernando Rosa Velardo