Sciweavers

899 search results - page 134 / 180
» A CTL-Based Logic for Program Abstractions
Sort
View
ESOP
2008
Springer
15 years 2 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
87
Voted
ICML
2004
IEEE
16 years 1 months ago
Bellman goes relational
Motivated by the interest in relational reinforcement learning, we introduce a novel relational Bellman update operator called ReBel. It employs a constraint logic programming lan...
Kristian Kersting, Martijn Van Otterlo, Luc De Rae...
117
Voted
CADE
2008
Springer
16 years 23 days ago
Towards SMT Model Checking of Array-Based Systems
Abstract. We introduce the notion of array-based system as a suittraction of infinite state systems such as broadcast protocols or sorting programs. By using a class of quantified-...
Silvio Ghilardi, Enrica Nicolini, Silvio Ranise, D...
107
Voted
ICMT
2009
Springer
15 years 7 months ago
Pattern-Based Model-to-Model Transformation: Handling Attribute Conditions
Abstract. Pattern-based model-to-model transformation is a new approach for specifying transformations in a declarative, relational and formal style. The language relies on pattern...
Esther Guerra, Juan de Lara, Fernando Orejas
TPHOL
2008
IEEE
15 years 6 months ago
Lightweight Separation
Abstract. Lightweight separation is a novel approach to automatic reasoning about memory updates in pointer programs. It replaces the spatial formulae of separation logic, which co...
Holger Gast