Sciweavers

756 search results - page 87 / 152
» Using Logic Programs to Reason about Infinite Sets
Sort
View
ISSTA
2006
ACM
15 years 9 months ago
Breaking up is hard to do: an investigation of decomposition for assume-guarantee reasoning
Finite-state verification techniques are often hampered by the stateexplosion problem. One proposed approach for addressing this problem is assume-guarantee reasoning. Using rece...
Jamieson M. Cobleigh, George S. Avrunin, Lori A. C...
LATA
2009
Springer
15 years 10 months ago
Termination of Priority Rewriting
Introducing priorities on rules in rewriting increases their expressive power and helps to limit computations. Priority rewriting is used in rule-based programming as well as in f...
Isabelle Gnaedig
POPL
2009
ACM
16 years 3 months ago
Formal certification of code-based cryptographic proofs
As cryptographic proofs have become essentially unverifiable, cryptographers have argued in favor of developing techniques that help tame the complexity of their proofs. Game-base...
Benjamin Grégoire, Gilles Barthe, Santiago ...
SIGMOD
1999
ACM
99views Database» more  SIGMOD 1999»
15 years 7 months ago
Belief Reasoning in MLS Deductive Databases
It is envisaged that the application of the multilevel security (MLS) scheme will enhance exibility and e ectiveness of authorization policies in shared enterprise databases and w...
Hasan M. Jamil
CLEIEJ
2010
15 years 19 days ago
Teaching Programming Principles through a Game Engine
Teaching fundamental programming to freshmen is a hard task to be performed, given the high level action and logical reasoning that are required for these students to develop in a...
Cristiane Camilo Hernandez, Luciano Silva, Rafael ...