Sciweavers

254 search results - page 41 / 51
» An abstract framework for reasoning about trust
Sort
View
JUCS
2006
131views more  JUCS 2006»
13 years 6 months ago
Verification of CRWL Programs with Rewriting Logic
Abstract: We present a novel approach to the verification of functional-logic programs. For our verification purposes, equational reasoning is not valid due to the presence of non-...
José Miguel Cleva, Isabel Pita
CADE
2007
Springer
14 years 7 months ago
Solving Quantified Verification Conditions Using Satisfiability Modulo Theories
Abstract. First order logic provides a convenient formalism for describing a wide variety of verification conditions. Two main approaches to checking such conditions are pure first...
Yeting Ge, Clark Barrett, Cesare Tinelli
COMPSAC
2009
IEEE
13 years 7 months ago
Modular Certification of Low-Level Intermediate Representation Programs
Modular certification of low-level intermediate representation (IR) programs is one of the key steps of proof-transforming compilation. The major challenges are lexity of abstract ...
Yuan Dong, Shengyuan Wang, Liwei Zhang, Ping Yang
TACAS
2010
Springer
255views Algorithms» more  TACAS 2010»
13 years 4 months ago
Satisfiability Modulo the Theory of Costs: Foundations and Applications
Abstract. We extend the setting of Satisfiability Modulo Theories (SMT) by introducing a theory of costs C, where it is possible to model and reason about resource consumption and ...
Alessandro Cimatti, Anders Franzén, Alberto...
ECAI
2008
Springer
13 years 8 months ago
Privacy-Preserving Query Answering in Logic-based Information Systems
Abstract. We study privacy guarantees for the owner of an information system who wants to share some of the information in the system with clients while keeping some other informat...
Bernardo Cuenca Grau, Ian Horrocks