Sciweavers

922 search results - page 47 / 185
» A generalization of the Lin-Zhao theorem
Sort
View
ISSTA
2012
ACM
12 years 23 days ago
Detecting inconsistencies via universal reachability analysis
Recent research has suggested that a large class of software bugs fall into the category of inconsistencies, or cases where two pieces of program code make incompatible assumption...
Aaron Tomb, Cormac Flanagan
LPNMR
2005
Springer
14 years 3 months ago
An Algebraic Account of Modularity in ID-Logic
ID-logic uses ideas from the field of logic programming to extend second order logic with non-monotone inductive defintions. In this work, we reformulate the semantics of this lo...
Joost Vennekens, Marc Denecker
ISIPTA
2003
IEEE
14 years 3 months ago
Combining Belief Functions Issued from Dependent Sources
Dempster’s rule for combining two belief functions assumes the independence of the sources of information. If this assumption is questionable, I suggest to use the least speci...
Marco E. G. V. Cattaneo
DAM
2002
78views more  DAM 2002»
13 years 10 months ago
Uniquely 2-list colorable graphs
A graph is said to be uniquely list colorable, if it admits a list assignment which induces a unique list coloring. We study uniquely list colorable graphs with a restriction on t...
Yashar Ganjali, Mohammad Ghebleh, Hossein Hajiabol...
ACL2
2006
ACM
14 years 2 months ago
Combining ACL2 and an automated verification tool to verify a multiplier
We have extended the ACL2 theorem prover to automatically prove properties of VHDL circuits with IBM's Internal SixthSense verification system. We have used this extension to...
Erik Reeber, Jun Sawada