Sciweavers

622 search results - page 41 / 125
» Answer Set Programming and Bounded Model Checking
Sort
View
CINQ
2004
Springer
131views Database» more  CINQ 2004»
14 years 1 months ago
Model-Independent Bounding of the Supports of Boolean Formulae in Binary Data
Abstract. Data mining algorithms such as the Apriori method for finding frequent sets in sparse binary data can be used for efficient computation of a large number of summaries fr...
Artur Bykowski, Jouni K. Seppänen, Jaakko Hol...
CAV
2008
Springer
96views Hardware» more  CAV 2008»
13 years 10 months ago
Implied Set Closure and Its Application to Memory Consistency Verification
Hangal et. al. [3] have developed a procedure to check if an instance of the execution of a shared memory multiprocessor program, is consistent with the Total Store Order (TSO) mem...
Surender Baswana, Shashank K. Mehta, Vishal Powar
VMCAI
2005
Springer
14 years 1 months ago
Checking Herbrand Equalities and Beyond
A Herbrand equality between expressions in a program is an equality which holds relative to the Herbrand interpretation of operators. We show that the problem of checking validity ...
Markus Müller-Olm, Oliver Rüthing, Helmu...
FIDJI
2003
Springer
14 years 1 months ago
Model Generation for Distributed Java Programs
— We present techniques for analyzing the source code of distributed Java applications, and building finite models of their behaviour. The models are labelled transition systems...
Rabéa Boulifa, Eric Madelaine
CONCUR
1999
Springer
14 years 10 days ago
Partial Order Reduction for Model Checking of Timed Automata
Abstract. The paper presents a partial order reduction method applicable to networks of timed automata. The advantage of the method is that it reduces both the number of explored c...
Marius Minea