Sciweavers

903 search results - page 96 / 181
» Completeness Results for Memory Logics
Sort
View
SE
2008
13 years 10 months ago
Eliminating Trust From Application Programs By Way Of Software Architecture
: In many of today's application programs, security functionality is inseparably intertwined with the actual mission-purpose logic. As a result, the trusted code base is unnec...
Michael Franz
CADE
2010
Springer
13 years 10 months ago
An Interpolating Sequent Calculus for Quantifier-Free Presburger Arithmetic
Craig interpolation has become a versatile tool in formal verification, for instance to generate intermediate assertions for safety analysis of programs. Interpolants are typically...
Angelo Brillout, Daniel Kroening, Philipp Rüm...
LOGCOM
2010
82views more  LOGCOM 2010»
13 years 7 months ago
Deduction Systems for Coalgebras Over Measurable Spaces
A theory of infinitary deduction systems is developed for the modal logic of coalgebras for measurable polynomial functors on the category of measurable spaces. These functors ha...
Robert Goldblatt
IFIPTM
2009
171views Management» more  IFIPTM 2009»
13 years 6 months ago
Trust-Enhanced Recommender Systems for Efficient On-Line Collaboration
Trust has been explored by many researchers in the past as a solution for assisting the process of recommendation production. In this work we are examining the feasibility of build...
Georgios Pitsilis
ICMLA
2010
13 years 6 months ago
Incremental Learning of Relational Action Rules
Abstract--In the Relational Reinforcement learning framework, we propose an algorithm that learns an action model allowing to predict the resulting state of each action in any give...
Christophe Rodrigues, Pierre Gérard, C&eacu...