Joram Hirshfeld

2015

לוגיקה למדעי המחשב

⁨הירשפלד, י.⁩, ⁨בורלא, ר.⁩ (Illustrator), ⁨גוגנהיימר, י.⁩ (Editor), ⁨דרשוביץ, נ.⁩, ⁨יהודאי, ע.⁩, ⁨מנביץ, ל.⁩ & ⁨קאופמן, י.⁩, 2015, רעננה: האוניברסיטה הפתוחה. 1 p.

Research output: Book/Report › Book › peer-review

2012

Continuous time temporal logic with counting

Hirshfeld, Y. & Rabinovich, A., May 2012, In: Information and Computation. 214, p. 1-9 9 p.

Research output: Contribution to journal › Article › peer-review

Open Access

7 Scopus citations

2010

Promptness in ω-regular automata

Almagor, S., Hirshfeld, Y. & Kupferman, O., 2010, Automated Technology for Verification and Analysis - 8th International Symposium, ATVA 2010, Proceedings. p. 22-36 15 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 6252 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

12 Scopus citations

2009

Meadows and the equational specification of division

Bergstra, J. A., Hirshfeld, Y. & Tucker, J. V., 17 Mar 2009, In: Theoretical Computer Science. 410, 12-13, p. 1261-1271 11 p.

Research output: Contribution to journal › Article › peer-review

Open Access

22 Scopus citations

2008

Decidable metric logics

Hirshfeld, Y. & Rabinovich, A., Dec 2008, In: Information and Computation. 206, 12, p. 1425-1442 18 p.

Research output: Contribution to journal › Article › peer-review

Open Access

3 Scopus citations

Fields, meadows and abstract data types

Bergstra, J., Hirshfeld, Y. & Tucker, J., 2008, Pillars of Computer Science - Essays Dedicated to Boris (Boaz) Trakhtenbrot on the Occasion of His 85th Birthday. Springer Verlag, p. 166-178 13 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 4800 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

4 Scopus citations

2007

Expressiveness of metric modalities for continuous time

Hirshfeld, Y. & Rabinovich, A., 23 Feb 2007, In: Logical Methods in Computer Science. 3, 1, 3.

Research output: Contribution to journal › Article › peer-review

Open Access

23 Scopus citations

2006

Abstraction classes in software design

Eden, A. H., Hirshfeld, Y. & Kazman, R., 2006, In: IEE Proceedings: Software. 153, 4, p. 163-182 20 p.

Research output: Contribution to journal › Article › peer-review

16 Scopus citations

An expressive temporal logic for real time

Hirshfeld, Y. & Rabinovich, A., 2006, Mathematical Foundations of Computer Science 2006 - 31st International Symposium, MFCS 2006, Proceedings. Springer Verlag, p. 492-504 13 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 4162 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

19 Scopus citations

Expressiveness of metric modalities for continuous time

Hirshfeld, Y. & Rabinovich, A., 2006, In: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 3967 LNCS, p. 211-220 10 p.

Research output: Contribution to journal › Conference article › peer-review

10 Scopus citations

2005

Timer formulas and decidable metric temporal logic

Hirshfeld, Y. & Rabinovich, A., 1 May 2005, In: Information and Computation. 198, 2, p. 148-178 31 p.

Research output: Contribution to journal › Article › peer-review

Open Access

22 Scopus citations

2004

Logics for real time: Decidability and complexity

Hirshfeld, Y. & Rabinovich, A., Aug 2004, In: Fundamenta Informaticae. 62, 1, p. 1-28 28 p.

Research output: Contribution to journal › Article › peer-review

80 Scopus citations

2003

Future temporal logic needs infinitely many modalities

Hirshfeld, Y. & Rabinovich, A., 15 Dec 2003, In: Information and Computation. 187, 2, p. 196-208 13 p.

Research output: Contribution to journal › Article › peer-review

Open Access

10 Scopus citations

2002

The probability nesting game

Beauquier, D., Hirshfeld, Y., Rabinovich, A. & Slissenko, A., Sep 2002, In: Electronic Notes in Theoretical Computer Science. 68, 2, p. 4-14 11 p.

Research output: Contribution to journal › Conference article › peer-review

Open Access

2001

Pushdown automata, multiset automata, and Petri nets

Hirshfeld, Y. & Moller, F., 2001, In: Theoretical Computer Science. 256, 1-2, p. 3-21 19 p.

Research output: Contribution to journal › Article › peer-review

Open Access

8 Scopus citations

1999

A framework for decidable metrical logics

Hirshfeld, Y. & Rabinovich, A., 1999, Automata, Languages and Programming - 26th International Colloquium, ICALP 1999, Proceedings. Springer Verlag, p. 422-432 11 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 1644 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

24 Scopus citations

Bisimulation equivalence is decidable for normed process algebra (extended abstract)

Hirshfeld, Y. & Jerrum, M., 1999, Automata, Languages and Programming - 26th International Colloquium, ICALP 1999, Proceedings. Springer Verlag, p. 412-421 10 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 1644 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

41 Scopus citations

Quantitative temporal logic

Hirshfeld, Y. & Rabinovich, A., 1999, Computer Science Logic - 13th International Workshop, CSL 1999 - 8th Annual Conference of the EACSL, Proceedings. Flum, J. & Rodriguez-Artalejo, M. (eds.). Springer Verlag, p. 172-187 16 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 1683).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

29 Scopus citations

1997

Bisimulation trees and the decidability of weak bisimulations

Hirshfeld, Y., 1997, In: Electronic Notes in Theoretical Computer Science. 5, p. 2-13 12 p.

Research output: Contribution to journal › Conference article › peer-review

Open Access

20 Scopus citations

1996

A polynomial algorithm for deciding bisimilarity of normed context-free processes

Hirshfeld, Y., Jerrum, M. & Moller, F., 20 May 1996, In: Theoretical Computer Science. 158, 1-2, p. 143-159 17 p.

Research output: Contribution to journal › Article › peer-review

Open Access

103 Scopus citations

A polynomial-time algorithm for deciding bisimulation equivalence of normed basic parallel processes

Hirshfeld, Y., Jerrum, M. & Moller, F., 16 Jun 1996, In: Mathematical Structures in Computer Science. 6, 3, p. 251-259 9 p.

Research output: Contribution to journal › Article › peer-review

59 Scopus citations

Decidability results in automata and process theory

Hirshfeld, Y. & Moller, F., 1996, Logics for Concurrency - Structure versus Automata. Moller, F. & Birtwistle, G. (eds.). Springer Verlag, p. 102-148 47 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 1043).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

10 Scopus citations

1994

A fast algorithm for deciding bisimilarity of normed context-free processes

Hirshfeld, Y. & Moller, F., 1994, CONCUR 1994: Concurrency Theory - 5th International Conference, Proceedings. Jonsson, B. & Parrow, J. (eds.). Springer Verlag, p. 48-63 16 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 836 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

13 Scopus citations

Decidable subsets of CCS

Christensen, S., Hirshfeld, Y. & Moller, F., 1994, In: Computer Journal. 37, 4, p. 233-242 10 p.

Research output: Contribution to journal › Article › peer-review

19 Scopus citations

Petri nets and the equivalence problem

Hirshfeld, Y., 1994, Computer Science Logic - 7th Workshop, CSL 1993, Selected Papers. Borger, E., Gurevich, Y. & Meinke, K. (eds.). Springer Verlag, p. 165-174 10 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 832 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

49 Scopus citations

Queries evaluation, relative safety, and domain independence in first-order database languages with functions

Avron, A. & Hirshfeld, J., 1994, In: Methods of logic in computer science. 1, 3, p. 261-277 17 p.

Research output: Contribution to journal › Article › peer-review

1993

Bisimulation equivalence is decidable for basic parallel processes

Christensen, S., Hirshfeld, Y. & Moller, F., 1993, CONCUR 1993 - 4th International Conference on Concurrency Theory, Proceedings. Best, E. (ed.). Springer Verlag, p. 143-157 15 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 715 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

114 Scopus citations

Decomposability, decidability and axiomatisability for bisimulation equivalence on basic parallel processes

Christensen, S., Hirshfeld, Y. & Moller, F., 1993, Logic in Computer Science. Publ by IEEE, p. 386-396 11 p. (Proceedings - Symposium on Logic in Computer Science).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

32 Scopus citations

1992

Safe queries in relational databases with functions

Hirshfeld, J., 1992, Computer Science Logic - 5th Workshop, CSL 1991, Proceedings. Borger, E., Jager, G., Buning, H. K. & Richter, M. M. (eds.). Springer Verlag, p. 173-183 11 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 626 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

2 Scopus citations

1991

On first order database query languages

Avron, A. & Hirshfeld, J., Jul 1991, Proceedings - Symposium on Logic in Computer Science. Publ by IEEE, p. 226-231 6 p. (Proceedings - Symposium on Logic in Computer Science).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

6 Scopus citations

1989

Discerning causality in interleaving behavior

Hirshfeld, J., Rabinovich, A. & Trakhtenbrot, B. A., 1989, Logic at Botik 1989 - Symposium on Logical Foundations of Computer Science, Proceedings. Meyer, A. R. & Taitslin, M. A. (eds.). Springer Verlag, p. 146-162 17 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 363 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

5 Scopus citations

1988

Nonstandard combinatorics

Hirshfeld, J., Sep 1988, In: Studia Logica. 47, 3, p. 221-232 12 p.

Research output: Contribution to journal › Article › peer-review

6 Scopus citations

Joram Hirshfeld

Research output

Search results