Sciweavers

3573 search results - page 414 / 715
» Reasoning about Codata
Sort
View
CLIMA
2009
15 years 4 months ago
Argumentation-Based Preference Modelling with Incomplete Information
Abstract. No intelligent decision support system functions even remotely without knowing the preferences of the user. A major problem is that the way average users think about and ...
Wietske Visser, Koen V. Hindriks, Catholijn M. Jon...
CSE
2009
IEEE
15 years 4 months ago
Verifying the Interplay of Authorization Policies and Workflow in Service-Oriented Architectures
Abstract--A widespread design approach in distributed applications based on the service-oriented paradigm, such as web-services, consists of clearly separating the enforcement of a...
Michele Barletta, Silvio Ranise, Luca Viganò...
IEEEHPCS
2010
15 years 5 months ago
Semantic model checking security requirements for web services
Model checking is a formal verification method widely accepted in the web service world because of its capability to reason about service behaviors, at their process-level. It ha...
L. Boaro, E. Glorio, Francesco Pagliarecci, Luca S...
ENTCS
2002
83views more  ENTCS 2002»
15 years 6 months ago
Operational Semantics for Functional Logic Languages
In this work we provide a semantic description of functional logic languages covering notions like laziness, sharing, and non-determinism. Such a semantic description is essential...
Elvira Albert, Michael Hanus, Frank Huch, Javier O...
FMSD
2002
114views more  FMSD 2002»
15 years 6 months ago
The Correctness of the Fast Fourier Transform: A Structured Proof in ACL2
The powerlists data structure, created by Misra in the early 90s, is well suited to express recursive, data-parallel algorithms. Misra has shown how powerlists can be used to give ...
Ruben Gamboa