Sciweavers

4595 search results - page 752 / 919
» Reasoning about Plans
Sort
View
FM
1991
Springer
164views Formal Methods» more  FM 1991»
14 years 1 months ago
Formalizing Design Spaces: Implicit Invocation Mechanisms
An important goal of software engineering is to exploit commonalities in system design in order to reduce the complexity of building new systems, support largescale reuse, and pro...
David Garlan, David Notkin
ICML
1994
IEEE
14 years 1 months ago
A Conservation Law for Generalization Performance
Conservation of information (COI) popularized by the no free lunch theorem is a great leveler of search algorithms, showing that on average no search outperforms any other. Yet in ...
Cullen Schaffer
PARLE
1991
14 years 1 months ago
FORK: A High-Level Language for PRAMs
We present a new programming language designed to allow the convenient expression of algorithms for a parallel random access machine (PRAM). The language attempts to satisfy two p...
Torben Hagerup, Arno Schmitt, Helmut Seidl
REX
1991
14 years 1 months ago
From Timed to Hybrid Systems
We propose a framework for the formal speci cation and veri cation of timed and hybrid systems. For timed systems we propose a speci cation language that refers to time only throug...
Oded Maler, Zohar Manna, Amir Pnueli
AFRICACRYPT
2010
Springer
14 years 1 months ago
Efficient Unidirectional Proxy Re-Encryption
Abstract. Proxy re-encryption (PRE) allows a semi-trusted proxy to convert a ciphertext originally intended for Alice into one encrypting the same plaintext for Bob. The proxy only...
Sherman S. M. Chow, Jian Weng, Yanjiang Yang, Robe...