Sciweavers

2432 search results - page 441 / 487
» Cryptographic logical relations
Sort
View
ICFP
2010
ACM
15 years 5 months ago
A fresh look at programming with names and binders
A wide range of computer programs, including compilers and theorem provers, manipulate data structures that involve names and binding. However, the design of programming idioms wh...
Nicolas Pouillard, François Pottier
ASE
2008
135views more  ASE 2008»
15 years 4 months ago
Deriving event-based transition systems from goal-oriented requirements models
Goal-oriented methods are increasingly popular for elaborating software requirements. They offer systematic support for incrementally building intentional, structural, and operati...
Emmanuel Letier, Jeff Kramer, Jeff Magee, Sebasti&...
DKE
2010
167views more  DKE 2010»
15 years 4 months ago
The consistency extractor system: Answer set programs for consistent query answering in databases
We describe the Consistency Extractor System (ConsEx) that computes consistent answers to Datalog queries with negation posed to relational databases that may be inconsistent with...
Mónica Caniupán Marileo, Leopoldo E....
ENTCS
2008
106views more  ENTCS 2008»
15 years 4 months ago
Verifying Test-Hypotheses: An Experiment in Test and Proof
HOL-TestGen is a specification and test case generation environment extending the interactive theorem prover Isabelle/HOL. The HOL-TestGen method is two-staged: first, the origina...
Achim D. Brucker, Lukas Brügger, Burkhart Wol...
FGCS
2008
147views more  FGCS 2008»
15 years 4 months ago
QoS-based dissemination of content in Grids
This paper proposes a bio-inspired approach tailored to the construction of a Grid information system in which content, specifically metadata descriptors that specify the characte...
Agostino Forestiero, Carlo Mastroianni, Giandomeni...