Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 238,670,126 papers from all fields of science
Search
Sign In
Create Free Account
Soundness (interactive proof)
Soundness is a property of interactive proof systems that requires that no prover can make the verifier accept for a wrong statement except with some…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
3 relations
Interactive proof system
Proof of knowledge
Zero-knowledge proof
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
Compositional Discovery of Workflow Nets from Event Logs Using Morphisms
L. Bernardinello
,
I. Lomazova
,
Roman A. Nesterov
,
L. Pomello
ATAED@Petri Nets/ACSD
2018
Corpus ID: 48358853
This paper presents a modular approach to discover process models for multi-agent systems from event logs. System event logs are…
Expand
2012
2012
Decidability Results for Soundness Criteria of Resource-Constrained Workflow Nets
F. Ţiplea
,
Corina Bocaneala
IEEE Transactions on Systems, Man, and…
2012
Corpus ID: 11491406
This paper focuses on the decidability status of various forms of behavioral correctness criteria for resource-constrained…
Expand
2009
2009
Implicative Logic based encoding of the λ-calculus into the π-calculus
S. van Bakel
,
M. Vigliotti
2009
Corpus ID: 14288392
We study anoutput-based encoding of the λ-calculus with explicit substitution into the synchronous π-calculus – enriched with…
Expand
2008
2008
UJ : type soundness for universe types
D. Cunningham
,
A. Francalanza
,
S. Drossopoulou
,
Werner Dietl
,
P. Müller
2008
Corpus ID: 16981534
Universe types characterise aliasing in object oriented programming languages and are used to reason modularly about programs. In…
Expand
2007
2007
Contextualization of a DL Knowledge Base
K. Goczyła
,
W. Waloszek
,
Aleksander Waloszek
Description Logics
2007
Corpus ID: 16239631
In the paper we propose a method of structuring a knowledge base into hierarchically related contexts and present how this…
Expand
2005
2005
Soundness and Completeness of Formal Logics of Symmetric Encryption
Gergely Bana
,
A. Scedrov
IACR Cryptology ePrint Archive
2005
Corpus ID: 36624169
In the last two decades, two major directions in cryptography have developed: formal and computational. The formal approach uses…
Expand
Review
2004
Review
2004
Graphical and Spreadsheet Reasoning for Sets of Functional Dependencies. (Christian Albrechts Universität. Institut für Informatik und Praktische Mathematik 0404)
János Demetrovics
,
András J. Molnár
,
Bernhard Thalheim
2004
Corpus ID: 18056699
Reasoning on constraint sets is a difficult task. Classical database design is based on a step-wise extension of the constraint…
Expand
2000
2000
The Logic of Knights, Knaves, Normals and Mutes
László Aszalós
Acta Cybernetica
2000
Corpus ID: 29331982
R. M. Smullyan wrote in his book about islands, knights and knaves. The knights always tell the truth and the knaves are always…
Expand
Review
1999
Review
1999
Driving a DSP Underground
R. Gooch
,
T. Clarke
,
D. D. A. Pushpakumara
,
T. Ellis
1999
Corpus ID: 14607656
This paper describes a general purpose digital signal processing architecture for embedded systems. The core hardware modules…
Expand
1995
1995
A New Procedural Interpretation of Horn Clauses with Equality
A. Degtyarev
,
A. Voronkov
International Conference on Logic Programming
1995
Corpus ID: 19921321
We introduce the equality elimination method which is a new procedure for dealing with Horn clause logic programs with equality…
Expand