Sciweavers

8132 search results - page 16 / 1627
» Dependability, Abstraction, and Programming
Sort
View
FROCOS
2007
Springer
15 years 3 months ago
Termination of Innermost Context-Sensitive Rewriting Using Dependency Pairs
Abstract. Innermost context-sensitive rewriting has been proved useful for modeling computations of programs of algebraic languages like Maude, OBJ, etc. Furthermore, innermost ter...
Beatriz Alarcón, Salvador Lucas
ICALP
2007
Springer
15 years 3 months ago
A Characterization of Non-interactive Instance-Dependent Commitment-Schemes (NIC)
Abstract. We provide a new characterization of certain zero-knowledge protocols as non-interactive instance-dependent commitment-schemes (NIC). To obtain this result we consider th...
Bruce M. Kapron, Lior Malka, Srinivasan Venkatesh
HPCN
1997
Springer
15 years 1 months ago
Visualizing the Iteration Space in PEFPT
Abstract. Su cient and precise semantic information is essential to interactive parallel programming. In this paper, we present afeasible implementation of the iteration space depe...
Qi Wang, Yijun Yu, Erik H. D'Hollander
RTAS
2003
IEEE
15 years 3 months ago
Modular Code Generation from Hybrid Automata based on Data Dependency
Model-based automatic code generation is a process of converting abstract models into concrete implementations in the form of a program written in a high-level programming languag...
Jesung Kim, Insup Lee
ECOOP
2000
Springer
15 years 2 months ago
A Basic Model of Typed Components
This paper studies specific language level abstractions for component-based programming. We propose a simple model which captures some basic ingredients — like explicit context ...
João Costa Seco, Luís Caires