Results 21 - 30 of 104,175

Table 2. Proof System

in A Decidable Fragment of Separation Logic
by Josh Berdine, Cristiano Calcagno, Peter O'Hearn 2004
"... In PAGE 8: ... We now see that it also forms the basis of a sound and complete proof theory, and a decision procedure based on proof-search. The rules of the proof system are shown in Table2 . Since there is no Cut rule, the rules have a rather odd form.... ..."
Cited by 34

Table 2. Proof System

in A decidable fragment of separation logic
by Josh Berdine, Cristiano Calcagno, Peter W. O’hearn 2004
"... In PAGE 8: ... We now see that it also forms the basis of a sound and complete proof theory, and a decision procedure based on proof-search. The rules of the proof system are shown in Table2 . Since there is no Cut rule, the rules have a rather odd form.... ..."
Cited by 34

Table 2. Proof System

in A Decidable Fragment of Separation Logic
by Josh Berdine, Cristiano Calcagno, Peter O'Hearn 2004
"... In PAGE 8: ... We now see that it also forms the basis of a sound and complete proof theory, and a decision procedure based on proof-search. The rules of the proof system are shown in Table2 . Since there is no Cut rule, the rules have a rather odd form.... ..."
Cited by 34

Table 2. Proof System

in A decidable fragment of separation logic
by Josh Berdine, Cristiano Calcagno, Peter W. O’hearn 2004
"... In PAGE 8: ... We now see that it also forms the basis of a sound and complete proof theory, and a decision procedure based on proof-search. The rules of the proof system are shown in Table2 . Since there is no Cut rule, the rules have a rather odd form.... ..."
Cited by 34

Table 2. Proof System

in A decidable fragment of separation logic
by Josh Berdine, Cristiano Calcagno, Peter W. O’hearn 2004
"... In PAGE 8: ... We now see that it also forms the basis of a sound and complete proof theory, and a decision procedure based on proof-search. The rules of the proof system are shown in Table2 . Since there is no Cut rule, the rules have a rather odd form.... ..."
Cited by 34

Table 3 and Table 4 integrate these optimizations into the basic enumerate technique we presented in Table 1 and Table 2.

in Spin: Mining maximal frequent subgraphs from graph databases
by Jun Huan, Wei Wang, Jan Prins, Jiong Yang 2004
"... In PAGE 5: ... Table3 : An algorithm for exploring the equivalence class of a tree T for maximal subgraph mining Algorithm Maximal Subgraph Mining(G; ) begin 1. R fTjT is a frequent tree in Gg 2.... ..."
Cited by 21

Table 9: The proof system

in A Modal Logic for Mobile Agents
by Rocco De Nicola, Michele Loreti
"... In PAGE 23: ... The proof system is defined in Table 10. Rules R1-R5 are essentially the same as in Table9 , where we have the rules for the finitary logics. The only difference is the hypothesis H.... ..."

Table 1. the proof system

in A Complete Proof System for Nested Term Graphs
by Stefan Blom 1995
Cited by 2

Table 1. Operating system functionality and corresponding techniques for optimizing energy utilization.

in ADVANCED POWER MANAGEMENT TECHNIQUES FOR MOBILE COMMUNICATION SYSTEMS
by Ben Abdallah Abderazek, Masahiro Sowa

Table 6.5. Compaction results for GATTO test sets

in Hierarchical Test Generation for Digital Circuits Represented by Decision Diagrams
by Jaan Raik
Results 21 - 30 of 104,175