Elad Shahar | Weizmann Institute of Science (original) (raw)
Papers by Elad Shahar
Lecture Notes in Computer Science, 2000
Abstract. The paper considers the problem of uniform verification of parameterized systems by sym... more Abstract. The paper considers the problem of uniform verification of parameterized systems by symbolic model checking, using formulas in fs1s (a syntactic variant of the 2nd order logic ws1s) for the symbolic representation of sets of states. The technical difficulty addressed ...
Lecture Notes in Computer Science, 1996
... t Department of Computer Science, Weizmann Institute, Rehovot, Israel, e-mail: amir@wisdom, w... more ... t Department of Computer Science, Weizmann Institute, Rehovot, Israel, e-mail: amir@wisdom, weizmann, ac. il Page 2. 185 proof. ... B1 :O-'-~p B2:prAp"~p~ Vr6T A1 :~A~=0--*q A2 : (~^ -q) ~ 3r e 7"3V'(p. ~ ~ ~- 6') [] p AG EF q Rule BINV Rule AGEF Fig. 4. Verification rules. ...
Proceedings of the 2006 20th anniversary conference on Computer supported cooperative work - CSCW '06, 2006
The CSCW conference is celebrating its 20th birthday. This is a perfect time to analyze the coher... more The CSCW conference is celebrating its 20th birthday. This is a perfect time to analyze the coherence of the field, to examine whether it has a solid core or sub-communities, and to identify various patterns of its development. In this paper we analyze the structure of the CSCW conference using structural analysis of the citation graph of CSCW and related
Proceeding of the twenty-sixth annual CHI conference on Human factors in computing systems - CHI '08, 2008
Web 2.0 gives people a substantial role in content and metadata creation. New interpersonal conne... more Web 2.0 gives people a substantial role in content and metadata creation. New interpersonal connections are formed and existing connections become evident. This newly created social network (SN) spans across multiple services and aggregating it could bring great value. In this work we present SONAR, an API for gathering and sharing SN information. We give a detailed description of SONAR, demonstrate its potential value through user scenarios, and show results from experiments we conducted with a SONAR-based social networking application within our organizational intranet. These suggest that aggregating SN information across diverse data sources enriches the SN picture and makes it more complete and useful for the end user.
Proceedings of the ACM 2008 conference on Computer supported cooperative work - CSCW '08, 2008
The goal of this research is to facilitate the design of systems which will mine and use sociocen... more The goal of this research is to facilitate the design of systems which will mine and use sociocentric social networks without infringing privacy. We describe an extensive experiment we conducted within our organization comparing social network information gathered from various intranet public sources with social network information gathered from a private source -the organizational email system. We also report the conclusions of a series of interviews we conducted based on our experiment. The results shed light on the richness of public social network information, its characteristics, and added value over email network information.
Proceedings of the 32nd international ACM SIGIR conference on Research and development in information retrieval - SIGIR '09, 2009
Theoretical Computer Science, 2001
The paper shows that, by an appropriate choice of a rich a ssertional language, it is possible to... more The paper shows that, by an appropriate choice of a rich a ssertional language, it is possible to extend the utility o f s y m bolic model checking beyond the realm of bdd-represented nite-state systems into the domain of in nite-state systems, leading to a powerful technique for uniform veri cation of unbounded (parameterized) process networks. The main contributions of the paper are a formulation of a general framework for symbolic model checking of in nite-state systems, a demonstration that many individual examples of uniformly veri ed parameterized designs that appear in the literature are special cases of our general approach, verifying the correctness of the Futurebus+ design for all single-bus con gurations, extending the technique to tree architectures, and establishing that the presented method is a precise dual to the top-down invariant generation method used in deductive v eri cation.
Formal Methods in System Design, 2006
In this paper we present a coherent framework for symbolic model checking of linear-time temporal... more In this paper we present a coherent framework for symbolic model checking of linear-time temporal logic (ltl) properties over finite state reactive systems, taking full fairness constraints into consideration. We use the computational model of a fair discrete system (fds) which takes into account both justice (weak fairness) and compassion (strong fairness). The approach presented here reduces the model-checking problem
Lecture Notes in Computer Science, 2002
Lecture Notes in Computer Science, 2000
Abstract. The paper considers the problem of uniform verification of parameterized systems by sym... more Abstract. The paper considers the problem of uniform verification of parameterized systems by symbolic model checking, using formulas in fs1s (a syntactic variant of the 2nd order logic ws1s) for the symbolic representation of sets of states. The technical difficulty addressed ...
Lecture Notes in Computer Science, 1996
... t Department of Computer Science, Weizmann Institute, Rehovot, Israel, e-mail: amir@wisdom, w... more ... t Department of Computer Science, Weizmann Institute, Rehovot, Israel, e-mail: amir@wisdom, weizmann, ac. il Page 2. 185 proof. ... B1 :O-'-~p B2:prAp"~p~ Vr6T A1 :~A~=0--*q A2 : (~^ -q) ~ 3r e 7"3V'(p. ~ ~ ~- 6') [] p AG EF q Rule BINV Rule AGEF Fig. 4. Verification rules. ...
Proceedings of the 2006 20th anniversary conference on Computer supported cooperative work - CSCW '06, 2006
The CSCW conference is celebrating its 20th birthday. This is a perfect time to analyze the coher... more The CSCW conference is celebrating its 20th birthday. This is a perfect time to analyze the coherence of the field, to examine whether it has a solid core or sub-communities, and to identify various patterns of its development. In this paper we analyze the structure of the CSCW conference using structural analysis of the citation graph of CSCW and related
Proceeding of the twenty-sixth annual CHI conference on Human factors in computing systems - CHI '08, 2008
Web 2.0 gives people a substantial role in content and metadata creation. New interpersonal conne... more Web 2.0 gives people a substantial role in content and metadata creation. New interpersonal connections are formed and existing connections become evident. This newly created social network (SN) spans across multiple services and aggregating it could bring great value. In this work we present SONAR, an API for gathering and sharing SN information. We give a detailed description of SONAR, demonstrate its potential value through user scenarios, and show results from experiments we conducted with a SONAR-based social networking application within our organizational intranet. These suggest that aggregating SN information across diverse data sources enriches the SN picture and makes it more complete and useful for the end user.
Proceedings of the ACM 2008 conference on Computer supported cooperative work - CSCW '08, 2008
The goal of this research is to facilitate the design of systems which will mine and use sociocen... more The goal of this research is to facilitate the design of systems which will mine and use sociocentric social networks without infringing privacy. We describe an extensive experiment we conducted within our organization comparing social network information gathered from various intranet public sources with social network information gathered from a private source -the organizational email system. We also report the conclusions of a series of interviews we conducted based on our experiment. The results shed light on the richness of public social network information, its characteristics, and added value over email network information.
Proceedings of the 32nd international ACM SIGIR conference on Research and development in information retrieval - SIGIR '09, 2009
Theoretical Computer Science, 2001
The paper shows that, by an appropriate choice of a rich a ssertional language, it is possible to... more The paper shows that, by an appropriate choice of a rich a ssertional language, it is possible to extend the utility o f s y m bolic model checking beyond the realm of bdd-represented nite-state systems into the domain of in nite-state systems, leading to a powerful technique for uniform veri cation of unbounded (parameterized) process networks. The main contributions of the paper are a formulation of a general framework for symbolic model checking of in nite-state systems, a demonstration that many individual examples of uniformly veri ed parameterized designs that appear in the literature are special cases of our general approach, verifying the correctness of the Futurebus+ design for all single-bus con gurations, extending the technique to tree architectures, and establishing that the presented method is a precise dual to the top-down invariant generation method used in deductive v eri cation.
Formal Methods in System Design, 2006
In this paper we present a coherent framework for symbolic model checking of linear-time temporal... more In this paper we present a coherent framework for symbolic model checking of linear-time temporal logic (ltl) properties over finite state reactive systems, taking full fairness constraints into consideration. We use the computational model of a fair discrete system (fds) which takes into account both justice (weak fairness) and compassion (strong fairness). The approach presented here reduces the model-checking problem
Lecture Notes in Computer Science, 2002