Sciweavers

132 search results - page 14 / 27
» A Rewriting Logic Semantics Approach to Modular Program Anal...
Sort
View
PASTE
2004
ACM
14 years 1 months ago
Evaluating the imprecision of static analysis
This work discusses two non-traditional approaches for evaluating the imprecision of static analysis. The approaches are based on proofs of feasibility or infeasibility that are c...
Atanas Rountev, Scott Kagan, Michael Gibas
ESOP
2008
Springer
13 years 9 months ago
Verification of Higher-Order Computation: A Game-Semantic Approach
Abstract. We survey recent developments in an approach to the verification of higher-order computation based on game semantics. Higherorder recursion schemes are in essence (progra...
C.-H. Luke Ong
KCAP
2003
ACM
14 years 25 days ago
Modularisation of domain ontologies implemented in description logics and related formalisms including OWL
Modularity is a key requirement for large ontologies in order to achieve re-use, maintainability, and evolution. Mechanisms for ‘normalisation’ to achieve analogous aims are s...
Alan L. Rector
POPL
2012
ACM
12 years 3 months ago
Probabilistic relational reasoning for differential privacy
Differential privacy is a notion of confidentiality that protects the privacy of individuals while allowing useful computations on their private data. Deriving differential priva...
Gilles Barthe, Boris Köpf, Federico Olmedo, S...
CORR
2006
Springer
135views Education» more  CORR 2006»
13 years 7 months ago
Constraint Functional Logic Programming over Finite Domains
In this paper, we present our proposal to Constraint Functional Logic Programming over Finite Domains (CFLP(FD) ) with a lazy functional logic programming language which seamlessl...
Antonio J. Fernández, Maria Teresa Hortal&a...