Sciweavers

366 search results - page 67 / 74
» Model-checking higher-order functions
Sort
View
CONCUR
2006
Springer
15 years 5 months ago
Proving Liveness by Backwards Reachability
Abstract. We present a new method for proving liveness and termination properties for fair concurrent programs, which does not rely on finding a ranking function or on computing th...
Parosh Aziz Abdulla, Bengt Jonsson, Ahmed Rezine, ...
ECAI
2010
Springer
15 years 2 months ago
Foundations of Tree-like Local Model Updates
Abstract. Model update is an approach to enhance model checking functions by providing computer aided modifications in system development [2, 9]. It has been observed that one majo...
Yan Zhang, Michael Kelly, Yi Zhou
CORR
2006
Springer
108views Education» more  CORR 2006»
15 years 1 months ago
Static Analysis using Parameterised Boolean Equation Systems
The well-known problem of state space explosion in model checking is even more critical when applying this technique to programming languages, mainly due to the presence of complex...
María-del-Mar Gallardo, Christophe Joubert,...
ENTCS
2007
105views more  ENTCS 2007»
15 years 1 months ago
Narrowing and Rewriting Logic: from Foundations to Applications
Narrowing was originally introduced to solve equational E-unification problems. It has also been recognized as a key mechanism to unify functional and logic programming. In both ...
Santiago Escobar, José Meseguer, Prasanna T...
STTT
2008
90views more  STTT 2008»
15 years 1 months ago
A uniform framework for weighted decision diagrams and its implementation
1 This papers introduces a generic framework for OBDD variants with weighted edges. It covers many boolean and multi-valued OBDD-variants that have been studied in the literature a...
Jörn Ossowski, Christel Baier