You can subscribe to this list here.
2004 
_{Jan}

_{Feb}

_{Mar}

_{Apr}

_{May}

_{Jun}

_{Jul}
(1) 
_{Aug}

_{Sep}

_{Oct}

_{Nov}

_{Dec}


2005 
_{Jan}

_{Feb}

_{Mar}

_{Apr}

_{May}

_{Jun}

_{Jul}

_{Aug}

_{Sep}

_{Oct}

_{Nov}
(1) 
_{Dec}

2006 
_{Jan}

_{Feb}

_{Mar}
(1) 
_{Apr}

_{May}

_{Jun}
(3) 
_{Jul}

_{Aug}

_{Sep}

_{Oct}

_{Nov}
(2) 
_{Dec}

2007 
_{Jan}
(6) 
_{Feb}
(1) 
_{Mar}
(1) 
_{Apr}

_{May}

_{Jun}
(12) 
_{Jul}

_{Aug}
(1) 
_{Sep}
(2) 
_{Oct}

_{Nov}
(3) 
_{Dec}
(2) 
2008 
_{Jan}

_{Feb}

_{Mar}

_{Apr}

_{May}

_{Jun}

_{Jul}

_{Aug}

_{Sep}
(1) 
_{Oct}

_{Nov}
(1) 
_{Dec}

2009 
_{Jan}

_{Feb}

_{Mar}
(1) 
_{Apr}

_{May}

_{Jun}

_{Jul}

_{Aug}

_{Sep}

_{Oct}

_{Nov}

_{Dec}
(1) 
2010 
_{Jan}

_{Feb}

_{Mar}

_{Apr}

_{May}

_{Jun}

_{Jul}

_{Aug}

_{Sep}

_{Oct}

_{Nov}
(1) 
_{Dec}

2011 
_{Jan}

_{Feb}

_{Mar}

_{Apr}
(1) 
_{May}
(1) 
_{Jun}

_{Jul}

_{Aug}

_{Sep}

_{Oct}

_{Nov}

_{Dec}

S  M  T  W  T  F  S 


1

2

3

4

5

6

7

8
(1) 
9

10

11

12

13

14

15

16

17

18

19

20

21

22

23

24
(2) 
25

26

27

28

29
(2) 
30
(1) 
31




From: John Whaley <joewhaley@gm...>  20070130 08:34:52

Hi Alan, There is some switch to turn on output of bytecode indices, or actually it may be output by default in the text strings that describe each variable. It's been a while so I'll have to go back and check it out. John On 1/29/07, Alan Ryan <alan.ryan@...> wrote: > Hi, > > I am running an analysis that requires me to know bytecode locations for > assignments / loads etc.. In the PODS '05 paper the SQLInjection example has > a domain B representing bytecodes, and this is the approach I was hoping to > follow, but it seems by default bddbddb does not give details regarding the > bytecode locations for store/load/assignment . Can I turn this feature on or > am I misinterpreting something here? > > Thanks, > Alan >  > Take Surveys. Earn Cash. Influence the Future of IT > Join SourceForge.net's Techsay panel and you'll get the chance to share your > opinions on IT & business topics through brief surveys  and earn cash > http://www.techsay.com/default.php?page=join.php&p=sourceforge&CID=DEVDEV > > _______________________________________________ > bddbddbdevel mailing list > bddbddbdevel@... > https://lists.sourceforge.net/lists/listinfo/bddbddbdevel > > > 
From: Prakash Prabhu <prakash.prabhu@gm...>  20070129 17:06:22

Hi John, Thanks for the pointers. Yeah, we actually needed a much simplified version of count() like you specified, finding out something similar to "Does this variable point to more than 1 object/ exactly one object or to no object" regards, Prakash On 1/24/07, John Whaley <joewhaley@...> wrote: > > Hi Prakash, > > What would you use the count() for? The only thing I could think of > is to compare it to an integer (or another count). You could use the > BDD operation "satCount()" to get the number of tuples in a relation. > There is no support for a count() predicate in bddbddb, although it > would not be difficult to add. See "dsize()" in BDDRelation for an > example of how to get the number of tuples in a relation, and > "update()/updateIncremental()" in BDDInferenceRule for a place to > integrate it within the rule solving. > > If your count is small (1 or 2) you could always write a simple rule like > this: > > moreThanOne(a) : relation(a,b), relation(a,c), a != c. > onlyOne(a) : relation(a,_), !moreThanOne(a). > > Likewise for two, three, etc. It gets really tedious at higher #s, > though. > > John > > > On 1/24/07, Prakash Prabhu <prakash.prabhu@...> wrote: > > Hi, > > > > Is there a way in bddbddb to count the number of tuples in a relation at > > runtime , ie, does bddbddb support a predicate of the form > > count(relation(a,_)) which would count the number of tuples in > 'relation' > > which have 'a' in the first column ? > > > > If not, I would like to get some advice on how complex it would be to > > implement it in bddbddb (the files to look at would be of great help ) > and > > whether it would be too expensive to incorporate the 'count' ( if > > implemented ) on the rhs of one of the rules of the Datalog program. > Would > > implementing this mean counting the number of paths that lead to the 1 > leaf > > in the corresponding BDD, then for each path filling in all possible > values > > for BDD variables that do not appear on that path ? > > > > thanks. > > Prakash > > > > >  > > Take Surveys. Earn Cash. Influence the Future of IT > > Join SourceForge.net's Techsay panel and you'll get the chance to share > your > > opinions on IT & business topics through brief surveys  and earn cash > > > http://www.techsay.com/default.php?page=join.php&p=sourceforge&CID=DEVDEV > > > > _______________________________________________ > > bddbddbdevel mailing list > > bddbddbdevel@... > > https://lists.sourceforge.net/lists/listinfo/bddbddbdevel > > > > > > > 
From: Alan Ryan <alan.ryan@gm...>  20070129 10:52:54

Hi, I am running an analysis that requires me to know bytecode locations for assignments / loads etc.. In the PODS '05 paper the SQLInjection example has a domain B representing bytecodes, and this is the approach I was hoping to follow, but it seems by default bddbddb does not give details regarding the bytecode locations for store/load/assignment . Can I turn this feature on or am I misinterpreting something here? Thanks, Alan 
From: John Whaley <joewhaley@gm...>  20070124 17:27:30

Hi Prakash, What would you use the count() for? The only thing I could think of is to compare it to an integer (or another count). You could use the BDD operation "satCount()" to get the number of tuples in a relation. There is no support for a count() predicate in bddbddb, although it would not be difficult to add. See "dsize()" in BDDRelation for an example of how to get the number of tuples in a relation, and "update()/updateIncremental()" in BDDInferenceRule for a place to integrate it within the rule solving. If your count is small (1 or 2) you could always write a simple rule like this: moreThanOne(a) : relation(a,b), relation(a,c), a != c. onlyOne(a) : relation(a,_), !moreThanOne(a). Likewise for two, three, etc. It gets really tedious at higher #s, though. John On 1/24/07, Prakash Prabhu <prakash.prabhu@...> wrote: > Hi, > > Is there a way in bddbddb to count the number of tuples in a relation at > runtime , ie, does bddbddb support a predicate of the form > count(relation(a,_)) which would count the number of tuples in 'relation' > which have 'a' in the first column ? > > If not, I would like to get some advice on how complex it would be to > implement it in bddbddb (the files to look at would be of great help ) and > whether it would be too expensive to incorporate the 'count' ( if > implemented ) on the rhs of one of the rules of the Datalog program. Would > implementing this mean counting the number of paths that lead to the 1 leaf > in the corresponding BDD, then for each path filling in all possible values > for BDD variables that do not appear on that path ? > > thanks. > Prakash > >  > Take Surveys. Earn Cash. Influence the Future of IT > Join SourceForge.net's Techsay panel and you'll get the chance to share your > opinions on IT & business topics through brief surveys  and earn cash > http://www.techsay.com/default.php?page=join.php&p=sourceforge&CID=DEVDEV > > _______________________________________________ > bddbddbdevel mailing list > bddbddbdevel@... > https://lists.sourceforge.net/lists/listinfo/bddbddbdevel > > > 
From: Prakash Prabhu <prakash.prabhu@gm...>  20070124 16:07:59

Hi, Is there a way in bddbddb to count the number of tuples in a relation at runtime , ie, does bddbddb support a predicate of the form count(relation(a,_)) which would count the number of tuples in 'relation' which have 'a' in the first column ? If not, I would like to get some advice on how complex it would be to implement it in bddbddb (the files to look at would be of great help ) and whether it would be too expensive to incorporate the 'count' ( if implemented ) on the rhs of one of the rules of the Datalog program. Would implementing this mean counting the number of paths that lead to the 1 leaf in the corresponding BDD, then for each path filling in all possible values for BDD variables that do not appear on that path ? thanks. Prakash 
From: David Brumley <dbrumley@cs...>  20070108 21:16:27

Hi John, I'm having troubles building bddbddb. Are there instructions anywhere? If I just type 'make jikes' in bddbddb, I get: *** Semantic Error: You need to modify your classpath, sourcepath, bootclasspath, and/or extdirs setup. Jikes could not find package "java.lang" in: . javabdd2.0.jar jwutil1.0.jar weka.jar jdom.jar . make: *** [_jikes] Error 1 So I modify BUILD_CLASSPATH in the Makefile to include ${CLASSPATH}. Then I get with 'make jikes': jikes target 1.3 classpath .:/usr/java/jdk1.5.0_07/jre/lib/rt.jar:.:javabdd2. 0.jar:jwutil1.0.jar:weka.jar:jdom.jar @.source_list Issued 1 semantic warning compiling "net/sf/bddbddb/ir/BDDInterpreter.java": 69. InferenceRule ir = (InferenceRule) o; ....<many more warnings>..... *** Semantic Error: The type of the left subexpression, "net.sf.bddbddb.ir.Oper ation", cannot possibly be an instance of type "net.sf.bddbddb.dataflow.PartialR edundancy$Phi". 162. Phi p = (Phi) e2.op; ^^ *** Semantic Error: An expression of type "net.sf.bddbddb.ir.Operation" cannot b e cast into type "net.sf.bddbddb.dataflow.Phi". 234. subExpression = new Expression(phi, new LinkedList(),depth); ^ ^ *** Semantic Error: No applicable overload was found for a constructor with sign ature "Expression(net.sf.bddbddb.dataflow.PartialRedundancy.Phi, java.util.Linke dList, int)" in type "net.sf.bddbddb.dataflow.PartialRedundancy $Expression". Per haps you wanted the overloaded version "Expression(net.sf.bddbddb.ir.Operation o p, java.util.List subExpressions, int depth);" instead? Any idea? I've attached a .txt of the make for easier parsing. As for changes to bddbddb, I'd like to add: bit shifting multiplication addition ifthenelse as bdd operations. Limiting ourselves to a finite domain is fine, but its going to be up to machine word sizes. So I think adding the multiplication table won't be tractable. Can we add the above operations as bdd operations in terms of the circuit? Thanks, David On Mon, 20061127 at 10:45 0800, John Whaley wrote: > Hi David, > > For operations like addition and multiplication, you will need to > build up a BDD that implements that function and load it in. For > example, for multiplication you will need to make your own BDD that > contains the multiplication table, i.e. it should have these tuples: > > mult(1,1,1). > mult(1,2,2). > mult(2,1,2). > mult(2,2,4). > mult(3,1,3). > mult(3,2,6). > ... > > As you guessed, BDDs aren't too good at representing multiplication, > but if you limit the number (up to say, 256x256) it should be > tractable. Addition is no problem. > > Adding native support for addition would be pretty easy as the pieces > are mostly there. Just need to edit the parser to parse it correctly: > see parseRuleTerm() in DatalogParser.java, and then use buildAdd() in > BDDDomain.java or add() in BDDBitVector.java to actually build the > addition relation. > > Let me know if you have any more questions. > > John > > > On 11/16/06, David Brumley <dbrumley@...> wrote: > > Hi, > > I'm looking at doing pointsto analysis for x86 assembly, and was > > interested in using bddbddb. x86 memory references are generally of the > > form base+(index*scale)+ displacement. Thus, my analysis requires > > addition and potentially multiplication and even less potentially, > > though possible, modulus. (I understand multiplication is sometimes bad > > for bdd's.) > > > > > > Does bddbddb support addition and/or multiplication in rules, i.e., can > > I write: > > > > fact(a,2). > > fact(b,3). > > foo(X,Y,Z) : fact(X,I1), fact(Y,I2), Z is I1+ I2. > > > > and on query: > > ? foo(a,b,Sum). > > > > Sum is 5 > > > > > > Thanks! > > David > > > > > > > >  > > Take Surveys. Earn Cash. Influence the Future of IT > > Join SourceForge.net's Techsay panel and you'll get the chance to share your > > opinions on IT & business topics through brief surveys  and earn cash > > http://www.techsay.com/default.php?page=join.php&p=sourceforge&CID=DEVDEV > > _______________________________________________ > > bddbddbdevel mailing list > > bddbddbdevel@... > > https://lists.sourceforge.net/lists/listinfo/bddbddbdevel > > > 