Sciweavers

44 search results - page 5 / 9
» Kleene Theorems for Product Systems
Sort
View
STOC
1995
ACM
108views Algorithms» more  STOC 1995»
13 years 11 months ago
A parallel repetition theorem
We show that a parallel repetition of any two-prover one-round proof system (MIP(2, 1)) decreases the probability of error at an exponential rate. No constructive bound was previou...
Ran Raz
DAGSTUHL
2000
13 years 9 months ago
Product Form Queueing Networks
Queueing network models have been extensively applied to represent and analyze resource sharing systems such as communication and computer systems and they have proved to be a pow...
Simonetta Balsamo
APAL
2010
113views more  APAL 2010»
13 years 7 months ago
Logic for update products and steps into the past
This paper provides a sound and complete proof system for a language Le+Y that adds to Dynamic Epistemic Logic (DEL) a discrete previous-time operator as well as single symbol for...
Joshua Sack
ACL2
2006
ACM
13 years 11 months ago
Combining ACL2 and an automated verification tool to verify a multiplier
We have extended the ACL2 theorem prover to automatically prove properties of VHDL circuits with IBM's Internal SixthSense verification system. We have used this extension to...
Erik Reeber, Jun Sawada
ACS
2008
13 years 7 months ago
Subobject Transformation Systems
Abstract Subobject transformation systems (sts) are proposed as a novel formal framework for the analysis of derivations of transformation systems based on the algebraic, double-pu...
Andrea Corradini, Frank Hermann, Pawel Sobocinski