International Colloquium on Automata, Languages and Programming on Automata, languages and programming
Alternating automata on infinite trees
Theoretical Computer Science
An automata theoretic decision procedure for the propositional mu-calculus
Information and Computation
On the synthesis of a reactive module
POPL '89 Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Tree automata, Mu-Calculus and determinacy
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
The modal mu-calculus alternation hierarchy is strict
Theoretical Computer Science
Journal of the ACM (JACM)
Efficient algorithms for pre* and post* on interprocedural parallel flow graphs
Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
An axiomatic basis for computer programming
Communications of the ACM
Pushdown processes: games and model-checking
Information and Computation - Special issue on FLOC '96
Modal and temporal properties of processes
Modal and temporal properties of processes
Dynamic Logic
"Sometime" is sometimes "not never": on the temporal logic of programs
POPL '80 Proceedings of the 7th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Algorithmic Logic
The Propositional Mu-Calculus is Elementary
Proceedings of the 11th Colloquium on Automata, Languages and Programming
On Deciding if Deterministic Rabin Language Is in Büchi Class
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Symbolic Strategy Synthesis for Games on Pushdown Graphs
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Relating Hierarchies of Word and Tree Automata
STACS '98 Proceedings of the 15th Annual Symposium on Theoretical Aspects of Computer Science
A Parametric Analysis of the State Explosion Problem in Model Checking
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
Timed Control Synthesis for External Specifications
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
Reachability Analysis of Pushdown Automata: Application to Model-Checking
CONCUR '97 Proceedings of the 8th International Conference on Concurrency Theory
A Decidable Class of Asynchronous Distributed Controllers
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
A Comparison of Control Problems for Timed and Hybrid Systems
HSCC '02 Proceedings of the 5th International Workshop on Hybrid Systems: Computation and Control
Logic for Computer Science: The Engineering Challenge
Informatics - 10 Years Back. 10 Years Ahead.
An Automata-Theoretic Approach to Reasoning about Infinite-State Systems
CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
Design and Synthesis of Synchronization Skeletons Using Branching-Time Temporal Logic
Logic of Programs, Workshop
Note on winning positions on pushdown games with ω-regular conditions
Information Processing Letters
How much memory is needed to win infinite games?
LICS '97 Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Automata theoretic techniques for modal logics of programs: (Extended abstract)
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
Games for synthesis of controllers with partial observation
Theoretical Computer Science - Logic and complexity in computer science
A gap property of deterministic tree languages
Theoretical Computer Science - Logic and complexity in computer science
Synthesizing Distributed Systems
LICS '01 Proceedings of the 16th Annual IEEE Symposium on Logic in Computer Science
LICS '05 Proceedings of the 20th Annual IEEE Symposium on Logic in Computer Science
Efficient on-the-fly algorithms for the analysis of timed games
CONCUR 2005 - Concurrency Theory
Two-player nonzero-sum ω-regular games
CONCUR 2005 - Concurrency Theory
Regular symbolic analysis of dynamic networks of pushdown systems
CONCUR 2005 - Concurrency Theory
The recognizability of sets of graphs is a robust property
Theoretical Computer Science
Finite automata and their decision problems
IBM Journal of Research and Development
Deciding Nondeterministic Hierarchy of Deterministic Tree Automata
Electronic Notes in Theoretical Computer Science (ENTCS)
Ambiguous classes in the games µ-calculus hierarchy
FOSSACS'03/ETAPS'03 Proceedings of the 6th International conference on Foundations of Software Science and Computation Structures and joint European conference on Theory and practice of software
Unsafe grammars and panic automata
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
The monadic second order theory of trees given by arbitrary level-two recursion schemes is decidable
TLCA'05 Proceedings of the 7th international conference on Typed Lambda Calculi and Applications
Optimal strategies in priced timed game automata
FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science
Hi-index | 0.00 |
The occasion of 25th jubilee of FSTCS gives an opportunity to look a bit further back then one normally would. In this presentation we will look at some developments in what is called formal verification. In the seventies logics occupied a principal place: Hoare logic [43], algorithmic logic [38], dynamic logic [41, 42], linear time temporal logic [55]. With a notable exception of the last one, these formalisms included programs into syntax of the logic with an idea to reduce verification to validity checking. Temporal logic was the first to advocate externalization of modeling of programs and passing from validity checking to model checking. Since the eighties, this view became predominant, and we have seen a proliferation of logical systems. We have learned that game based methods not only are very useful but also permit to abstract from irrelevant details of logical formalisms. At present games themselves take place of specification formalisms.