Sciweavers

1179 search results - page 165 / 236
» Programming in Hybrid Constraint Languages
Sort
View
MPC
2010
Springer
165views Mathematics» more  MPC 2010»
15 years 6 months ago
Dependently Typed Grammars
Parser combinators are a popular tool for designing parsers in functional programming languages. If such combinators generate an abstract representation of the grammar as an interm...
Kasper Brink, Stefan Holdermans, Andres Löh
IFIP
2010
Springer
14 years 8 months ago
Modular Plans for Secure Service Composition
Service Oriented Computing (SOC) is a programming paradigm aiming at characterising Service Networks. Services are entities waiting for clients requests and they often result from ...
Gabriele Costa, Pierpaolo Degano, Fabio Martinelli
ICALP
2007
Springer
15 years 3 months ago
Trading Static for Adaptive Security in Universally Composable Zero-Knowledge
Adaptive security, while more realistic as an adversarial model, is typically much harder to achieve compared to static security in cryptographic protocol design. Universal composi...
Aggelos Kiayias, Hong-Sheng Zhou
PLDI
2012
ACM
13 years 3 months ago
Speculative separation for privatization and reductions
Automatic parallelization is a promising strategy to improve application performance in the multicore era. However, common programming practices such as the reuse of data structur...
Nick P. Johnson, Hanjun Kim, Prakash Prabhu, Ayal ...
IWPC
2003
IEEE
15 years 6 months ago
YAAB (Yet Another AST Browser): Using OCL to Navigate ASTs
In the last decades several tools and environments defined and introduced languages for querying, navigating sforming abstract syntax trees. These environments were meant to supp...
Giuliano Antoniol, Massimiliano Di Penta, Ettore M...