The SCEAS System
| |||||||

## Search the dblp DataBase
Ana Pasztor:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Ana Pasztor
**Nonstandard Logics of Recursive Programs and Denotational Semantics.**[Citation Graph (0, 0)][DBLP] ALP, 1988, pp:255-278 [Conf] - Ana Pasztor, Ildikó Sain
**A Streamlined Temporal Completeness Theorem.**[Citation Graph (0, 0)][DBLP] CSL, 1989, pp:322-336 [Conf] - Mihaly Lenart, Ana Pasztor
**How Much Knowledge is Needed? (Co-)Evolutionary Design.**[Citation Graph (0, 0)][DBLP] IEA/AIE, 1994, pp:413-419 [Conf] - Mihaly Lenart, Ana Pasztor
**The Chunking Engine: Closing the Gap Between Formal and Informal Design Specifications.**[Citation Graph (0, 0)][DBLP] IEA/AIE, 1995, pp:491-499 [Conf] - Mihaly Lenart, Peter Padawitz, Ana Pasztor
**Formal specification for design automation.**[Citation Graph (0, 0)][DBLP] Formal Design Methods for CAD, 1994, pp:201-220 [Conf] - Ana Pasztor
**A Sup-Preserving Completion of Ordered Partial Algebras.**[Citation Graph (0, 0)][DBLP] MFCS, 1990, pp:446-456 [Conf] - Ana Pasztor
**On the Variety Concept of omega-Continuous Algebras. Application of a General Approach.**[Citation Graph (0, 0)][DBLP] Mathematical Foundations of Programming Semantics, 1985, pp:215-248 [Conf] - Ana Pasztor
**Does "N+1 Times" Prove More Programs Correct Than "N Times"?**[Citation Graph (0, 0)][DBLP] Mathematical Foundations of Programming Semantics, 1989, pp:373-389 [Conf] - Ana Pasztor
**Epis of some categories of Z-continuous partial algebras.**[Citation Graph (0, 0)][DBLP] Acta Cybern., 1983, v:6, n:, pp:111-123 [Journal] - Ana Pasztor
**Non-Standard Algorithmic and Dynamic Logic.**[Citation Graph (0, 0)][DBLP] J. Symb. Comput., 1986, v:2, n:1, pp:59-81 [Journal] - Daniel J. Lehmann, Ana Pasztor
**Epis need not be Dense.**[Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 1982, v:17, n:, pp:151-161 [Journal] - Ana Pasztor
**Recursive Programs and Denotational Semantics in Absolute Logics of Programs.**[Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 1990, v:70, n:1, pp:127-150 [Journal] - Ana Pasztor, Richard Statman
**Scott Induction and Closure under omega-Sups.**[Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 1986, v:43, n:, pp:251-263 [Journal] **An Interactive and Multimodal Software for Teaching Induction for Computer Science.**[Citation Graph (, )][DBLP]**A conceptual approach to teaching induction for computer science.**[Citation Graph (, )][DBLP]
Search in 0.003secs, Finished in 0.003secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |