![]() | ![]() |
| 2012 | ||
|---|---|---|
| 71 | Rivka Taub, Michal Armoni, Mordechai Ben-Ari: CS Unplugged and Middle-School Students' Views, Attitudes, and Intentions Regarding CS. TOCE 12(2): 8 (2012) | |
| 2011 | ||
| 70 | Orni Meerbaum-Salant, Michal Armoni, Mordechai Ben-Ari: Habits of programming in scratch. ITiCSE 2011: 168-172 | |
| 69 | Andreas Leon Aagaard Moth, Jørgen Villadsen, Mordechai Ben-Ari: SyntaxTrain: relieving the pain of learning syntax. ITiCSE 2011: 387 | |
| 68 | Jan Lönnberg, Mordechai Ben-Ari, Lauri Malmi: Java replay for dependence-based debugging. PADTAD 2011: 15-25 | |
| 67 | Jan Lönnberg, Mordechai Ben-Ari, Lauri Malmi: Visualising concurrent programs with dynamic dependence graphs. VISSOFT 2011: 1-4 | |
| 66 | Mordechai Ben-Ari: Non-myths about programming. Commun. ACM 54(7): 35-37 (2011) | |
| 65 | Mordechai Ben-Ari, Roman Bednarik, Ronit Ben-Bassat Levy, Gil Ebel, Andrés Moreno, Niko Myller, Erkki Sutinen: A decade of research and development on program animation: The Jeliot experience. J. Vis. Lang. Comput. 22(5): 375-384 (2011) | |
| 2010 | ||
| 64 | Mordechai Ben-Ari: Non-myths about programming. ICER 2010: 1-2 | |
| 63 | Orni Meerbaum-Salant, Michal Armoni, Mordechai Ben-Ari: Learning computer science concepts with scratch. ICER 2010: 69-76 | |
| 62 | Mordechai Ben-Ari: Objects never?: well, hardly ever! Commun. ACM 53(9): 32-35 (2010) | |
| 2009 | ||
| 61 | Mordechai Ben-Ari: Ada for Software Engineers - second edition with Ada 2005 (2. ed.). Springer 2009: I-XIV, 1-509 | |
| 60 | Rivka Taub, Mordechai Ben-Ari, Michal Armoni: The effect of CS unplugged on middle-school students' views of CS. ITiCSE 2009: 99-103 | |
| 59 | Mordechai Ben-Ari: Tool Presentation: Teaching Concurrency and Model Checking. SPIN 2009: 6-11 | |
| 58 | Michal Armoni, Mordechai Ben-Ari: The concept of nondeterminism: its development and implications for teaching. SIGCSE Bulletin 41(2): 141-160 (2009) | |
| 57 | Niko Myller, Roman Bednarik, Erkki Sutinen, Mordechai Ben-Ari: Extending the Engagement Taxonomy: Software Visualization and Collaborative Learning. TOCE 9(1): (2009) | |
| 2008 | ||
| 56 | Mordechai Ben-Ari: Principles of the spin model checker. Springer 2008: I-XV, 1-216 | |
| 55 | Ronit Ben-Bassat Levy, Mordechai Ben-Ari: Perceived behavior control and its influence on the adoption of software tools. ITiCSE 2008: 169-173 | |
| 54 | Michal Armoni, Noa Lewenstein, Mordechai Ben-Ari: Teaching students to think nondeterministically. SIGCSE 2008: 4-8 | |
| 2007 | ||
| 53 | Ronit Ben-Bassat Levy, Mordechai Ben-Ari: We work so hard and they don't use it: acceptance of software tools by teachers. ITiCSE 2007: 246-250 | |
| 52 | Mordechai Ben-Ari: Teaching concurrency and nondeterminism with spin. ITiCSE 2007: 363-364 | |
| 2006 | ||
| 51 | Mordechai Ben-Ari, Tzippora Yeshno: Conceptual models of software artifacts. Interacting with Computers 18(6): 1336-1350 (2006) | |
| 50 | Mordechai Ben-Ari: McKinley's Amazon. SIGCSE Bulletin 38(4): 75-77 (2006) | |
| 2005 | ||
| 49 | Cecile Yehezkel, Mordechai Ben-Ari, Tommy Dreyfus: Computer architecture and mental models. SIGCSE 2005: 101-105 | |
| 48 | Mordechai Ben-Ari: The concorde doesn't fly anymore. SIGCSE 2005: 196 | |
| 47 | Noa Ragonis, Mordechai Ben-Ari: On understanding the statics and dynamics of object-oriented programs. SIGCSE 2005: 226-230 | |
| 46 | Mordechai Ben-Ari: Minesweeper as an NP-complete problem. SIGCSE Bulletin 37(4): 39-40 (2005) | |
| 2004 | ||
| 45 | Andrés Moreno, Niko Myller, Erkki Sutinen, Mordechai Ben-Ari: Visualizing programs with Jeliot 3. AVI 2004: 373-376 | |
| 44 | Mordechai Ben-Ari, Anders Berglund, Shirley Booth, Christian Holmboe: What do we mean by theoretically sound research in computer science education? ITiCSE 2004: 230-231 | |
| 43 | Mordechai Ben-Ari: A suite of tools for teaching concurrency. ITiCSE 2004: 251 | |
| 42 | Andrés Moreno, Niko Myller, Mordechai Ben-Ari, Erkki Sutinen: Program animation in jeliot 3. ITiCSE 2004: 265 | |
| 41 | Mordechai Ben-Ari, Jorma Sajaniemi: Roles of variables as seen by CS educators. ITiCSE 2004: 52-56 | |
| 40 | Mordechai Ben-Ari: The concorde doesn't fly anymore. SIGCSE 2004: 1 | |
| 39 | Ahuva Tikvati, Mordechai Ben-Ari, Yifat Ben-David Kolikant: Virtual trees for the byzantine generals algorithm. SIGCSE 2004: 392-396 | |
| 2003 | ||
| 38 | Ronit Ben-Bassat Levy, Mordechai Ben-Ari, Pekka A. Uronen: The Jeliot 2000 program animation system. Computers & Education 40(1): 1-15 (2003) | |
| 2002 | ||
| 37 | Mordechai Ben-Ari, Henry MacKay Walker, Gaynor Redvers-Mutton, Keith Mansfield: Writing a textbook. ITiCSE 2002: 94-95 | |
| 2001 | ||
| 36 | Mordechai Ben-Ari: Mathematical logic for computer science (2. ed.). Springer 2001: I-XIV, 1-304 | |
| 35 | Mordechai Ben-Ari, Niko Myller, Erkki Sutinen, Jorma Tarhio: Perspectives on Program Animation with Jeliot. Software Visualization 2001: 31-45 | |
| 34 | Mordechai Ben-Ari: Interactive execution of distributed algorithms. ACM Journal of Educational Resources in Computing 1(2): 2 (2001) | |
| 33 | Mordechai Ben-Ari, Alan Burns: Extreme Interleavings. IEEE Distributed Systems Online 2(1): (2001) | |
| 32 | Mordechai Ben-Ari: The bug that destroyed a rocket. SIGCSE Bulletin 33(2): 58-59 (2001) | |
| 2000 | ||
| 31 | Ekaterina Sedletsky, Amir Pnueli, Mordechai Ben-Ari: Formal Verification of the Ricart-Agrawala Algorithm. FSTTCS 2000: 325-335 | |
| 30 | Yifat Ben-David Kolikant, Mordechai Ben-Ari, Sarah Pollack: The anthropology semaphores. ITiCSE 2000: 21-24 | |
| 29 | Mordechai Ben-Ari: How to Get a Good Review. SIGCSE Bulletin 32(2): 4-6 (2000) | |
| 1999 | ||
| 28 | Mordechai Ben-Ari, Yifat Ben-David Kolikant: Thinking parallel: the process of learning concurrency. ITiCSE 1999: 13-16 | |
| 27 | Mordechai Ben-Ari, Shawn Silverman: DPLab: an environment for distributed programming. ITiCSE 1999: 91-94 | |
| 1998 | ||
| 26 | Mordechai Ben-Ari: Synchronizing Multiple Clients and Servers. Ada-Europe 1998: 41-52 | |
| 25 | Yakov Persky, Mordechai Ben-Ari: Re-engineering a concurrency simulator. ITiCSE 1998: 185-188 | |
| 24 | Noa Ragonis, Ehud Y. Shapiro, Mordechai Ben-Ari, Zahava Scherz: Development, implementation and evaluation of a course in expert systems for high-school students (poster). ITiCSE 1998: 300 | |
| 23 | Yoav Tzruya, Mordechai Ben-Ari: A Portable Implementation of the Distributed Systems Annex in Java. SIGAda 1998: 204-211 | |
| 22 | Mordechai Ben-Ari: Constructivism in computer science education. SIGCSE 1998: 257-261 | |
| 21 | Mordechai Ben-Ari: How to solve the Santa Claus problem. Concurrency - Practice and Experience 10(6): 485-496 (1998) | |
| 20 | Mordechai Ben-Ari: Teaching Object-Oriented Programming in Ada. JOOP 11(6): 39-45 (1998) | |
| 1997 | ||
| 19 | Mordechai Ben-Ari: Distributed algorithms in Java. ITiCSE 1997: 62-64 | |
| 18 | Mordechai Ben-Ari, Kevlin Henney: A critique of the advanced placement C++ subset. SIGCSE Bulletin 29(2): 7-10 (1997) | |
| 1996 | ||
| 17 | Mordechai Ben-Ari: Using inheritance to implement concurrency. SIGCSE 1996: 180-184 | |
| 1993 | ||
| 16 | Mordechai Ben-Ari: Mathematical logic for computer science. Prentice Hall 1993: I-XI, 1-305 | |
| 1990 | ||
| 15 | Mordechai Ben-Ari: Principles of concurrent and distributed programming. Prentice Hall 1990: I-X, 1-225 | |
| 1986 | ||
| 14 | Mordechai Ben-Ari: Foreet: A Tool for Design and Documentation of Fortran Programs. Softw., Pract. Exper. 16(10): 915-924 (1986) | |
| 1985 | ||
| 13 | Mordechai Ben-Ari: Grundlagen der Parallel-Programmierung. Hanser 1985: I-XIII, 1-162 | |
| 1984 | ||
| 12 | Mordechai Ben-Ari: Algorithms for On-the-fly Garbage Collection. ACM Trans. Program. Lang. Syst. 6(3): 333-344 (1984) | |
| 1983 | ||
| 11 | Mordechai Ben-Ari, Amir Pnueli, Zohar Manna: The Temporal Logic of Branching Time. Acta Inf. 20: 207-226 (1983) | |
| 1982 | ||
| 10 | Mordechai Ben-Ari: Principles of concurrent programming. Prentice Hall 1982: I-XV, 1-172 | |
| 9 | Mordechai Ben-Ari: On-the-Fly Garbage Collection: New Algorithms Inspired by Program Proofs. ICALP 1982: 14-22 | |
| 8 | Mordechai Ben-Ari, Joseph Y. Halpern, Amir Pnueli: Deterministic Propositional Dynamic Logic: Finite Models, Complexity, and Completeness. J. Comput. Syst. Sci. 25(3): 402-417 (1982) | |
| 1981 | ||
| 7 | Mordechai Ben-Ari, Joseph Y. Halpern, Amir Pnueli: Finite Models for Deterministic Propositional Dynamic Logic. ICALP 1981: 249-263 | |
| 6 | Mordechai Ben-Ari, Zohar Manna, Amir Pnueli: The Temporal Logic of Branching Time. POPL 1981: 164-176 | |
| 5 | Mordechai Ben-Ari: Cheap Concurrent Programming. Softw., Pract. Exper. 11(12): 1261-1264 (1981) | |
| 1980 | ||
| 4 | Mordechai Ben-Ari: A Simplified Proof That Regular Resolution is Exponential. Inf. Process. Lett. 10(2): 96-98 (1980) | |
| 3 | Mordechai Ben-Ari: Comments on "Tautology Testing with a Generalized Matrix Reduction Method". Theor. Comput. Sci. 11: 341 (1980) | |
| 1979 | ||
| 2 | Mordechai Ben-Ari: On Transposing Large 2n × 2n Matrices. IEEE Trans. Computers 28(1): 72-75 (1979) | |
| 1978 | ||
| 1 | Mordechai Ben-Ari: Ianov Pushdown Schemes Are Contained in Boolean Recursive Schemes. Acta Inf. 10: 117-125 (1978) | |
Colors in the list of coauthors
Last update Sun May 27 04:04:01 2012 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page