Sciweavers

526 search results - page 58 / 106
» Towards the Verifying Compiler
Sort
View
CADE
2007
Springer
15 years 10 months ago
Towards Efficient Satisfiability Checking for Boolean Algebra with Presburger Arithmetic
Boolean Algebra with Presburger Arithmetic (BAPA) is a decidable logic that combines 1) Boolean algebra of sets of uninterpreted elements (BA) and 2) Presburger arithmetic (PA). BA...
Viktor Kuncak, Martin C. Rinard
SIGMOD
2007
ACM
186views Database» more  SIGMOD 2007»
15 years 10 months ago
Fg-index: towards verification-free query processing on graph databases
Graphs are prevalently used to model the relationships between objects in various domains. With the increasing usage of graph databases, it has become more and more demanding to e...
James Cheng, Yiping Ke, Wilfred Ng, An Lu
ICFP
2005
ACM
15 years 9 months ago
Toward a general theory of names: binding and scope
High-level formalisms for reasoning about names and binding such uijn indices, various flavors of higher-order abstract syntax, ry of Contexts, and nominal abstract syntax address...
James Cheney
SACMAT
2009
ACM
15 years 4 months ago
Towards formal security analysis of GTRBAC using timed automata
An access control system is often viewed as a state transition system. Given a set of access control policies, a general safety requirement in such a system is to determine whethe...
Samrat Mondal, Shamik Sural, Vijayalakshmi Atluri
ADAEUROPE
2007
Springer
15 years 4 months ago
Towards the Testing of Power-Aware Software Applications for Wireless Sensor Networks
The testing of programs in wireless sensor networks (WSN) is an important means to assure quality but is a challenging process. As pervasive computing has been identified as a not...
W. K. Chan, Tsong Yueh Chen, S. C. Cheung, T. H. T...