Sciweavers

241 search results - page 15 / 49
» Bounded Nondeterminism of Logic Programs
Sort
View
DAC
2003
ACM
14 years 8 months ago
Behavioral consistency of C and verilog programs using bounded model checking
We present an algorithm that checks behavioral consistency between an ANSI-C program and a circuit given in Verilog using Bounded Model Checking. Both the circuit and the program ...
Edmund M. Clarke, Daniel Kroening, Karen Yorav
CPAIOR
2007
Springer
14 years 1 months ago
Cost-Bounded Binary Decision Diagrams for 0-1 Programming
Abstract. In recent work binary decision diagrams (BDDs) were introduced as a technique for postoptimality analysis for integer programming. In this paper we show that much smaller...
Tarik Hadzic, John N. Hooker
CORR
2008
Springer
107views Education» more  CORR 2008»
13 years 7 months ago
Model Checking Probabilistic Timed Automata with One or Two Clocks
Probabilistic timed automata are an extension of timed automata with discrete probability distributions. We consider model-checking algorithms for the subclasses of probabilistic t...
Marcin Jurdzinski, François Laroussinie, Je...
ATAL
2005
Springer
14 years 1 months ago
Bounded model checking for knowledge and real time
We present TECTLK, a logic to specify knowledge and real time in multi-agent systems. We show that the model checking problem is decidable, and we present an algorithm for TECTLK ...
Bozena Wozna, Alessio Lomuscio, Wojciech Penczek
IPPS
2000
IEEE
14 years 20 hour ago
Deterministic Replay of Distributed Java Applications
Execution behavior of a Java application can be nondeterministic due to concurrent threads of execution, thread scheduling, and variable network delays. This nondeterminism in Jav...
Ravi B. Konuru, Harini Srinivasan, Jong-Deok Choi