Sciweavers

141 search results - page 21 / 29
» Beyond Regular Model Checking
Sort
View
FM
2008
Springer
93views Formal Methods» more  FM 2008»
13 years 9 months ago
Finding Minimal Unsatisfiable Cores of Declarative Specifications
Declarative specifications exhibit a variety of problems, such as inadvertently overconstrained axioms and underconstrained conjectures, that are hard to diagnose with model checki...
Emina Torlak, Felix Sheng-Ho Chang, Daniel Jackson
CL
2006
Springer
13 years 7 months ago
Co-evolving code and design with intensional views: A case study
Intensional views and relations have been proposed as a way of actively documenting high-level structural regularities in the source code of a software system. By checking conform...
Kim Mens, Andy Kellens, Frédéric Plu...
POPL
2004
ACM
14 years 7 months ago
Incremental execution of transformation specifications
We aim to specify program transformations in a declarative style, and then to generate executable program transformers from such specifications. Many transformations require non-t...
Ganesh Sittampalam, Oege de Moor, Ken Friis Larsen
CONCUR
2006
Springer
13 years 11 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, ...
KCAP
2009
ACM
14 years 2 months ago
Formally measuring agreement and disagreement in ontologies
Ontologies are conceptual models of particular domains, and domains can be modeled differently, representing different opinions, beliefs or perspectives. In other terms, ontolog...
Mathieu d'Aquin