How to Solve Qualification and Ramification Using Dijkstra s Semantics for Programming Languages

Ewa Madalinska-Bugaj. How to Solve Qualification and Ramification Using Dijkstra s Semantics for Programming Languages. In Maurizio Lenzerini, editor, AI*IA 97: Advances in Artificial Intelligence, 5th Congress of the Italian Association for Artificial Intelligence, Rome, Italy, September 17-19, 1997, Proceedings. Volume 1321 of Lecture Notes in Computer Science, pages 381-392, Springer, 1997.

@inproceedings{Madalinska-Bugaj97,
  title = {How to Solve Qualification and Ramification Using Dijkstra s Semantics for Programming Languages},
  author = {Ewa Madalinska-Bugaj},
  year = {1997},
  tags = {programming languages, semantics, programming},
  researchr = {https://researchr.org/publication/Madalinska-Bugaj97},
  cites = {0},
  citedby = {0},
  pages = {381-392},
  booktitle = {AI*IA 97: Advances in Artificial Intelligence, 5th Congress of the Italian Association for Artificial Intelligence, Rome, Italy, September 17-19, 1997, Proceedings},
  editor = {Maurizio Lenzerini},
  volume = {1321},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-63576-9},
}