Sciweavers

116 search results - page 14 / 24
» Automatic Abstraction for Intervals Using Boolean Formulae
Sort
View
CIE
2007
Springer
15 years 3 months ago
Computational Complexity of Constraint Satisfaction
Abstract. The input to a constraint satisfaction problem (CSP) consists of a set of variables, each with a domain, and constraints between these variables formulated by relations o...
Heribert Vollmer
ECAI
2008
Springer
14 years 11 months ago
Incremental Diagnosis of DES by Satisfiability
Abstract. We propose a SAT-based algorithm for incremental diagnosis of discrete-event systems. The monotonicity is ensured by a prediction window that uses the future observations...
Alban Grastien, Anbulagan
LISA
2004
14 years 11 months ago
Auto-configuration by File Construction: Configuration Management with newfig
A tool is described that provides for the automatic configuration of systems from a single description. The tool, newfig, uses two simple concepts to provide its functionality: bo...
William LeFebvre, David Snyder
CADE
2008
Springer
15 years 10 months ago
Compositional Proofs with Symbolic Execution
Abstract. A proof method is described which combines compositional proofs of interleaved parallel programs with the intuitive and highly automatic strategy of symbolic execution. A...
Simon Bäumler, Florian Nafz, Michael Balser, ...
ECBS
2006
IEEE
135views Hardware» more  ECBS 2006»
15 years 1 months ago
Model Checking Procedures for Infinite State Systems
The paper depicts experiments and results with preditraction based verification applied to infinite state Predicate abstraction is a method for automatic tion of abstract state sp...
Nikola Bogunovi, Edgar Pek