Sciweavers

6829 search results - page 209 / 1366
» Quantitative Generalizations of Languages
Sort
View
ASIACRYPT
2006
Springer
15 years 10 months ago
Simulation-Sound NIZK Proofs for a Practical Language and Constant Size Group Signatures
Non-interactive zero-knowledge proofs play an essential role in many cryptographic protocols. We suggest several NIZK proof systems based on prime order groups with a bilinear map...
Jens Groth
AGP
1995
IEEE
15 years 10 months ago
Constraint Systems for Pattern Analysis of Constraint Logic-Based Languages
Pattern analysis consists in determining the shape of the set of solutions of the constraint store at some program points. Our basic claim is that pattern analyses can all be desc...
Roberto Bagnara
TAPSOFT
1991
Springer
15 years 10 months ago
Comparative Semantics for a Real-Time Programming Language with Integration
An operational and a denotational semantic model are presented for a real-time programming language incorporating the concept of integration. This concept of integration, which ha...
Franck van Breugel
AUTOMATICA
2008
59views more  AUTOMATICA 2008»
15 years 6 months ago
Supervisory control of modular systems with global specification languages
The paper presents sufficient conditions for modular (supervisory) control synthesis to equal global control synthesis. In modular control synthesis a supervisory control is synth...
Jan Komenda, Jan H. van Schuppen, Benoit Gaudin, H...
CORR
2006
Springer
144views Education» more  CORR 2006»
15 years 6 months ago
On the logical definability of certain graph and poset languages
We show that it is equivalent, for certain sets of finite graphs, to be definable in CMS (counting monadic second-order, a natural extension of monoadic second-order logic), and t...
Pascal Weil