Publications 1999
Follow paper's title for abstract
Link's may lead to sites with restricted access
- K. Altisen,
G. Gossler, A. Pnueli, J. Sifakis, S. Tripakis, and S. Yovine.
A
framework for scheduler synthesis.
In Proc. 20th IEEE Real-Time Systems Symposium, pages 154-163,
Phoenix, AZ, USA, December 1999. IEEE, IEEE Computer Society Press.
(IEEE PDF)
- D. Harel and Y. Koren.
A fast multi-scale method for drawing large graphs.
Technical Report MCS99-21, Weizmann Institute of Science, November 1999.
- D. Harel and H. Kugler.
Synthesizing state-based object systems from lsc
specifications.
Technical Report MCS99-20, Weizmann Institute of Science, October 1999.
- Y. Kesten and A. Pnueli.
Verifying liveness
by augmented abstraction.
In Computer Science Logic, 13th International Workshop, volume 1683 of
Lecture Notes in
Computer Science, pages 141-156. © Springer-Verlag, September
1999.
(Gzipped PostScript)
(PDF)
- A. Pnueli.
Deduction is
forever.
An invited talk at "Formal Methods", Toulouse, September 1999.
- Y. Kesten,
A. Klein, A. Pnueli, and G. Raanan.
A
perfecto verification: Combining model checking with deductive analysis to
verify real-life software.
In Formal Methods, Volume I, volume 1708 of Lecture Notes in Computer
Science , pages 173-194, Toulouse, France, September 1999. ©
Springer-Verlag.
(Springer PDF)
- Y. Kesten,
A. Klein, A. Pnueli, and G. Raanan.
Bridging the e-business gap through formal verification.
In M. Hinchey and J. Bowen, editors, Industrial-Strength Formal Methods in
Practice, Formal Approaches to Computing and Information Technology,
chapter 6, pages 117-137. © Springer-Verlag, September 1999.
- D. Harel and M. Kaminsky.
Strengthened results on nonregular pdl.
Technical Report MCS99-13, Weizmann Institute of Science, August 1999.
- A. Pnueli,
Y. Rodeh, O. Shtrichman, and M. Siegel.
Deciding equality formulas by small domains
instantiations.
In Proc. 11th International Computer Aided Verification Conference,
volume 1633 of Lecture
Notes in Computer Science , pages 455-469. © Springer-Verlag, July
1999.
(Gzipped PostScript, 12 pages, 102355 bytes)
- B. Jonsson,
A. Pnueli, and C. Rump.
Proving refinement using transduction.
Distributed Computing, 12(2-3):129-149, June 1999.
(Springer PDF)
- D. Harel and
O. Kupferman.
On the behavioral inheritance of state-based objects.
Technical Report MCS99-12, Weizmann Institute of Science, June 1999.
- R. Hadany and D. Harel.
Multi-scale algorithm for drawing graphs nicely.
In 25th International Workshop on Graph-Theoretic Concepts in Computer
Science, volume 1665 of Lecture Notes in Computer Science,
pages 262-277, Ascona, Switzerland, June 1999. Springer-Verlag.
(Springer PDF)
- Y. Kesten,
A. Pnueli, J. Sifakis, and S. Yovine.
Decidable
integration graphs.
Information and Computation, 150(2):209-243, May 1999.
(I&C PDF)
- W. Damm and D. Harel.
Lscs: Breathing life into message sequence charts.
Technical Report CS98-09, Weizmann Institute of Science, May 1998.
- O. Bournez,
O. Maler, and A. Pnueli.
Orthogonal polyhedra: Representation and computation.
In 2nd International Workshop on Hybrid Systems: Computation and
Control, volume 1569 of Lecture Notes in Computer
Science , Berg en Dal, The Netherlands, March 1999. ©
Springer-Verlag.
(Springer PDF)
- W. Damm and D. Harel.
Lscs: Breathing life into message sequence charts.
In Proc. 3rd international Conferene on Formal Methods for Open
Object-Based Distributed System, volume 139 of IFIP, pages
293-312, Florence, Italy, February 1999. International Federation for
Information Processing, Kluwer Academic Publishers.
- T. Arons and A. Pnueli.
Verifying Tomasulo's algorithm by refinement.
In The Twelfth International Conference on VLSI Design, pages
306-309, Goa, India, January 1999. IEEE Computer Society.
(Gzipped PostScript, 4 pages, 25211 bytes)
(PVS dump file)
- J. Gal-Ezer and D. Harel.
Curriculum and course syllabi for a high-school program in computer science.
Computer Science Education, 9(2):114-147, 1999.
- J. Gal-Ezer and D. Harel.
Curriculum and course syllabi for a high-school program in
computer science.
Technical Report CS99-02, Weizmann Institute of Science, January 1999.
- R. Hadany and D. Harel.
A multi-scale algorithm for drawing graphs nicely.
Technical Report CS99-01, Weizmann Institute of Science, January 1999.