Ildikó Sain

Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.

? Tutorial for this page

Demo Data from EDBT 2026 / reviewers in the wild / expert

dblp:87/5459 · DBLP profile ↗

← Back

15ranked-venue papers

5as first author

0since 2021 · last 1993

—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 15 · 5 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Software engineering, system software, and programming languages 1 paper		Programming languages and type systems · 100%
Theoretical computer science 1 paper		Logic in computer science · 100%

Topics — the 2 heaviest of 2, each with the papers that count most for it

Topic	Weight	Papers	Last	Evidence papers
Programming languages and type systems language semantics	0.0	1	1986	On the Equivalence of Weak Second Order and Nonstandard Time Semantics For Various Program Verification Systems · LICS 1986
Logic in computer science › higher-order logic second-order logic	0.0	1	1986	On the Equivalence of Weak Second Order and Nonstandard Time Semantics For Various Program Verification Systems · LICS 1986

Methods — techniques the papers use, named apart from their topics

program verification · 0.0

Year	Publication	Venue	Position
1993	Peano Arithmetic as Axiomatization of the Time Frame in Logics of Programs and in Dynamic Logics Balázs Biró, Ildikó Sain	Ann. Pure Appl. Log.	2
1992	Temporal Logics Need Their Clocks Ildikó Sain	Theor. Comput. Sci.	1
1991	On the Strength of Temporal Proofs Hajnal Andréka, István Németi, Ildikó Sain	Theor. Comput. Sci.	3
1990	Results on the Glory of the Past Ildikó Sain	MFCS	1
1989	On the Strength of Temporal Proofs Hajnal Andréka, István Németi, Ildikó Sain	MFCS	3
1989	Weak Second Order Characterizations of Various Program Verification Systems Johann A. Makowsky, Ildikó Sain	Theor. Comput. Sci.	2
1987	Total Correctness in Nonstandard Logics of Programs Ildikó Sain	Theor. Comput. Sci.	1
1986	On the Equivalence of Weak Second Order and Nonstandard Time Semantics For Various Program Verification Systems Johann A. Makowsky, Ildikó Sain	LICS	2
1985	A Simple Proof for the Completeness of Floyd's Method Ildikó Sain	Theor. Comput. Sci.	1
1982	A Complete Logic for Reasoning about Programs via Nonstandard Model Theory I Hajnal Andréka, István Németi, Ildikó Sain	Theor. Comput. Sci.	3
1982	A Complete Logic for Reasoning about Programs via Nonstandard Model Theory II Hajnal Andréka, István Németi, Ildikó Sain	Theor. Comput. Sci.	3
1981	First Order Dynamic Logic with Decidable Proofs and Workable Model Theory Ildikó Sain	FCT	1
1981	A Characterization of Floyd-Provable Programs Hajnal Andréka, István Németi, Ildikó Sain	MFCS	3
1979	Henkin-type semantics for program-schemes to turn negative results to positive Hajnal Andréka, István Németi, Ildikó Sain	FCT	3
1979	Completeness Problems in Verification of Programs and Program Schemes Hajnal Andréka, István Németi, Ildikó Sain	MFCS	3