Sciweavers

12774 search results - page 385 / 2555
» A Framework for Proof Systems
Sort
View
FBT
2000
167views Formal Methods» more  FBT 2000»
15 years 9 months ago
Diagrams for Dataflow
The behavior of reactive systems can be described by their black box properties as a relation between input and output streams. More operational is the behavior's description...
Max Breitling, Jan Philipps
IGPL
2008
93views more  IGPL 2008»
15 years 7 months ago
Cut-Based Abduction
In this paper we explore a generalization of traditional abduction which can simultaneously perform two different tasks: (i) given an unprovable sequent G, find a sentence H such ...
Marcello D'Agostino, Marcelo Finger, Dov M. Gabbay
ENTCS
2006
103views more  ENTCS 2006»
15 years 7 months ago
Static Equivalence is Harder than Knowledge
There are two main ways of defining secrecy of cryptographic protocols. The first version checks if the adversary can learn the value of a secret parameter. In the second version,...
Johannes Borgström
MST
2008
94views more  MST 2008»
15 years 7 months ago
Partial Bi-immunity, Scaled Dimension, and NP-Completeness
The Turing and many-one completeness notions for NP have been previously separated under measure, genericity, and bi-immunity hypotheses on NP. The proofs of all these results rel...
John M. Hitchcock, Aduri Pavan, N. V. Vinodchandra...
CG
2004
Springer
15 years 7 months ago
Recursive turtle programs and iterated affine transformations
We provide a formal proof of equivalence between the class of fractals created by Recursive Turtle Programs (RTP) and Iterated Affine Transformations (IAT). We begin by reviewing ...
Tao Ju, Scott Schaefer, Ron Goldman