Sciweavers

5904 search results - page 143 / 1181
» Requirements for a Composition Language
Sort
View
ISSTA
1991
ACM
15 years 7 months ago
Dynamic Slicing in the Presence of Unconstrained Pointers
Program slices are useful in debugging. Most work on program slicing to date has concentrated on nding slices of programs involving only scalar variables. Pointers and composite v...
Hiralal Agrawal, Richard A. DeMillo, Eugene H. Spa...
142
Voted
DLOG
1997
15 years 4 months ago
Experiments with the DFL Hybrid System
Abstract. In this short paper we describe the DFL hybrid knowledge base, that integrates descriptions with expressive object-oriented rules. The knowledge base manages a database o...
Mira Balaban, Adi Eyal
110
Voted
EACL
1989
ACL Anthology
15 years 4 months ago
An Approach To Sentence-Level Anaphora In Machine Translation
Theoretical research in the area of machine translation usually involves the search for and creation of an appropriate formalism. An important issue in this respect is the way in ...
Gertjan van Noord, Joke Dorrepaal, Doug Arnold, St...
168
Voted
FIW
1998
130views Communications» more  FIW 1998»
15 years 5 months ago
A Heuristic Approach to Detect Feature Interactions in Requirements
We present a method to systematically detect feature interactions in requirements, which are expressed as constraints on system event traces. We show its application on the lift sy...
Maritta Heisel, Jeanine Souquières
128
Voted
CRYPTO
2009
Springer
144views Cryptology» more  CRYPTO 2009»
15 years 10 months ago
On the Composition of Public-Coin Zero-Knowledge Protocols
Abstract. We show that only languages in BPP have public-coin, blackbox zero-knowledge protocols that are secure under an unbounded (polynomial) number of parallel repetitions. Thi...
Rafael Pass, Wei-Lung Dustin Tseng, Douglas Wikstr...