Sciweavers

616 search results - page 45 / 124
» Bounded Model Checking with Description Logic Reasoning
Sort
View
106
Voted
ASPDAC
2007
ACM
139views Hardware» more  ASPDAC 2007»
15 years 7 months ago
Deeper Bound in BMC by Combining Constant Propagation and Abstraction
ound in BMC by Combining Constant Propagation and Abstraction Roy Armoni, Limor Fix1 , Ranan Fraer1 , Tamir Heyman1,3 , Moshe Vardi2 , Yakir Vizel1 , Yael Zbar1 1 Logic and Validat...
Roy Armoni, Limor Fix, Ranan Fraer, Tamir Heyman, ...
130
Voted
CADE
2007
Springer
16 years 4 months ago
System for Automated Deduction (SAD): A Tool for Proof Verification
In this paper, a proof assistant, called SAD, is presented. SAD deals with mathematical texts that are formalized in the ForTheL language (brief description of which is also given)...
Konstantin Verchinine, Alexander V. Lyaletski, And...
174
Voted
ICFEM
2009
Springer
15 years 10 months ago
Approximate Model Checking of PCTL Involving Unbounded Path Properties
Abstract. We study the problem of applying statistical methods for approximate model checking of probabilistic systems against properties encoded as PCTL formulas. Such approximate...
Samik Basu, Arka P. Ghosh, Ru He
137
Voted
IS
2010
15 years 2 months ago
Content value chains modelling using a copyright ontology
Existing Digital Rights Management systems, initiatives like Creative Commons or research works as some digital rights ontologies provide limited support for content value chains m...
Roberto García, Rosa Gil
125
Voted
DLOG
2008
15 years 6 months ago
ContraBovemRufum: A System for Probabilistic Lexicographic Entailment
Representing probabilistic knowledge in combination with a description logic has been a research topic for quite some time. In [1] one of such combinations is introduced. We presen...
Tobias Henrik Näth, Ralf Möller