262 search results - page 43 / 53 » Verifying Web Applications Using Bounded Model Checking |
108
Voted
SEMWEB
2005
Springer
15 years 5 months ago
2005
Springer
Abstract. We present a method for rapid development of benchmarks for Semantic Web knowledge base systems. At the core, we have a synthetic data generation approach for OWL that is...
136
Voted
ESOP
2005
Springer
15 years 5 months ago
2005
Springer
Abstract. We instantiate an Isabelle/HOL framework for proof carrying code to Jinja bytecode, a downsized variant of Java bytecode featuring objects, inheritance, method calls and ...
90
Voted
TPHOL
2005
IEEE
15 years 5 months ago
2005
IEEE
Using the HOL theorem prover, we proved the correctness of a translation from a subset of Accellera’s property specification language PSL to linear temporal logic LTL. Moreover,...
120
click to vote
KAIS
2011
14 years 6 months ago
2011
Triangle counting is an important problem in graph mining. Two frequently used metrics in complex network analysis which require the count of triangles are the clustering coefficie...
128
click to vote
SIGSOFT
2006
ACM
15 years 5 months ago
2006
ACM
Bitwise operations are commonly used in low-level systems code to access multiple data fields that have been packed into a single word. Program analysis tools that reason about s...