Sciweavers

3228 search results - page 133 / 646
» Computationally Sound Proofs
Sort
View
TPHOL
1991
IEEE
14 years 1 months ago
First Steps Towards Automating Hardware Proofs in HOL
D ABSTRACT) Ramayya Kumar, Thomas Kropf, Klaus Schneider University of Karlsruhe,Institute of ComputerDesign and Fault Tolerance (Prof.Dr.D. Schmid) P.O. Box 6980, W-7500 Karlsruhe...
Ramayya Kumar, Thomas Kropf, Klaus Schneider
ROOM
2000
13 years 11 months ago
Object-Oriented Refinement and Proof using Behaviour Functions
This paper proposes a new calculus for expressing the behaviour of object-oriented systems. The semantics of the calculus is given in terms of operators from computational categor...
Tony Clark
DM
2007
106views more  DM 2007»
13 years 10 months ago
The Roberts characterization of proper and unit interval graphs
In this note, a constructive proof is given that the classes of proper interval graphs and unit interval graphs coincide, a result originally established by Fred S. Roberts. Addit...
Frédéric Gardi
IPL
2007
94views more  IPL 2007»
13 years 10 months ago
A note on emptiness for alternating finite automata with a one-letter alphabet
We present a new proof of PSPACE-hardness of the emptiness problem for alternating finite automata with a singleton alphabet. This result was shown by Holzer (1995) who used a pr...
Petr Jancar, Zdenek Sawa
CCS
2009
ACM
14 years 10 months ago
Confidentiality-preserving distributed proofs of conjunctive queries
Distributed proof construction protocols have been shown to be valuable for reasoning about authorization decisions in open distributed environments such as pervasive computing sp...
Adam J. Lee, Kazuhiro Minami, Nikita Borisov