Ana Pasztor

Publication Activity (10 Years)

Years Active: 1982-2008
Publications (10 Years): 0

Publications

Irene Polycarpou, Ana Pasztor
An Interactive and Multimodal Software for Teaching Induction for Computer Science. FECS (2008)
Irene Polycarpou, Ana Pasztor, Malek Adjouadi
A conceptual approach to teaching induction for computer science. SIGCSE (2008)
Mihaly Lenart, Ana Pasztor
Constructing Design Worlds. AID (2002)
Mihaly Lenart, Ana Pasztor
The Chunking Engine: Closing the Gap Between Formal and Informal Design Specifications. IEA/AIE (1995)
Chris Stary, Ana Pasztor
LUIS - A logic for task-oriented user interface specification. Int. J. Intell. Syst. 10 (2) (1995)
Mihaly Lenart, Ana Pasztor
How Much Knowledge is Needed? (Co-)Evolutionary Design. IEA/AIE (1994)
Mihaly Lenart, Peter Padawitz, Ana Pasztor
Formal specification for design automation. Formal Design Methods for CAD (1994)
Ana Pasztor
A Sup-Preserving Completion of Ordered Partial Algebras. MFCS (1990)
Ana Pasztor
Recursive Programs and Denotational Semantics in Absolute Logics of Programs. Theor. Comput. Sci. 70 (1) (1990)
Ana Pasztor
Does "N+1 Times" Prove More Programs Correct Than "N Times"? Mathematical Foundations of Programming Semantics (1989)
Ana Pasztor, Ildikó Sain
A Streamlined Temporal Completeness Theorem. CSL (1989)
Ana Pasztor
Nonstandard Logics of Recursive Programs and Denotational Semantics. ALP (1988)
Ana Pasztor, Richard Statman
Scott Induction and Closure under omega-Sups. Theor. Comput. Sci. 43 (1986)
Ana Pasztor
Non-Standard Algorithmic and Dynamic Logic. J. Symb. Comput. 2 (1) (1986)
Ana Pasztor
On the Variety Concept of omega-Continuous Algebras. Application of a General Approach. Mathematical Foundations of Programming Semantics (1985)
Ana Pasztor
Epis of some categories of Z-continuous partial algebras. Acta Cybern. 6 (1) (1983)
Daniel Lehmann, Ana Pasztor
Epis need not be Dense. Theor. Comput. Sci. 17 (1982)