Sciweavers

922 search results - page 42 / 185
» On a Generalization of the Stone-Weierstrass Theorem
Sort
View
MEMOCODE
2006
IEEE
15 years 8 months ago
Specifying and proving properties of timed I/O automata in the TIOA toolkit
Timed I/O Automata (TIOA) is a mathematical framework for modeling and verification of distributed systems that involve discrete and continuous dynamics. TIOA can be used for exa...
Myla Archer, Hongping Lim, Nancy A. Lynch, Sayan M...
ACL2
2006
ACM
15 years 8 months ago
Reasoning about ACL2 file input
We introduce the logical story behind file input in ACL2 and discuss the types of theorems that can be proven about filereading operations. We develop a low level library for re...
Jared Davis
ACL2
2006
ACM
15 years 8 months ago
A SAT-based procedure for verifying finite state machines in ACL2
We describe a new procedure for verifying ACL2 properties about finite state machines (FSMs) using satisfiability (SAT) solving. We present an algorithm for converting ACL2 conj...
Warren A. Hunt Jr., Erik Reeber
CRYPTO
2003
Springer
93views Cryptology» more  CRYPTO 2003»
15 years 7 months ago
Universal Composition with Joint State
Abstract. Cryptographic systems often involve running multiple concurrent instances of some protocol, where the instances have some amount of joint state and randomness. (Examples ...
Ran Canetti, Tal Rabin
JAR
2002
83views more  JAR 2002»
15 years 1 months ago
Mathematical Programming Embeddings of Logic
Abstract. Can theorem proving in mathematical logic be addressed by classical mathematical techniques like the calculus of variations? The answer is surprisingly in the affirmative...
Vivek S. Borkar, Vijay Chandru, Sanjoy K. Mitter