Ana Pasztor

Available identifiers

Publication	Date of Publication	Type
Does “N+1 times” prove more programs correct than “N times”?	2023-04-12	Paper
https://portal.mardi4nfdi.de/entity/Q4268476	1999-10-28	Paper
https://portal.mardi4nfdi.de/entity/Q4871287	1996-07-20	Paper
https://portal.mardi4nfdi.de/entity/Q3976043	1992-06-26	Paper
Recursive programs and denotational semantics in absolute logics of programs	1990-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3490962	1989-01-01	Paper
Non-standard algorithmic and dynamic logic	1986-01-01	Paper
On P-dominions of continuous algebras	1986-01-01	Paper
Scott induction and closure under \(\omega\)-sups	1986-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3735754	1986-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3743307	1986-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3744208	1986-01-01	Paper
Relative epis need not be surjective	1985-01-01	Paper
Surjections of complete posets and of continuous algebras	1983-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3665163	1983-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3665164	1983-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3037525	1983-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3967577	1982-01-01	Paper
Epis need not be dense	1982-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3328599	1982-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3874383	1979-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3884164	1977-01-01	Paper

This page was built for person: Ana Pasztor