 | 2008 |
| 15 |  | Irene Polycarpou,
Ana Pasztor:
An Interactive and Multimodal Software for Teaching Induction for Computer Science.
FECS 2008: 326-331 |
| 14 |  | Irene Polycarpou,
Ana Pasztor,
Malek Adjouadi:
A conceptual approach to teaching induction for computer science.
SIGCSE 2008: 9-13 |
| 1995 |
| 13 |  | Mihaly Lenart,
Ana Pasztor:
The Chunking Engine: Closing the Gap Between Formal and Informal Design Specifications.
IEA/AIE 1995: 491-499 |
| 1994 |
| 12 |  | Mihaly Lenart,
Peter Padawitz,
Ana Pasztor:
Formal specification for design automation.
Formal Design Methods for CAD 1994: 201-220 |
| 11 |  | Mihaly Lenart,
Ana Pasztor:
How Much Knowledge is Needed? (Co-)Evolutionary Design.
IEA/AIE 1994: 413-419 |
| 1990 |
| 10 |  | Ana Pasztor:
A Sup-Preserving Completion of Ordered Partial Algebras.
MFCS 1990: 446-456 |
| 9 |  | Ana Pasztor:
Recursive Programs and Denotational Semantics in Absolute Logics of Programs.
Theor. Comput. Sci. 70(1): 127-150 (1990) |
| 1989 |
| 8 |  | Ana Pasztor,
Ildikó Sain:
A Streamlined Temporal Completeness Theorem.
CSL 1989: 322-336 |
| 7 |  | Ana Pasztor:
Does "N+1 Times" Prove More Programs Correct Than "N Times"?
Mathematical Foundations of Programming Semantics 1989: 373-389 |
| 1988 |
| 6 |  | Ana Pasztor:
Nonstandard Logics of Recursive Programs and Denotational Semantics.
ALP 1988: 255-278 |
| 1986 |
| 5 |  | Ana Pasztor:
Non-Standard Algorithmic and Dynamic Logic.
J. Symb. Comput. 2(1): 59-81 (1986) |
| 4 |  | Ana Pasztor,
Richard Statman:
Scott Induction and Closure under omega-Sups.
Theor. Comput. Sci. 43: 251-263 (1986) |
| 1985 |
| 3 |  | Ana Pasztor:
On the Variety Concept of omega-Continuous Algebras. Application of a General Approach.
Mathematical Foundations of Programming Semantics 1985: 215-248 |
| 1983 |
| 2 |  | Ana Pasztor:
Epis of some categories of Z-continuous partial algebras.
Acta Cybern. 6: 111-123 (1983) |
| 1982 |
| 1 |  | Daniel J. Lehmann,
Ana Pasztor:
Epis need not be Dense.
Theor. Comput. Sci. 17: 151-161 (1982) |