| 2008 |
|---|
| 41 | EE | Ronit Ben-Bassat Levy,
Mordechai Ben-Ari:
Perceived behavior control and its influence on the adoption of software tools.
ITiCSE 2008: 169-173 |
| 40 | EE | Michal Armoni,
Noa Lewenstein,
Mordechai Ben-Ari:
Teaching students to think nondeterministically.
SIGCSE 2008: 4-8 |
| 2007 |
|---|
| 39 | EE | 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 |
| 38 | EE | Mordechai Ben-Ari:
Teaching concurrency and nondeterminism with spin.
ITiCSE 2007: 363-364 |
| 2006 |
|---|
| 37 | EE | Mordechai Ben-Ari,
Tzippora Yeshno:
Conceptual models of software artifacts.
Interacting with Computers 18(6): 1336-1350 (2006) |
| 36 | EE | Mordechai Ben-Ari:
McKinley's Amazon.
SIGCSE Bulletin 38(4): 75-77 (2006) |
| 2005 |
|---|
| 35 | EE | Cecile Yehezkel,
Mordechai Ben-Ari,
Tommy Dreyfus:
Computer architecture and mental models.
SIGCSE 2005: 101-105 |
| 34 | EE | Mordechai Ben-Ari:
The concorde doesn't fly anymore.
SIGCSE 2005: 196 |
| 33 | EE | Noa Ragonis,
Mordechai Ben-Ari:
On understanding the statics and dynamics of object-oriented programs.
SIGCSE 2005: 226-230 |
| 32 | EE | Mordechai Ben-Ari:
Minesweeper as an NP-complete problem.
SIGCSE Bulletin 37(4): 39-40 (2005) |
| 2004 |
|---|
| 31 | EE | Andrés Moreno,
Niko Myller,
Erkki Sutinen,
Mordechai Ben-Ari:
Visualizing programs with Jeliot 3.
AVI 2004: 373-376 |
| 30 | EE | 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 |
| 29 | EE | Mordechai Ben-Ari:
A suite of tools for teaching concurrency.
ITiCSE 2004: 251 |
| 28 | EE | Andrés Moreno,
Niko Myller,
Mordechai Ben-Ari,
Erkki Sutinen:
Program animation in jeliot 3.
ITiCSE 2004: 265 |
| 27 | EE | Mordechai Ben-Ari,
Jorma Sajaniemi:
Roles of variables as seen by CS educators.
ITiCSE 2004: 52-56 |
| 26 | EE | Mordechai Ben-Ari:
The concorde doesn't fly anymore.
SIGCSE 2004: 1 |
| 25 | EE | Ahuva Tikvati,
Mordechai Ben-Ari,
Yifat Ben-David Kolikant:
Virtual trees for the byzantine generals algorithm.
SIGCSE 2004: 392-396 |
| 2002 |
|---|
| 24 | EE | Mordechai Ben-Ari,
Henry MacKay Walker,
Gaynor Redvers-Mutton,
Keith Mansfield:
Writing a textbook.
ITiCSE 2002: 94-95 |
| 2001 |
|---|
| 23 | EE | Mordechai Ben-Ari,
Niko Myller,
Erkki Sutinen,
Jorma Tarhio:
Perspectives on Program Animation with Jeliot.
Software Visualization 2001: 31-45 |
| 22 | | Mordechai Ben-Ari:
Interactive execution of distributed algorithms.
ACM Journal of Educational Resources in Computing 1(2): 2 (2001) |
| 21 | EE | Mordechai Ben-Ari,
Alan Burns:
Extreme Interleavings.
IEEE Distributed Systems Online 2(1): (2001) |
| 20 | EE | Mordechai Ben-Ari:
The bug that destroyed a rocket.
SIGCSE Bulletin 33(2): 58-59 (2001) |
| 2000 |
|---|
| 19 | EE | Ekaterina Sedletsky,
Amir Pnueli,
Mordechai Ben-Ari:
Formal Verification of the Ricart-Agrawala Algorithm.
FSTTCS 2000: 325-335 |
| 1998 |
|---|
| 18 | EE | Mordechai Ben-Ari:
Synchronizing Multiple Clients and Servers.
Ada-Europe 1998: 41-52 |
| 17 | EE | Yoav Tzruya,
Mordechai Ben-Ari:
A Portable Implementation of the Distributed Systems Annex in Java.
SIGAda 1998: 204-211 |
| 16 | EE | Mordechai Ben-Ari:
Constructivism in computer science education.
SIGCSE 1998: 257-261 |
| 15 | | Mordechai Ben-Ari:
How to solve the Santa Claus problem.
Concurrency - Practice and Experience 10(6): 485-496 (1998) |
| 14 | | Mordechai Ben-Ari:
Teaching Object-Oriented Programming in Ada.
JOOP 11(6): 39-45 (1998) |
| 1996 |
|---|
| 13 | EE | Mordechai Ben-Ari:
Using inheritance to implement concurrency.
SIGCSE 1996: 180-184 |
| 1986 |
|---|
| 12 | | Mordechai Ben-Ari:
Foreet: A Tool for Design and Documentation of Fortran Programs.
Softw., Pract. Exper. 16(10): 915-924 (1986) |
| 1984 |
|---|
| 11 | EE | Mordechai Ben-Ari:
Algorithms for On-the-fly Garbage Collection.
ACM Trans. Program. Lang. Syst. 6(3): 333-344 (1984) |
| 1983 |
|---|
| 10 | | Mordechai Ben-Ari,
Amir Pnueli,
Zohar Manna:
The Temporal Logic of Branching Time.
Acta Inf. 20: 207-226 (1983) |
| 1982 |
|---|
| 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) |
