Sciweavers

622 search results - page 42 / 125
» Answer Set Programming and Bounded Model Checking
Sort
View
ACSD
2007
IEEE
93views Hardware» more  ACSD 2007»
13 years 10 months ago
SAT-based Unbounded Model Checking of Timed Automata
We present an improvement of the SAT-based Unbounded Model Checking (UMC) algorithm. UMC, a symbolic approach introduced in [7], uses propositional formulas in conjunctive normal ...
Wojciech Penczek, Maciej Szreter
JAIR
2007
121views more  JAIR 2007»
13 years 8 months ago
On the Semantics of Logic Programs with Preferences
This work is a contribution to prioritized reasoning in logic programming in the presence of preference relations involving atoms. The technique, providing a new interpretation fo...
Sergio Greco, Irina Trubitsyna, Ester Zumpano
CAV
2004
Springer
152views Hardware» more  CAV 2004»
14 years 1 months ago
Abstract Regular Model Checking
Regular Tree Model Checking Ahmed Bouajjani, Peter Habermehl 1 LIAFA, University Paris 7, Case 7014, 2, place Jussieu, F-75251 Paris Cedex 05, France Adam Rogalewicz, Tom´aˇs Voj...
Ahmed Bouajjani, Peter Habermehl, Tomás Voj...
ENTCS
2007
84views more  ENTCS 2007»
13 years 8 months ago
Inductive Reasoning and Programming Visualization, an Experiment Proposal
We lay down plans to study how Inductive Reasoning Ability (IRA) affects the analyzing and understanding of Program Visualization (PV) systems. Current PV systems do not take int...
Andrés Moreno, Niko Myller, Erkki Sutinen, ...
DAC
2008
ACM
14 years 9 months ago
Construction of concrete verification models from C++
C++ based verification methodologies are now emerging as the preferred method for SOC design. However most of the verification involving the C++ models are simulation based. The c...
Malay Haldar, Gagandeep Singh, Saurabh Prabhakar, ...